Search:

Or this:


#!/usr/bin/perl
my ($a,$b,$c,$d,$x,$z) = qw(100 3 0 $ 6bC z);
my $s = $d . join $d , ((join undef, map ord , ((' '.$x.$b)=~/./g)) =~
/./g);
$_ = join undef , map {...

I don't recall what it was called, but Netscape offered something very simular to that several years ago. I'm not sure if they still do.
There was a setting in the Netscape options that allowed you...

Multiplication by 2 is most often optimized into var << 1.

The lucky thing with binary multiplicaiton is EVERYTHING is a multiple of 2, so shifts are all you need. After all the shifts you still...

Do you want replacments for both pre and post increments? (ie ++x and x++)

What if I'm allergic to carrots? ;)

Hmmm...lets see...the hard way.


#include <stdio.h>

#define flip_bit if(a&1){ \
if(b&1) { a >>= 1; a |= 0x80000000; } \
else...