net.sf.phiweave.collection
MappedVector
Inherited
- Hide All
- Show all
- MappedVectorAdapter
- JObjectMutable
- JText
- JEntity
- TrieMap
- SparseVector
- Map
- MapLike
- Cloneable
- Shrinkable
- Builder
- Growable
- Map
- MapLike
- Subtractable
- PartialFunction
- Function1
- Iterable
- Iterable
- IterableLike
- Equals
- Traversable
- Mutable
- Traversable
- GenericTraversableTemplate
- TraversableLike
- TraversableOnce
- FilterMonadic
- HasNewBuilder
- AnyRef
- Any
Type Members
-
type
Self = TrieMap
Value Members
-
def
!=(arg0: AnyRef): Boolean
-
def
!=(arg0: Any): Boolean
-
def
##(): Int
-
def
$asInstanceOf[T0](): T0
-
def
$isInstanceOf[T0](): Boolean
-
def
+[B1 >: Double](elem1: (Int, B1), elem2: (Int, B1), elems: (Int, B1)*): Map[Int, B1]
-
def
+[B1 >: Double](kv: (Int, B1)): Map[Int, B1]
-
def
++[B1 >: Double](xs: TraversableOnce[(Int, B1)]): Map[Int, B1]
-
def
++[B >: (Int, Double), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[TrieMap, B, That]): That
-
def
++=(xs: TraversableOnce[(Int, Double)]): Growable[(Int, Double)]
-
def
+=(kv: (Int, Double)): TrieMap
-
def
+=(elem1: (Int, Double), elem2: (Int, Double), elems: (Int, Double)*): Growable[(Int, Double)]
-
def
-(elem1: Int, elem2: Int, elems: Int*): TrieMap
-
def
-(key: Int): TrieMap
-
def
--(xs: TraversableOnce[Int]): TrieMap
-
def
--=(xs: TraversableOnce[Int]): Shrinkable[Int]
-
def
-=(k: Int): TrieMap
-
def
-=(elem1: Int, elem2: Int, elems: Int*): Shrinkable[Int]
-
def
/:[B](z: B)(op: (B, (Int, Double)) ⇒ B): B
-
def
:\[B](z: B)(op: ((Int, Double), B) ⇒ B): B
-
def
==(arg0: AnyRef): Boolean
-
def
==(arg0: Any): Boolean
-
var
N: Int
-
-
def
addScaled(v: SparseVector, alpha: Double): Unit
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
-
def
addString(b: StringBuilder): StringBuilder
-
def
addString(b: StringBuilder, sep: String): StringBuilder
-
def
addSupported(v: SparseVector): Unit
-
def
addSupportedScaled(w: Iterator[Double], alpha: Double): Unit
-
def
addSupportedScaled(v: SparseVector, alpha: Double): Unit
-
def
andThen[C](k: (Double) ⇒ C): PartialFunction[Int, C]
-
def
apply(key: Int): Double
-
def
asInstanceOf[T0]: T0
-
def
canEqual(that: Any): Boolean
-
def
clear(): Unit
-
-
def
collect[B, That](pf: PartialFunction[(Int, Double), B])(implicit bf: CanBuildFrom[TrieMap, B, That]): That
-
def
companion: GenericCompanion[Iterable[A][A]]
-
def
compose[A](g: (A) ⇒ Int): (A) ⇒ Double
-
def
contains(key: Int): Boolean
-
def
copyToArray[B >: (Int, Double)](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: (Int, Double)](xs: Array[B]): Unit
-
def
copyToArray[B >: (Int, Double)](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: (Int, Double)](dest: Buffer[B]): Unit
-
def
count(p: ((Int, Double)) ⇒ Boolean): Int
-
def
default(key: Int): Double
-
def
denseValues(): Array[Double]
-
def
dotProduct(v: SparseVector): Double
-
def
drop(n: Int): TrieMap
-
def
dropRight(n: Int): TrieMap
-
def
dropWhile(p: ((Int, Double)) ⇒ Boolean): TrieMap
-
def
elements: Iterator[(Int, Double)]
-
def
empty: TrieMap
-
def
entries: Iterator[Int] {...}
-
def
eq(arg0: AnyRef): Boolean
-
def
equals(that: Any): Boolean
-
def
exists(p: ((Int, Double)) ⇒ Boolean): Boolean
-
def
filter(p: ((Int, Double)) ⇒ Boolean): TrieMap
-
def
filterKeys(p: (Int) ⇒ Boolean): Map[Int, Double]
-
def
filterNot(p: ((Int, Double)) ⇒ Boolean): TrieMap
-
def
finalize(): Unit
-
def
find(k: Int): Int
-
def
find(p: ((Int, Double)) ⇒ Boolean): Option[(Int, Double)]
-
def
findOrCreate(k: Int): Int
-
def
first: (Int, Double)
-
def
firstOption: Option[(Int, Double)]
-
def
flatMap[B, That](f: ((Int, Double)) ⇒ Traversable[B])(implicit bf: CanBuildFrom[TrieMap, B, That]): That
-
def
flatten[B](implicit asTraversable: ((Int, Double)) ⇒ Traversable[B]): Iterable[B]
-
def
foldLeft[B](z: B)(op: (B, (Int, Double)) ⇒ B): B
-
def
foldRight[B](z: B)(op: ((Int, Double), B) ⇒ B): B
-
def
forall(p: ((Int, Double)) ⇒ Boolean): Boolean
-
def
foreach[U](f: ((Int, Double)) ⇒ U): Unit
-
def
genericBuilder[B]: Builder[B, Iterable[B]]
-
def
get(k: Int): Option[Double]
-
def
getClass(): java.lang.Class[_]
-
def
getOrElse[B1 >: Double](key: Int, default: ⇒ B1): B1
-
def
getOrElseUpdate(key: Int, op: ⇒ Double): Double
-
def
groupBy[K](f: ((Int, Double)) ⇒ K): Map[K, TrieMap]
-
def
grouped(size: Int): Iterator[TrieMap]
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
def
head: (Int, Double)
-
def
headOption: Option[(Int, Double)]
-
def
init: TrieMap
-
def
initializedAs(alpha: Double): MappedVector
-
def
isDefinedAt(key: Int): Boolean
-
def
isEmpty: Boolean
-
def
isInstanceOf[T0]: Boolean
-
def
isTraversableAgain: Boolean
-
def
iterator: Iterator[(Int, Double)]
-
def
jadd(key: JString, value: JEntity): Unit
-
def
jderror(unexpected: JEntity, expected: String, id: String): Nothing
-
-
def
jserror(unserializable: String, id: String): Nothing
-
var
key: Array[Int]
-
def
keySet: Set[Int]
-
def
keys: Iterable[Int]
-
def
keysIterator: Iterator[Int]
-
def
last: (Int, Double)
-
def
lastOption: Option[(Int, Double)]
-
def
lift: (Int) ⇒ Option[Double]
-
def
map[B, That](f: ((Int, Double)) ⇒ B)(implicit bf: CanBuildFrom[TrieMap, B, That]): That
-
def
mapElements[C](f: (Double) ⇒ C): Map[Int, C]
-
def
mapResult[NewTo](f: (TrieMap) ⇒ NewTo): Builder[(Int, Double), NewTo]
-
def
mapValues[C](f: (Double) ⇒ C): Map[Int, C]
-
def
max[B >: (Int, Double)](implicit cmp: Ordering[B]): (Int, Double)
-
def
min[B >: (Int, Double)](implicit cmp: Ordering[B]): (Int, Double)
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
var
n: Int
-
def
ne(arg0: AnyRef): Boolean
-
def
newBuilder: Builder[(Int, Double), TrieMap]
-
def
nonEmpty: Boolean
-
def
notify(): Unit
-
def
notifyAll(): Unit
-
var
one: Array[Int]
-
def
orElse[A1 <: Int, B1 >: Double](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
-
def
partition(p: ((Int, Double)) ⇒ Boolean): (TrieMap, TrieMap)
-
def
print(buf: OutputBuffer, path: List[String], verbose: (JEntity, List[String]) ⇒ Boolean): Unit
-
def
product[B >: (Int, Double)](implicit num: Numeric[B]): B
-
def
projection: IterableView[(Int, Double), TrieMap]
-
def
put(key: Int, value: Double): Option[Double]
-
def
reduceLeft[B >: (Int, Double)](op: (B, (Int, Double)) ⇒ B): B
-
def
reduceLeftOption[B >: (Int, Double)](op: (B, (Int, Double)) ⇒ B): Option[B]
-
def
reduceRight[B >: (Int, Double)](op: ((Int, Double), B) ⇒ B): B
-
def
reduceRightOption[B >: (Int, Double)](op: ((Int, Double), B) ⇒ B): Option[B]
-
def
remove(key: Int): Option[Double]
-
def
removeKey(key: Int): Option[Double]
-
def
repr: TrieMap
-
def
result(): TrieMap
-
def
retain(p: (Int, Double) ⇒ Boolean): MapLike[Int, Double, TrieMap]
-
def
reversed: List[(Int, Double)]
-
val
root: Int
-
var
s: Int
-
def
sameElements[B >: (Int, Double)](that: Iterable[B]): Boolean
-
def
scale(alpha: Double): Unit
-
def
scanLeft[B, That](z: B)(op: (B, (Int, Double)) ⇒ B)(implicit bf: CanBuildFrom[TrieMap, B, That]): That
-
def
scanRight[B, That](z: B)(op: ((Int, Double), B) ⇒ B)(implicit bf: CanBuildFrom[TrieMap, B, That]): That
-
def
set(idx: Int, alpha: Double): Unit
-
def
setSupported(alpha: Double): Unit
-
def
size: Int
-
def
sizeHint(coll: scala.collection.TraversableLike[_, _], delta: Int): Unit
-
def
sizeHint(size: Int): Unit
-
def
sizeHintBounded(size: Int, boundingColl: scala.collection.TraversableLike[_, _]): Unit
-
def
slice(from: Int, until: Int): TrieMap
-
def
sliding[B >: (Int, Double)](size: Int, step: Int): Iterator[TrieMap]
-
def
sliding[B >: (Int, Double)](size: Int): Iterator[TrieMap]
-
def
span(p: ((Int, Double)) ⇒ Boolean): (TrieMap, TrieMap)
-
def
splitAt(n: Int): (TrieMap, TrieMap)
-
def
stringPrefix: String
-
def
sum[B >: (Int, Double)](implicit num: Numeric[B]): B
-
def
synchronized[T0](arg0: T0): T0
-
def
tail: TrieMap
-
def
take(n: Int): TrieMap
-
def
takeRight(n: Int): TrieMap
-
def
takeWhile(p: ((Int, Double)) ⇒ Boolean): TrieMap
-
def
thisCollection: Iterable[(Int, Double)]
-
def
toArray[B >: (Int, Double)](implicit arg0: ClassManifest[B]): Array[B]
-
def
toBuffer[B >: (Int, Double)]: Buffer[B]
-
def
toCollection(repr: TrieMap): Iterable[(Int, Double)]
-
def
toIndexedSeq[B >: (Int, Double)]: IndexedSeq[B]
-
def
toIterable: Iterable[(Int, Double)]
-
def
toIterator: Iterator[(Int, Double)]
-
def
toList: List[(Int, Double)]
-
def
toMap[T, U](implicit ev: <:<[(Int, Double), (T, U)]): Map[T, U]
-
def
toSeq: Seq[(Int, Double)]
-
def
toSet[B >: (Int, Double)]: Set[B]
-
def
toStream: Stream[(Int, Double)]
-
def
toString(): String
-
def
toTraversable: Traversable[(Int, Double)]
-
def
transform(f: (Int, Double) ⇒ Double): MapLike[Int, Double, TrieMap]
-
def
transpose[B](implicit asTraversable: ((Int, Double)) ⇒ Traversable[B]): Iterable[Iterable[B]]
-
def
unzip[A1, A2](implicit asPair: ((Int, Double)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
-
def
update(key: Int, value: Double): Unit
-
def
updated[B1 >: Double](key: Int, value: B1): Map[Int, B1]
-
var
value: Array[Double]
-
def
values: Iterable[Double]
-
def
valuesIterator: Iterator[Double]
-
def
view(from: Int, until: Int): IterableView[(Int, Double), TrieMap]
-
def
view: IterableView[(Int, Double), TrieMap]
-
def
wait(): Unit
-
def
wait(arg0: Long, arg1: Int): Unit
-
def
wait(arg0: Long): Unit
-
def
withFilter(p: ((Int, Double)) ⇒ Boolean): FilterMonadic[(Int, Double), TrieMap]
-
var
zero: Array[Int]
-
def
zip[A1 >: (Int, Double), B, That](that: Iterable[B])(implicit bf: CanBuildFrom[TrieMap, (A1, B), That]): That
-
def
zipAll[B, A1 >: (Int, Double), That](that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[TrieMap, (A1, B), That]): That
-
def
zipWithIndex[A1 >: (Int, Double), That](implicit bf: CanBuildFrom[TrieMap, (A1, Int), That]): That