🚚 refactor: Rename adt to types.

Author: make-github-pseudonymous-again

src/debug/_debug.js

@@ -1,6 +1,6 @@
 import assert from 'assert';
-import Node from '../adt/Node.js';
-import Leaf from '../adt/Leaf.js';
+import Node from '../types/Node.js';
+import Leaf from '../types/Leaf.js';
 import BLACK from '../color/BLACK.js';
 
 /**

src/deletion/delete_case1.js

@@ -1,7 +1,7 @@
 import assert from 'assert';
 import BLACK from '../color/BLACK.js';
-import Node from '../adt/Node.js';
-import Leaf from '../adt/Leaf.js';
+import Node from '../types/Node.js';
+import Leaf from '../types/Leaf.js';
 import delete_case2 from './delete_case2.js';
 
 /**

src/deletion/delete_case2.js

@@ -1,8 +1,8 @@
 import assert from 'assert';
 import BLACK from '../color/BLACK.js';
 import RED from '../color/RED.js';
-import Node from '../adt/Node.js';
-import Leaf from '../adt/Leaf.js';
+import Node from '../types/Node.js';
+import Leaf from '../types/Leaf.js';
 import rotate_left from '../rotate/rotate_left.js';
 import rotate_right from '../rotate/rotate_right.js';
 import sibling from '../family/sibling.js';

src/deletion/delete_case3.js

@@ -1,8 +1,8 @@
 import assert from 'assert';
 import BLACK from '../color/BLACK.js';
 import RED from '../color/RED.js';
-import Node from '../adt/Node.js';
-import Leaf from '../adt/Leaf.js';
+import Node from '../types/Node.js';
+import Leaf from '../types/Leaf.js';
 import sibling from '../family/sibling.js';
 
 import delete_case1 from './delete_case1.js';

src/deletion/delete_case4.js

@@ -1,8 +1,8 @@
 import assert from 'assert';
 import BLACK from '../color/BLACK.js';
 import RED from '../color/RED.js';
-import Node from '../adt/Node.js';
-import Leaf from '../adt/Leaf.js';
+import Node from '../types/Node.js';
+import Leaf from '../types/Leaf.js';
 import sibling from '../family/sibling.js';
 
 import delete_case5 from './delete_case5.js';

src/deletion/delete_case5.js

@@ -1,8 +1,8 @@
 import assert from 'assert';
 import BLACK from '../color/BLACK.js';
 import RED from '../color/RED.js';
-import Node from '../adt/Node.js';
-import Leaf from '../adt/Leaf.js';
+import Node from '../types/Node.js';
+import Leaf from '../types/Leaf.js';
 import rotate_left from '../rotate/rotate_left.js';
 import rotate_right from '../rotate/rotate_right.js';
 import sibling from '../family/sibling.js';

src/deletion/delete_case6.js

@@ -1,8 +1,8 @@
 import assert from 'assert';
 import BLACK from '../color/BLACK.js';
 import RED from '../color/RED.js';
-import Node from '../adt/Node.js';
-import Leaf from '../adt/Leaf.js';
+import Node from '../types/Node.js';
+import Leaf from '../types/Leaf.js';
 import rotate_left from '../rotate/rotate_left.js';
 import rotate_right from '../rotate/rotate_right.js';
 import sibling from '../family/sibling.js';

src/deletion/delete_one_child.js

@@ -1,8 +1,8 @@
 import assert from 'assert';
 import BLACK from '../color/BLACK.js';
 import RED from '../color/RED.js';
-import Node from '../adt/Node.js';
-import Leaf from '../adt/Leaf.js';
+import Node from '../types/Node.js';
+import Leaf from '../types/Leaf.js';
 
 import replace_node from './replace_node.js';
 import delete_case1 from './delete_case1.js';

src/deletion/replace_node.js

@@ -1,6 +1,6 @@
 import assert from 'assert';
-import Node from '../adt/Node.js';
-import Leaf from '../adt/Leaf.js';
+import Node from '../types/Node.js';
+import Leaf from '../types/Leaf.js';
 
 /**
  * Replaces node <code>A</code> by node <code>B</code>.

src/family/grandparent.js

@@ -1,5 +1,5 @@
 import assert from 'assert';
-import Node from '../adt/Node.js';
+import Node from '../types/Node.js';
 
 /**
  * Computes the grandparent (parent of parent) of the input node.

src/family/predecessor.js

@@ -1,5 +1,5 @@
 import assert from 'assert';
-import Node from '../adt/Node.js';
+import Node from '../types/Node.js';
 
 /**
  * Computes the predecessor of the input node, in the subtree rooted at the

src/family/sibling.js

@@ -1,6 +1,6 @@
 import assert from 'assert';
-import Node from '../adt/Node.js';
-import Leaf from '../adt/Leaf.js';
+import Node from '../types/Node.js';
+import Leaf from '../types/Leaf.js';
 
 /**
  * Computes the sibling of the input node.

src/family/uncle.js

@@ -1,6 +1,6 @@
 import assert from 'assert';
-import Node from '../adt/Node.js';
-import Leaf from '../adt/Leaf.js';
+import Node from '../types/Node.js';
+import Leaf from '../types/Leaf.js';
 import grandparent from './grandparent.js';
 
 /**

src/index.js

@@ -1,6 +1,3 @@
-export {default as Leaf} from './adt/Leaf.js';
-export {default as Node} from './adt/Node.js';
-export {default as RedBlackTree} from './adt/RedBlackTree.js';
 export {default as BLACK} from './color/BLACK.js';
 export {default as RED} from './color/RED.js';
 export {default as _debug} from './debug/_debug.js';
@@ -27,3 +24,6 @@ export {default as rotate_right} from './rotate/rotate_right.js';
 export {default as search} from './search/search.js';
 export {default as inordertraversal} from './traversal/inordertraversal.js';
 export {default as rangetraversal} from './traversal/rangetraversal.js';
+export {default as Leaf} from './types/Leaf.js';
+export {default as Node} from './types/Node.js';
+export {default as RedBlackTree} from './types/RedBlackTree.js';

src/insertion/insert.js

@@ -1,5 +1,5 @@
 import assert from 'assert';
-import Node from '../adt/Node.js';
+import Node from '../types/Node.js';
 
 /**
  * Walks the tree rooted at <code>A</code> down the only path that satisfies

src/insertion/insert_case1.js

@@ -1,5 +1,5 @@
 import assert from 'assert';
-import Node from '../adt/Node.js';
+import Node from '../types/Node.js';
 import BLACK from '../color/BLACK.js';
 import RED from '../color/RED.js';
 import insert_case2 from './insert_case2.js';

src/insertion/insert_case2.js

@@ -1,5 +1,5 @@
 import assert from 'assert';
-import Node from '../adt/Node.js';
+import Node from '../types/Node.js';
 import BLACK from '../color/BLACK.js';
 import RED from '../color/RED.js';
 import insert_case3 from './insert_case3.js';

src/insertion/insert_case3.js

@@ -1,5 +1,5 @@
 import assert from 'assert';
-import Node from '../adt/Node.js';
+import Node from '../types/Node.js';
 import BLACK from '../color/BLACK.js';
 import RED from '../color/RED.js';
 import uncle from '../family/uncle.js';

src/insertion/insert_case4.js

@@ -1,5 +1,5 @@
 import assert from 'assert';
-import Node from '../adt/Node.js';
+import Node from '../types/Node.js';
 import BLACK from '../color/BLACK.js';
 import RED from '../color/RED.js';
 import rotate_left from '../rotate/rotate_left.js';

src/insertion/insert_case5.js

@@ -1,5 +1,5 @@
 import assert from 'assert';
-import Node from '../adt/Node.js';
+import Node from '../types/Node.js';
 import BLACK from '../color/BLACK.js';
 import RED from '../color/RED.js';
 import rotate_left from '../rotate/rotate_left.js';

src/rotate/rotate_left.js

@@ -1,5 +1,5 @@
 import assert from 'assert';
-import Node from '../adt/Node.js';
+import Node from '../types/Node.js';
 
 /**
  * Rotate tree left. (see https://en.wikipedia.org/wiki/Tree_rotation)

src/rotate/rotate_right.js

@@ -1,5 +1,5 @@
 import assert from 'assert';
-import Node from '../adt/Node.js';
+import Node from '../types/Node.js';
 
 /**
  * Rotate tree right. (see https://en.wikipedia.org/wiki/Tree_rotation)

src/search/search.js

@@ -1,5 +1,5 @@
 import assert from 'assert';
-import Node from '../adt/Node.js';
+import Node from '../types/Node.js';
 
 /**
  * Search for the first node whose key equals <code>key</code>.

src/traversal/inordertraversal.js

@@ -1,5 +1,5 @@
 import assert from 'assert';
-import Node from '../adt/Node.js';
+import Node from '../types/Node.js';
 
 /**
  * Traverses the tree rooted at <code>node</code> in order.

src/traversal/rangetraversal.js

@@ -1,5 +1,5 @@
 import assert from 'assert';
-import Node from '../adt/Node.js';
+import Node from '../types/Node.js';
 
 /**
  * Yields all the keys in the tree rooted at <code>root</code> that lie in the