💥 BREAKING CHANGE: Remove chalk dependency.

Fixes #82.

Author: make-github-pseudonymous-again

package.json

@@ -26,9 +26,6 @@
   "bugs": {
     "url": "https://github.com/aureooms/js-red-black-tree/issues"
   },
-  "dependencies": {
-    "chalk": "^4.0.0"
-  },
   "devDependencies": {
     "@aureooms/js-compare": "1.4.8",
     "@aureooms/js-itertools": "4.1.0",
@@ -39,6 +36,7 @@
     "@babel/preset-env": "7.12.11",
     "@babel/register": "7.12.10",
     "ava": "3.15.0",
+    "chalk": "^4.1.0",
     "coveralls": "3.1.0",
     "esdoc": "1.1.0",
     "esdoc-inject-script-plugin": "1.0.0",

src/debug/debug.js

@@ -1,5 +1,3 @@
-import chalk from 'chalk' ;
-
 import { BLACK } from '..' ;
 
 /**
@@ -9,12 +7,18 @@ import { BLACK } from '..' ;
  * @param {Node} root - The root of the tree.
  * @returns {String}
  */
-export function debug ( root ) {
+export function _debug ({red, black}) {
+
+	const debug = ( root ) => {
+
+		if (root.isleaf( )) return black('L');
+
+		const repr = root.color === BLACK ? black(root.key) : red(root.key);
 
-	if ( root.isleaf( ) ) return chalk.bgBlack('L') ;
+		return `(${debug(root.left)}, ${repr}, ${debug(root.right)})`;
 
-	const repr = root.color === BLACK ? chalk.bgBlack(root.key) : chalk.bgRed( root.key ) ;
+	};
 
-	return `(${debug(root.left)}, ${repr}, ${debug(root.right)})` ;
+	return debug;
 
 }

test/src/RedBlackTree/remove.js

@@ -6,9 +6,13 @@ import { list , range , sorted , head , iter , exhaust } from '@aureooms/js-iter
 
 import { randint , shuffle } from '@aureooms/js-random' ;
 
-import { RedBlackTree , debug } from '../../../src' ;
+import { RedBlackTree , _debug } from '../../../src' ;
 
-import chalk from 'chalk' ;
+import { bgRed, bgBlack } from 'chalk' ;
+
+const red = bgRed;
+const black = bgBlack;
+const debug = _debug({red, black});
 
 test( 'RedBlackTree::remove' , t => {
 
@@ -72,15 +76,15 @@ test( 'delete root with right child' , t => {
 	tree.add( 0 ) ;
 	tree.add( 1 ) ;
 
-	const repr1 = `(${chalk.bgBlack('L')}, ${chalk.bgBlack(0)}, (${chalk.bgBlack('L')}, ${chalk.bgRed(1)}, ${chalk.bgBlack('L')}))` ;
+	const repr1 = `(${black('L')}, ${black(0)}, (${black('L')}, ${red(1)}, ${black('L')}))` ;
 
 	t.deepEqual( debug( tree.root ) , repr1 , 'debug string 1 is correct' ) ;
 
 	tree.remove( 0 ) ;
 
 	t.deepEqual( list( tree ) , [ 1 ] ) ;
 
-	const repr2 = `(${chalk.bgBlack('L')}, ${chalk.bgBlack(1)}, ${chalk.bgBlack('L')})` ;
+	const repr2 = `(${black('L')}, ${black(1)}, ${black('L')})` ;
 
 	t.deepEqual( debug( tree.root ) , repr2 , 'debug string 2 is correct' ) ;
 
@@ -93,15 +97,15 @@ test( 'delete root with left child' , t => {
 	tree.add( 0 ) ;
 	tree.add( -1 ) ;
 
-	const repr1 = `((${chalk.bgBlack('L')}, ${chalk.bgRed(-1)}, ${chalk.bgBlack('L')}), ${chalk.bgBlack(0)}, ${chalk.bgBlack('L')})` ;
+	const repr1 = `((${black('L')}, ${red(-1)}, ${black('L')}), ${black(0)}, ${black('L')})` ;
 
 	t.deepEqual( debug( tree.root ) , repr1 , 'debug string 1 is correct' ) ;
 
 	tree.remove( 0 ) ;
 
 	t.deepEqual( list( tree ) , [ -1 ] ) ;
 
-	const repr2 = `(${chalk.bgBlack('L')}, ${chalk.bgBlack(-1)}, ${chalk.bgBlack('L')})` ;
+	const repr2 = `(${black('L')}, ${black(-1)}, ${black('L')})` ;
 
 	t.deepEqual( debug( tree.root ) , repr2 , 'debug string 2 is correct' ) ;