data-structure-typed/test/integration/index.html

<!DOCTYPE html>
<html lang='en'>
<head>
  <meta charset='UTF-8'>
  <title>CDN Test</title>
<!--  <script src="../../dist/umd/data-structure-typed.min.js"></script>-->
  <script src='https://cdn.jsdelivr.net/npm/data-structure-typed/dist/umd/data-structure-typed.min.js'></script>
  <script src='https://unpkg.com/js-sdsl@4.4.2/dist/umd/js-sdsl.js'></script>
</head>
<body>
<div id='app'>
  <ul class='modules'>

  </ul>
</div>
<script defer>
  const $modules = document.querySelector('.modules');


  try {
    const queue = new Queue();
    for (let i = 0; i < 100000; i++) {
      queue.enqueue(i);
    }
    let last = 0;
    const startTime = performance.now();

    for (let i = 0; i < 100000; i++) {
      last = queue.dequeue();
    }

    console.log(performance.now() - startTime);

  } catch (e) {
    console.error(e);
  }
  try {
    const {AVLTree} = window.dataStructureTyped;
    const avlTree = new AVLTree();
    const $avlTree = document.createElement('li');
    const $avlTreeSpan = document.createElement('span');
    $avlTreeSpan.innerText = 'AVLTree';
    $avlTree.append($avlTreeSpan);
    for (let i = 1; i < 31; i++) {
      avlTree.add(i, i);
    }
    console.log(avlTree.bfs());
    // avlTree.print();
    $modules.append($avlTree);
  } catch (e) {
    console.error(e);
  }

  try {
    const {BinaryTree} = dataStructureTyped;
    const tree = new BinaryTree();
    tree.add(3);
    tree.add(12);
    tree.addMany([1, 6, 9, 8,5,2,3,4,7])
    tree.add(10);
    console.log(tree.isPerfectlyBalanced());
    tree.print();

    const node3 = tree.getNode(3);
    if (node3) node3.right = tree.createNode(1);
    console.log(tree.isPerfectlyBalanced());
    tree.print();

    tree.clear();
    tree.addMany([1, null, 2, null, 3, null, 4, null, 5, null, 6, null]);
    console.log(tree.isPerfectlyBalanced());
    tree.print();
  } catch (e) {
    console.error(e);
  }


  try {
    const {OrderedMap} = sdsl;
    const {RedBlackTree} = dataStructureTyped;
    const cTree = new OrderedMap();
    const tree = new RedBlackTree();
    const tS = performance.now();
    for (let i = 1; i < 1000000; i++) {
      tree.add(i, i);
    }
    console.log(performance.now() - tS);
    console.log(tree.size);
    const cS = performance.now();
    for (let i = 1; i < 1000000; i++) {
      cTree.setElement(i, i);
    }
    console.log(performance.now() - cS);
    console.log(cTree.size());

    // console.log(tree.isPerfectlyBalanced());
    // tree.print();

  } catch (e) {
    console.error(e);
  }

  try {
    const {PriorityQueue: CPriorityQueue} = sdsl;
    const {PriorityQueue} = dataStructureTyped;
    const pq = new PriorityQueue({comparator: (a, b) => b - a});

    const tS = performance.now();

    for (let i = 0; i < 1000000; i++) {
      pq.add(i);
    }

    for (let i = 0; i < 10000; i++) {
      pq.pop();
    }
    console.log(performance.now() - tS);
    console.log(pq.size);
    const cS = performance.now();
    const cpq = new CPriorityQueue();

    for (let i = 0; i < 1000000; i++) {
      cpq.push(i);
    }

    for (let i = 0; i < 10000; i++) {
      cpq.pop();
    }
    console.log(performance.now() - cS);
    console.log(cpq.size());
  } catch (e) {
    console.error(e);
  }
</script>

</body>
</html>
[core] remove all the unnecessary files and directories when publishing the npm package 2023-09-09 15:49:53 +00:00			`<!DOCTYPE html>`
[README] data structures comparation 2023-09-26 04:49:33 +00:00			`<html lang='en'>`
[core] remove all the unnecessary files and directories when publishing the npm package 2023-09-09 15:49:53 +00:00			`<head>`
[README] data structures comparation 2023-09-26 04:49:33 +00:00			`<meta charset='UTF-8'>`
v1.3.3 published 2023-09-19 09:00:25 +00:00			`<title>CDN Test</title>`
test: Compare performance with other libraries. 2023-11-13 04:50:33 +00:00			`<!-- <script src="../../dist/umd/data-structure-typed.min.js"></script>-->`
[binary-tree] The binary tree's BFS and level-order traversal results should be the same. However, for convenience, we provide an additional method called listLevels to display traversal results in levels. 2023-10-27 14:30:52 +00:00			`<script src='https://cdn.jsdelivr.net/npm/data-structure-typed/dist/umd/data-structure-typed.min.js'></script>`
test: Compare performance with other libraries. 2023-11-13 04:50:33 +00:00			`<script src='https://unpkg.com/js-sdsl@4.4.2/dist/umd/js-sdsl.js'></script>`
[core] remove all the unnecessary files and directories when publishing the npm package 2023-09-09 15:49:53 +00:00			`</head>`
			`<body>`
[README] data structures comparation 2023-09-26 04:49:33 +00:00			`<div id='app'>`
			`<ul class='modules'>`
v1.3.3 published 2023-09-19 09:00:25 +00:00
			`</ul>`
			`</div>`
			`<script defer>`
			`const $modules = document.querySelector('.modules');`


[pkg] v1.33.8 published 2023-10-05 02:37:42 +00:00			`try {`
			`const queue = new Queue();`
