class EntryIterator extends EqHashIterator[(K, V)]
- Attributes
- protected
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- EntryIterator
- EqHashIterator
- Iterator
- TraversableOnce
- GenTraversableOnce
- AnyRef
- Any
Implicitly
- by MonadOps
- by CollectionsHaveToParArray
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- by alternateImplicit
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new EntryIterator()
Type Members
-
class
GroupedIterator[B >: A] extends scala.collection.AbstractIterator[Seq[B]] with Iterator[Seq[B]]
- Definition Classes
- Iterator
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
+(other: String): String
- Implicit
- This member is added by an implicit conversion from EntryIterator to any2stringadd[EntryIterator] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
-
def
++[B >: (K, V)](that: ⇒ GenTraversableOnce[B]): Iterator[B]
- Definition Classes
- Iterator
-
def
->[B](y: B): (EntryIterator, B)
- Implicit
- This member is added by an implicit conversion from EntryIterator to ArrowAssoc[EntryIterator] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
-
def
/:[B](z: B)(op: (B, (K, V)) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
:\[B](z: B)(op: ((K, V), 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, (K, V)) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
buffered: BufferedIterator[(K, V)]
- Definition Classes
- Iterator
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
collect[B](pf: PartialFunction[(K, V), 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[(K, V), B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
contains(elem: Any): Boolean
- Definition Classes
- Iterator
-
def
copyToArray[B >: (K, V)](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- Iterator → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: (K, V)](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: (K, V)](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: (K, V)](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
corresponds[B](that: GenTraversableOnce[B])(p: ((K, V), B) ⇒ Boolean): Boolean
- Definition Classes
- Iterator
-
def
count(p: ((K, V)) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
drop(n: Int): Iterator[(K, V)]
- Definition Classes
- Iterator
-
def
dropWhile(p: ((K, V)) ⇒ Boolean): Iterator[(K, V)]
- Definition Classes
- Iterator
-
def
duplicate: (Iterator[(K, V)], Iterator[(K, V)])
- Definition Classes
- Iterator
-
def
ensuring(cond: (EntryIterator) ⇒ Boolean, msg: ⇒ Any): EntryIterator
- Implicit
- This member is added by an implicit conversion from EntryIterator to Ensuring[EntryIterator] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: (EntryIterator) ⇒ Boolean): EntryIterator
- Implicit
- This member is added by an implicit conversion from EntryIterator to Ensuring[EntryIterator] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean, msg: ⇒ Any): EntryIterator
- Implicit
- This member is added by an implicit conversion from EntryIterator to Ensuring[EntryIterator] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean): EntryIterator
- Implicit
- This member is added by an implicit conversion from EntryIterator to Ensuring[EntryIterator] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
exists(p: ((K, V)) ⇒ Boolean): Boolean
- Definition Classes
- Iterator → TraversableOnce → GenTraversableOnce
-
def
filter(p: ((K, V)) ⇒ Boolean): Iterator[(K, V)]
- Definition Classes
- Iterator
-
def
filterNot(p: ((K, V)) ⇒ Boolean): Iterator[(K, V)]
- Definition Classes
- Iterator
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
find(p: ((K, V)) ⇒ Boolean): Option[(K, V)]
- Definition Classes
- Iterator → TraversableOnce → GenTraversableOnce
-
def
flatMap[B](f: ((K, V)) ⇒ GenTraversableOnce[B]): Iterator[B]
- Definition Classes
- Iterator
-
def
fold[A1 >: (K, V)](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, (K, V)) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: ((K, V), B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
forall(p: ((K, V)) ⇒ Boolean): Boolean
- Definition Classes
- Iterator → TraversableOnce → GenTraversableOnce
-
def
foreach[U](f: ((K, V)) ⇒ U): Unit
- Definition Classes
- Iterator → TraversableOnce → GenTraversableOnce
-
def
formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from EntryIterator to StringFormat[EntryIterator] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @inline()
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
grouped[B >: (K, V)](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 >: (K, V)](elem: B, from: Int): Int
- Definition Classes
- Iterator
-
def
indexOf[B >: (K, V)](elem: B): Int
- Definition Classes
- Iterator
-
def
indexWhere(p: ((K, V)) ⇒ Boolean, from: Int): Int
- Definition Classes
- Iterator
-
def
indexWhere(p: ((K, V)) ⇒ 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: ((K, V)) ⇒ B): Iterator[B]
- Definition Classes
- Iterator
-
def
max[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
min[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)
- 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
next(): (K, V)
- Definition Classes
- EntryIterator → Iterator
-
def
nextIndex: Int
- Attributes
- protected
- Definition Classes
- EqHashIterator
-
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 >: (K, V)](len: Int, elem: A1): Iterator[A1]
- Definition Classes
- Iterator
-
def
partition(p: ((K, V)) ⇒ Boolean): (Iterator[(K, V)], Iterator[(K, V)])
- Definition Classes
- Iterator
-
def
patch[B >: (K, V)](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]
- Definition Classes
- Iterator
-
def
product[B >: (K, V)](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduce[A1 >: (K, V)](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: (K, V)](op: (B, (K, V)) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: (K, V)](op: (B, (K, V)) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: (K, V)](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: (K, V)](op: ((K, V), B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: (K, V)](op: ((K, V), B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reversed: List[(K, V)]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
def
sameElements(that: Iterator[_]): Boolean
- Definition Classes
- Iterator
-
def
scanLeft[B](z: B)(op: (B, (K, V)) ⇒ B): Iterator[B]
- Definition Classes
- Iterator
-
def
scanRight[B](z: B)(op: ((K, V), B) ⇒ B): Iterator[B]
- Definition Classes
- Iterator
-
def
seq: Iterator[(K, V)]
- 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[(K, V)]
- Definition Classes
- Iterator
-
def
sliceIterator(from: Int, until: Int): Iterator[(K, V)]
- Attributes
- protected
- Definition Classes
- Iterator
-
def
sliding[B >: (K, V)](size: Int, step: Int): GroupedIterator[B]
- Definition Classes
- Iterator
-
def
span(p: ((K, V)) ⇒ Boolean): (Iterator[(K, V)], Iterator[(K, V)])
- Definition Classes
- Iterator
-
def
sum[B >: (K, V)](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
- Definition Classes
- EqHashIterator
-
def
take(n: Int): Iterator[(K, V)]
- Definition Classes
- Iterator
-
def
takeWhile(p: ((K, V)) ⇒ Boolean): Iterator[(K, V)]
- Definition Classes
- Iterator
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (K, V), Col[(K, V)]]): Col[(K, V)]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toArray[B >: (K, V)](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[B >: (K, V)]: Buffer[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIndexedSeq: IndexedSeq[(K, V)]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterable: Iterable[(K, V)]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterator: Iterator[(K, V)]
- Definition Classes
- Iterator → GenTraversableOnce
-
def
toList: List[(K, V)]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[(K, V), (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toParArray: ParArray[T]
- Implicit
- This member is added by an implicit conversion from EntryIterator to CollectionsHaveToParArray[EntryIterator, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (EntryIterator) ⇒ GenTraversableOnce[T] is in scope.
- Definition Classes
- CollectionsHaveToParArray
-
def
toSeq: Seq[(K, V)]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSet[B >: (K, V)]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toStream: Stream[(K, V)]
- Definition Classes
- Iterator → GenTraversableOnce
-
def
toString(): String
- Definition Classes
- Iterator → AnyRef → Any
-
def
toTraversable: Traversable[(K, V)]
- Definition Classes
- Iterator → TraversableOnce → GenTraversableOnce
-
def
toVector: Vector[(K, V)]
- 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: ((K, V)) ⇒ Boolean): Iterator[(K, V)]
- Definition Classes
- Iterator
-
def
zip[B](that: Iterator[B]): Iterator[((K, V), B)]
- Definition Classes
- Iterator
-
def
zipAll[B, A1 >: (K, V), B1 >: B](that: Iterator[B], thisElem: A1, thatElem: B1): Iterator[(A1, B1)]
- Definition Classes
- Iterator
-
def
zipWithIndex: Iterator[((K, V), Int)]
- Definition Classes
- Iterator
-
def
→[B](y: B): (EntryIterator, B)
- Implicit
- This member is added by an implicit conversion from EntryIterator to ArrowAssoc[EntryIterator] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
Shadowed Implicit Value Members
-
def
filter(p: ((K, V)) ⇒ Boolean): TraversableOnce[(K, V)]
- Implicit
- This member is added by an implicit conversion from EntryIterator to MonadOps[(K, V)] 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:(entryIterator: MonadOps[(K, V)]).filter(p)
- Definition Classes
- MonadOps
-
def
flatMap[B](f: ((K, V)) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
- Implicit
- This member is added by an implicit conversion from EntryIterator to MonadOps[(K, V)] 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:(entryIterator: MonadOps[(K, V)]).flatMap(f)
- Definition Classes
- MonadOps
-
def
map[B](f: ((K, V)) ⇒ B): TraversableOnce[B]
- Implicit
- This member is added by an implicit conversion from EntryIterator to MonadOps[(K, V)] 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:(entryIterator: MonadOps[(K, V)]).map(f)
- Definition Classes
- MonadOps
-
def
withFilter(p: ((K, V)) ⇒ Boolean): Iterator[(K, V)]
- Implicit
- This member is added by an implicit conversion from EntryIterator to MonadOps[(K, V)] 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:(entryIterator: MonadOps[(K, V)]).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
.