class
PointedGraphs[Rdf <: RDF] extends Iterable[PointedGraph[Rdf]]
Instance Constructors
-
new
PointedGraphs(nodes: Iterable[Rdf.Node], graph: Rdf.Graph)
Type Members
-
type
Self = Iterable[PointedGraph[Rdf]]
-
class
WithFilter extends FilterMonadic[A, Repr]
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
+(other: String): String
-
def
++[B >: PointedGraph[Rdf], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[PointedGraph[Rdf]], B, That]): That
-
def
++:[B >: PointedGraph[Rdf], That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[PointedGraph[Rdf]], B, That]): That
-
def
++:[B >: PointedGraph[Rdf], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[PointedGraph[Rdf]], B, That]): That
-
def
->[B](y: B): (PointedGraphs[Rdf], B)
-
def
/(p: Rdf.URI)(implicit ops: RDFOps[Rdf]): PointedGraphs[Rdf]
-
def
/:[B](z: B)(op: (B, PointedGraph[Rdf]) ⇒ B): B
-
def
:\[B](z: B)(op: (PointedGraph[Rdf], B) ⇒ B): B
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): 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, PointedGraph[Rdf]) ⇒ B, combop: (B, B) ⇒ B): B
-
def
as[T](implicit fromPG: FromPG[Rdf, T]): Try[T]
-
def
as2[T1, T2](implicit fromPG1: FromPG[Rdf, T1], fromPG2: FromPG[Rdf, T2]): Try[(T1, T2)]
-
final
def
asInstanceOf[T0]: T0
-
def
asOption[T](implicit fromPG: FromPG[Rdf, T]): Try[Option[T]]
-
def
asOption2[T1, T2](implicit fromPG1: FromPG[Rdf, T1], fromPG2: FromPG[Rdf, T2]): Try[Option[(T1, T2)]]
-
def
asParIterable: ParIterable[PointedGraph[Rdf]]
-
def
asParSeq: ParSeq[PointedGraph[Rdf]]
-
def
asSet[T](implicit fromPG: FromPG[Rdf, T]): Try[Set[T]]
-
def
asSet2[T1, T2](implicit fromPG1: FromPG[Rdf, T1], fromPG2: FromPG[Rdf, T2]): Try[Set[(T1, T2)]]
-
def
canEqual(that: Any): Boolean
-
def
clone(): AnyRef
-
def
collect[B, That](pf: PartialFunction[PointedGraph[Rdf], B])(implicit bf: CanBuildFrom[Iterable[PointedGraph[Rdf]], B, That]): That
-
def
collectFirst[B](pf: PartialFunction[PointedGraph[Rdf], B]): Option[B]
-
def
companion: GenericCompanion[Iterable]
-
def
copyToArray[B >: PointedGraph[Rdf]](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: PointedGraph[Rdf]](xs: Array[B]): Unit
-
def
copyToArray[B >: PointedGraph[Rdf]](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: PointedGraph[Rdf]](dest: Buffer[B]): Unit
-
def
count(p: (PointedGraph[Rdf]) ⇒ Boolean): Int
-
def
drop(n: Int): Iterable[PointedGraph[Rdf]]
-
def
dropRight(n: Int): Iterable[PointedGraph[Rdf]]
-
def
dropWhile(p: (PointedGraph[Rdf]) ⇒ Boolean): Iterable[PointedGraph[Rdf]]
-
def
ensuring(cond: (PointedGraphs[Rdf]) ⇒ Boolean, msg: ⇒ Any): PointedGraphs[Rdf]
-
-
def
ensuring(cond: Boolean, msg: ⇒ Any): PointedGraphs[Rdf]
-
def
ensuring(cond: Boolean): PointedGraphs[Rdf]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
exactlyOneAs[T](implicit fromPG: FromPG[Rdf, T]): Try[T]
-
def
exactlyOnePointedGraph: Try[PointedGraph[Rdf]]
-
def
exists(p: (PointedGraph[Rdf]) ⇒ Boolean): Boolean
-
def
filter(p: (PointedGraph[Rdf]) ⇒ Boolean): Iterable[PointedGraph[Rdf]]
-
def
filterNot(p: (PointedGraph[Rdf]) ⇒ Boolean): Iterable[PointedGraph[Rdf]]
-
def
finalize(): Unit
-
-
def
flatMap[B, That](f: (PointedGraph[Rdf]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[PointedGraph[Rdf]], B, That]): That
-
def
flatten[B](implicit asTraversable: (PointedGraph[Rdf]) ⇒ GenTraversableOnce[B]): Iterable[B]
-
def
fold[A1 >: PointedGraph[Rdf]](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, PointedGraph[Rdf]) ⇒ B): B
-
def
foldRight[B](z: B)(op: (PointedGraph[Rdf], B) ⇒ B): B
-
def
forall(p: (PointedGraph[Rdf]) ⇒ Boolean): Boolean
-
def
foreach[U](f: (PointedGraph[Rdf]) ⇒ U): Unit
-
def
formatted(fmtstr: String): String
-
def
genericBuilder[B]: Builder[B, Iterable[B]]
-
final
def
getClass(): Class[_]
-
val
graph: Rdf.Graph
-
def
groupBy[K](f: (PointedGraph[Rdf]) ⇒ K): Map[K, Iterable[PointedGraph[Rdf]]]
-
def
grouped(size: Int): Iterator[Iterable[PointedGraph[Rdf]]]
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
-
def
headOption: Option[PointedGraph[Rdf]]
-
def
ifParSeq[R](isbody: (ParSeq[PointedGraph[Rdf]]) ⇒ R): (TraversableOps[PointedGraph[Rdf]])#Otherwise[R]
-
def
init: Iterable[PointedGraph[Rdf]]
-
def
inits: Iterator[Iterable[PointedGraph[Rdf]]]
-
def
isEmpty: Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
def
isParIterable: Boolean
-
def
isParSeq: Boolean
-
def
isParallel: Boolean
-
final
def
isTraversableAgain: Boolean
-
def
iterator: Iterator[PointedGraph[Rdf]]
-
-
def
lastOption: Option[PointedGraph[Rdf]]
-
def
map[B, That](f: (PointedGraph[Rdf]) ⇒ B)(implicit bf: CanBuildFrom[Iterable[PointedGraph[Rdf]], B, That]): That
-
def
max[B >: PointedGraph[Rdf]](implicit cmp: Ordering[B]): PointedGraph[Rdf]
-
def
maxBy[B](f: (PointedGraph[Rdf]) ⇒ B)(implicit cmp: Ordering[B]): PointedGraph[Rdf]
-
def
min[B >: PointedGraph[Rdf]](implicit cmp: Ordering[B]): PointedGraph[Rdf]
-
def
minBy[B](f: (PointedGraph[Rdf]) ⇒ B)(implicit cmp: Ordering[B]): PointedGraph[Rdf]
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
final
def
ne(arg0: AnyRef): Boolean
-
-
val
nodes: Iterable[Rdf.Node]
-
def
nonEmpty: Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
par: ParIterable[PointedGraph[Rdf]]
-
def
parCombiner: Combiner[PointedGraph[Rdf], ParIterable[PointedGraph[Rdf]]]
-
-
def
product[B >: PointedGraph[Rdf]](implicit num: Numeric[B]): B
-
def
reduce[A1 >: PointedGraph[Rdf]](op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft[B >: PointedGraph[Rdf]](op: (B, PointedGraph[Rdf]) ⇒ B): B
-
def
reduceLeftOption[B >: PointedGraph[Rdf]](op: (B, PointedGraph[Rdf]) ⇒ B): Option[B]
-
def
reduceOption[A1 >: PointedGraph[Rdf]](op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight[B >: PointedGraph[Rdf]](op: (PointedGraph[Rdf], B) ⇒ B): B
-
def
reduceRightOption[B >: PointedGraph[Rdf]](op: (PointedGraph[Rdf], B) ⇒ B): Option[B]
-
def
repr: Iterable[PointedGraph[Rdf]]
-
def
reversed: List[PointedGraph[Rdf]]
-
def
sameElements[B >: PointedGraph[Rdf]](that: GenIterable[B]): Boolean
-
def
scan[B >: PointedGraph[Rdf], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[PointedGraph[Rdf]], B, That]): That
-
def
scanLeft[B, That](z: B)(op: (B, PointedGraph[Rdf]) ⇒ B)(implicit bf: CanBuildFrom[Iterable[PointedGraph[Rdf]], B, That]): That
-
def
scanRight[B, That](z: B)(op: (PointedGraph[Rdf], B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[PointedGraph[Rdf]], B, That]): That
-
-
def
size: Int
-
def
slice(from: Int, until: Int): Iterable[PointedGraph[Rdf]]
-
def
sliding(size: Int, step: Int): Iterator[Iterable[PointedGraph[Rdf]]]
-
def
sliding(size: Int): Iterator[Iterable[PointedGraph[Rdf]]]
-
-
def
splitAt(n: Int): (Iterable[PointedGraph[Rdf]], Iterable[PointedGraph[Rdf]])
-
def
stringPrefix: String
-
def
sum[B >: PointedGraph[Rdf]](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
tail: Iterable[PointedGraph[Rdf]]
-
def
tails: Iterator[Iterable[PointedGraph[Rdf]]]
-
def
take(n: Int): Iterable[PointedGraph[Rdf]]
-
def
takeOnePointedGraph: Try[PointedGraph[Rdf]]
-
def
takeRight(n: Int): Iterable[PointedGraph[Rdf]]
-
def
takeWhile(p: (PointedGraph[Rdf]) ⇒ Boolean): Iterable[PointedGraph[Rdf]]
-
def
thisCollection: Iterable[PointedGraph[Rdf]]
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, PointedGraph[Rdf], Col[PointedGraph[Rdf]]]): Col[PointedGraph[Rdf]]
-
def
toArray[B >: PointedGraph[Rdf]](implicit arg0: ClassTag[B]): Array[B]
-
def
toBuffer[B >: PointedGraph[Rdf]]: Buffer[B]
-
def
toCollection(repr: Iterable[PointedGraph[Rdf]]): Iterable[PointedGraph[Rdf]]
-
def
toIndexedSeq: IndexedSeq[PointedGraph[Rdf]]
-
def
toIterable: Iterable[PointedGraph[Rdf]]
-
def
toIterator: Iterator[PointedGraph[Rdf]]
-
-
def
toMap[T, U](implicit ev: <:<[PointedGraph[Rdf], (T, U)]): Map[T, U]
-
def
toParArray: ParArray[PointedGraph[Rdf]]
-
-
def
toSet[B >: PointedGraph[Rdf]]: Set[B]
-
def
toStream: Stream[PointedGraph[Rdf]]
-
def
toString(): String
-
def
toTraversable: Traversable[PointedGraph[Rdf]]
-
def
toVector: Vector[PointedGraph[Rdf]]
-
def
transpose[B](implicit asTraversable: (PointedGraph[Rdf]) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]
-
def
unzip[A1, A2](implicit asPair: (PointedGraph[Rdf]) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
-
def
unzip3[A1, A2, A3](implicit asTriple: (PointedGraph[Rdf]) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
-
def
view(from: Int, until: Int): IterableView[PointedGraph[Rdf], Iterable[PointedGraph[Rdf]]]
-
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
withFilter(p: (PointedGraph[Rdf]) ⇒ Boolean): FilterMonadic[PointedGraph[Rdf], Iterable[PointedGraph[Rdf]]]
-
def
zip[A1 >: PointedGraph[Rdf], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[PointedGraph[Rdf]], (A1, B), That]): That
-
def
zipAll[B, A1 >: PointedGraph[Rdf], That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[PointedGraph[Rdf]], (A1, B), That]): That
-
def
zipWithIndex[A1 >: PointedGraph[Rdf], That](implicit bf: CanBuildFrom[Iterable[PointedGraph[Rdf]], (A1, Int), That]): That
-
Shadowed Implicit Value Members
-
def
filter(p: (PointedGraph[Rdf]) ⇒ Boolean): TraversableOnce[PointedGraph[Rdf]]
-
def
flatMap[B](f: (PointedGraph[Rdf]) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
-
def
map[B](f: (PointedGraph[Rdf]) ⇒ B): TraversableOnce[B]
-
val
self: Any
-
val
self: Any
-
def
withFilter(p: (PointedGraph[Rdf]) ⇒ Boolean): Iterator[PointedGraph[Rdf]]
Deprecated Value Members
-
def
/:\[A1 >: PointedGraph[Rdf]](z: A1)(op: (A1, A1) ⇒ A1): A1
-
-
Inherited from Equals
Inherited from GenericTraversableTemplate[PointedGraph[Rdf], Iterable]
Inherited from AnyRef
Inherited from Any
Inherited by implicit conversion any2stringadd from
PointedGraphs[Rdf] to StringAdd
Inherited by implicit conversion any2stringfmt from
PointedGraphs[Rdf] to StringFormat
Inherited by implicit conversion alternateImplicit from
PointedGraphs[Rdf] to ForceImplicitAmbiguity