class
AccessSet extends Set[AccessMode]
Instance Constructors
-
new
AccessSet(owner: Path)
Type Members
-
-
class
WithFilter extends FilterMonadic[A, Repr]
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
-
-
-
-
-
def
++[B >: AccessMode, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[AccessMode], B, That]): That
-
def
++:[B >: AccessMode, That](that: Traversable[B])(implicit bf: CanBuildFrom[Set[AccessMode], B, That]): That
-
def
++:[B >: AccessMode, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Set[AccessMode], B, That]): That
-
def
++=(xs: TraversableOnce[AccessMode]): AccessSet.this.type
-
-
-
-
-
-
def
--=(xs: TraversableOnce[AccessMode]): AccessSet.this.type
-
-
-
def
/:[B](z: B)(op: (B, AccessMode) ⇒ B): B
-
def
:\[B](z: B)(op: (AccessMode, B) ⇒ B): B
-
def
<<(cmd: Message[AccessMode]): Unit
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
def
add(elem: AccessMode): 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, AccessMode) ⇒ B, combop: (B, B) ⇒ B): B
-
def
andThen[A](g: (Boolean) ⇒ A): (AccessMode) ⇒ A
-
def
apply(elem: AccessMode): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
canEqual(that: Any): Boolean
-
def
clear(): Unit
-
-
def
collect[B, That](pf: PartialFunction[AccessMode, B])(implicit bf: CanBuildFrom[Set[AccessMode], B, That]): That
-
def
collectFirst[B](pf: PartialFunction[AccessMode, B]): Option[B]
-
def
companion: GenericCompanion[Set]
-
def
compose[A](g: (A) ⇒ AccessMode): (A) ⇒ Boolean
-
def
contains(elem: AccessMode): Boolean
-
def
copyToArray[B >: AccessMode](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: AccessMode](xs: Array[B]): Unit
-
def
copyToArray[B >: AccessMode](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: AccessMode](dest: Buffer[B]): Unit
-
def
count(p: (AccessMode) ⇒ Boolean): Int
-
-
def
drop(n: Int): Set[AccessMode]
-
def
dropRight(n: Int): Set[AccessMode]
-
-
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(that: Any): Boolean
-
def
exists(p: (AccessMode) ⇒ Boolean): Boolean
-
-
-
def
finalize(): Unit
-
-
def
flatMap[B, That](f: (AccessMode) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[AccessMode], B, That]): That
-
def
flatten[B](implicit asTraversable: (AccessMode) ⇒ GenTraversableOnce[B]): Set[B]
-
def
fold[A1 >: AccessMode](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, AccessMode) ⇒ B): B
-
def
foldRight[B](z: B)(op: (AccessMode, B) ⇒ B): B
-
def
forall(p: (AccessMode) ⇒ Boolean): Boolean
-
def
foreach[U](f: (AccessMode) ⇒ U): Unit
-
def
genericBuilder[B]: Builder[B, Set[B]]
-
final
def
getClass(): Class[_]
-
-
def
grouped(size: Int): Iterator[Set[AccessMode]]
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
-
def
headOption: Option[AccessMode]
-
-
def
inits: Iterator[Set[AccessMode]]
-
-
def
isEmpty: Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
isTraversableAgain: Boolean
-
def
iterator: Iterator[AccessMode]
-
-
def
lastOption: Option[AccessMode]
-
def
map[B, That](f: (AccessMode) ⇒ B)(implicit bf: CanBuildFrom[Set[AccessMode], B, That]): That
-
def
mapResult[NewTo](f: (Set[AccessMode]) ⇒ NewTo): Builder[AccessMode, NewTo]
-
def
max[B >: AccessMode](implicit cmp: Ordering[B]): AccessMode
-
def
maxBy[B](f: (AccessMode) ⇒ B)(implicit cmp: Ordering[B]): AccessMode
-
def
min[B >: AccessMode](implicit cmp: Ordering[B]): AccessMode
-
def
minBy[B](f: (AccessMode) ⇒ B)(implicit cmp: Ordering[B]): AccessMode
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
final
def
ne(arg0: AnyRef): Boolean
-
-
def
nonEmpty: Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
-
-
-
def
product[B >: AccessMode](implicit num: Numeric[B]): B
-
def
reduce[A1 >: AccessMode](op: (A1, A1) ⇒ A1): A1
-
-
def
reduceLeftOption[B >: AccessMode](op: (B, AccessMode) ⇒ B): Option[B]
-
def
reduceOption[A1 >: AccessMode](op: (A1, A1) ⇒ A1): Option[A1]
-
-
def
reduceRightOption[B >: AccessMode](op: (AccessMode, B) ⇒ B): Option[B]
-
def
remove(elem: AccessMode): Boolean
-
-
-
def
retain(p: (AccessMode) ⇒ Boolean): Unit
-
-
def
sameElements[B >: AccessMode](that: GenIterable[B]): Boolean
-
def
scan[B >: AccessMode, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Set[AccessMode], B, That]): That
-
def
scanLeft[B, That](z: B)(op: (B, AccessMode) ⇒ B)(implicit bf: CanBuildFrom[Set[AccessMode], B, That]): That
-
def
scanRight[B, That](z: B)(op: (AccessMode, B) ⇒ B)(implicit bf: CanBuildFrom[Set[AccessMode], B, That]): That
-
-
def
size: Int
-
def
sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
-
def
sizeHint(coll: TraversableLike[_, _]): Unit
-
def
sizeHint(size: Int): Unit
-
def
sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
-
def
slice(from: Int, until: Int): Set[AccessMode]
-
def
sliding(size: Int, step: Int): Iterator[Set[AccessMode]]
-
def
sliding(size: Int): Iterator[Set[AccessMode]]
-
-
-
def
stringPrefix: String
-
def
subsetOf(that: GenSet[AccessMode]): Boolean
-
def
subsets: Iterator[Set[AccessMode]]
-
def
subsets(len: Int): Iterator[Set[AccessMode]]
-
def
sum[B >: AccessMode](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
def
tails: Iterator[Set[AccessMode]]
-
def
take(n: Int): Set[AccessMode]
-
def
takeRight(n: Int): Set[AccessMode]
-
-
def
thisCollection: Iterable[AccessMode]
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, AccessMode, Col[AccessMode]]): Col[AccessMode]
-
def
toArray[B >: AccessMode](implicit arg0: ClassTag[B]): Array[B]
-
def
toBuffer[A1 >: AccessMode]: Buffer[A1]
-
def
toCollection(repr: Set[AccessMode]): Iterable[AccessMode]
-
def
toIndexedSeq: IndexedSeq[AccessMode]
-
def
toIterable: Iterable[AccessMode]
-
def
toIterator: Iterator[AccessMode]
-
-
def
toMap[T, U](implicit ev: <:<[AccessMode, (T, U)]): Map[T, U]
-
-
def
toSet[B >: AccessMode]: Set[B]
-
def
toStream: Stream[AccessMode]
-
def
toString(): String
-
def
toTraversable: Traversable[AccessMode]
-
def
toVector: Vector[AccessMode]
-
def
transpose[B](implicit asTraversable: (AccessMode) ⇒ GenTraversableOnce[B]): Set[Set[B]]
-
-
def
unzip[A1, A2](implicit asPair: (AccessMode) ⇒ (A1, A2)): (Set[A1], Set[A2])
-
def
unzip3[A1, A2, A3](implicit asTriple: (AccessMode) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
-
def
update(elem: AccessMode, included: Boolean): Unit
-
def
view(from: Int, until: Int): IterableView[AccessMode, Set[AccessMode]]
-
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
-
def
zip[A1 >: AccessMode, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Set[AccessMode], (A1, B), That]): That
-
def
zipAll[B, A1 >: AccessMode, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Set[AccessMode], (A1, B), That]): That
-
def
zipWithIndex[A1 >: AccessMode, That](implicit bf: CanBuildFrom[Set[AccessMode], (A1, Int), That]): That
-
Deprecated Value Members
-
def
/:\[A1 >: AccessMode](z: A1)(op: (A1, A1) ⇒ A1): A1
Inherited from Cloneable
Inherited from Cloneable
Inherited from Clearable
Inherited from GenericSetTemplate[AccessMode, Set]
Inherited from Equals
Inherited from Mutable
Inherited from GenericTraversableTemplate[AccessMode, Set]
Inherited from HasNewBuilder[AccessMode, scala.collection.mutable.Set[scalax.file.Path.AccessModes.AccessMode] @scala.annotation.unchecked.uncheckedVariance]
Inherited from AnyRef
Inherited from Any