💥 refactor!: Rename #empty to #isEmpty.

BREAKING CHANGE: This breaks any dependent relying on the old API.

Author: make-github-pseudonymous-again

README.md

@@ -41,7 +41,7 @@ Parent is [@aureooms/js-persistent](https://github.com/aureooms/js-persistent).
     * [`from(Measure, Iterable) -> Tree`](#frommeasure-iterable---tree)
   * [:question: Predicates](#question-predicates)
     * [`Tree#measure() -> m`](#treemeasure---m)
-    * [`Tree#empty() -> Boolean`](#treeempty---boolean)
+    * [`Tree#isEmpty() -> Boolean`](#treeisempty---boolean)
   * [:salt: Add values](#salt-add-values)
     * [`Tree#push(x) -> Tree`](#treepushx---tree)
     * [`Tree#cons(x) -> Tree`](#treeconsx---tree)
@@ -161,12 +161,12 @@ Returns the measure of the tree.
 if ( tree.measure() > 1 ) ...
 ```
 
-#### `Tree#empty() -> Boolean`
+#### `Tree#isEmpty() -> Boolean`
 
 Returns `true` if the tree is empty, `false` otherwise.
 
 ```js
-return tree.empty() ? 'empty' : 'not empty' ;
+return tree.isEmpty() ? 'empty' : 'not empty' ;
 ```
 
 
@@ -228,15 +228,15 @@ let last = tree.last() ; // 'b'
 Returns a new tree without the right-most value.
 
 ```js
-while ( ! tree.empty() ) tree = tree.init() ;
+while ( ! tree.isEmpty() ) tree = tree.init() ;
 ```
 
 #### `Tree#tail() -> Tree`
 
 Returns a new tree without the left-most value.
 
 ```js
-while ( ! tree.empty() ) tree = tree.tail() ;
+while ( ! tree.isEmpty() ) tree = tree.tail() ;
 ```
 
 

src/0-core/split/deepL.js

@@ -10,7 +10,7 @@ import {_from_digit, _digit} from '../_fast/index.js';
  */
 export function deepL(M, left, middle, right) {
 	if (left.length === 0) {
-		if (middle.empty()) return _from_digit(M, right);
+		if (middle.isEmpty()) return _from_digit(M, right);
 
 		return new Deep(
 			M,

src/0-core/split/deepR.js

@@ -10,7 +10,7 @@ import {_from_digit, _digit} from '../_fast/index.js';
  */
 export function deepR(M, left, middle, right) {
 	if (right.length === 0) {
-		if (middle.empty()) return _from_digit(M, left);
+		if (middle.isEmpty()) return _from_digit(M, left);
 
 		return new Deep(
 			M,

src/3-tree/implementations/0-Empty.js

@@ -13,7 +13,7 @@ Empty.prototype.measure = function () {
 	return this.v;
 };
 
-Empty.prototype.empty = function () {
+Empty.prototype.isEmpty = function () {
 	return true;
 };
 

src/3-tree/implementations/1-Single.js

@@ -15,7 +15,7 @@ Single.prototype.measure = function () {
 	return this.v;
 };
 
-Single.prototype.empty = function () {
+Single.prototype.isEmpty = function () {
 	return false;
 };
 

src/3-tree/implementations/2-Deep.js

@@ -38,7 +38,7 @@ Deep.prototype.measure = function () {
 	return this.v;
 };
 
-Deep.prototype.empty = function () {
+Deep.prototype.isEmpty = function () {
 	return false;
 };
 
@@ -52,7 +52,7 @@ Deep.prototype.last = function () {
 
 Deep.prototype.tail = function () {
 	if (this.left instanceof One) {
-		if (this.middle.empty()) {
+		if (this.middle.isEmpty()) {
 			return _from_digit(this.M, this.right);
 		}
 
@@ -69,7 +69,7 @@ Deep.prototype.tail = function () {
 
 Deep.prototype.init = function () {
 	if (this.right instanceof One) {
-		if (this.middle.empty()) {
+		if (this.middle.isEmpty()) {
 			return _from_digit(this.M, this.left);
 		}
 

src/4-lazy/0-Lazy.js

@@ -16,8 +16,8 @@ Lazy.prototype.force = function () {
 	return this.tree;
 };
 
-Lazy.prototype.empty = function () {
-	return this.force().empty();
+Lazy.prototype.isEmpty = function () {
+	return this.force().isEmpty();
 };
 
 Lazy.prototype.measure = function () {

test/src/FingerTree.js

@@ -65,14 +65,14 @@ test('FingerTree', (t) => {
 		.concat(V4)
 		.concat(EMPTY);
 
-	t.true(EMPTY.empty());
-	t.true(!V.empty());
-	t.true(V1.tail().empty());
-	t.true(V1.init().empty());
-	t.true(V4.tail().empty());
-	t.true(V4.init().empty());
-	t.true(EMPTY.tail().empty());
-	t.true(EMPTY.init().empty());
+	t.true(EMPTY.isEmpty());
+	t.true(!V.isEmpty());
+	t.true(V1.tail().isEmpty());
+	t.true(V1.init().isEmpty());
+	t.true(V4.tail().isEmpty());
+	t.true(V4.init().isEmpty());
+	t.true(EMPTY.tail().isEmpty());
+	t.true(EMPTY.init().isEmpty());
 	t.is(V.measure(), M);
 	t.is(V.head(), 0);
 	t.is(V.last(), M - 1);

test/src/methods/isEmpty.js

@@ -0,0 +1,28 @@
+import test from 'ava';
+
+import {Measures} from '@aureooms/js-measure';
+const {COUNTER} = Measures;
+
+import {range} from '@aureooms/js-itertools';
+
+import {empty, from} from '../../../src/index.js';
+
+test('empty(COUNTER) is empty', (t) => {
+	t.true(empty(COUNTER).isEmpty());
+});
+
+test('from(COUNTER, []) is empty', (t) => {
+	t.true(from(COUNTER, []).isEmpty());
+});
+
+test('from(COUNTER, range(0)) is empty', (t) => {
+	t.true(from(COUNTER, range(0)).isEmpty());
+});
+
+test('from(COUNTER, [0]) is not empty', (t) => {
+	t.false(from(COUNTER, [0]).isEmpty());
+});
+
+test('from(COUNTER, range(1000)) is not empty', (t) => {
+	t.false(from(COUNTER, range(1000)).isEmpty());
+});