Be concise.
Be useful.
All contributions dictatorially edited by webmasters to match personal tastes.
Please do not paste any copyright violating material.
Please try to avoid dependencies to third-party libraries and frameworks.
x := make([]uint64, (n+63)/64)This compact bitset requires some extra logic to implement get, set, clear (see demo).
x := make([]bool, n)This makes a simple fixed-size bitset.
It uses more bits in memory than the useful size n.
It uses more bits in memory than the useful size n.
let x = new Buffer (Math.ceil (n / 8))Buffers allocate bytes, so we divide n by 8 and take the ceiling of n
(let ((x (make-array n :element-type 'bit))))$x = new BitSet($n);Required BitSet PECL Package
procedure Task;
var
x: Set Of Byte;
begin
x:= [2,4,8,16,32,64,256];
end;when the set contains less than 256 elements the built-in Set Of construct can be used.
procedure task;
var
x: TBits;
n: integer;
begin
n := $FFF;
x := TBits.Create(n);
end;when the set contains more than 256 elements the class TBits must be used
vec($x, $n, 1) = 0;Creates bitset (containing all zeros) of $n bits (rounded up to the nearest multiple of 8). To extend it, just set another 0 (or 1) bit at the new width you want.
class BitSet:
def __init__(self, n):
self.a = [False] * n
def __getitem__(self, i):
return self.a[i]
def __setitem__(self, k, v):
self.a[k] = v
def __str__(self):
s = ('01'[x] for x in self.a)
return ''.join(s)
x = BitSet(n)x = 0Integers are promoted automatically to hold (almost) any number of bits