GitLab

fix: when the target bucket is empty or low, pull from all other buckets

There's no reason to do these in series and they're kind of slow.

The neighbors may _also_ be empty or low. This can cause peers with a low number
of peers in their routing table to fail to find _any_ peers in their routing table.

readme: replace IPFS contrib links with libp2p

Merge pull request #39 from libp2p/dependabot/go_modules/github.com/libp2p/go-libp2p-peerstore-0.1.4

Bump github.com/libp2p/go-libp2p-peerstore from 0.1.0 to 0.1.4

Bumps [github.com/libp2p/go-libp2p-peerstore](https://github.com/libp2p/go-libp2p-peerstore) from 0.1.0 to 0.1.4.
- [Release notes](https://github.com/libp2p/go-libp2p-peerstore/releases)
- [Commits](https://github.com/libp2p/go-libp2p-peerstore/compare/v0.1.0...v0.1.4)
Signed-off-by: dependabot-preview[bot] <support@dependabot.com>

Merge pull request #40 from libp2p/dependabot/go_modules/github.com/multiformats/go-multihash-0.0.10

Bump github.com/multiformats/go-multihash from 0.0.1 to 0.0.10

Bumps [github.com/multiformats/go-multihash](https://github.com/multiformats/go-multihash) from 0.0.1 to 0.0.10.
- [Release notes](https://github.com/multiformats/go-multihash/releases)
- [Commits](https://github.com/multiformats/go-multihash/compare/v0.0.1...v0.0.10)
Signed-off-by: dependabot-preview[bot] <support@dependabot.com>

Bump github.com/libp2p/go-libp2p-core from 0.0.1 to 0.2.5

Bumps [github.com/libp2p/go-libp2p-core](https://github.com/libp2p/go-libp2p-core) from 0.0.1 to 0.2.5.
- [Release notes](https://github.com/libp2p/go-libp2p-core/releases)
- [Commits](https://github.com/libp2p/go-libp2p-core/compare/v0.0.1...v0.2.5)
Signed-off-by: dependabot-preview[bot] <support@dependabot.com>

k-bucket support for peoper kad bootstrapping

Fix bootstrapping id generation logic

fix: avoid hashing under a lock

dep: use a faster sha256 library

This is the one we're using in secio/multihash.

Remove a lot of allocations, and fix some ambiguous naming

Additionally, there it may require less allocations to pack the interface value to sort.Sort now, and lint warning about modifying a receiver in peerDistanceSorter.appendPeersFromList goes away.

the `copy` function will use  the minimum of len(src) and len(dst)

PeerRemoved was called even when the peer wasn't in the routing table.