steve
/
factor
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Faster bit-array equality, add bit-set-subset? word

db4
Slava Pestov 2009-07-28 11:14:57 -05:00
parent d10993b837
commit 5fe3bcff4d
2 changed files with 4 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
basis/bit-arrays/bit-arrays.factor
View File

@ -61,7 +61,7 @@ M: bit-array like drop dup bit-array? [ >bit-array ] unless ;
M: bit-array new-sequence drop <bit-array> ;
M: bit-array equal?
over bit-array? [ sequence= ] [ 2drop f ] if ;
over bit-array? [ [ underlying>> ] bi@ sequence= ] [ 2drop f ] if ;
M: bit-array resize
[ drop ] [

2
basis/bit-sets/bit-sets.factor
View File

@ -27,3 +27,5 @@ HINTS: bit-set-intersect bit-array bit-array ;
: bit-set-diff ( seq1 seq2 -- seq ) [ bitnot bitand ] bit-set-map ;
HINTS: bit-set-diff bit-array bit-array ;
: bit-set-subset? ( seq1 seq2 -- ? ) dupd bit-set-intersect = ;