object SetUtils
- Source
- SetUtils.scala
- Alphabetic
- By Inheritance
- SetUtils
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native() @HotSpotIntrinsicCandidate()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
pSet[A](set: Set[A]): LazyList[(Set[A], Set[A])]
Tail recursive pSet pSet s generates the power set of s, pairing each subset with its complement.
Tail recursive pSet pSet s generates the power set of s, pairing each subset with its complement. Example: pSet(Set(1,2)) = Stream((Set(1,2),Set()),(Set(1),Set(2)),(Set(2),Set(1)),(Set(),Set(1,2))).
-
def
partition[A](set: Set[A], n: Int): LazyList[List[Set[A]]]
paritition of a set in n sets whose union give that set again Example: partition(Set(1,2),2) = Stream( List(Set(1, 2), Set[Int]()), List(Set(2), Set(1)), List(Set(1), Set(2)), List(Set[Int](), Set(1, 2)) )
paritition of a set in n sets whose union give that set again Example: partition(Set(1,2),2) = Stream( List(Set(1, 2), Set[Int]()), List(Set(2), Set(1)), List(Set(1), Set(2)), List(Set[Int](), Set(1, 2)) )
partition(Set(1,2),3) = Stream( List(Set(1, 2), Set[Int](), Set[Int]()), List(Set(2), Set(1), Set[Int]()), List(Set(2), Set[Int](), Set(1)), List(Set(1), Set(2), Set[Int]()), List(Set(1), Set[Int](), Set(2)), List(Set[Int](), Set(1, 2), Set[Int]()), List(Set[Int](), Set(2), Set(1)), List(Set[Int](), Set(1), Set(2)), List(Set[Int](), Set[Int](), Set(1, 2)) )
- A
type of values
- set
set of elements
- n
number of sets to generate
- returns
a list of sets
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
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()
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )