45 lines
1.3 KiB
Factor
45 lines
1.3 KiB
Factor
! Copyright (C) 2010 Daniel Ehrenberg
|
|
! See http://factorcode.org/license.txt for BSD license.
|
|
USING: accessors assocs hashtables kernel sets sets.private
|
|
sequences parser ;
|
|
|
|
IN: hash-sets
|
|
|
|
! In a better implementation, less memory would be used
|
|
TUPLE: hash-set { table hashtable read-only } ;
|
|
|
|
: <hash-set> ( capacity -- hash-set )
|
|
<hashtable> hash-set boa ; inline
|
|
|
|
: >hash-set ( members -- hash-set )
|
|
unique hash-set boa ; inline
|
|
|
|
INSTANCE: hash-set set
|
|
M: hash-set in? table>> key? ; inline
|
|
M: hash-set adjoin table>> dupd set-at ; inline
|
|
M: hash-set delete table>> delete-at ; inline
|
|
M: hash-set members table>> keys ; inline
|
|
M: hash-set set-like drop dup hash-set? [ ?members >hash-set ] unless ;
|
|
M: hash-set clone table>> clone hash-set boa ;
|
|
M: hash-set null? table>> assoc-empty? ;
|
|
M: hash-set cardinality table>> assoc-size ;
|
|
M: hash-set intersect small/large sequence/tester filter >hash-set ;
|
|
M: hash-set union (union) >hash-set ;
|
|
M: hash-set diff sequence/tester [ not ] compose filter >hash-set ;
|
|
|
|
M: sequence fast-set >hash-set ;
|
|
M: f fast-set drop H{ } clone hash-set boa ;
|
|
|
|
M: sequence duplicates
|
|
dup length <hash-set> [ ?adjoin not ] curry filter ;
|
|
|
|
<PRIVATE
|
|
|
|
: (all-unique?) ( elt hash -- ? )
|
|
2dup in? [ 2drop f ] [ adjoin t ] if ; inline
|
|
|
|
PRIVATE>
|
|
|
|
M: sequence all-unique?
|
|
dup length <hash-set> [ (all-unique?) ] curry all? ;
|