class
TimeStampedHashSet[A] extends Set[A]
Instance Constructors
-
new
TimeStampedHashSet()
Type Members
-
type
Self = Set[A]
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
&(that: GenSet[A]): Set[A]
-
def
&~(that: GenSet[A]): Set[A]
-
def
+(elem: A): Set[A]
-
def
+(elem1: A, elem2: A, elems: A*): Set[A]
-
def
++(xs: GenTraversableOnce[A]): Set[A]
-
def
++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[A], B, That]): That
-
def
++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[Set[A], B, That]): That
-
def
++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Set[A], B, That]): That
-
def
++=(xs: TraversableOnce[A]): TimeStampedHashSet.this.type
-
def
+=(key: A): TimeStampedHashSet.this.type
-
def
+=(elem1: A, elem2: A, elems: A*): TimeStampedHashSet.this.type
-
def
-(elem: A): Set[A]
-
def
-(elem1: A, elem2: A, elems: A*): Set[A]
-
def
--(xs: GenTraversableOnce[A]): Set[A]
-
def
--=(xs: TraversableOnce[A]): TimeStampedHashSet.this.type
-
def
-=(key: A): TimeStampedHashSet.this.type
-
def
-=(elem1: A, elem2: A, elems: A*): TimeStampedHashSet.this.type
-
def
/:[B](z: B)(op: (B, A) ⇒ B): B
-
def
/:\[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
:\[B](z: B)(op: (A, B) ⇒ B): B
-
def
<<(cmd: Message[A]): Unit
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
def
add(elem: A): 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, A) ⇒ B, combop: (B, B) ⇒ B): B
-
def
andThen[A](g: (Boolean) ⇒ A): (A) ⇒ A
-
def
apply(elem: A): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
canEqual(that: Any): Boolean
-
def
clear(): Unit
-
def
clearOldValues(threshTime: Long): Unit
-
def
clone(): Set[A]
-
def
collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[Set[A], B, That]): That
-
def
collectFirst[B](pf: PartialFunction[A, B]): Option[B]
-
def
companion: GenericCompanion[Set]
-
def
compose[A](g: (A) ⇒ A): (A) ⇒ Boolean
-
def
contains(key: A): Boolean
-
def
copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: A](xs: Array[B]): Unit
-
def
copyToArray[B >: A](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: A](dest: Buffer[B]): Unit
-
def
count(p: (A) ⇒ Boolean): Int
-
def
diff(that: GenSet[A]): Set[A]
-
def
drop(n: Int): Set[A]
-
def
dropRight(n: Int): Set[A]
-
def
dropWhile(p: (A) ⇒ Boolean): Set[A]
-
def
empty: Set[A]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(that: Any): Boolean
-
def
exists(p: (A) ⇒ Boolean): Boolean
-
def
filter(p: (A) ⇒ Boolean): Set[A]
-
def
filterNot(p: (A) ⇒ Boolean): Set[A]
-
def
finalize(): Unit
-
def
find(p: (A) ⇒ Boolean): Option[A]
-
def
flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[A], B, That]): That
-
def
fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, A) ⇒ B): B
-
def
foldRight[B](z: B)(op: (A, B) ⇒ B): B
-
def
forall(p: (A) ⇒ Boolean): Boolean
-
def
foreach[U](f: (A) ⇒ U): Unit
-
def
genericBuilder[B]: Builder[B, Set[B]]
-
final
def
getClass(): java.lang.Class[_]
-
def
groupBy[K](f: (A) ⇒ K): Map[K, Set[A]]
-
def
grouped(size: Int): Iterator[Set[A]]
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
def
head: A
-
def
headOption: Option[A]
-
def
init: Set[A]
-
def
inits: Iterator[Set[A]]
-
val
internalMap: ConcurrentHashMap[A, Long]
-
def
intersect(that: GenSet[A]): Set[A]
-
def
isEmpty: Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
isTraversableAgain: Boolean
-
def
iterator: Iterator[A]
-
def
last: A
-
def
lastOption: Option[A]
-
def
map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[Set[A], B, That]): That
-
def
mapResult[NewTo](f: (Set[A]) ⇒ NewTo): Builder[A, NewTo]
-
def
max[B >: A](implicit cmp: Ordering[B]): A
-
def
maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
-
def
min[B >: A](implicit cmp: Ordering[B]): A
-
def
minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
-
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[A, Set[A]]
-
def
nonEmpty: Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
par: ParSet[A]
-
def
parCombiner: Combiner[A, ParSet[A]]
-
def
partition(p: (A) ⇒ Boolean): (Set[A], Set[A])
-
def
product[B >: A](implicit num: Numeric[B]): B
-
def
reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft[B >: A](op: (B, A) ⇒ B): B
-
def
reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]
-
def
reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight[B >: A](op: (A, B) ⇒ B): B
-
def
reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]
-
def
remove(elem: A): Boolean
-
def
repr: Set[A]
-
def
result(): Set[A]
-
def
retain(p: (A) ⇒ Boolean): Unit
-
def
reversed: List[A]
-
def
sameElements[B >: A](that: GenIterable[B]): Boolean
-
def
scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Set[A], B, That]): That
-
def
scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[Set[A], B, That]): That
-
def
scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[Set[A], B, That]): That
-
def
seq: Set[A]
-
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): Set[A]
-
def
sliding[B >: A](size: Int, step: Int): Iterator[Set[A]]
-
def
sliding[B >: A](size: Int): Iterator[Set[A]]
-
def
span(p: (A) ⇒ Boolean): (Set[A], Set[A])
-
def
splitAt(n: Int): (Set[A], Set[A])
-
def
stringPrefix: String
-
def
subsetOf(that: GenSet[A]): Boolean
-
def
subsets: Iterator[Set[A]]
-
def
subsets(len: Int): Iterator[Set[A]]
-
def
sum[B >: A](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
tail: Set[A]
-
def
tails: Iterator[Set[A]]
-
def
take(n: Int): Set[A]
-
def
takeRight(n: Int): Set[A]
-
def
takeWhile(p: (A) ⇒ Boolean): Set[A]
-
def
thisCollection: Iterable[A]
-
def
toArray[B >: A](implicit arg0: ClassManifest[B]): Array[B]
-
def
toBuffer[A1 >: A]: Buffer[A1]
-
def
toCollection(repr: Set[A]): Iterable[A]
-
def
toIndexedSeq[B >: A]: IndexedSeq[B]
-
def
toIterable: Iterable[A]
-
def
toIterator: Iterator[A]
-
def
toList: List[A]
-
def
toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]
-
def
toSeq: Seq[A]
-
def
toSet[B >: A]: Set[B]
-
def
toStream: Stream[A]
-
def
toString(): String
-
def
toTraversable: Traversable[A]
-
def
transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): Set[Set[B]]
-
def
union(that: GenSet[A]): Set[A]
-
def
unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (Set[A1], Set[A2])
-
def
unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
-
def
update(elem: A, included: Boolean): Unit
-
def
view(from: Int, until: Int): IterableView[A, Set[A]]
-
def
view: IterableView[A, Set[A]]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, Set[A]]
-
def
zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Set[A], (A1, B), That]): That
-
def
zipAll[B, A1 >: A, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Set[A], (A1, B), That]): That
-
def
zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[Set[A], (A1, Int), That]): That
-
def
|(that: GenSet[A]): Set[A]
Deprecated Value Members
-
def
**(that: Set[A]): Set[A]
-
def
elements: Iterator[A]
-
def
first: A
-
def
firstOption: Option[A]
-
def
projection: IterableView[A, Set[A]]
Inherited from Set[A]
Value Members
-
def
companion: GenericCompanion[Set]
-
def
seq: Set[A]
Inherited from SetLike[A, Set[A]]
Value Members
-
def
+(elem1: A, elem2: A, elems: A*): Set[A]
-
def
++(xs: GenTraversableOnce[A]): Set[A]
-
def
-(elem1: A, elem2: A, elems: A*): Set[A]
-
def
--(xs: GenTraversableOnce[A]): Set[A]
-
def
<<(cmd: Message[A]): Unit
-
def
add(elem: A): Boolean
-
def
clear(): Unit
-
def
clone(): Set[A]
-
def
newBuilder: Builder[A, Set[A]]
-
def
parCombiner: Combiner[A, ParSet[A]]
-
def
remove(elem: A): Boolean
-
def
result(): Set[A]
-
def
retain(p: (A) ⇒ Boolean): Unit
-
def
update(elem: A, included: Boolean): Unit
Inherited from Shrinkable[A]
Value Members
-
def
--=(xs: TraversableOnce[A]): TimeStampedHashSet.this.type
-
def
-=(elem1: A, elem2: A, elems: A*): TimeStampedHashSet.this.type
Inherited from Builder[A, Set[A]]
Value Members
-
def
mapResult[NewTo](f: (Set[A]) ⇒ NewTo): Builder[A, NewTo]
-
def
sizeHint(coll: scala.collection.TraversableLike[_, _], delta: Int): Unit
-
def
sizeHint(size: Int): Unit
-
def
sizeHintBounded(size: Int, boundingColl: scala.collection.TraversableLike[_, _]): Unit
Inherited from Growable[A]
Value Members
-
def
++=(xs: TraversableOnce[A]): TimeStampedHashSet.this.type
-
def
+=(elem1: A, elem2: A, elems: A*): TimeStampedHashSet.this.type
Inherited from SetLike[A, Set[A]]
Value Members
-
def
diff(that: GenSet[A]): Set[A]
-
def
isEmpty: Boolean
-
def
map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[Set[A], B, That]): That
-
def
stringPrefix: String
-
def
subsets: Iterator[Set[A]]
-
def
subsets(len: Int): Iterator[Set[A]]
-
def
toBuffer[A1 >: A]: Buffer[A1]
-
def
toSeq: Seq[A]
-
def
toString(): String
-
def
union(that: GenSet[A]): Set[A]
-
def
**(that: Set[A]): Set[A]
Inherited from GenSetLike[A, Set[A]]
Value Members
-
def
&(that: GenSet[A]): Set[A]
-
def
&~(that: GenSet[A]): Set[A]
-
def
apply(elem: A): Boolean
-
def
equals(that: Any): Boolean
-
def
hashCode(): Int
-
def
intersect(that: GenSet[A]): Set[A]
-
def
subsetOf(that: GenSet[A]): Boolean
-
def
|(that: GenSet[A]): Set[A]
Inherited from (A) ⇒ Boolean
Value Members
-
def
andThen[A](g: (Boolean) ⇒ A): (A) ⇒ A
-
def
compose[A](g: (A) ⇒ A): (A) ⇒ Boolean
Inherited from IterableLike[A, Set[A]]
Value Members
-
def
canEqual(that: Any): Boolean
-
def
copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit
-
def
drop(n: Int): Set[A]
-
def
dropRight(n: Int): Set[A]
-
def
exists(p: (A) ⇒ Boolean): Boolean
-
def
find(p: (A) ⇒ Boolean): Option[A]
-
def
foldRight[B](z: B)(op: (A, B) ⇒ B): B
-
def
forall(p: (A) ⇒ Boolean): Boolean
-
def
grouped(size: Int): Iterator[Set[A]]
-
def
head: A
-
def
reduceRight[B >: A](op: (A, B) ⇒ B): B
-
def
sameElements[B >: A](that: GenIterable[B]): Boolean
-
def
slice(from: Int, until: Int): Set[A]
-
def
sliding[B >: A](size: Int, step: Int): Iterator[Set[A]]
-
def
sliding[B >: A](size: Int): Iterator[Set[A]]
-
def
take(n: Int): Set[A]
-
def
takeRight(n: Int): Set[A]
-
def
takeWhile(p: (A) ⇒ Boolean): Set[A]
-
def
thisCollection: Iterable[A]
-
def
toCollection(repr: Set[A]): Iterable[A]
-
def
toIterable: Iterable[A]
-
def
toStream: Stream[A]
-
def
view(from: Int, until: Int): IterableView[A, Set[A]]
-
def
view: IterableView[A, Set[A]]
-
def
zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Set[A], (A1, B), That]): That
-
def
zipAll[B, A1 >: A, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Set[A], (A1, B), That]): That
-
def
zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[Set[A], (A1, Int), That]): That
-
def
elements: Iterator[A]
-
def
first: A
-
def
firstOption: Option[A]
-
def
projection: IterableView[A, Set[A]]
Inherited from GenericTraversableTemplate[A, Set]
Value Members
-
def
genericBuilder[B]: Builder[B, Set[B]]
-
def
transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): Set[Set[B]]
-
def
unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (Set[A1], Set[A2])
-
def
unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
Inherited from TraversableLike[A, Set[A]]
Type Members
-
type
Self = Set[A]
Value Members
-
def
++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[A], B, That]): That
-
def
++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[Set[A], B, That]): That
-
def
++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Set[A], B, That]): That
-
def
collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[Set[A], B, That]): That
-
def
dropWhile(p: (A) ⇒ Boolean): Set[A]
-
def
filter(p: (A) ⇒ Boolean): Set[A]
-
def
filterNot(p: (A) ⇒ Boolean): Set[A]
-
def
flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[A], B, That]): That
-
def
groupBy[K](f: (A) ⇒ K): Map[K, Set[A]]
-
def
hasDefiniteSize: Boolean
-
def
headOption: Option[A]
-
def
init: Set[A]
-
def
inits: Iterator[Set[A]]
-
def
last: A
-
def
lastOption: Option[A]
-
def
partition(p: (A) ⇒ Boolean): (Set[A], Set[A])
-
def
repr: Set[A]
-
def
scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Set[A], B, That]): That
-
def
scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[Set[A], B, That]): That
-
def
scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[Set[A], B, That]): That
-
def
span(p: (A) ⇒ Boolean): (Set[A], Set[A])
-
def
splitAt(n: Int): (Set[A], Set[A])
-
def
tail: Set[A]
-
def
tails: Iterator[Set[A]]
-
def
toIterator: Iterator[A]
-
def
toTraversable: Traversable[A]
-
def
withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, Set[A]]
Inherited from GenTraversableLike[A, Set[A]]
Value Members
-
final
def
isTraversableAgain: Boolean
Inherited from Parallelizable[A, ParSet[A]]
Value Members
-
def
par: ParSet[A]
Inherited from TraversableOnce[A]
Value Members
-
def
/:[B](z: B)(op: (B, A) ⇒ B): B
-
def
:\[B](z: B)(op: (A, B) ⇒ B): B
-
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, A) ⇒ B, combop: (B, B) ⇒ B): B
-
def
collectFirst[B](pf: PartialFunction[A, B]): Option[B]
-
def
copyToArray[B >: A](xs: Array[B]): Unit
-
def
copyToArray[B >: A](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: A](dest: Buffer[B]): Unit
-
def
count(p: (A) ⇒ Boolean): Int
-
def
fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, A) ⇒ B): B
-
def
max[B >: A](implicit cmp: Ordering[B]): A
-
def
maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
-
def
min[B >: A](implicit cmp: Ordering[B]): A
-
def
minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
def
nonEmpty: Boolean
-
def
product[B >: A](implicit num: Numeric[B]): B
-
def
reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft[B >: A](op: (B, A) ⇒ B): B
-
def
reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]
-
def
reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]
-
def
reversed: List[A]
-
def
sum[B >: A](implicit num: Numeric[B]): B
-
def
toArray[B >: A](implicit arg0: ClassManifest[B]): Array[B]
-
def
toIndexedSeq[B >: A]: IndexedSeq[B]
-
def
toList: List[A]
-
def
toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]
-
def
toSet[B >: A]: Set[B]
Inherited from GenTraversableOnce[A]
Value Members
-
def
/:\[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
Inherited from AnyRef
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
eq(arg0: AnyRef): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): java.lang.Class[_]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from Any
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
final
def
isInstanceOf[T0]: Boolean