Logo

Programming-Idioms

  • Scala
  • C#
  • Python
  • Elixir

Idiom #275 Binary digits to byte array

From the string s consisting of 8n binary digit characters ('0' or '1'), build the equivalent array a of n bytes.
Each chunk of 8 binary digits (2 possible values per digit) is decoded into one byte (256 possible values).

using System;
using System.Linq;
var a = Enumerable.Range(0, s.Length / 8)
        .Select(i => s.Substring(i * 8, 8).ToCharArray())
        .Select(block => (byte)block.Aggregate(0, (acc, c) => (acc << 1) + (c - '0')))
        .ToArray();
f = lambda x: int(s[x:x + 8], 2)
a = [*map(f, range(0, len(s), 8))]
from re import findall
p = findall('.{8}', s)
a = bytes(int(x, 2) for x in p)
n = (len(s) - 1) // 8 + 1
a = bytearray(n)
for i in range(n):
    b = int(s[i * 8:(i + 1) * 8], 2)
    a[i] = b

import re
p = re.findall('.{8}', s)
a = [*map(lambda x: int(x, 2), p)]
from itertools import batched
f = lambda x: int(''.join(x), 2)
a = [*map(f, batched(s, 8))]

The `batched` function is from Python 3.12+.
#include <stdlib.h>
#include <string.h>
unsigned char *a = calloc(strlen(s) / 8, 1);
for(int i = 0; i < strlen(s); ++i){
  a[i / 8] |= (s[i] == '1') << (7 - i % 8);
}

If s is not 8n characters long or contains characters orher than '0' and '1', correct behavior is not guaranteed.
New implementation...
< > ⌨
programming-idioms.org 
var a = Enumerable.Range(0, s.Length / 8)
        .Select(i => s.Substring(i * 8, 8).ToCharArray())
        .Select(block => (byte)block.Aggregate(0, (acc, c) => (acc << 1) + (c - '0')))
        .ToArray();
f = lambda x: int(s[x:x + 8], 2)
a = [*map(f, range(0, len(s), 8))]
p = findall('.{8}', s)
a = bytes(int(x, 2) for x in p)
n = (len(s) - 1) // 8 + 1
a = bytearray(n)
for i in range(n):
    b = int(s[i * 8:(i + 1) * 8], 2)
    a[i] = b

p = re.findall('.{8}', s)
a = [*map(lambda x: int(x, 2), p)]
f = lambda x: int(''.join(x), 2)
a = [*map(f, batched(s, 8))]
unsigned char *a = calloc(strlen(s) / 8, 1);
for(int i = 0; i < strlen(s); ++i){
  a[i / 8] |= (s[i] == '1') << (7 - i % 8);
}
const size_t n = s.length() / 8;

vector<uint8_t> a(n);

for(size_t block = 0; block < n; block++)
{
    uint8_t acc = 0;
    const size_t start = block * 8;
    for(size_t offset = start; offset < start + 8; offset++)
    {
        acc = (acc << 1) + (s[offset] - '0');
    }

    a[block] = acc;
}
  subroutine to_s (s, a)
    use iso_fortran_env, only: int8
    character (len=*), intent(in) :: s
    integer (kind=int8), allocatable, intent(out), dimension(:) :: a
    allocate (a(len(s)/8))
    read (unit=s,fmt='(*(B8.8))') a
  end subroutine to_s
n := len(s) / 8
a := make([]byte, n)
for i := range a {
	b, err := strconv.ParseInt(s[i*8:i*8+8], 2, 0)
	if err != nil {
		log.Fatal(err)
	}
	a[i] = byte(b)
}
int i, m = s.length(), n = (m + 1) / 8, t;
byte a[] = new byte[n];
for (i = 0; i < m; i = i + 8) {
    t = parseInt(s.substring(i, i + 8), 2);
    a[i / 8] = (byte) t;
}
  Size := Length(S) div 8;
  SetLength(a, Size);
  for i := 0 to Size - 1 do
  begin
    SBin := '%' + Copy(S, 1+(i*8), 8);
    Val(SBin, a[i], Err);
    if (Err <> 0) then
      RunError(106);  
  end;

my $s = '1000' . '0010' . '0101' . '1010';   # AZ

my @a;
for ( my $i = 0; $i < length $s; $i += 8) {
    my @b = pack 'b8', substr($s, $i, 8);
    push @a, @b;
}

a = s.scan(/[01]{8}/).map{|slice| slice.to_i(2).to_s(16).rjust(2, "0")}

let a: Vec<u8> = s.as_bytes()
    .chunks(8)
    .map(|chunk| unsafe {
        let chunk_str = std::str::from_utf8_unchecked(chunk);
        u8::from_str_radix(chunk_str, 2).unwrap_unchecked()
    })
    .collect();