factor/core/bit-arrays/bit-arrays.factor

55 lines
1.2 KiB
Factor
Raw Normal View History

2008-01-05 17:27:15 -05:00
! Copyright (C) 2007, 2008 Slava Pestov.
2007-09-20 18:09:08 -04:00
! See http://factorcode.org/license.txt for BSD license.
2008-01-31 21:11:46 -05:00
USING: math alien.accessors kernel kernel.private sequences
2007-09-20 18:09:08 -04:00
sequences.private ;
IN: bit-arrays
<PRIVATE
2008-01-12 21:37:44 -05:00
: n>byte -3 shift ; inline
2007-09-20 18:09:08 -04:00
2008-01-12 21:37:44 -05:00
: byte/bit ( n alien -- byte bit )
over n>byte alien-unsigned-1 swap 7 bitand ; inline
2007-09-20 18:09:08 -04:00
: set-bit ( ? byte bit -- byte )
2^ rot [ bitor ] [ bitnot bitand ] if ; inline
: bits>cells 31 + -5 shift ; inline
: (set-bits) ( bit-array n -- )
over length bits>cells -rot [
2007-12-29 11:36:20 -05:00
spin 4 * set-alien-unsigned-4
2007-09-20 18:09:08 -04:00
] 2curry each ; inline
PRIVATE>
M: bit-array length array-capacity ;
2008-01-12 21:37:44 -05:00
M: bit-array nth-unsafe
>r >fixnum r> byte/bit bit? ;
2007-09-20 18:09:08 -04:00
M: bit-array set-nth-unsafe
2008-01-12 21:37:44 -05:00
>r >fixnum r>
[ byte/bit set-bit ] 2keep
swap n>byte set-alien-unsigned-1 ;
2007-09-20 18:09:08 -04:00
: clear-bits ( bit-array -- ) 0 (set-bits) ;
: set-bits ( bit-array -- ) -1 (set-bits) ;
M: bit-array clone (clone) ;
: >bit-array ( seq -- bit-array ) ?{ } clone-like ; inline
M: bit-array like drop dup bit-array? [ >bit-array ] unless ;
M: bit-array new drop <bit-array> ;
M: bit-array equal?
over bit-array? [ sequence= ] [ 2drop f ] if ;
2008-01-28 19:15:21 -05:00
M: bit-array resize
resize-bit-array ;
2007-09-20 18:09:08 -04:00
INSTANCE: bit-array sequence