Type Members
-
class
DefaultKeySet extends AbstractSet[A] with Set[A] with Serializable
-
class
DefaultValuesIterable extends AbstractIterable[B] with Iterable[B] with Serializable
-
class
FilteredKeys extends AbstractMap[A, B] with DefaultMap[A, B]
-
class
MappedValues[C] extends AbstractMap[A, C] with DefaultMap[A, C]
-
-
class
WithFilter extends FilterMonadic[A, Repr]
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
-
-
-
def
++[B >: (PropertyKey, PropertyValue), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Properties, B, That]): That
-
def
++:[B >: (PropertyKey, PropertyValue), That](that: Traversable[B])(implicit bf: CanBuildFrom[Properties, B, That]): That
-
def
++:[B >: (PropertyKey, PropertyValue), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Properties, B, That]): That
-
-
-
-
-
-
-
-
-
-
-
-
final
def
==(arg0: Any): Boolean
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
-
def
addString(b: StringBuilder): StringBuilder
-
def
addString(b: StringBuilder, sep: String): StringBuilder
-
def
aggregate[B](z: ⇒ B)(seqop: (B, (PropertyKey, PropertyValue)) ⇒ B, combop: (B, B) ⇒ B): B
-
-
-
def
applyOrElse[A1 <: PropertyKey, B1 >: PropertyValue](x: A1, default: (A1) ⇒ B1): B1
-
final
def
asInstanceOf[T0]: T0
-
def
canEqual(that: Any): Boolean
-
def
clear(): Unit
-
-
def
collect[B, That](pf: PartialFunction[(PropertyKey, PropertyValue), B])(implicit bf: CanBuildFrom[Properties, B, That]): That
-
def
collectFirst[B](pf: PartialFunction[(PropertyKey, PropertyValue), B]): Option[B]
-
def
companion: GenericCompanion[Iterable]
-
-
def
contains(key: PropertyKey): Boolean
-
def
copyToArray[B >: (PropertyKey, PropertyValue)](xs: Array[B], start: Int, len: Int): Unit
-
-
def
copyToArray[B >: (PropertyKey, PropertyValue)](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: (PropertyKey, PropertyValue)](dest: Buffer[B]): Unit
-
-
-
-
def
dropRight(n: Int): Properties
-
-
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(that: Any): Boolean
-
-
-
-
-
def
finalize(): Unit
-
-
def
flatMap[B, That](f: ((PropertyKey, PropertyValue)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Properties, B, That]): That
-
def
flatten[B](implicit asTraversable: ((PropertyKey, PropertyValue)) ⇒ GenTraversableOnce[B]): Iterable[B]
-
def
fold[A1 >: (PropertyKey, PropertyValue)](z: A1)(op: (A1, A1) ⇒ A1): A1
-
-
-
-
-
def
genericBuilder[B]: Builder[B, Iterable[B]]
-
-
final
def
getClass(): Class[_]
-
-
-
-
def
grouped(size: Int): Iterator[Properties]
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
-
-
-
def
inits: Iterator[Properties]
-
def
isDefinedAt(key: PropertyKey): Boolean
-
def
isEmpty: Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
isTraversableAgain: Boolean
-
val
item: Item
-
-
-
-
def
keysIterator: Iterator[PropertyKey]
-
-
-
-
def
map[B, That](f: ((PropertyKey, PropertyValue)) ⇒ B)(implicit bf: CanBuildFrom[Properties, B, That]): That
-
-
-
-
-
-
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
final
def
ne(arg0: AnyRef): Boolean
-
-
def
nonEmpty: Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
orElse[A1 <: PropertyKey, B1 >: PropertyValue](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
-
-
-
-
def
product[B >: (PropertyKey, PropertyValue)](implicit num: Numeric[B]): B
-
-
-
-
-
def
reduceOption[A1 >: (PropertyKey, PropertyValue)](op: (A1, A1) ⇒ A1): Option[A1]
-
-
-
-
-
-
-
-
-
def
sameElements[B >: (PropertyKey, PropertyValue)](that: GenIterable[B]): Boolean
-
def
scan[B >: (PropertyKey, PropertyValue), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Properties, B, That]): That
-
def
scanLeft[B, That](z: B)(op: (B, (PropertyKey, PropertyValue)) ⇒ B)(implicit bf: CanBuildFrom[Properties, B, That]): That
-
def
scanRight[B, That](z: B)(op: ((PropertyKey, PropertyValue), B) ⇒ B)(implicit bf: CanBuildFrom[Properties, B, That]): That
-
-
def
size: Int
-
def
sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
-
def
sizeHint(coll: TraversableLike[_, _]): Unit
-
def
sizeHint(size: Int): Unit
-
def
sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
-
def
slice(from: Int, until: Int): Properties
-
def
sliding(size: Int, step: Int): Iterator[Properties]
-
def
sliding(size: Int): Iterator[Properties]
-
-
-
def
stringPrefix: String
-
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
def
tails: Iterator[Properties]
-
-
def
takeRight(n: Int): Properties
-
-
-
-
def
toArray[B >: (PropertyKey, PropertyValue)](implicit arg0: ClassTag[B]): Array[B]
-
-
-
-
-
-
-
def
toMap[T, U](implicit ev: <:<[(PropertyKey, PropertyValue), (T, U)]): Map[T, U]
-
-
-
-
def
toString(): String
-
-
-
-
def
transpose[B](implicit asTraversable: ((PropertyKey, PropertyValue)) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]
-
def
unzip[A1, A2](implicit asPair: ((PropertyKey, PropertyValue)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
-
def
unzip3[A1, A2, A3](implicit asTriple: ((PropertyKey, PropertyValue)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
-
-
-
-
def
valuesIterator: Iterator[PropertyValue]
-
-
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
-
-
-
def
zip[A1 >: (PropertyKey, PropertyValue), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Properties, (A1, B), That]): That
-
def
zipAll[B, A1 >: (PropertyKey, PropertyValue), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Properties, (A1, B), That]): That
-
def
zipWithIndex[A1 >: (PropertyKey, PropertyValue), That](implicit bf: CanBuildFrom[Properties, (A1, Int), That]): That
Inherited from Cloneable
Inherited from Cloneable
Inherited from Clearable
Inherited from Equals
Inherited from Mutable
Inherited from AnyRef
Inherited from Any