MCPcopy Create free account

hub / github.com/biogo/store / functions

Functions516 in github.com/biogo/store

⨍ Functions 516◇ Types & classes 85
↓ 1 callersFunctiondot
(t *Tree, label string)
kdtree/kdtree_test.go:532
↓ 1 callersMethodfloor
(q Comparable)
llrb/llrb.go:391
↓ 1 callersMethodfloor
(m Comparable, id uintptr)
interval/interval.go:480
↓ 1 callersMethodfloor
(m int, id uintptr)
interval/int_interval.go:443
↓ 1 callersMethodinsert
(c Comparable, d Dim)
kdtree/kdtree.go:178
↓ 1 callersMethodinsert
(e Comparable)
llrb/llrb.go:198
↓ 1 callersMethodinsert
(e Interface, min Comparable, id uintptr, fast bool)
interval/interval.go:260
↓ 1 callersMethodinsert
(e IntInterface, r IntRange, id uintptr, fast bool)
interval/int_interval.go:219
↓ 1 callersMethodinsertBounded
(c Extender, d Dim, bounding bool)
kdtree/kdtree.go:197
↓ 1 callersFunctionintMax
(a, b int)
interval/int_interval_test.go:198
↓ 1 callersFunctionintMin
(a, b int)
interval/int_interval_test.go:191
↓ 1 callersMethodisContainedBy
(b *Bounding)
kdtree/kdtree_test.go:160
↓ 1 callersFunctionleft
(v float64)
kdtree/kdtree_test.go:126
↓ 1 callersFunctionmax
(a, b Int)
interval/do_example_test.go:20
↓ 1 callersMethodmax
()
llrb/llrb.go:373
↓ 1 callersMethodmax
()
interval/interval.go:461
↓ 1 callersMethodmax
()
interval/int_interval.go:424
↓ 1 callersMethodplanesHaveCoincidentPointsIn
(n *Node, tight [2][]bool)
kdtree/kdtree_test.go:170
↓ 1 callersMethodsearch
(q Comparable, dist float64)
kdtree/kdtree.go:249
↓ 1 callersMethodsearch
(q Comparable)
llrb/llrb.go:171
↓ 1 callersMethodsearchSet
(q Comparable, k Keeper)
kdtree/kdtree.go:378
↓ 1 callersMethodsetRange
(start, end int, e Equaler)
step/step_test.go:1303
↓ 1 callersFunctionsortSelection
(list Ints, k int)
kdtree/medians_test.go:54
MethodAdjustRanges
AdjustRanges fixes range fields for all IntNodes in the IntTree. This must be called before Get or DoMatching* is used if fast insertion or deletion h
interval/int_interval.go:189
FunctionBenchmarkApplyRangeDense
(b *testing.B)
step/step_test.go:1555
FunctionBenchmarkApplyRangeSparse
(b *testing.B)
step/step_test.go:1561
FunctionBenchmarkApplyRangeUnity
(b *testing.B)
step/step_test.go:1558
FunctionBenchmarkApplyRangeVDense
(b *testing.B)
step/step_test.go:1552
FunctionBenchmarkApplyRangeVSparse
(b *testing.B)
step/step_test.go:1564
FunctionBenchmarkApplyRangeXDense
(b *testing.B)
step/step_test.go:1549
FunctionBenchmarkApplyRangeXSparse
(b *testing.B)
step/step_test.go:1567
FunctionBenchmarkAtDense
(b *testing.B)
step/step_test.go:1602
FunctionBenchmarkAtSparse
(b *testing.B)
step/step_test.go:1608
FunctionBenchmarkAtUnity
(b *testing.B)
step/step_test.go:1605
FunctionBenchmarkAtVDense
(b *testing.B)
step/step_test.go:1599
FunctionBenchmarkAtVSparse
(b *testing.B)
step/step_test.go:1611
FunctionBenchmarkAtXDense
(b *testing.B)
step/step_test.go:1596
FunctionBenchmarkAtXSparse
(b *testing.B)
step/step_test.go:1614
FunctionBenchmarkDelete
(b *testing.B)
llrb/llrb_test.go:1019
FunctionBenchmarkDelete
(b *testing.B)
interval/interval_test.go:937
FunctionBenchmarkDeleteMap
(b *testing.B)
llrb/llrb_test.go:1066
FunctionBenchmarkDeleteMin
(b *testing.B)
llrb/llrb_test.go:1031
FunctionBenchmarkDeleteMin
(b *testing.B)
interval/interval_test.go:973
FunctionBenchmarkFastDelete
(b *testing.B)
interval/interval_test.go:955
FunctionBenchmarkFastDeleteMin
(b *testing.B)
interval/interval_test.go:990
FunctionBenchmarkFastInsert
(b *testing.B)
interval/interval_test.go:869
FunctionBenchmarkGet
(b *testing.B)
llrb/llrb_test.go:979
FunctionBenchmarkGet
(b *testing.B)
interval/interval_test.go:881
FunctionBenchmarkGetMap
(b *testing.B)
llrb/llrb_test.go:1052
FunctionBenchmarkInsert
(b *testing.B)
kdtree/kdtree_test.go:460
FunctionBenchmarkInsert
Benchmarks
llrb/llrb_test.go:965
FunctionBenchmarkInsert
Benchmarks
interval/interval_test.go:857
FunctionBenchmarkInsertBounds
(b *testing.B)
kdtree/kdtree_test.go:468
FunctionBenchmarkInsertMap
Benchmarks for comparison to the built-in type.
llrb/llrb_test.go:1045
FunctionBenchmarkInsertNoRep
(b *testing.B)
llrb/llrb_test.go:972
FunctionBenchmarkIntDelete
(b *testing.B)
interval/int_interval_test.go:798
FunctionBenchmarkIntDeleteMin
(b *testing.B)
interval/int_interval_test.go:832
FunctionBenchmarkIntFastDelete
(b *testing.B)
interval/int_interval_test.go:815
FunctionBenchmarkIntFastDeleteMin
(b *testing.B)
interval/int_interval_test.go:848
FunctionBenchmarkIntFastInsert
(b *testing.B)
interval/int_interval_test.go:734
FunctionBenchmarkIntGet
(b *testing.B)
interval/int_interval_test.go:745
FunctionBenchmarkIntInsert
Benchmarks
interval/int_interval_test.go:723
FunctionBenchmarkIntMax
(b *testing.B)
interval/int_interval_test.go:780
FunctionBenchmarkIntMin
(b *testing.B)
interval/int_interval_test.go:762
FunctionBenchmarkMax
(b *testing.B)
llrb/llrb_test.go:1005
FunctionBenchmarkMax
(b *testing.B)
interval/interval_test.go:918
FunctionBenchmarkMin
(b *testing.B)
llrb/llrb_test.go:991
FunctionBenchmarkMin
(b *testing.B)
interval/interval_test.go:899
FunctionBenchmarkMoM
(b *testing.B)
kdtree/medians_test.go:107
FunctionBenchmarkMoMPartition
(b *testing.B)
kdtree/medians_test.go:119
FunctionBenchmarkNearBrute
(b *testing.B)
kdtree/kdtree_test.go:504
FunctionBenchmarkNearBruteN10
(b *testing.B)
kdtree/kdtree_test.go:524
FunctionBenchmarkNearest
(b *testing.B)
kdtree/kdtree_test.go:493
FunctionBenchmarkNearestSetN10
(b *testing.B)
kdtree/kdtree_test.go:515
FunctionBenchmarkNew
(b *testing.B)
kdtree/kdtree_test.go:436
FunctionBenchmarkNewBounds
(b *testing.B)
kdtree/kdtree_test.go:448
FunctionBenchmarkRM
(b *testing.B)
kdtree/medians_test.go:132
FunctionBenchmarkRMPartition
(b *testing.B)
kdtree/medians_test.go:144
FunctionBenchmarkSM
(b *testing.B)
kdtree/medians_test.go:157
MethodBounds
()
kdtree/points.go:51
MethodCompare
(c Comparable, d Dim)
kdtree/nbpoints_test.go:19
MethodCompare
Compare returns the shortest translation of the plane through b with normal vector along dimension d to the parallel plane through a. Given c = a.Com
kdtree/kdtree.go:50
MethodCompare
(c Comparable, d Dim)
kdtree/points.go:23
MethodCompare
Compare returns a value indicating the sort order relationship between the receiver and the parameter. Given c = a.Compare(b): c < 0 if a < b; c == 0
llrb/llrb.go:39
MethodCompare
(r Comparable)
llrb/llrb_test.go:119
MethodCompare
(i Comparable)
llrb/llrb_test.go:125
MethodCompare
(i Comparable)
llrb/llrb_test.go:137
MethodCompare
(s Comparable)
llrb/llrb_test.go:545
MethodCompare
(b llrb.Comparable)
llrb/llrb_example_test.go:18
MethodCompare
(b llrb.Comparable)
llrb/llrb_example_test.go:28
MethodCompare
(c llrb.Comparable)
step/step.go:34
MethodCompare
(c llrb.Comparable)
step/step.go:37
MethodCompare
(c llrb.Comparable)
step/step.go:44
MethodCompare
(c llrb.Comparable)
step/step.go:53
MethodCompare
(b interval.Comparable)
interval/interval_example_test.go:16
MethodCompare
(b Comparable)
interval/interval_test.go:149
MethodCompare
(b Comparable)
interval/interval_test.go:164
MethodContains
Contains returns whether c is within the volume of the Bounding. A nil Bounding returns true.
kdtree/kdtree.go:75
MethodDims
()
kdtree/nbpoints_test.go:20
MethodDims
()
kdtree/points.go:24
← previousnext →201–300 of 516, ranked by callers