final class RemoteSetSyntax[A] extends AnyRef
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- RemoteSetSyntax
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- def &(that: Remote[Set[A]]): Remote[Set[A]]
- def &~(that: Remote[Set[A]]): Remote[Set[A]]
- def +(elem: Remote[A]): Remote[Set[A]]
- def ++[B >: A](that: Remote[List[B]]): Remote[Set[B]]
- def -(elem: Remote[A]): Remote[Set[A]]
- def --(that: Remote[List[A]]): Remote[Set[A]]
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def apply(elem: Remote[A]): Remote[Boolean]
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
- def concat[B >: A](that: Remote[List[B]]): Remote[Set[B]]
- def contains(elem: Remote[A]): Remote[Boolean]
- def corresponds[B](that: Remote[List[B]])(p: (Remote[A], Remote[B]) ⇒ Remote[Boolean]): Remote[Boolean]
- def count(p: (Remote[A]) ⇒ Remote[Boolean]): Remote[Int]
- def diff(that: Remote[Set[A]]): Remote[Set[A]]
- def drop(n: Remote[Int]): Remote[Set[A]]
- def dropRight(n: Remote[Int]): Remote[Set[A]]
- def dropWhile(predicate: (Remote[A]) ⇒ Remote[Boolean]): Remote[Set[A]]
- def empty: Remote[Set[A]]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def excl(elem: Remote[A]): Remote[Set[A]]
- def exists(p: (Remote[A]) ⇒ Remote[Boolean]): Remote[Boolean]
- def filter(predicate: (Remote[A]) ⇒ Remote[Boolean]): Remote[Set[A]]
- def filterNot(predicate: (Remote[A]) ⇒ Remote[Boolean]): Remote[Set[A]]
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- def find(p: (Remote[A]) ⇒ Remote[Boolean]): Remote[Option[A]]
- def flatMap[B](f: (Remote[A]) ⇒ Remote[Set[B]]): Remote[Set[B]]
- def flatten[B](implicit ev: <:<[A, Set[B]]): Remote[Set[B]]
- def fold[B](initial: Remote[B])(f: (Remote[B], Remote[A]) ⇒ Remote[B]): Remote[B]
- def foldLeft[B](initial: Remote[B])(f: (Remote[B], Remote[A]) ⇒ Remote[B]): Remote[B]
- def foldRight[B](initial: Remote[B])(f: (Remote[A], Remote[B]) ⇒ Remote[B]): Remote[B]
- def forall(p: (Remote[A]) ⇒ Remote[Boolean]): Remote[Boolean]
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def groupBy[K](f: (Remote[A]) ⇒ Remote[K]): Remote[Map[K, Set[A]]]
- def groupMap[K, B](key: (Remote[A]) ⇒ Remote[K])(f: (Remote[A]) ⇒ Remote[B]): Remote[Map[K, Set[B]]]
- def groupMapReduce[K, B](key: (Remote[A]) ⇒ Remote[K])(f: (Remote[A]) ⇒ Remote[B])(reduce: (Remote[B], Remote[B]) ⇒ Remote[B]): Remote[Map[K, B]]
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def head: Remote[A]
- def headOption: Remote[Option[A]]
- def incl(elem: Remote[A]): Remote[Set[A]]
- def init: Remote[Set[A]]
- def inits: Remote[List[Set[A]]]
- def intersect(that: Remote[Set[A]]): Remote[Set[A]]
- def isEmpty: Remote[Boolean]
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def last: Remote[A]
- def lastOption: Remote[Option[A]]
- def map[B](f: (Remote[A]) ⇒ Remote[B]): Remote[Set[B]]
- def max(implicit schema: Schema[A]): Remote[A]
- def maxBy[B](f: (Remote[A]) ⇒ Remote[B])(implicit schema: Schema[B]): Remote[A]
- def maxByOption[B](f: (Remote[A]) ⇒ Remote[B])(implicit schema: Schema[B]): Remote[Option[A]]
- def maxOption(implicit schema: Schema[A]): Remote[Option[A]]
- def min(implicit schema: Schema[A]): Remote[A]
- def minBy[B](f: (Remote[A]) ⇒ Remote[B])(implicit schema: Schema[B]): Remote[A]
- def minByOption[B](f: (Remote[A]) ⇒ Remote[B])(implicit schema: Schema[B]): Remote[Option[A]]
- def minOption(implicit schema: Schema[A]): Remote[Option[A]]
- def mkString(start: Remote[String], sep: Remote[String], end: Remote[String])(implicit schema: Schema[A]): Remote[String]
- def mkString(sep: Remote[String])(implicit schema: Schema[A]): Remote[String]
- def mkString(implicit schema: Schema[A]): Remote[String]
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def nonEmpty: Remote[Boolean]
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def partition(p: (Remote[A]) ⇒ Remote[Boolean]): Remote[(Set[A], Set[A])]
- def partitionMap[A1, A2](p: (Remote[A]) ⇒ Remote[Either[A1, A2]]): Remote[(Set[A1], Set[A2])]
- def product(implicit numeric: Numeric[A]): Remote[A]
- def reduce[B >: A](op: (Remote[B], Remote[B]) ⇒ Remote[B]): Remote[B]
- def reduceLeft[B >: A](op: (Remote[B], Remote[A]) ⇒ Remote[B]): Remote[B]
- def reduceLeftOption[B >: A](op: (Remote[B], Remote[A]) ⇒ Remote[B]): Remote[Option[B]]
- def reduceOption[B >: A](op: (Remote[B], Remote[B]) ⇒ Remote[B]): Remote[Option[B]]
- def reduceRight[B >: A](op: (Remote[A], Remote[B]) ⇒ Remote[B]): Remote[B]
- def reduceRightOption[B >: A](op: (Remote[A], Remote[B]) ⇒ Remote[B]): Remote[Option[B]]
- def removedAll(that: Remote[List[A]]): Remote[Set[A]]
- def scan[B >: A](z: Remote[B])(op: (Remote[B], Remote[B]) ⇒ Remote[B]): Remote[Set[B]]
- def scanLeft[B >: A](z: Remote[B])(op: (Remote[B], Remote[A]) ⇒ Remote[B]): Remote[Set[B]]
- def scanRight[B >: A](z: Remote[B])(op: (Remote[A], Remote[B]) ⇒ Remote[B]): Remote[Set[B]]
- val self: Remote[Set[A]]
- def size: Remote[Int]
- def slice(from: Remote[Int], until: Remote[Int]): Remote[Set[A]]
- def sliding(size: Remote[Int]): Remote[List[Set[A]]]
- def sliding(size: Remote[Int], step: Remote[Int]): Remote[List[Set[A]]]
- def span(p: (Remote[A]) ⇒ Remote[Boolean]): Remote[(Set[A], Set[A])]
- def splitAt(n: Remote[Int]): Remote[(Set[A], Set[A])]
- def subsetOf(that: Remote[Set[A]]): Remote[Boolean]
- def sum(implicit numeric: Numeric[A]): Remote[A]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- def tail: Remote[Set[A]]
- def tails: Remote[List[Set[A]]]
- def take(n: Remote[Int]): Remote[Set[A]]
- def takeRight(n: Remote[Int]): Remote[Set[A]]
- def takeWhile(p: (Remote[A]) ⇒ Remote[Boolean]): Remote[Set[A]]
- def toList: Remote[List[A]]
- def toMap[K, V](implicit ev: <:<[A, (K, V)]): Remote[Map[K, V]]
- def toSet: Remote[Set[A]]
-
def
toString(): String
- Definition Classes
- AnyRef → Any
- def union(that: Remote[Set[A]]): Remote[Set[A]]
- def unzip[A1, A2](implicit ev: =:=[A, (A1, A2)]): Remote[(Set[A1], Set[A2])]
- def unzip3[A1, A2, A3](implicit ev: =:=[A, (A1, A2, A3)]): Remote[(Set[A1], Set[A2], Set[A3])]
-
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
- @throws( ... ) @native()
- def zip[B](that: Remote[Set[B]]): Remote[Set[(A, B)]]
- def zipAll[B](that: Remote[List[B]], thisElem: Remote[A], thatElem: Remote[B]): Remote[Set[(A, B)]]
- def zipWithIndex: Remote[Set[(A, Int)]]
- def |(that: Remote[Set[A]]): Remote[Set[A]]