Logo

Programming-Idioms

Create an object x to store n bits (n being potentially large).
New implementation

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.

Other implementations
#include <bitset>
std::bitset<n> x;
#include <bitset>
std::bitset<n> bs;
#include <vector>
std::vector<bool> x(n, 0);
using System.Collections;
new BitArray(n);
import std.bitmanip;
BitArray x;
x.length = n;
import 'package:bit_array/bit_array.dart';
final x = FixedBitArray(n);
x := make([]bool, n)
import "math/big"
var x *big.Int = new(big.Int)
x := make([]uint64, (n+63)/64)
import Data.Bits
x :: Integer
x = sum [bit i | i <- [1..n], wannaset i]
let x = new Buffer (Math.ceil (n / 8))
import java.util.BitSet;
BitSet x = new BitSet(n);
(let ((x (make-array n :element-type 'bit))))
$x = new BitSet($n);
procedure Task;
var
  x: Set Of Byte;
begin
  x:= [2,4,8,16,32,64,256];  
end;
uses classes;
procedure task;
var 
  x: TBits;
  n: integer;
begin 
  n := $FFF;
  x := TBits.Create(n);
end;
vec($x, $n, 1) = 0;
from __future__ import division
import math
x = bytearray(int(math.ceil(n / 8.0)))
x = 0
let mut x = vec![false; n];