1 ! Copyright (C) 2008 Slava Pestov.
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: accessors byte-arrays growable kernel math sequences
8 { underlying byte-array }
9 { length array-capacity } ;
11 : <byte-vector> ( n -- byte-vector )
12 (byte-array) 0 byte-vector boa ; inline
14 : >byte-vector ( seq -- byte-vector )
15 >byte-array dup length byte-vector boa ;
18 drop dup byte-vector? [
20 [ dup length byte-vector boa ] [ >byte-vector ] if
23 M: byte-vector new-sequence
24 drop [ (byte-array) ] [ >fixnum ] bi byte-vector boa ; inline
27 over byte-vector? [ sequence= ] [ 2drop f ] if ;
29 M: byte-vector contract 2drop ; inline
32 ! If we have an byte-array, we're done.
33 ! If we have a byte-vector, and it's at full capacity,
34 ! we're done. Otherwise, call resize-byte-array, which is a
35 ! relatively fast primitive.
36 drop dup byte-array? [
38 [ length ] [ underlying>> ] bi
40 [ nip ] [ resize-byte-array ] if
44 M: byte-array new-resizable drop <byte-vector> ; inline
46 M: byte-vector new-resizable drop <byte-vector> ; inline
48 INSTANCE: byte-vector growable