func (p *NodesCache) GetNode(id int64) (*element.Node, error) {
keyBuf := idToKeyBuf(id)
data, err := p.db.Get(p.ro, keyBuf)
if err != nil {
return nil, err
}
if data == nil {
return nil, NotFound
}
node, err := binary.UnmarshalNode(data)
if err != nil {
return nil, err
}
node.Id = id
return node, nil
}
func (p *NodesCache) Iter() chan *element.Node {
nodes := make(chan *element.Node)
go func() {
ro := levigo.NewReadOptions()
ro.SetFillCache(false)
it := p.db.NewIterator(ro)
defer it.Close()
it.SeekToFirst()
for ; it.Valid(); it.Next() {
node, err := binary.UnmarshalNode(it.Value())
if err != nil {
panic(err)
}
node.Id = idFromKeyBuf(it.Key())
nodes <- node
}
close(nodes)
}()
return nodes
}
func (p *NodesCache) Iter() chan *element.Node {
nodes := make(chan *element.Node)
go func() {
ro := levigo.NewReadOptions()
ro.SetFillCache(false)
it := p.db.NewIterator(ro)
// we need to Close the iter before closing the
// chan (and thus signaling that we are done)
// to avoid race where db is closed before the iterator
defer close(nodes)
defer it.Close()
it.SeekToFirst()
for ; it.Valid(); it.Next() {
node, err := binary.UnmarshalNode(it.Value())
if err != nil {
panic(err)
}
node.Id = idFromKeyBuf(it.Key())
nodes <- node
}
}()
return nodes
}