v0.4.2

1. Collapse empty buckets towards the "end" of the Routing Table.
2. API to fetch number of peers we have for a Cpl.
3. Give a usefulness bump to a peer if we are querying it the first time after adding it.

v0.4.1

Quick release to use durations instead of floats.

v0.4.0

Tack "usefulness" and "last queried" separately.

v0.3.3

Refresh all "common prefix lengths", up to the max common prefix length. Previously, we'd just refresh every bucket. However, the last bucket will contain peers from multiple CPLs so we'd fill our routing table slowly instead of all at once.

v0.3.1

1. Export the Option type so we can refer to in in the DHT.
2. Fix interface conversion in RT.Print().
3. Functions to get the number of peers for a Cpl/determine if a bucket is full.

v0.3.0

1. Disassociate connectivity from Routing Table membership. Please see libp2p/go-libp2p-kad-dht#283 for the motivating discussion & design notes.
2. Makes the Routing Table a self cleaning & self maintaining data structure by replacing peers that are not dialable with peers from a replacement cache.
3. Replace the existing imperative Routing Table API with an "event-driven" API so it responds to events such as peer connection, disconnection, undialable peer etc and updates it's internal state accordingly.

v0.2.3

Refresh and track real buckets, not virtual buckets. That is, don't treat the catch-all bucket as a single bucket.

That way, we correctly try to fill-in any buckets that might be available.

v0.2.2

This is a bug fix release to make sure we take peers from all bucket if the target bucket and its neighbors are empty. Otherwise, we'd return no peers when we had peers in the routing table.

v0.2.0

🎉 This release applies the core refactor to this module; migrating to the consolidated types under go-libp2p-core. See libp2p/go-libp2p#602 for more context.