v5.1.0

Added toIterable(). (#52)
Removed devDependency buffer-equals.
Updated dependencies.
Updated code style to standard@16.

v5.0.0

Updated implementation to ES6.
KBucket.prototype._determineNode uses bitshift (#41)

v4.0.1

Faster closest(). (#47)
Updated dependencies.

v4.0.0

Internal implementation now expects Uint8Array instead of Buffer for node ids. (#45)
Since Buffer extends Uint8Array, code using Buffer for node ids should continue to work.
kBucket.add() is faster in benchmark while perhaps slightly increasing heap usage.
Browsers no longer need Buffer polyfill to use k-bucket.

v3.3.1

When calculating closest nodes, no need to sort and slice everything all the time, it can be done once at the end. (#44)

v3.3.0

Added metadata property to k-bucket so that users can safely store satellite data associated with the bucket. (#43)

v3.2.1

Removed stray console.log.

v3.2.0

The implementation of the API did not enforce the contract for closest(id, n) method call when n (required) is not provided. Some consumers of the library used closest(id), without specifying n. v3.0.3 introduced a change in internal implementation that, while maintaining behavior with n specified, changed the behavior when n was omitted. This release reverts the observed behavior of closest, when n is omitted, to be the same as prior to v3.0.3. The API is now updated, and n in closest(id [, n = Infinity]) is optional and set to Infinity by default.

v3.1.0

Custom distance function can be provided via KBucket options: (#37)
Exposed KBucket.arbiter for a more consistent API

v3.0.3

Reduced heap usage by removing recursion from KBucket: (#35)

Reported problems:

This release changed the internal implementation of closest(id, n) which may impact code that does not provide the required n parameter. See #38. Upgrading to v3.2.0 resolves this problem.