mirror of
https://github.com/dolthub/dolt.git
synced 2026-02-05 02:59:44 -06:00
662bc5e3c4
Given two refs, we need to be able to determine the set of chunks reachable from one that cannot be reached from the other. This patch adds a naive implementation of this functionality that essentially walks the value tree down from the values pointed to by two refs and compares them. It also has a little command-line driver, but this may be removed. Fixes issue #82
Noms
Noms is a content-addressable, immutable, peer-to-peer datastore for structured data.
In other words, noms is git for structured data.
This repository will contain the reference implementation of the noms protocol, and will eventually be open sourced.
This includes:
- Go wrappers for all the core Nom types
- Support for generating Go types from Nom schema definitions
- Chunking and dechunking
- Serialization and deserialization
- Chunkstore interface as well as several sample implementations
- Search support
- Sample applications
Get the code
go get -u -t github.com/attic-labs/noms/...
Build
go build ./...
go test ./...
Run
cd <noms>/clients/counter
go build
./counter -file-store="/tmp/foo"
./counter -file-store="/tmp/foo"
./counter -file-store="/tmp/foo"
rejoice!
You can see the raw data:
ls /tmp/foo
cat /tmp/foo/root
You can also explore the data visually. Follow the instructions in clients/explore.