abstract class EqHashIterator[A] extends Iterator[A]
- Attributes
- protected
Linear Supertypes
Known Subclasses
Ordering
- Alphabetic
- By Inheritance
Inherited
- EqHashIterator
- Iterator
- TraversableOnce
- GenTraversableOnce
- AnyRef
- Any
Implicitly
- by MonadOps
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- by alternateImplicit
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new EqHashIterator()
Type Members
-
class
GroupedIterator[B >: A] extends scala.collection.AbstractIterator[Seq[B]] with Iterator[Seq[B]]
- Definition Classes
- Iterator
Abstract Value Members
-
abstract
def
next(): A
- Definition Classes
- Iterator
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
-
def
++[B >: A](that: ⇒ GenTraversableOnce[B]): Iterator[B]
- Definition Classes
- Iterator
- def ->[B](y: B): ((EqHash.this)#EqHashIterator[A], B)
-
def
/:[B](z: B)(op: (B, A) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
:\[B](z: B)(op: (A, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
addString(b: StringBuilder): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
aggregate[B](z: ⇒ B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
buffered: BufferedIterator[A]
- Definition Classes
- Iterator
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
collect[B](pf: PartialFunction[A, B]): Iterator[B]
- Definition Classes
- Iterator
- Annotations
- @migration
- Migration
(Changed in version 2.8.0)
collect
has changed. The previous behavior can be reproduced withtoSeq
.
-
def
collectFirst[B](pf: PartialFunction[A, B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
contains(elem: Any): Boolean
- Definition Classes
- Iterator
-
def
copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- Iterator → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: A](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: A](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: A](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
corresponds[B](that: GenTraversableOnce[B])(p: (A, B) ⇒ Boolean): Boolean
- Definition Classes
- Iterator
-
def
count(p: (A) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
drop(n: Int): Iterator[A]
- Definition Classes
- Iterator
-
def
dropWhile(p: (A) ⇒ Boolean): Iterator[A]
- Definition Classes
- Iterator
-
def
duplicate: (Iterator[A], Iterator[A])
- Definition Classes
- Iterator
- def ensuring(cond: ((EqHash.this)#EqHashIterator[A]) ⇒ Boolean, msg: ⇒ Any): (EqHash.this)#EqHashIterator[A]
- def ensuring(cond: ((EqHash.this)#EqHashIterator[A]) ⇒ Boolean): (EqHash.this)#EqHashIterator[A]
- def ensuring(cond: Boolean, msg: ⇒ Any): (EqHash.this)#EqHashIterator[A]
- def ensuring(cond: Boolean): (EqHash.this)#EqHashIterator[A]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
exists(p: (A) ⇒ Boolean): Boolean
- Definition Classes
- Iterator → TraversableOnce → GenTraversableOnce
-
def
filter(p: (A) ⇒ Boolean): Iterator[A]
- Definition Classes
- Iterator
-
def
filterNot(p: (A) ⇒ Boolean): Iterator[A]
- Definition Classes
- Iterator
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
find(p: (A) ⇒ Boolean): Option[A]
- Definition Classes
- Iterator → TraversableOnce → GenTraversableOnce
-
def
flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): Iterator[B]
- Definition Classes
- Iterator
-
def
fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, A) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: (A, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
forall(p: (A) ⇒ Boolean): Boolean
- Definition Classes
- Iterator → TraversableOnce → GenTraversableOnce
-
def
foreach[U](f: (A) ⇒ U): Unit
- Definition Classes
- Iterator → TraversableOnce → GenTraversableOnce
- def formatted(fmtstr: String): String
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
grouped[B >: A](size: Int): GroupedIterator[B]
- Definition Classes
- Iterator
-
def
hasDefiniteSize: Boolean
- Definition Classes
- Iterator → TraversableOnce → GenTraversableOnce
-
def
hasNext: Boolean
- Definition Classes
- EqHashIterator → Iterator
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
indexOf[B >: A](elem: B, from: Int): Int
- Definition Classes
- Iterator
-
def
indexOf[B >: A](elem: B): Int
- Definition Classes
- Iterator
-
def
indexWhere(p: (A) ⇒ Boolean, from: Int): Int
- Definition Classes
- Iterator
-
def
indexWhere(p: (A) ⇒ Boolean): Int
- Definition Classes
- Iterator
-
def
isEmpty: Boolean
- Definition Classes
- Iterator → TraversableOnce → GenTraversableOnce
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isTraversableAgain: Boolean
- Definition Classes
- Iterator → GenTraversableOnce
-
def
length: Int
- Definition Classes
- Iterator
-
def
map[B](f: (A) ⇒ B): Iterator[B]
- Definition Classes
- Iterator
-
def
max[B >: A](implicit cmp: Ordering[B]): A
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
min[B >: A](implicit cmp: Ordering[B]): A
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString: String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(sep: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(start: String, sep: String, end: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
nextIndex: Int
- Attributes
- protected
-
def
nonEmpty: Boolean
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
padTo[A1 >: A](len: Int, elem: A1): Iterator[A1]
- Definition Classes
- Iterator
-
def
partition(p: (A) ⇒ Boolean): (Iterator[A], Iterator[A])
- Definition Classes
- Iterator
-
def
patch[B >: A](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]
- Definition Classes
- Iterator
-
def
product[B >: A](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: A](op: (B, A) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: A](op: (A, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reversed: List[A]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
def
sameElements(that: Iterator[_]): Boolean
- Definition Classes
- Iterator
-
def
scanLeft[B](z: B)(op: (B, A) ⇒ B): Iterator[B]
- Definition Classes
- Iterator
-
def
scanRight[B](z: B)(op: (A, B) ⇒ B): Iterator[B]
- Definition Classes
- Iterator
-
def
seq: Iterator[A]
- Definition Classes
- Iterator → TraversableOnce → GenTraversableOnce
-
def
size: Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
sizeHintIfCheap: Int
- Attributes
- protected[scala.collection]
- Definition Classes
- GenTraversableOnce
-
def
slice(from: Int, until: Int): Iterator[A]
- Definition Classes
- Iterator
-
def
sliceIterator(from: Int, until: Int): Iterator[A]
- Attributes
- protected
- Definition Classes
- Iterator
-
def
sliding[B >: A](size: Int, step: Int): GroupedIterator[B]
- Definition Classes
- Iterator
-
def
span(p: (A) ⇒ Boolean): (Iterator[A], Iterator[A])
- Definition Classes
- Iterator
-
def
sum[B >: A](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
val
tab: Array[AnyRef]
- Attributes
- protected
-
def
take(n: Int): Iterator[A]
- Definition Classes
- Iterator
-
def
takeWhile(p: (A) ⇒ Boolean): Iterator[A]
- Definition Classes
- Iterator
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[B >: A]: Buffer[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIndexedSeq: IndexedSeq[A]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterable: Iterable[A]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterator: Iterator[A]
- Definition Classes
- Iterator → GenTraversableOnce
-
def
toList: List[A]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSeq: Seq[A]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSet[B >: A]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toStream: Stream[A]
- Definition Classes
- Iterator → GenTraversableOnce
-
def
toString(): String
- Definition Classes
- Iterator → AnyRef → Any
-
def
toTraversable: Traversable[A]
- Definition Classes
- Iterator → TraversableOnce → GenTraversableOnce
-
def
toVector: Vector[A]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
withFilter(p: (A) ⇒ Boolean): Iterator[A]
- Definition Classes
- Iterator
-
def
zip[B](that: Iterator[B]): Iterator[(A, B)]
- Definition Classes
- Iterator
-
def
zipAll[B, A1 >: A, B1 >: B](that: Iterator[B], thisElem: A1, thatElem: B1): Iterator[(A1, B1)]
- Definition Classes
- Iterator
-
def
zipWithIndex: Iterator[(A, Int)]
- Definition Classes
- Iterator
- def →[B](y: B): ((EqHash.this)#EqHashIterator[A], B)
Shadowed Implicit Value Members
-
def
filter(p: (A) ⇒ Boolean): TraversableOnce[A]
- Implicit
- This member is added by an implicit conversion from (EqHash.this)#EqHashIterator[A] to MonadOps[A] performed by method MonadOps in scala.collection.TraversableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(eqHashIterator: MonadOps[A]).filter(p)
- Definition Classes
- MonadOps
-
def
flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
- Implicit
- This member is added by an implicit conversion from (EqHash.this)#EqHashIterator[A] to MonadOps[A] performed by method MonadOps in scala.collection.TraversableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(eqHashIterator: MonadOps[A]).flatMap(f)
- Definition Classes
- MonadOps
-
def
map[B](f: (A) ⇒ B): TraversableOnce[B]
- Implicit
- This member is added by an implicit conversion from (EqHash.this)#EqHashIterator[A] to MonadOps[A] performed by method MonadOps in scala.collection.TraversableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(eqHashIterator: MonadOps[A]).map(f)
- Definition Classes
- MonadOps
-
def
withFilter(p: (A) ⇒ Boolean): Iterator[A]
- Implicit
- This member is added by an implicit conversion from (EqHash.this)#EqHashIterator[A] to MonadOps[A] performed by method MonadOps in scala.collection.TraversableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(eqHashIterator: MonadOps[A]).withFilter(p)
- Definition Classes
- MonadOps
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graph
mutable.Graph
and its inner nodes.GraphEdge
objectedge
packageGraphPredef
object andImplicits
object.GraphTraversal
andTraverserInnerNode
.RandomGraph
.GraphGen
.