6acfdcc5d6
Comparison of -short benchmarks in cayley.
$ benchcmp pointer.bench concrete.bench
benchmark old ns/op new ns/op delta
BenchmarkNamePredicate 1673276 1655093 -1.09%
BenchmarkLargeSetsNoIntersection 318985907 261499984 -18.02%
BenchmarkNetAndSpeed 104403743 41516981 -60.23%
BenchmarkKeanuAndNet 17309258 16857513 -2.61%
BenchmarkKeanuAndSpeed 20159161 19282833 -4.35%
Comparison of pathological cases are not so happy.
benchmark old ns/op new ns/op delta
BenchmarkVeryLargeSetsSmallIntersection 55269775527 246084606672 +345.24%
BenchmarkHelplessContainsChecker 23436501319 24308906949 +3.72%
Profiling the worst case:
Pointer:
Total: 6121 samples
1973 32.2% 32.2% 1973 32.2% runtime.findfunc
773 12.6% 44.9% 773 12.6% readvarint
510 8.3% 53.2% 511 8.3% step
409 6.7% 59.9% 410 6.7% runtime.gentraceback
390 6.4% 66.2% 391 6.4% pcvalue
215 3.5% 69.8% 215 3.5% runtime.funcdata
181 3.0% 72.7% 181 3.0% checkframecopy
118 1.9% 74.6% 119 1.9% runtime.funcspdelta
96 1.6% 76.2% 96 1.6% runtime.topofstack
76 1.2% 77.5% 76 1.2% scanblock
Concrete:
Total: 25027 samples
9437 37.7% 37.7% 9437 37.7% runtime.findfunc
3853 15.4% 53.1% 3853 15.4% readvarint
2366 9.5% 62.6% 2366 9.5% step
2186 8.7% 71.3% 2186 8.7% runtime.gentraceback
1816 7.3% 78.5% 1816 7.3% pcvalue
1016 4.1% 82.6% 1016 4.1% runtime.funcdata
859 3.4% 86.0% 859 3.4% checkframecopy
506 2.0% 88.1% 506 2.0% runtime.funcspdelta
410 1.6% 89.7% 410 1.6% runtime.topofstack
303 1.2% 90.9% 303 1.2% runtime.newstack
77 lines
2 KiB
Go
77 lines
2 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 iterator
|
|
|
|
// A quickly mocked version of the TripleStore interface, for use in tests.
|
|
// Can better used Mock.Called but will fill in as needed.
|
|
|
|
import (
|
|
"github.com/google/cayley/graph"
|
|
"github.com/google/cayley/quad"
|
|
)
|
|
|
|
type store struct {
|
|
data []string
|
|
iter graph.Iterator
|
|
}
|
|
|
|
func (qs *store) ValueOf(s string) graph.Value {
|
|
for i, v := range qs.data {
|
|
if s == v {
|
|
return i
|
|
}
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (qs *store) AddTriple(quad.Quad) {}
|
|
|
|
func (qs *store) AddTripleSet([]quad.Quad) {}
|
|
|
|
func (qs *store) Quad(graph.Value) quad.Quad { return quad.Quad{} }
|
|
|
|
func (qs *store) TripleIterator(d quad.Direction, i graph.Value) graph.Iterator {
|
|
return qs.iter
|
|
}
|
|
|
|
func (qs *store) NodesAllIterator() graph.Iterator { return &Null{} }
|
|
|
|
func (qs *store) TriplesAllIterator() graph.Iterator { return &Null{} }
|
|
|
|
func (qs *store) NameOf(v graph.Value) string {
|
|
i := v.(int)
|
|
if i < 0 || i >= len(qs.data) {
|
|
return ""
|
|
}
|
|
return qs.data[i]
|
|
}
|
|
|
|
func (qs *store) Size() int64 { return 0 }
|
|
|
|
func (qs *store) DebugPrint() {}
|
|
|
|
func (qs *store) OptimizeIterator(it graph.Iterator) (graph.Iterator, bool) {
|
|
return &Null{}, false
|
|
}
|
|
|
|
func (qs *store) FixedIterator() graph.FixedIterator {
|
|
return NewFixedIteratorWithCompare(BasicEquality)
|
|
}
|
|
|
|
func (qs *store) Close() {}
|
|
|
|
func (qs *store) TripleDirection(graph.Value, quad.Direction) graph.Value { return 0 }
|
|
|
|
func (qs *store) RemoveTriple(t quad.Quad) {}
|