401c58426f
* Move nquads into quad. * Create cquads simplified parser in quad. * Move Triple (renamed Quad) to quad. Also made sure mongo actually implements BulkLoader.
136 lines
3 KiB
Go
136 lines
3 KiB
Go
// Copyright 2014 The Cayley Authors. All rights reserved.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
package leveldb
|
|
|
|
import (
|
|
"bytes"
|
|
"fmt"
|
|
"strings"
|
|
|
|
ldbit "github.com/syndtr/goleveldb/leveldb/iterator"
|
|
"github.com/syndtr/goleveldb/leveldb/opt"
|
|
|
|
"github.com/google/cayley/graph"
|
|
"github.com/google/cayley/graph/iterator"
|
|
"github.com/google/cayley/quad"
|
|
)
|
|
|
|
type AllIterator struct {
|
|
iterator.Base
|
|
prefix []byte
|
|
dir quad.Direction
|
|
open bool
|
|
iter ldbit.Iterator
|
|
ts *TripleStore
|
|
ro *opt.ReadOptions
|
|
}
|
|
|
|
func NewAllIterator(prefix string, d quad.Direction, ts *TripleStore) *AllIterator {
|
|
var it AllIterator
|
|
iterator.BaseInit(&it.Base)
|
|
it.ro = &opt.ReadOptions{}
|
|
it.ro.DontFillCache = true
|
|
it.iter = ts.db.NewIterator(nil, it.ro)
|
|
it.prefix = []byte(prefix)
|
|
it.dir = d
|
|
it.open = true
|
|
it.ts = ts
|
|
it.iter.Seek(it.prefix)
|
|
if !it.iter.Valid() {
|
|
it.open = false
|
|
it.iter.Release()
|
|
}
|
|
return &it
|
|
}
|
|
|
|
func (it *AllIterator) Reset() {
|
|
if !it.open {
|
|
it.iter = it.ts.db.NewIterator(nil, it.ro)
|
|
it.open = true
|
|
}
|
|
it.iter.Seek(it.prefix)
|
|
if !it.iter.Valid() {
|
|
it.open = false
|
|
it.iter.Release()
|
|
}
|
|
}
|
|
|
|
func (it *AllIterator) Clone() graph.Iterator {
|
|
out := NewAllIterator(string(it.prefix), it.dir, it.ts)
|
|
out.CopyTagsFrom(it)
|
|
return out
|
|
}
|
|
|
|
func (it *AllIterator) Next() (graph.Value, bool) {
|
|
if !it.open {
|
|
it.Last = nil
|
|
return nil, false
|
|
}
|
|
var out []byte
|
|
out = make([]byte, len(it.iter.Key()))
|
|
copy(out, it.iter.Key())
|
|
it.iter.Next()
|
|
if !it.iter.Valid() {
|
|
it.Close()
|
|
}
|
|
if !bytes.HasPrefix(out, it.prefix) {
|
|
it.Close()
|
|
return nil, false
|
|
}
|
|
it.Last = out
|
|
return out, true
|
|
}
|
|
|
|
func (it *AllIterator) Check(v graph.Value) bool {
|
|
it.Last = v
|
|
return true
|
|
}
|
|
|
|
func (it *AllIterator) Close() {
|
|
if it.open {
|
|
it.iter.Release()
|
|
it.open = false
|
|
}
|
|
}
|
|
|
|
func (it *AllIterator) Size() (int64, bool) {
|
|
size, err := it.ts.SizeOfPrefix(it.prefix)
|
|
if err == nil {
|
|
return size, false
|
|
}
|
|
// INT64_MAX
|
|
return int64(^uint64(0) >> 1), false
|
|
}
|
|
|
|
func (it *AllIterator) DebugString(indent int) string {
|
|
size, _ := it.Size()
|
|
return fmt.Sprintf("%s(%s tags: %v leveldb size:%d %s %p)", strings.Repeat(" ", indent), it.Type(), it.Tags(), size, it.dir, it)
|
|
}
|
|
|
|
func (it *AllIterator) Type() graph.Type { return graph.All }
|
|
func (it *AllIterator) Sorted() bool { return false }
|
|
|
|
func (it *AllIterator) Optimize() (graph.Iterator, bool) {
|
|
return it, false
|
|
}
|
|
|
|
func (it *AllIterator) Stats() graph.IteratorStats {
|
|
s, _ := it.Size()
|
|
return graph.IteratorStats{
|
|
CheckCost: 1,
|
|
NextCost: 2,
|
|
Size: s,
|
|
}
|
|
}
|