I'm looking for the faster way to convert char 2 Bin and Bin 2 char (8bits)

[DarkGoth]

I've seen many means to return the bin value of an integer and a question came to me ...
How can i convert a char 2 bin and bin 2 char?
typing char2bin(a) --> 001000001 (not 1000001)

I have found some solutions to this one but i guess there's a better one ...
i guess in one line.
I have made some test for the contrary : bin 2 char, but a problem came to me : it returns me the ascii value.
I have made a pack "C" then ...
but i'd like a quicker and easier solution.

so, if you'v got an idee ... i would be thanxfull :)~

[eg]

If you want a string of 0's and 1's, use pack and unpack with the template "B*" (descending) or "b*" (ascending).

Is that what you're looking for?

[DarkGoth]

Ok, that's right ;) thanx.
That was so easy in fact ...

[Fixer]

To get the byte (char) representation of a bit string:
$char = pack("b8","01010101");
To get the bit_string of a char/byte:
$bit_string = unpack("b8",$char);

[DarkGoth]

Thanx, that was exactly what i looked for ;)~~~~

[jynx]

beware before!

Yesterday i found an amusing little routine to do decimal to binary (not the same drek everyone did in school as i understand it). So i converted it to perl and felt like posting it. Unfortunately i may have messed up something, so if someone (like maybe IO) could tell me if i did or not that would be sweet.

sub dec2bin {
   my $num = shift;
   my @num;  my $i = 0;

   (push @num, (($num & 2**$i) == 2**$i) ? 1 : 0) and $i++ until (2**$
+i > $num);
   return 0 + join '', reverse @num;
}

It is completely untested, but it should work (as if that's any boon to a programmer)

jynx

update: changed the $n to $num on line 5 according to IO's suggestion (thank you).

[I0]

Testing it would have found
Name "main::n" used only once: possible typo at - line 5.
But besides that, ** is a more expensive operation than you need here especially doing it 3 times per iteration.
using 1<<$iin place of 2**$i would be a bit faster.


  my $i = 1;
   (push @num, (($num & $i) ? 1 : 0)) and $i<<=1 until $i > $num;

is even better. And
(push @num, (($num & 1) ? 1 : 0)) and $num>>=1 until 1 > $num;still faster...