Re: Operations on bits in Octave, scramblers. (quite urgent)

[Kai Habel]

Paul Ortyl wrote:
> 
> Hi,
> 
>         I have to write and test scrambling algorithms.  That's why I need bit
> operations.  I know, that writing eg. [0,1,1,1,0,0,1,0] works, but these
> numbers are floats and it lasts *very* long for single operation (XOR, AND, <<
> , >>)
> 
> Are there already implemented 8,16,32... bit word operations of this kind?
> 
> OR... how to implement it...  (but I'm really short of time)
> 
> I've found bit{and,cmp,or,max,set,shift,get,xor} functions in Matlab(5)
> function reference.

Hello Paul,

interesting coincidence. A power outage stopped me yesterday to announce
my recent work on bit operations. I have implemented the matlab
functions bitand, bitor, bitxor, bitget, bitset, bitcmp, bitshift,
bitmax. The bit operators (and,or,xor) are in DLD-functions, so you have
to compile these yourself (see instructions in bitand.cc).
Be aware these functions are new and just tested for a few cases.
If you find them usefull give me some feedback. I am always interested
in bug reports or other comments. 
You can get them at
http://user.berlin.de/~kai.habel

Bye 

P.S. these operations work on unsigned long integers (32 or 64 bit)
-- 
Kai Habel
mailto:address@hidden




-----------------------------------------------------------------------
Octave is freely available under the terms of the GNU GPL.

Octave's home on the web:  http://www.che.wisc.edu/octave/octave.html
How to fund new projects:  http://www.che.wisc.edu/octave/funding.html
Subscription information:  http://www.che.wisc.edu/octave/archive.html
-----------------------------------------------------------------------