kubo/blocks/set/set.go

80 lines
1.5 KiB
Go

package set
import (
"errors"
ds "github.com/jbenet/go-ipfs/Godeps/_workspace/src/github.com/jbenet/datastore.go"
"github.com/jbenet/go-ipfs/blocks/bloom"
"github.com/jbenet/go-ipfs/util"
)
var log = util.Logger("blockset")
type BlockSet interface {
AddBlock(util.Key)
RemoveBlock(util.Key)
HasKey(util.Key) bool
GetBloomFilter() bloom.Filter
GetKeys() []util.Key
}
func SimpleSetFromKeys(keys []util.Key) BlockSet {
sbs := &simpleBlockSet{blocks: make(map[util.Key]struct{})}
for _, k := range keys {
sbs.blocks[k] = struct{}{}
}
return sbs
}
func SetFromDatastore(d ds.Datastore, k ds.Key) (BlockSet, error) {
ikeys, err := d.Get(k)
if err != nil {
return nil, err
}
keys, ok := ikeys.([]util.Key)
if !ok {
return nil, errors.New("Incorrect type for keys from datastore")
}
return SimpleSetFromKeys(keys), nil
}
func NewSimpleBlockSet() BlockSet {
return &simpleBlockSet{blocks: make(map[util.Key]struct{})}
}
type simpleBlockSet struct {
blocks map[util.Key]struct{}
}
func (b *simpleBlockSet) AddBlock(k util.Key) {
b.blocks[k] = struct{}{}
}
func (b *simpleBlockSet) RemoveBlock(k util.Key) {
delete(b.blocks, k)
}
func (b *simpleBlockSet) HasKey(k util.Key) bool {
_, has := b.blocks[k]
return has
}
func (b *simpleBlockSet) GetBloomFilter() bloom.Filter {
f := bloom.BasicFilter()
for k, _ := range b.blocks {
f.Add([]byte(k))
}
return f
}
func (b *simpleBlockSet) GetKeys() []util.Key {
var out []util.Key
for k, _ := range b.blocks {
out = append(out, k)
}
return out
}