chore: Add comments for the time and space complexity of all methods for the BinaryTree. 2023-11-10 03:01:49 +00:00			`for (let i = 0; i < 100000; i++) {`
[pkg] v1.33.8 published 2023-10-05 02:37:42 +00:00			`queue.enqueue(i);`
			`}`
			`let last = 0;`
			`const startTime = performance.now();`

chore: Add comments for the time and space complexity of all methods for the BinaryTree. 2023-11-10 03:01:49 +00:00			`for (let i = 0; i < 100000; i++) {`
[pkg] v1.33.8 published 2023-10-05 02:37:42 +00:00			`last = queue.dequeue();`
			`}`

			`console.log(performance.now() - startTime);`

[project] Optimize the build configuration to be compatible with both earlier and later versions of Node.js. Switch to using tsup for UMD module output. Format code using an IDE. 2023-10-25 07:51:50 +00:00			`} catch (e) {`
[pkg] v1.33.8 published 2023-10-05 02:37:42 +00:00			`console.error(e);`
v1.3.3 published 2023-09-19 09:00:25 +00:00			`}`
release: v 1.43.1 2023-11-12 16:03:42 +00:00			`try {`
			`const {AVLTree} = window.dataStructureTyped;`
			`const avlTree = new AVLTree();`
			`const $avlTree = document.createElement('li');`
			`const $avlTreeSpan = document.createElement('span');`
			`$avlTreeSpan.innerText = 'AVLTree';`
			`$avlTree.append($avlTreeSpan);`
			`for (let i = 1; i < 31; i++) {`
			`avlTree.add(i, i);`
			`}`
			`console.log(avlTree.bfs());`
			`// avlTree.print();`
			`$modules.append($avlTree);`
			`} catch (e) {`
			`console.error(e);`
			`}`
v1.3.3 published 2023-09-19 09:00:25 +00:00
chore: Add comments for the time and space complexity of all methods for the BinaryTree. 2023-11-10 03:01:49 +00:00			`try {`
			`const {BinaryTree} = dataStructureTyped;`
			`const tree = new BinaryTree();`
			`tree.add(3);`
			`tree.add(12);`
			`tree.addMany([1, 6, 9, 8,5,2,3,4,7])`
			`tree.add(10);`
			`console.log(tree.isPerfectlyBalanced());`
			`tree.print();`

			`const node3 = tree.getNode(3);`
			`if (node3) node3.right = tree.createNode(1);`
			`console.log(tree.isPerfectlyBalanced());`
			`tree.print();`

			`tree.clear();`
			`tree.addMany([1, null, 2, null, 3, null, 4, null, 5, null, 6, null]);`
			`console.log(tree.isPerfectlyBalanced());`
			`tree.print();`
			`} catch (e) {`
			`console.error(e);`
			`}`
release: v 1.43.1 2023-11-12 16:03:42 +00:00

			`try {`
test: Compare performance with other libraries. 2023-11-13 04:50:33 +00:00			`const {OrderedMap} = sdsl;`
release: v 1.43.1 2023-11-12 16:03:42 +00:00			`const {RedBlackTree} = dataStructureTyped;`
test: Compare performance with other libraries. 2023-11-13 04:50:33 +00:00			`const cTree = new OrderedMap();`
release: v 1.43.1 2023-11-12 16:03:42 +00:00			`const tree = new RedBlackTree();`
test: Compare performance with other libraries. 2023-11-13 04:50:33 +00:00			`const tS = performance.now();`
			`for (let i = 1; i < 1000000; i++) {`
release: v 1.43.1 2023-11-12 16:03:42 +00:00			`tree.add(i, i);`
			`}`
test: Compare performance with other libraries. 2023-11-13 04:50:33 +00:00			`console.log(performance.now() - tS);`
			`console.log(tree.size);`
			`const cS = performance.now();`
			`for (let i = 1; i < 1000000; i++) {`
			`cTree.setElement(i, i);`
			`}`
			`console.log(performance.now() - cS);`
			`console.log(cTree.size());`

			`// console.log(tree.isPerfectlyBalanced());`
			`// tree.print();`
release: v 1.43.1 2023-11-12 16:03:42 +00:00
			`} catch (e) {`
			`console.error(e);`
			`}`
test: Compare performance with other libraries. 2023-11-13 04:50:33 +00:00
			`try {`
			`const {PriorityQueue: CPriorityQueue} = sdsl;`
			`const {PriorityQueue} = dataStructureTyped;`
			`const pq = new PriorityQueue({comparator: (a, b) => b - a});`

			`const tS = performance.now();`

			`for (let i = 0; i < 1000000; i++) {`
			`pq.add(i);`
			`}`

			`for (let i = 0; i < 10000; i++) {`
			`pq.pop();`
			`}`
			`console.log(performance.now() - tS);`
			`console.log(pq.size);`
			`const cS = performance.now();`
			`const cpq = new CPriorityQueue();`

			`for (let i = 0; i < 1000000; i++) {`
			`cpq.push(i);`
			`}`

			`for (let i = 0; i < 10000; i++) {`
			`cpq.pop();`
			`}`
			`console.log(performance.now() - cS);`
			`console.log(cpq.size());`
			`} catch (e) {`
			`console.error(e);`
			`}`
v1.3.3 published 2023-09-19 09:00:25 +00:00			`</script>`
[core] remove all the unnecessary files and directories when publishing the npm package 2023-09-09 15:49:53 +00:00
			`</body>`
v1.3.3 published 2023-09-19 09:00:25 +00:00			`</html>`
test coverage report supported. Code quality enhanced and support multiple environments such as ES6 (ESModule), ES5 (CommonJS), and a single file for both browser and Node.js environments (UMD). Supported for source maps. CODE-OF-CONDUCT.md, COMMANDS.md, SECURITY.md, .gitattributes added. 2023-09-21 16:53:34 +00:00