1 ! Copyright (C) 2008 Slava Pestov.
\r
2 ! See http://factorcode.org/license.txt for BSD license.
\r
3 USING: arrays kernel kernel.private math sequences
\r
4 sequences.private growable bit-arrays prettyprint.backend
\r
8 TUPLE: bit-vector underlying fill ;
\r
10 M: bit-vector underlying underlying>> { bit-array } declare ;
\r
12 M: bit-vector set-underlying (>>underlying) ;
\r
14 M: bit-vector length fill>> { array-capacity } declare ;
\r
16 M: bit-vector set-fill (>>fill) ;
\r
20 : bit-array>vector ( bit-array length -- bit-vector )
\r
21 bit-vector boa ; inline
\r
25 : <bit-vector> ( n -- bit-vector )
\r
26 <bit-array> 0 bit-array>vector ; inline
\r
28 : >bit-vector ( seq -- bit-vector )
\r
29 T{ bit-vector f ?{ } 0 } clone-like ;
\r
32 drop dup bit-vector? [
\r
34 [ dup length bit-array>vector ] [ >bit-vector ] if
\r
37 M: bit-vector new-sequence
\r
38 drop [ <bit-array> ] keep >fixnum bit-array>vector ;
\r
40 M: bit-vector equal?
\r
41 over bit-vector? [ sequence= ] [ 2drop f ] if ;
\r
43 M: bit-array new-resizable drop <bit-vector> ;
\r
45 INSTANCE: bit-vector growable
\r
47 : ?V{ \ } [ >bit-vector ] parse-literal ; parsing
\r
49 M: bit-vector >pprint-sequence ;
\r
51 M: bit-vector pprint-delims drop \ ?V{ \ } ;
\r