rust/src/libstd/bitv.rs

558 lines
15 KiB
Rust
Raw Normal View History

2012-03-15 16:06:33 -05:00
export bitv;
export union;
export intersect;
export assign;
export clone;
export get;
export equal;
export clear;
export set_all;
export invert;
export difference;
export set;
export is_true;
export is_false;
2011-08-15 18:09:17 -05:00
export to_vec;
export to_str;
2011-08-18 16:32:25 -05:00
export eq_vec;
// FIXME (#2341): With recursive object types, we could implement binary
// methods like union, intersection, and difference. At that point, we could
// write an optimizing version of this module that produces a different obj
// for the case where nbits <= 32.
2012-03-07 20:17:30 -06:00
#[doc = "The bitvector type"]
type bitv = @{storage: [mut uint]/~, nbits: uint};
const uint_bits: uint = 32u + (1u << 32u >> 27u);
2012-03-07 20:17:30 -06:00
#[doc = "
Constructs a bitvector
2012-03-07 20:17:30 -06:00
# Arguments
2012-03-07 20:17:30 -06:00
* nbits - The number of bits in the bitvector
* init - If true then the bits are initialized to 1, otherwise 0
"]
2012-03-15 16:06:33 -05:00
fn bitv(nbits: uint, init: bool) -> bitv {
2011-07-27 07:19:39 -05:00
let elt = if init { !0u } else { 0u };
2012-03-12 17:52:30 -05:00
let storage = vec::to_mut(vec::from_elem(nbits / uint_bits + 1u, elt));
2011-07-27 07:19:39 -05:00
ret @{storage: storage, nbits: nbits};
}
2012-03-15 16:06:33 -05:00
fn process(v0: bitv, v1: bitv, op: fn(uint, uint) -> uint) -> bool {
2011-08-15 18:38:23 -05:00
let len = vec::len(v1.storage);
assert (vec::len(v0.storage) == len);
assert (v0.nbits == v1.nbits);
let mut changed = false;
for uint::range(0u, len) {|i|
let w0 = v0.storage[i];
let w1 = v1.storage[i];
2011-07-27 07:19:39 -05:00
let w = op(w0, w1);
if w0 != w { changed = true; v0.storage[i] = w; }
};
ret changed;
}
2011-10-27 17:35:56 -05:00
2011-07-27 07:19:39 -05:00
fn lor(w0: uint, w1: uint) -> uint { ret w0 | w1; }
2012-03-15 16:06:33 -05:00
fn union(v0: bitv, v1: bitv) -> bool {
let sub = lor; ret process(v0, v1, sub);
}
2011-07-27 07:19:39 -05:00
fn land(w0: uint, w1: uint) -> uint { ret w0 & w1; }
2012-03-07 20:17:30 -06:00
#[doc = "
2011-10-27 17:35:56 -05:00
Calculates the intersection of two bitvectors
2012-03-07 20:17:30 -06:00
Sets `v0` to the intersection of `v0` and `v1`. Both bitvectors must be the
same length. Returns 'true' if `v0` was changed.
"]
2012-03-15 16:06:33 -05:00
fn intersect(v0: bitv, v1: bitv) -> bool {
2011-07-27 07:19:39 -05:00
let sub = land;
ret process(v0, v1, sub);
}
fn right(_w0: uint, w1: uint) -> uint { ret w1; }
2012-03-07 20:17:30 -06:00
#[doc = "
2011-10-27 17:35:56 -05:00
Assigns the value of `v1` to `v0`
2012-03-07 20:17:30 -06:00
Both bitvectors must be the same length. Returns `true` if `v0` was changed
"]
2012-03-15 16:06:33 -05:00
fn assign(v0: bitv, v1: bitv) -> bool {
let sub = right; ret process(v0, v1, sub);
}
2012-03-07 20:17:30 -06:00
#[doc = "Makes a copy of a bitvector"]
2012-03-15 16:06:33 -05:00
fn clone(v: bitv) -> bitv {
2012-03-12 17:52:30 -05:00
let storage = vec::to_mut(vec::from_elem(v.nbits / uint_bits + 1u, 0u));
2011-08-15 18:38:23 -05:00
let len = vec::len(v.storage);
for uint::range(0u, len) {|i| storage[i] = v.storage[i]; };
2011-07-27 07:19:39 -05:00
ret @{storage: storage, nbits: v.nbits};
}
2012-06-07 13:45:59 -05:00
#[doc = "Retrieve the value at index `i`"]
2012-05-31 13:37:39 -05:00
#[inline(always)]
2012-03-15 16:06:33 -05:00
pure fn get(v: bitv, i: uint) -> bool {
assert (i < v.nbits);
let bits = uint_bits;
2011-07-27 07:19:39 -05:00
let w = i / bits;
let b = i % bits;
let x = 1u & v.storage[w] >> b;
ret x == 1u;
}
2012-03-07 20:17:30 -06:00
#[doc = "
2011-10-27 17:35:56 -05:00
Compares two bitvectors
2012-03-07 20:17:30 -06:00
Both bitvectors must be the same length. Returns `true` if both bitvectors
contain identical elements.
"]
2012-03-15 16:06:33 -05:00
fn equal(v0: bitv, v1: bitv) -> bool {
2012-05-31 13:37:39 -05:00
if v0.nbits != v1.nbits { ret false; }
2011-08-15 18:38:23 -05:00
let len = vec::len(v1.storage);
for uint::iterate(0u, len) {|i|
if v0.storage[i] != v1.storage[i] { ret false; }
}
}
2012-03-07 20:17:30 -06:00
#[doc = "Set all bits to 0"]
2012-05-31 13:37:39 -05:00
#[inline(always)]
fn clear(v: bitv) { for each_storage(v) {|w| w = 0u } }
2012-03-07 20:17:30 -06:00
#[doc = "Set all bits to 1"]
2012-05-31 13:37:39 -05:00
#[inline(always)]
fn set_all(v: bitv) { for each_storage(v) {|w| w = !0u } }
2012-03-07 20:17:30 -06:00
#[doc = "Invert all bits"]
2012-05-31 13:37:39 -05:00
#[inline(always)]
fn invert(v: bitv) { for each_storage(v) {|w| w = !w } }
2012-03-07 20:17:30 -06:00
#[doc = "
2011-10-27 17:35:56 -05:00
Calculate the difference between two bitvectors
Sets each element of `v0` to the value of that element minus the element
2012-03-07 20:17:30 -06:00
of `v1` at the same index. Both bitvectors must be the same length.
2012-03-07 20:17:30 -06:00
Returns `true` if `v0` was changed.
"]
2012-03-15 16:06:33 -05:00
fn difference(v0: bitv, v1: bitv) -> bool {
invert(v1);
2011-07-27 07:19:39 -05:00
let b = intersect(v0, v1);
invert(v1);
ret b;
}
2012-03-07 20:17:30 -06:00
#[doc = "
2011-10-27 17:35:56 -05:00
Set the value of a bit at a given index
2012-03-07 20:17:30 -06:00
`i` must be less than the length of the bitvector.
"]
2012-05-31 13:37:39 -05:00
#[inline(always)]
2012-03-15 16:06:33 -05:00
fn set(v: bitv, i: uint, x: bool) {
assert (i < v.nbits);
let bits = uint_bits;
2011-07-27 07:19:39 -05:00
let w = i / bits;
let b = i % bits;
let flag = 1u << b;
v.storage[w] = if x { v.storage[w] | flag } else { v.storage[w] & !flag };
}
2012-03-07 20:17:30 -06:00
#[doc = "Returns true if all bits are 1"]
2012-03-15 16:06:33 -05:00
fn is_true(v: bitv) -> bool {
for each(v) {|i| if !i { ret false; } }
ret true;
}
2012-03-07 20:17:30 -06:00
#[doc = "Returns true if all bits are 0"]
2012-03-15 16:06:33 -05:00
fn is_false(v: bitv) -> bool {
for each(v) {|i| if i { ret false; } }
ret true;
}
2012-03-15 16:06:33 -05:00
fn init_to_vec(v: bitv, i: uint) -> uint {
ret if get(v, i) { 1u } else { 0u };
}
2012-03-07 20:17:30 -06:00
#[doc = "
Converts the bitvector to a vector of uint with the same length.
2011-10-27 17:35:56 -05:00
2012-03-07 20:17:30 -06:00
Each uint in the resulting vector has either value 0u or 1u.
"]
fn to_vec(v: bitv) -> [uint]/~ {
2012-06-19 21:34:01 -05:00
let sub = {|x|init_to_vec(v, x)};
2012-03-12 17:52:30 -05:00
ret vec::from_fn::<uint>(v.nbits, sub);
}
2012-05-31 13:37:39 -05:00
#[inline(always)]
fn each(v: bitv, f: fn(bool) -> bool) {
let mut i = 0u;
while i < v.nbits {
if !f(get(v, i)) { break; }
i = i + 1u;
}
}
2011-10-27 17:35:56 -05:00
2012-05-31 13:37:39 -05:00
#[inline(always)]
fn each_storage(v: bitv, op: fn(&uint) -> bool) {
for uint::range(0u, vec::len(v.storage)) {|i|
let mut w = v.storage[i];
let b = !op(w);
v.storage[i] = w;
if !b { break; }
}
}
2012-03-07 20:17:30 -06:00
#[doc = "
Converts the bitvector to a string.
The resulting string has the same length as the bitvector, and each character
is either '0' or '1'.
"]
2012-03-15 16:06:33 -05:00
fn to_str(v: bitv) -> str {
let mut rs = "";
for each(v) {|i| if i { rs += "1"; } else { rs += "0"; } }
2011-06-24 10:55:02 -05:00
ret rs;
}
2012-03-07 20:17:30 -06:00
#[doc = "
Compare a bitvector to a vector of uint
2011-10-27 17:35:56 -05:00
2012-03-07 20:17:30 -06:00
The uint vector is expected to only contain the values 0u and 1u. Both the
bitvector and vector must have the same length
"]
fn eq_vec(v0: bitv, v1: [uint]/~) -> bool {
assert (v0.nbits == vec::len::<uint>(v1));
2011-07-27 07:19:39 -05:00
let len = v0.nbits;
let mut i = 0u;
2011-07-27 07:19:39 -05:00
while i < len {
let w0 = get(v0, i);
let w1 = v1[i];
2011-07-27 07:19:39 -05:00
if !w0 && w1 != 0u || w0 && w1 == 0u { ret false; }
i = i + 1u;
}
ret true;
}
2012-01-17 21:05:07 -06:00
#[cfg(test)]
mod tests {
#[test]
fn test_to_str() {
let zerolen = bitv(0u, false);
assert to_str(zerolen) == "";
let eightbits = bitv(8u, false);
assert to_str(eightbits) == "00000000";
}
2012-01-17 21:05:07 -06:00
#[test]
fn test_0_elements() {
let mut act;
let mut exp;
2012-03-15 16:06:33 -05:00
act = bitv(0u, false);
2012-03-12 17:52:30 -05:00
exp = vec::from_elem::<uint>(0u, 0u);
2012-01-17 21:05:07 -06:00
assert (eq_vec(act, exp));
}
#[test]
fn test_1_element() {
let mut act;
2012-03-15 16:06:33 -05:00
act = bitv(1u, false);
assert (eq_vec(act, [0u]/~));
2012-03-15 16:06:33 -05:00
act = bitv(1u, true);
assert (eq_vec(act, [1u]/~));
2012-01-17 21:05:07 -06:00
}
#[test]
fn test_10_elements() {
let mut act;
2012-01-17 21:05:07 -06:00
// all 0
2012-03-15 16:06:33 -05:00
act = bitv(10u, false);
assert (eq_vec(act, [0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u]/~));
2012-01-17 21:05:07 -06:00
// all 1
2012-03-15 16:06:33 -05:00
act = bitv(10u, true);
assert (eq_vec(act, [1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u]/~));
2012-01-17 21:05:07 -06:00
// mixed
2012-03-15 16:06:33 -05:00
act = bitv(10u, false);
2012-01-17 21:05:07 -06:00
set(act, 0u, true);
set(act, 1u, true);
set(act, 2u, true);
set(act, 3u, true);
set(act, 4u, true);
assert (eq_vec(act, [1u, 1u, 1u, 1u, 1u, 0u, 0u, 0u, 0u, 0u]/~));
2012-01-17 21:05:07 -06:00
// mixed
2012-03-15 16:06:33 -05:00
act = bitv(10u, false);
2012-01-17 21:05:07 -06:00
set(act, 5u, true);
set(act, 6u, true);
set(act, 7u, true);
set(act, 8u, true);
set(act, 9u, true);
assert (eq_vec(act, [0u, 0u, 0u, 0u, 0u, 1u, 1u, 1u, 1u, 1u]/~));
2012-01-17 21:05:07 -06:00
// mixed
2012-03-15 16:06:33 -05:00
act = bitv(10u, false);
2012-01-17 21:05:07 -06:00
set(act, 0u, true);
set(act, 3u, true);
set(act, 6u, true);
set(act, 9u, true);
assert (eq_vec(act, [1u, 0u, 0u, 1u, 0u, 0u, 1u, 0u, 0u, 1u]/~));
2012-01-17 21:05:07 -06:00
}
#[test]
fn test_31_elements() {
let mut act;
2012-01-17 21:05:07 -06:00
// all 0
2012-03-15 16:06:33 -05:00
act = bitv(31u, false);
2012-01-17 21:05:07 -06:00
assert (eq_vec(act,
[0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u,
0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u,
0u, 0u, 0u, 0u, 0u]/~));
2012-01-17 21:05:07 -06:00
// all 1
2012-03-15 16:06:33 -05:00
act = bitv(31u, true);
2012-01-17 21:05:07 -06:00
assert (eq_vec(act,
[1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u,
1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u,
1u, 1u, 1u, 1u, 1u]/~));
2012-01-17 21:05:07 -06:00
// mixed
2012-03-15 16:06:33 -05:00
act = bitv(31u, false);
2012-01-17 21:05:07 -06:00
set(act, 0u, true);
set(act, 1u, true);
set(act, 2u, true);
set(act, 3u, true);
set(act, 4u, true);
set(act, 5u, true);
set(act, 6u, true);
set(act, 7u, true);
assert (eq_vec(act,
[1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 0u, 0u, 0u, 0u, 0u,
0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u,
0u, 0u, 0u, 0u, 0u]/~));
2012-01-17 21:05:07 -06:00
// mixed
2012-03-15 16:06:33 -05:00
act = bitv(31u, false);
2012-01-17 21:05:07 -06:00
set(act, 16u, true);
set(act, 17u, true);
set(act, 18u, true);
set(act, 19u, true);
set(act, 20u, true);
set(act, 21u, true);
set(act, 22u, true);
set(act, 23u, true);
assert (eq_vec(act,
[0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u,
0u, 0u, 0u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 0u, 0u,
0u, 0u, 0u, 0u, 0u]/~));
2012-01-17 21:05:07 -06:00
// mixed
2012-03-15 16:06:33 -05:00
act = bitv(31u, false);
2012-01-17 21:05:07 -06:00
set(act, 24u, true);
set(act, 25u, true);
set(act, 26u, true);
set(act, 27u, true);
set(act, 28u, true);
set(act, 29u, true);
set(act, 30u, true);
assert (eq_vec(act,
[0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u,
0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 1u, 1u,
1u, 1u, 1u, 1u, 1u]/~));
2012-01-17 21:05:07 -06:00
// mixed
2012-03-15 16:06:33 -05:00
act = bitv(31u, false);
2012-01-17 21:05:07 -06:00
set(act, 3u, true);
set(act, 17u, true);
set(act, 30u, true);
assert (eq_vec(act,
[0u, 0u, 0u, 1u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u,
0u, 0u, 0u, 0u, 1u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u,
0u, 0u, 0u, 0u, 1u]/~));
2012-01-17 21:05:07 -06:00
}
#[test]
fn test_32_elements() {
let mut act;
2012-01-17 21:05:07 -06:00
// all 0
2012-03-15 16:06:33 -05:00
act = bitv(32u, false);
2012-01-17 21:05:07 -06:00
assert (eq_vec(act,
[0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u,
0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u,
0u, 0u, 0u, 0u, 0u, 0u]/~));
2012-01-17 21:05:07 -06:00
// all 1
2012-03-15 16:06:33 -05:00
act = bitv(32u, true);
2012-01-17 21:05:07 -06:00
assert (eq_vec(act,
[1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u,
1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u,
1u, 1u, 1u, 1u, 1u, 1u]/~));
2012-01-17 21:05:07 -06:00
// mixed
2012-03-15 16:06:33 -05:00
act = bitv(32u, false);
2012-01-17 21:05:07 -06:00
set(act, 0u, true);
set(act, 1u, true);
set(act, 2u, true);
set(act, 3u, true);
set(act, 4u, true);
set(act, 5u, true);
set(act, 6u, true);
set(act, 7u, true);
assert (eq_vec(act,
[1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 0u, 0u, 0u, 0u, 0u,
0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u,
0u, 0u, 0u, 0u, 0u, 0u]/~));
2012-01-17 21:05:07 -06:00
// mixed
2012-03-15 16:06:33 -05:00
act = bitv(32u, false);
2012-01-17 21:05:07 -06:00
set(act, 16u, true);
set(act, 17u, true);
set(act, 18u, true);
set(act, 19u, true);
set(act, 20u, true);
set(act, 21u, true);
set(act, 22u, true);
set(act, 23u, true);
assert (eq_vec(act,
[0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u,
0u, 0u, 0u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 0u, 0u,
0u, 0u, 0u, 0u, 0u, 0u]/~));
2012-01-17 21:05:07 -06:00
// mixed
2012-03-15 16:06:33 -05:00
act = bitv(32u, false);
2012-01-17 21:05:07 -06:00
set(act, 24u, true);
set(act, 25u, true);
set(act, 26u, true);
set(act, 27u, true);
set(act, 28u, true);
set(act, 29u, true);
set(act, 30u, true);
set(act, 31u, true);
assert (eq_vec(act,
[0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u,
0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 1u, 1u,
1u, 1u, 1u, 1u, 1u, 1u]/~));
2012-01-17 21:05:07 -06:00
// mixed
2012-03-15 16:06:33 -05:00
act = bitv(32u, false);
2012-01-17 21:05:07 -06:00
set(act, 3u, true);
set(act, 17u, true);
set(act, 30u, true);
set(act, 31u, true);
assert (eq_vec(act,
[0u, 0u, 0u, 1u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u,
0u, 0u, 0u, 0u, 1u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u,
0u, 0u, 0u, 0u, 1u, 1u]/~));
2012-01-17 21:05:07 -06:00
}
#[test]
fn test_33_elements() {
let mut act;
2012-01-17 21:05:07 -06:00
// all 0
2012-03-15 16:06:33 -05:00
act = bitv(33u, false);
2012-01-17 21:05:07 -06:00
assert (eq_vec(act,
[0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u,
0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u,
0u, 0u, 0u, 0u, 0u, 0u, 0u]/~));
2012-01-17 21:05:07 -06:00
// all 1
2012-03-15 16:06:33 -05:00
act = bitv(33u, true);
2012-01-17 21:05:07 -06:00
assert (eq_vec(act,
[1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u,
1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u,
1u, 1u, 1u, 1u, 1u, 1u, 1u]/~));
2012-01-17 21:05:07 -06:00
// mixed
2012-03-15 16:06:33 -05:00
act = bitv(33u, false);
2012-01-17 21:05:07 -06:00
set(act, 0u, true);
set(act, 1u, true);
set(act, 2u, true);
set(act, 3u, true);
set(act, 4u, true);
set(act, 5u, true);
set(act, 6u, true);
set(act, 7u, true);
assert (eq_vec(act,
[1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 0u, 0u, 0u, 0u, 0u,
0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u,
0u, 0u, 0u, 0u, 0u, 0u, 0u]/~));
2012-01-17 21:05:07 -06:00
// mixed
2012-03-15 16:06:33 -05:00
act = bitv(33u, false);
2012-01-17 21:05:07 -06:00
set(act, 16u, true);
set(act, 17u, true);
set(act, 18u, true);
set(act, 19u, true);
set(act, 20u, true);
set(act, 21u, true);
set(act, 22u, true);
set(act, 23u, true);
assert (eq_vec(act,
[0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u,
0u, 0u, 0u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 1u, 0u, 0u,
0u, 0u, 0u, 0u, 0u, 0u, 0u]/~));
2012-01-17 21:05:07 -06:00
// mixed
2012-03-15 16:06:33 -05:00
act = bitv(33u, false);
2012-01-17 21:05:07 -06:00
set(act, 24u, true);
set(act, 25u, true);
set(act, 26u, true);
set(act, 27u, true);
set(act, 28u, true);
set(act, 29u, true);
set(act, 30u, true);
set(act, 31u, true);
assert (eq_vec(act,
[0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u,
0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 1u, 1u,
1u, 1u, 1u, 1u, 1u, 1u, 0u]/~));
2012-01-17 21:05:07 -06:00
// mixed
2012-03-15 16:06:33 -05:00
act = bitv(33u, false);
2012-01-17 21:05:07 -06:00
set(act, 3u, true);
set(act, 17u, true);
set(act, 30u, true);
set(act, 31u, true);
set(act, 32u, true);
assert (eq_vec(act,
[0u, 0u, 0u, 1u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u,
0u, 0u, 0u, 0u, 1u, 0u, 0u, 0u, 0u, 0u, 0u, 0u, 0u,
0u, 0u, 0u, 0u, 1u, 1u, 1u]/~));
2012-01-17 21:05:07 -06:00
}
2012-05-31 13:37:39 -05:00
#[test]
fn test_equal_differing_sizes() {
let v0 = bitv(10u, false);
let v1 = bitv(11u, false);
assert !equal(v0, v1);
}
#[test]
fn test_equal_greatly_differing_sizes() {
let v0 = bitv(10u, false);
let v1 = bitv(110u, false);
assert !equal(v0, v1);
}
2012-01-17 21:05:07 -06:00
}
//
// Local Variables:
// mode: rust
// fill-column: 78;
// indent-tabs-mode: nil
// c-basic-offset: 4
// buffer-file-coding-system: utf-8-unix
// End:
//