abstract class BTreeBoundIterator<K, V>| <init> |
BTreeBoundIterator(m: BTreeMap<K, V>, lo: K?, loInclusive: Boolean, hi: K?, hiInclusive: Boolean) |
| currentLeaf |
var currentLeaf: Node? |
| currentPos |
var currentPos: Int |
| hi |
val hi: K? |
| hiC |
val hiC: Int |
| hiInclusive |
val hiInclusive: Boolean |
| lastReturnedKey |
var lastReturnedKey: K? |
| lo |
val lo: K? |
| loInclusive |
val loInclusive: Boolean |
| m |
val m: BTreeMap<K, V> |
| advance |
fun advance(): Unit |
| checkHiBound |
fun checkHiBound(): Unit |
| hasNext |
fun hasNext(): Boolean |
| remove |
fun remove(): Unit |