GeomesaFilteringIterator

abstract def setTopConditionally(): Unit

Subclasses should set top key and top value if the current row is valid to be returned

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def checkTop(): Boolean

def clone(): AnyRef

def deepCopy(env: IteratorEnvironment): SortedKeyValueIterator[Key, Value]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def findTop(): Unit

Advances the index-iterator to the next qualifying entry

final def getClass(): Class[_]

def getTopKey(): Key

def getTopValue(): Value

def hasTop(): Boolean

def hashCode(): Int

def init(source: SortedKeyValueIterator[Key, Value], options: Map[String, String], env: IteratorEnvironment): Unit

def init(featureType: SimpleFeatureType, options: OptionMap): Unit

final def isInstanceOf[T0]: Boolean

lazy val logger: Logger

final def ne(arg0: AnyRef): Boolean

def next(): Unit

final def notify(): Unit

final def notifyAll(): Unit

def seek(range: Range, columnFamilies: Collection[ByteSequence], inclusive: Boolean): Unit

var source: SortedKeyValueIterator[Key, Value]

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

var topKey: Key

var topValue: Value

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit