Godeps/

The uuid package generates and inspects UUIDs.

Package proto converts data structures to and from the wire format of protocol buffers.

This package provides a simple LRU cache.

package blocks contains the lowest level of ipfs data structures, the raw block with a checksum.

package blockstore implements a thin wrapper over a datastore, giving a clean interface for Getting and Putting block objects.

package set contains various different types of 'BlockSet's

package blockservice implements a BlockService interface that provides a single GetBlock/AddBlock interface that seamlessly retrieves data either locally or from a remote peer through the exchange.

TODO FIXME name me

package exchange defines the IPFS Exchange interface

package offline implements an object that implements the exchange interface but returns nil values to every request.

package merkledag implements the ipfs Merkle DAG datastructures.

Package traverse provides merkledag traversal functions

package pin implements structures and methods to keep track of which objects a user wants to keep stored locally.

package config implements the ipfs config file datastructures and utilities.

Package notifier provides a simple notification dispatcher meant to be embedded in larger structres who wish to allow clients to sign up for event notifications.

package util implements various utility functions used within ipfs that do not currently have a better place to live.

Package base58 provides base58-check encoding.

package ctxgroup provides the ContextGroup, a hybrid between the context.Context and sync.WaitGroup, which models process trees.

Package flatfs is a Datastore implementation that stores all objects in a two-level directory structure in the local file system, regardless of the hierarchy of the keys.

Package fs is a simple Datastore implementation that stores keys are directories and files, mirroring the key.

Package keytransform introduces a Datastore Shim that transforms keys before passing them to its child.

Package measure provides a Datastore wrapper that records metrics using github.com/codahale/metrics.

Package mount provides a Datastore that has other Datastores mounted at various key prefixes.

Package namespace introduces a namespace Datastore Shim, which basically mounts the entire child datastore under a prefix.

Package goprocess introduces a Process abstraction that allows simple organization, and orchestration of work.

Package periodic is part of github.com/jbenet/goprocess.

Package ratelimit is part of github.com/jbenet/goprocess.

Package leveldb provides implementation of LevelDB key/value database.

Package cache provides interface and implementation of a cache algorithms.

Package comparer provides interface and implementation for ordering sets of data.

Package errors provides common error types used throughout leveldb.

Package filter provides interface and implementation of probabilistic data structure.

Package iterator provides interface and implementation to traverse over contents of a database.

Package journal reads and writes sequences of journals.

Package memdb provides in-memory key/value database implementation.

Package opt provides sets of options used by LevelDB.

Package storage provides storage abstraction for LevelDB.

Package table allows read and write sorted key/value.

Package util provides utilities used throughout leveldb.

Package snappy implements the snappy block-based compression format.

Package logging implements a logging infrastructure for Go.

Go port of Coda Hale's Metrics library <https://github.com/rcrowley/go-metrics> Coda Hale's original work: <https://github.com/codahale/metrics>

Metrics output to StatHat.

Package blowfish implements Bruce Schneier's Blowfish encryption algorithm.

Package sha3 implements the SHA-3 fixed-output-length hash functions and the SHAKE variable-output-length hash functions defined by FIPS-202.

Package context defines the Context type, which carries deadlines, cancelation signals, and other request-scoped values across API boundaries and between processes.