blob: bd5855c1deb9d75c98fc324b6564cbc58531f3f4 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
|
/* __ *\
** ________ ___ / / ___ Scala API **
** / __/ __// _ | / / / _ | (c) 2003-2004, LAMP/EPFL **
** __\ \/ /__/ __ |/ /__/ __ | **
** /____/\___/_/ |_/____/_/ | | **
** |/ **
** $Id$
\* */
package scala.collection;
/** The class <code>BitSet</code> ...
*
* @author Burak Emir, Stephane Micheloud
* @version 1.0
*/
[_trait_] abstract class BitSet extends AnyRef with Function1[Int,Boolean] {
/** number of bits in this bitset */
def size: Int;
/** returns true if bit i is set */
def apply(i: Int): Boolean;
/** returns an iterator over the truth values of all bits */
final def booleanElements: Iterator[Boolean] = new Iterator[Boolean] {
var i = 0;
def hasNext: Boolean = i < size;
def next: Boolean = { i = i + 1; apply(i-1) }
}
/**
* Returns the subset of <code>[0..size]</code> whose elements are
* indices of bits set to <code>v</code>.
*
* @param v
*/
final def toSet(v: Boolean) = {
var res = new immutable.TreeSet[Int]();
var j = 0;
while (j < size) {
if (v == apply(j))
res = res + j;
j = j + 1;
}
res
}
/**
* Checks if two bitsets are structurally identical.
*
* @return true, iff both bitsets contain the same sequence of elements.
*/
override def equals(that: Any): Boolean = (
that.isInstanceOf[BitSet] &&
{ val other = that.asInstanceOf[BitSet];
( size == other.size) && (
Iterator.range(0, size) forall { i => apply(i) == other.apply(i)}
)
}
);
/**
* applies f to any index which is set to true.
*/
def foreach(f: Int => Unit): Unit = toSet(true).foreach(f);
/**
* Returns a string representation of this bitset in hexadecimal form,
* e.g. the bitset 001100000001 (12 bits) is represented as "{0, 8, 9}".
*
* @return the string representation for this bitset
*/
override def toString() =
toSet(true).toString();
/** returns number of Int cells needed to store n bits */
protected def memsize(n:Int) = (n >>> 5) + {
if((n & 0x1F) != 0) 1 else 0
};
}
|
