Optimize hash-set-related functions
Several hash-set-related functions should be optimized to be more efficient. The initial makeshift implementations (see issue #1 (closed)) use the lset functions from SRFI-1, which "typically run in time O(n * m) for n- and m-element [collections]" because they operate on linked lists. Much better efficiency could be achieved by using transient/mutable hash-sets or hash-maps internally.
-
_hash-set-into
(i.e.into
with a hash-set) -
hash-set
-
set
-
disj
-
set/union
-
set/difference
-
set/intersection
-
set/select