💥 refactor!: rename empty to isEmpty.

This required to upgrade @aureooms/js-fingertree to v6. Upgraded a bunch of other dependencies along with it. BREAKING CHANGE: This breaks any dependent relying on the old API.
functional-data-structure · Mar 25, 2021 · ec1336c · ec1336c
1 parent 7d9b72f
commit ec1336c
Show file tree

Hide file tree

Showing 12 changed files with 554 additions and 1,046 deletions.
diff --git a/package.json b/package.json
@@ -77,13 +77,13 @@
   },
   "dependencies": {},
   "devDependencies": {
-    "@aureooms/js-fingertree": "5.0.2",
-    "@aureooms/js-itertools": "5.0.1",
-    "@aureooms/js-measure": "1.0.3",
-    "@aureooms/js-predicate": "2.0.2",
+    "@aureooms/js-fingertree": "6.0.0",
+    "@aureooms/js-itertools": "5.1.0",
+    "@aureooms/js-measure": "2.0.0",
+    "@aureooms/js-predicate": "3.0.1",
     "@babel/cli": "7.13.10",
     "@babel/core": "7.13.10",
-    "@babel/preset-env": "7.13.10",
+    "@babel/preset-env": "7.13.12",
     "@babel/register": "7.13.8",
     "ava": "3.15.0",
     "babel-plugin-transform-remove-console": "6.9.4",

diff --git a/src/heap.js b/src/heap.js
@@ -5,8 +5,8 @@ let Heap = function ( tree ) {
 	this.tree = tree ;
 } ;
 
-Heap.prototype.empty = function ( ) {
-	return this.tree.empty( ) ;
+Heap.prototype.isEmpty = function ( ) {
+	return this.tree.isEmpty( ) ;
 } ;
 
 Heap.prototype.maxKey =

diff --git a/src/indordseq.js b/src/indordseq.js
@@ -9,8 +9,8 @@ const IndOrdSeq = function ( tree ) {
 	this.tree = tree ;
 } ;
 
-IndOrdSeq.prototype.empty = function ( ) {
-	return this.tree.empty( ) ;
+IndOrdSeq.prototype.isEmpty = function ( ) {
+	return this.tree.isEmpty( ) ;
 } ;
 
 IndOrdSeq.prototype.measure = function ( ) {
@@ -72,7 +72,7 @@ IndOrdSeq.prototype.deleteAll = function ( value ) {
 
 IndOrdSeq.prototype.merge = function ( other ) {
 
-	if ( other.empty( ) ) return this ;
+	if ( other.isEmpty( ) ) return this ;
 
 	const a = other.head( ) ;
 	const k = key.measure( a ) ;

diff --git a/src/intervaltree.js b/src/intervaltree.js
@@ -13,7 +13,7 @@ const matches = function* ( low , tree ) {
 
 	const xs = tree.dropUntil( ( m ) => atleast( low , m ) ) ;
 
-	if ( xs.empty( ) ) return ;
+	if ( xs.isEmpty( ) ) return ;
 
 	yield xs.head( ) ;
 
@@ -25,8 +25,8 @@ const IntervalTree = function ( tree ) {
 	this.tree = tree ;
 } ;
 
-IntervalTree.prototype.empty = function ( ) {
-	return this.tree.empty( ) ;
+IntervalTree.prototype.isEmpty = function ( ) {
+	return this.tree.isEmpty( ) ;
 } ;
 
 IntervalTree.prototype.measure = function ( ) {
@@ -74,7 +74,7 @@ IntervalTree.prototype.insert = function ( interval ) {
 
 IntervalTree.prototype.merge = function ( other ) {
 
-	if ( other.empty( ) ) return this ;
+	if ( other.isEmpty( ) ) return this ;
 
 	const a = other.head( ) ;
 	const k = M.measure( a )[0] ;

diff --git a/src/ordseq.js b/src/ordseq.js
@@ -9,8 +9,8 @@ const OrdSeq = function ( tree ) {
 	this.tree = tree ;
 } ;
 
-OrdSeq.prototype.empty = function ( ) {
-	return this.tree.empty( ) ;
+OrdSeq.prototype.isEmpty = function ( ) {
+	return this.tree.isEmpty( ) ;
 } ;
 
 OrdSeq.prototype.measure = function ( ) {
@@ -72,7 +72,7 @@ OrdSeq.prototype.deleteAll = function ( value ) {
 
 OrdSeq.prototype.merge = function ( other ) {
 
-	if ( other.empty( ) ) return this ;
+	if ( other.isEmpty( ) ) return this ;
 
 	const a = other.head( ) ;
 	const k = key.measure( a ) ;

diff --git a/src/seq.js b/src/seq.js
@@ -5,8 +5,8 @@ const Seq = function ( tree ) {
 	this.tree = tree ;
 } ;
 
-Seq.prototype.empty = function ( ) {
-	return this.tree.empty( ) ;
+Seq.prototype.isEmpty = function ( ) {
+	return this.tree.isEmpty( ) ;
 } ;
 
 Seq.prototype.measure =

diff --git a/test/src/heap.js b/test/src/heap.js
@@ -24,7 +24,7 @@ test( 'heap' , t => {
 	t.is( b , 2 ) ;
 	t.is( c , 1 ) ;
 
-	t.true( z[1].empty( ) ) ;
+	t.true( z[1].isEmpty( ) ) ;
 	t.is( h.maxKey( ) , 3 ) ;
 	t.is( x[1].maxKey( ) , 2 ) ;
 	t.is( y[1].maxKey( ) , 1 ) ;
@@ -43,7 +43,7 @@ test( 'heap' , t => {
 	t.is( b , 2 ) ;
 	t.is( c , 1 ) ;
 
-	t.true( z[1].empty( ) ) ;
+	t.true( z[1].isEmpty( ) ) ;
 	t.is( h.maxKey( ) , 3 ) ;
 	t.is( x[1].maxKey( ) , 2 ) ;
 	t.is( y[1].maxKey( ) , 1 ) ;

diff --git a/test/src/indordseq.js b/test/src/indordseq.js
@@ -13,15 +13,15 @@ test( 'indordseq (ordseq behavior)' , t => {
 
 	let o = IndOrdSeq.empty( ) ;
 
-	t.true( o.empty( ) ) ;
+	t.true( o.isEmpty( ) ) ;
 
 	o = o.insert( 1 ) ;
 	o = o.insert( 3 ) ;
 	o = o.insert( 2 ) ;
 
 	t.deepEqual( o.measure( ) , [ 3 , 3 ] ) ;
 
-	t.true( !o.empty( ) ) ;
+	t.true( !o.isEmpty( ) ) ;
 
 	t.is( o.min( ) , 1 ) ;
 	t.is( o.max( ) , 3 ) ;
@@ -51,15 +51,15 @@ test( 'indordseq (seq behavior)' , t => {
 
 	let s = IndOrdSeq.empty( ) ;
 
-	t.true( s.empty( ) ) ;
+	t.true( s.isEmpty( ) ) ;
 
 	t.is( s.len( ) , 0 ) ;
 
 	s = s.insert( 'b' ) ;
 	s = s.insert( 'c' ) ;
 	s = s.insert( 'a' ) ;
 
-	t.true( !s.empty( ) ) ;
+	t.true( !s.isEmpty( ) ) ;
 
 	t.is( s.len( ) , 3 ) ;
 

diff --git a/test/src/intervaltree.js b/test/src/intervaltree.js
@@ -11,7 +11,7 @@ test( 'intervaltree' ,  t => {
 
 	let i = IntervalTree.empty( ) ;
 
-	t.true( i.empty( ) ) ;
+	t.true( i.isEmpty( ) ) ;
 
 	i = i.insert( [ 1 , 7 ] ) ;
 	i = i.insert( [ 3 , 9 ] ) ;

diff --git a/test/src/ordseq.js b/test/src/ordseq.js
@@ -12,15 +12,15 @@ test( 'ordseq' , t => {
 
 	let o = OrdSeq.empty( ) ;
 
-	t.true( o.empty( ) ) ;
+	t.true( o.isEmpty( ) ) ;
 
 	o = o.insert( 1 ) ;
 	o = o.insert( 3 ) ;
 	o = o.insert( 2 ) ;
 
 	t.is( o.measure( ) , 3 ) ;
 
-	t.true( !o.empty( ) ) ;
+	t.true( !o.isEmpty( ) ) ;
 
 	t.is( o.min( ) , 1 ) ;
 	t.is( o.max( ) , 3 ) ;

diff --git a/test/src/seq.js b/test/src/seq.js
@@ -12,15 +12,15 @@ test( 'seq' , t => {
 
 	let s = Seq.empty( ) ;
 
-	t.true( s.empty( ) ) ;
+	t.true( s.isEmpty( ) ) ;
 
 	t.is( s.len( ) , 0 ) ;
 
 	s = s.push( 'b' ) ;
 	s = s.push( 'c' ) ;
 	s = s.cons( 'a' ) ;
 
-	t.true( !s.empty( ) ) ;
+	t.true( !s.isEmpty( ) ) ;
 
 	t.is( s.len( ) , 3 ) ;