BasicPathSet

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def *[F](filter: F)(implicit factory: PathMatcherFactory[F]): PathSet[T]

Constructs a new finder that selects all paths with a name that matches filter and are immediate children of paths selected by this finder.

def **[F](filter: F)(implicit factory: PathMatcherFactory[F]): PathSet[T]

Constructs a new finder that selects all paths with a name that matches filter and are descendants of paths selected by this finder.

def ***: PathSet[T]

def ++[B >: T, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[PathSet[T], B, That]): That

def +++[U >: T](includes: PathFinder[U]): PathSet[U]

The union of the paths found by this PathSet with the paths found by 'paths'.

def ++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[PathSet[T], B, That]): That

def ++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[PathSet[T], B, That]): That

def ---[U >: T](excludes: PathFinder[U]): PathSet[T]

Excludes all paths from excludePaths from the paths selected by this PathSet.

def /(literal: String): PathSet[T]

Constructs a new finder that selects all paths with name literal that are immediate children of paths selected by this finder.

def /:[B](z: B)(op: (B, T) ⇒ B): B

def /:\[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1

def :\[B](z: B)(op: (T, B) ⇒ B): B

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def \(literal: String): PathSet[T]

Constructs a new finder that selects all paths with name literal that are immediate children of paths selected by this finder.

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, T) ⇒ B, combop: (B, B) ⇒ B): B

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[PathSet[T], B, That]): That

def collectFirst[B](pf: PartialFunction[T, B]): Option[B]

def companion: GenericCompanion[Iterable]

def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: T](xs: Array[B]): Unit

def copyToArray[B >: T](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: T](dest: Buffer[B]): Unit

def count(p: (T) ⇒ Boolean): Int

def drop(n: Int): PathSet[T]

def dropRight(n: Int): PathSet[T]

def dropWhile(p: (T) ⇒ Boolean): PathSet[T]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(p: (T) ⇒ Boolean): Boolean

def filter(f: (T) ⇒ Boolean): PathSet[T]

def filterNot(p: (T) ⇒ Boolean): PathSet[T]

def finalize(): Unit

def find(p: (T) ⇒ Boolean): Option[T]

def flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[PathSet[T], B, That]): That

def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, T) ⇒ B): B

def foldRight[B](z: B)(op: (T, B) ⇒ B): B

def forall(p: (T) ⇒ Boolean): Boolean

def force: Iterable[T]

Load the set into memory and a more standard set

def foreach[U](f: (T) ⇒ U): Unit

def genericBuilder[B]: Builder[B, Iterable[B]]

final def getClass(): java.lang.Class[_]

def groupBy[K](f: (T) ⇒ K): Map[K, PathSet[T]]

def grouped(size: Int): Iterator[PathSet[T]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: T

def headOption: Option[T]

def init: PathSet[T]

def inits: Iterator[PathSet[T]]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[T]

def last: T

def lastOption: Option[T]

def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[PathSet[T], B, That]): That

def max[B >: T](implicit cmp: Ordering[B]): T

def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

def min[B >: T](implicit cmp: Ordering[B]): T

def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

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[T, PathSet[T]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParIterable[T]

def parCombiner: Combiner[T, ParIterable[T]]

def partition(p: (T) ⇒ Boolean): (PathSet[T], PathSet[T])

def product[B >: T](implicit num: Numeric[B]): B

def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: T](op: (B, T) ⇒ B): B

def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]

def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: T](op: (T, B) ⇒ B): B

def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]

def repr: PathSet[T]

def reversed: List[T]

def sameElements[B >: T](that: GenIterable[B]): Boolean

def scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[PathSet[T], B, That]): That

def scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[PathSet[T], B, That]): That

def scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[PathSet[T], B, That]): That

def seq: Iterable[T]

def size: Int

def slice(from: Int, until: Int): PathSet[T]

def sliding[B >: T](size: Int, step: Int): Iterator[PathSet[T]]

def sliding[B >: T](size: Int): Iterator[PathSet[T]]

def span(p: (T) ⇒ Boolean): (PathSet[T], PathSet[T])

def splitAt(n: Int): (PathSet[T], PathSet[T])

def stringPrefix: String

def sum[B >: T](implicit num: Numeric[B]): B

final def synchronized[T0](arg0: ⇒ T0): T0

def tail: PathSet[T]

def tails: Iterator[PathSet[T]]

def take(n: Int): PathSet[T]

def takeRight(n: Int): PathSet[T]

def takeWhile(p: (T) ⇒ Boolean): PathSet[T]

def thisCollection: PathSet[T]

def toArray[B >: T](implicit arg0: ClassManifest[B]): Array[B]

def toBuffer[B >: T]: Buffer[B]

def toCollection(repr: PathSet[T]): PathSet[T]

def toIndexedSeq[B >: T]: IndexedSeq[B]

def toIterable: Iterable[T]

def toIterator: Iterator[T]

def toList: List[T]

def toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]

def toSeq: Seq[T]

def toSet[B >: T]: Set[B]

def toStream: Stream[T]

lazy val toString: String

def toTraversable: Traversable[T]

def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

def view(from: Int, until: Int): IterableView[T, PathSet[T]]

def view: IterableView[T, PathSet[T]]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, PathSet[T]]

def zip[A1 >: T, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[PathSet[T], (A1, B), That]): That

def zipAll[B, A1 >: T, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[PathSet[T], (A1, B), That]): That

def zipWithIndex[A1 >: T, That](implicit bf: CanBuildFrom[PathSet[T], (A1, Int), That]): That

def elements: Iterator[T]

def first: T

def firstOption: Option[T]

def projection: IterableView[T, PathSet[T]]