data-structure-typed/test/unit/unrestricted-interconversion.test.ts

163 lines
3.7 KiB
TypeScript
Raw Normal View History

import {
AVLTree,
BinaryTree,
BST,
Deque,
DoublyLinkedList,
HashMap,
Heap,
MaxHeap,
MaxPriorityQueue,
MinHeap,
MinPriorityQueue,
Queue,
RedBlackTree,
SinglyLinkedList,
Stack,
TreeMultimap,
Trie
} from '../../src';
2023-12-21 02:26:45 +00:00
import { isDebugTest } from '../config';
const isDebug = isDebugTest;
const orgArr: number[] = [6, 1, 2, 7, 5, 3, 4, 9, 8];
const orgStrArr: string[] = [
2023-12-21 02:26:45 +00:00
'trie',
'trial',
'trick',
'trip',
'tree',
'trend',
'triangle',
'track',
'trace',
'transmit'
];
const entries: [number, number][] = [
[6, 6],
[1, 1],
[2, 2],
[7, 7],
[5, 5],
[3, 3],
[4, 4],
[9, 9],
[8, 8]
];
describe('conversions', () => {
it('Array to Queue', () => {
const q = new Queue<number>(orgArr);
isDebug && q.print();
2023-12-21 02:26:45 +00:00
});
it('Array to Deque', () => {
const dq = new Deque<number>(orgArr);
isDebug && dq.print();
2023-12-21 02:26:45 +00:00
});
it('Array to SinglyLinkedList', () => {
const sl = new SinglyLinkedList<number>(orgArr);
isDebug && sl.print();
2023-12-21 02:26:45 +00:00
});
it('Array to DoublyLinkedList', () => {
const dl = new DoublyLinkedList<number>(orgArr);
isDebug && dl.print();
2023-12-21 02:26:45 +00:00
});
it('Array to Stack', () => {
const stack = new Stack<number>(orgArr);
isDebug && stack.print();
2023-12-21 02:26:45 +00:00
});
it('Array to MinHeap', () => {
const minHeap = new MinHeap<number>(orgArr);
isDebug && minHeap.print();
2023-12-21 02:26:45 +00:00
});
it('Array to MaxHeap', () => {
const maxHeap = new MaxHeap<number>(orgArr);
isDebug && maxHeap.print();
2023-12-21 02:26:45 +00:00
});
it('Array to MinPriorityQueue', () => {
const minPQ = new MinPriorityQueue<number>(orgArr);
isDebug && minPQ.print();
2023-12-21 02:26:45 +00:00
});
it('Array to MaxPriorityQueue', () => {
const maxPQ = new MaxPriorityQueue<number>(orgArr);
isDebug && maxPQ.print();
2023-12-21 02:26:45 +00:00
});
it('Entry Array to BinaryTree', () => {
const biTree = new BinaryTree<number>(entries);
isDebug && biTree.print();
2023-12-21 02:26:45 +00:00
});
it('Entry Array to BST', () => {
const bst = new BST<number>(entries);
2023-12-21 02:26:45 +00:00
expect(bst.size).toBe(9);
isDebug && bst.print();
2023-12-21 02:26:45 +00:00
});
it('Entry Array to RedBlackTree', () => {
const rbTree = new RedBlackTree<number>(entries);
2023-12-21 02:26:45 +00:00
expect(rbTree.size).toBe(9);
isDebug && rbTree.print();
2023-12-21 02:26:45 +00:00
});
it('Entry Array to AVLTree', () => {
const avl = new AVLTree<number>(entries);
2023-12-21 02:26:45 +00:00
expect(avl.size).toBe(9);
isDebug && avl.print();
2023-12-21 02:26:45 +00:00
});
it('Entry Array to TreeMultimap', () => {
const treeMulti = new TreeMultimap<number>(entries);
2023-12-21 02:26:45 +00:00
expect(treeMulti.size).toBe(9);
isDebug && treeMulti.print();
2023-12-21 02:26:45 +00:00
});
it('HashMap to RedBlackTree', () => {
const hm = new HashMap(entries);
2023-12-21 02:26:45 +00:00
isDebug && hm.print();
const rbTree = new RedBlackTree<number>(hm);
2023-12-21 02:26:45 +00:00
expect(rbTree.size).toBe(9);
isDebug && rbTree.print();
2023-12-21 02:26:45 +00:00
});
it('PriorityQueue to BST', () => {
const pq = new MinPriorityQueue(orgArr);
isDebug && pq.print();
const bst = new BST<number>(pq);
2023-12-21 02:26:45 +00:00
expect(bst.size).toBe(9);
isDebug && bst.print();
2023-12-21 02:26:45 +00:00
});
it('Deque to RedBlackTree', () => {
const dq = new Deque(orgArr);
isDebug && dq.print();
const rbTree = new RedBlackTree<number>(dq);
2023-12-21 02:26:45 +00:00
expect(rbTree.size).toBe(9);
isDebug && rbTree.print();
2023-12-21 02:26:45 +00:00
});
it('Trie to Heap to Deque', () => {
const trie = new Trie(orgStrArr);
expect(trie.size).toBe(10);
isDebug && trie.print();
const heap = new Heap<string>(trie, { comparator: (a, b) => Number(a) - Number(b) });
expect(heap.size).toBe(10);
isDebug && heap.print();
const dq = new Deque<string>(heap);
expect(dq.size).toBe(10);
isDebug && dq.print();
const entries = dq.map((el, i) => <[number, string]>[i, el]);
const avl = new AVLTree<number, string>(entries);
2023-12-21 02:26:45 +00:00
expect(avl.size).toBe(10);
isDebug && avl.print();
2023-12-21 02:26:45 +00:00
});
});