MCPcopy Index your code
hub / github.com/andylamp/BPlusTree / rangeSearch

Method rangeSearch

src/main/java/ds/bplus/bptree/BPlusTree.java:574–644  ·  view source on GitHub ↗

Handle range search queries with a bit of twist on how we handle duplicate keys. We have two basic cases depending duplicate keys, which is basically whether we actually return them or not. @param minKey min key of the range @param maxKey max key of the range @param unique return only first enco

(long minKey, long maxKey, boolean unique)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 1

rangeIOMethod · 0.80

Calls 15

searchKeyMethod · 0.95
isFoundMethod · 0.95
getIndexMethod · 0.95
getLeafMethod · 0.95
getQueryResultMethod · 0.95
parseOverflowPagesMethod · 0.95
setLeafMethod · 0.95
readNodeMethod · 0.95
getKeyAtMethod · 0.80
getOverflowPointerAtMethod · 0.80
getCurrentCapacityMethod · 0.80

Tested by

no test coverage detected