🎨 refactor: Use flat export style.

Author: make-github-pseudonymous-again

src/adt/Leaf.js

@@ -1,14 +1,14 @@
 import assert from 'assert';
-import {BLACK} from '../color/BLACK.js';
-import {Node} from './Node.js';
+import BLACK from '../color/BLACK.js';
+import Node from './Node.js';
 
 /**
  * A black leaf node.
  *
  * @class
  * @param {Node} parent - The parent node in the tree.
  */
-export function Leaf(parent) {
+export default function Leaf(parent) {
 	assert(parent instanceof Node);
 	/** @constant {number} The color of the node. */
 	this._color = BLACK;

src/adt/Node.js

@@ -1,4 +1,4 @@
-import {Leaf} from './Leaf.js';
+import Leaf from './Leaf.js';
 
 /**
  * An internal node. This node can be red or black.
@@ -7,7 +7,7 @@ import {Leaf} from './Leaf.js';
  * @param {number} color - The color of the node.
  * @param {any} key - The key of the node.
  */
-export function Node(color, key) {
+export default function Node(color, key) {
 	/** @member {number} The color of the node. */
 	this._color = color;
 	/** @member {Node|Leaf} The left child */

src/adt/RedBlackTree.js

@@ -1,17 +1,20 @@
 import assert from 'assert';
-import {Node} from './Node.js';
-import {BLACK, RED} from '../color/index.js';
-import {predecessor} from '../family/predecessor.js';
-import {insert, insert_case2} from '../insertion/index.js';
-import {delete_one_child} from '../deletion/index.js';
-import {search} from '../search/index.js';
-import {inordertraversal, rangetraversal} from '../traversal/index.js';
+import Node from './Node.js';
+import BLACK from '../color/BLACK.js';
+import RED from '../color/RED.js';
+import predecessor from '../family/predecessor.js';
+import insert from '../insertion/insert.js';
+import insert_case2 from '../insertion/insert_case2.js';
+import delete_one_child from '../deletion/delete_one_child.js';
+import search from '../search/search.js';
+import inordertraversal from '../traversal/inordertraversal.js';
+import rangetraversal from '../traversal/rangetraversal.js';
 
 /**
  * A RedBlackTree with key-only nodes.
  *
  */
-export class RedBlackTree {
+export default class RedBlackTree {
 	/**
 	 * Constructs a new empty red-black tree.
 	 *

src/adt/index.js

@@ -1,4 +1,5 @@
 /**
  * Constant for black.
  */
-export const BLACK = 0;
+const BLACK = 0;
+export default BLACK;

src/color/BLACK.js

@@ -1,4 +1,5 @@
 /**
  * Constant for red.
  */
-export const RED = 1;
+const RED = 1;
+export default RED;

src/color/RED.js

@@ -1,15 +1,15 @@
 import assert from 'assert';
-import {Node} from '../adt/Node.js';
-import {Leaf} from '../adt/Leaf.js';
-import {BLACK} from '../color/BLACK.js';
+import Node from '../adt/Node.js';
+import Leaf from '../adt/Leaf.js';
+import BLACK from '../color/BLACK.js';
 
 /**
  * Builds a debug function from color handlers.
  *
  * @param {Object} colors The colors to use.
  * @returns {Function} The debug function.
  */
-export const _debug = ({red, black}) => {
+const _debug = ({red, black}) => {
 	/**
 	 * Recursively constructs a prettyprint string for the red-black tree rooted at
 	 * <code>root</code>.
@@ -33,3 +33,5 @@ export const _debug = ({red, black}) => {
 
 	return debug;
 };
+
+export default _debug;

src/color/index.js

@@ -1,8 +1,8 @@
 import assert from 'assert';
-import {BLACK} from '../color/BLACK.js';
-import {Node} from '../adt/Node.js';
-import {Leaf} from '../adt/Leaf.js';
-import {delete_case2} from './delete_case2.js';
+import BLACK from '../color/BLACK.js';
+import Node from '../adt/Node.js';
+import Leaf from '../adt/Leaf.js';
+import delete_case2 from './delete_case2.js';
 
 /**
  * Preconditions:
@@ -12,11 +12,13 @@ import {delete_case2} from './delete_case2.js';
  *
  * @param {Node|Leaf} n - The input node.
  */
-export const delete_case1 = (n) => {
+const delete_case1 = (n) => {
 	assert(n instanceof Node || n instanceof Leaf);
 	assert(n._color === BLACK);
 	// If n is the root, there is nothing to do:
 	//   - all paths go through n, and
 	//   - n is black.
 	if (n.parent !== null) delete_case2(n);
 };
+
+export default delete_case1;