Docs.rs

Ping protocol for libp2p

Implementation of the libp2p mDNS discovery method

Fast CRC-32/BYOND checksum computation

Common controllers we can reuse in many contracts

Enhanced/experimental storage engines

Common helpers for other cw specs

Nodes identifcation protocol for libp2p

Gossipsub protocol for libp2p

Floodsub protocol for libp2p

The libp2p swarm

Core traits and structs of libp2p

Priority Queue is more specialized data structure than Queue. Like ordinary queue, priority queue has same method but with a major difference. In Priority queue items are ordered by key value so that item with the lowest value of key is at front and item with the highest value of key is at rear or vice versa. So we're assigned priority to item based on its key value. Lower the value, higher the priority. Following are the principal methods of a Priority Queue.

A trick to parameterize functions and traits by the calling convention of their arguments and results

Terminal workspace (WIP)

Hex editor that works vaguely like ed