factor/extra/bit-vectors/bit-vectors.factor

52 lines
1.3 KiB
Factor
Raw Normal View History

2008-01-28 19:15:21 -05:00
! Copyright (C) 2008 Slava Pestov.
! See http://factorcode.org/license.txt for BSD license.
USING: arrays kernel kernel.private math sequences
sequences.private growable bit-arrays prettyprint.backend
2008-04-20 03:30:52 -04:00
parser accessors ;
2008-01-28 19:15:21 -05:00
IN: bit-vectors
2008-04-20 01:18:27 -04:00
TUPLE: bit-vector underlying fill ;
M: bit-vector underlying underlying>> { bit-array } declare ;
M: bit-vector set-underlying (>>underlying) ;
M: bit-vector length fill>> { array-capacity } declare ;
M: bit-vector set-fill (>>fill) ;
2008-01-28 19:15:21 -05:00
<PRIVATE
2008-01-30 02:10:58 -05:00
: bit-array>vector ( bit-array length -- bit-vector )
bit-vector boa ; inline
2008-01-28 19:15:21 -05:00
PRIVATE>
: <bit-vector> ( n -- bit-vector )
<bit-array> 0 bit-array>vector ; inline
2008-04-20 01:18:27 -04:00
: >bit-vector ( seq -- bit-vector )
T{ bit-vector f ?{ } 0 } clone-like ;
2008-01-28 19:15:21 -05:00
M: bit-vector like
drop dup bit-vector? [
dup bit-array?
[ dup length bit-array>vector ] [ >bit-vector ] if
] unless ;
2008-04-13 13:54:58 -04:00
M: bit-vector new-sequence
2008-01-28 19:15:21 -05:00
drop [ <bit-array> ] keep >fixnum bit-array>vector ;
M: bit-vector equal?
over bit-vector? [ sequence= ] [ 2drop f ] if ;
2008-01-30 02:40:22 -05:00
M: bit-array new-resizable drop <bit-vector> ;
2008-01-28 19:15:21 -05:00
INSTANCE: bit-vector growable
2008-04-20 03:30:52 -04:00
: ?V{ \ } [ >bit-vector ] parse-literal ; parsing
2008-04-20 01:18:27 -04:00
M: bit-vector >pprint-sequence ;
M: bit-vector pprint-delims drop \ ?V{ \ } ;