FeatureUpdater

abstract def foreach[U](f: ((F, V)) ⇒ U): Unit

abstract def updateAll(fn: ((F, V)) ⇒ V): Unit

Destructively modify all feature values using a function of the feature and value

final def !=(arg0: Any): Boolean

final def ##(): Int

def ++[B >: (F, V), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(F, V)], B, That]): That

def ++:[B >: (F, V), That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[(F, V)], B, That]): That

def ++:[B >: (F, V), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(F, V)], B, That]): That

def /:[B](z: B)(op: (B, (F, V)) ⇒ B): B

def :\[B](z: B)(op: ((F, V), B) ⇒ B): B

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def aggregate[B](z: ⇒ B)(seqop: (B, (F, V)) ⇒ B, combop: (B, B) ⇒ B): B

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[(F, V), B])(implicit bf: CanBuildFrom[Traversable[(F, V)], B, That]): That

def collectFirst[B](pf: PartialFunction[(F, V), B]): Option[B]

def companion: GenericCompanion[Traversable]

def copyToArray[B >: (F, V)](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: (F, V)](xs: Array[B]): Unit

def copyToArray[B >: (F, V)](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: (F, V)](dest: Buffer[B]): Unit

def count(p: ((F, V)) ⇒ Boolean): Int

def drop(n: Int): Traversable[(F, V)]

def dropWhile(p: ((F, V)) ⇒ Boolean): Traversable[(F, V)]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(p: ((F, V)) ⇒ Boolean): Boolean

def filter(p: ((F, V)) ⇒ Boolean): Traversable[(F, V)]

def filterNot(p: ((F, V)) ⇒ Boolean): Traversable[(F, V)]

def finalize(): Unit

def find(p: ((F, V)) ⇒ Boolean): Option[(F, V)]

def flatMap[B, That](f: ((F, V)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(F, V)], B, That]): That

def flatten[B](implicit asTraversable: ((F, V)) ⇒ GenTraversableOnce[B]): Traversable[B]

def fold[A1 >: (F, V)](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, (F, V)) ⇒ B): B

def foldRight[B](z: B)(op: ((F, V), B) ⇒ B): B

def forall(p: ((F, V)) ⇒ Boolean): Boolean

def genericBuilder[B]: Builder[B, Traversable[B]]

final def getClass(): Class[_]

def groupBy[K](f: ((F, V)) ⇒ K): Map[K, Traversable[(F, V)]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: (F, V)

def headOption: Option[(F, V)]

def init: Traversable[(F, V)]

def inits: Iterator[Traversable[(F, V)]]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def last: (F, V)

def lastOption: Option[(F, V)]

def map[B, That](f: ((F, V)) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(F, V)], B, That]): That

def max[B >: (F, V)](implicit cmp: Ordering[B]): (F, V)

def maxBy[B](f: ((F, V)) ⇒ B)(implicit cmp: Ordering[B]): (F, V)

def min[B >: (F, V)](implicit cmp: Ordering[B]): (F, V)

def minBy[B](f: ((F, V)) ⇒ B)(implicit cmp: Ordering[B]): (F, V)

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

final def ne(arg0: AnyRef): Boolean

def newBuilder: Builder[(F, V), Traversable[(F, V)]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParIterable[(F, V)]

def parCombiner: Combiner[(F, V), ParIterable[(F, V)]]

def partition(p: ((F, V)) ⇒ Boolean): (Traversable[(F, V)], Traversable[(F, V)])

def product[B >: (F, V)](implicit num: Numeric[B]): B

def reduce[A1 >: (F, V)](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: (F, V)](op: (B, (F, V)) ⇒ B): B

def reduceLeftOption[B >: (F, V)](op: (B, (F, V)) ⇒ B): Option[B]

def reduceOption[A1 >: (F, V)](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: (F, V)](op: ((F, V), B) ⇒ B): B

def reduceRightOption[B >: (F, V)](op: ((F, V), B) ⇒ B): Option[B]

def repr: Traversable[(F, V)]

def reversed: List[(F, V)]

def scan[B >: (F, V), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[(F, V)], B, That]): That

def scanLeft[B, That](z: B)(op: (B, (F, V)) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(F, V)], B, That]): That

def scanRight[B, That](z: B)(op: ((F, V), B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(F, V)], B, That]): That

def seq: Traversable[(F, V)]

def size: Int

def slice(from: Int, until: Int): Traversable[(F, V)]

def span(p: ((F, V)) ⇒ Boolean): (Traversable[(F, V)], Traversable[(F, V)])

def splitAt(n: Int): (Traversable[(F, V)], Traversable[(F, V)])

def stringPrefix: String

def sum[B >: (F, V)](implicit num: Numeric[B]): B

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

def tail: Traversable[(F, V)]

def tails: Iterator[Traversable[(F, V)]]

def take(n: Int): Traversable[(F, V)]

def takeWhile(p: ((F, V)) ⇒ Boolean): Traversable[(F, V)]

def thisCollection: Traversable[(F, V)]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (F, V), Col[(F, V)]]): Col[(F, V)]

def toArray[B >: (F, V)](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[B >: (F, V)]: Buffer[B]

def toCollection(repr: Traversable[(F, V)]): Traversable[(F, V)]

def toIndexedSeq: IndexedSeq[(F, V)]

def toIterable: Iterable[(F, V)]

def toIterator: Iterator[(F, V)]

def toList: List[(F, V)]

def toMap[T, U](implicit ev: <:<[(F, V), (T, U)]): Map[T, U]

def toSeq: Seq[(F, V)]

def toSet[B >: (F, V)]: Set[B]

def toStream: Stream[(F, V)]

def toString(): String

def toTraversable: Traversable[(F, V)]

def toVector: Vector[(F, V)]

def transpose[B](implicit asTraversable: ((F, V)) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]

def unzip[A1, A2](implicit asPair: ((F, V)) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])

def unzip3[A1, A2, A3](implicit asTriple: ((F, V)) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])

def view(from: Int, until: Int): TraversableView[(F, V), Traversable[(F, V)]]

def view: TraversableView[(F, V), Traversable[(F, V)]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: ((F, V)) ⇒ Boolean): FilterMonadic[(F, V), Traversable[(F, V)]]