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

hash-sets: Support >alist on hash-sets or else tab-completion breaks. Can we write a unit test for this too?

db4
Doug Coleman 2013-03-08 17:32:46 -08:00
parent 85a3966a9d
commit dc395a6b31
1 changed files with 6 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
core/hash-sets/hash-sets.factor
View File

@ -1,9 +1,9 @@
! Copyright (C) 2010 Daniel Ehrenberg ! Copyright (C) 2010 Daniel Ehrenberg
! Copyright (C) 2005, 2011 John Benediktsson, Slava Pestov. ! Copyright (C) 2005, 2011 John Benediktsson, Slava Pestov.
! See http://factorcode.org/license.txt for BSD license. ! See http://factorcode.org/license.txt for BSD license.
USING: accessors arrays hash-sets hashtables.private kernel USING: accessors arrays assocs hash-sets hashtables.private
kernel.private math math.private sequences sequences.private kernel kernel.private math math.private sequences
sets sets.private slots.private vectors ; sequences.private sets sets.private slots.private vectors ;
IN: hash-sets IN: hash-sets
TUPLE: hash-set TUPLE: hash-set
@ -163,3 +163,6 @@ PRIVATE>
M: sequence all-unique? M: sequence all-unique?
dup length <hash-set> [ (all-unique?) ] curry all? ; dup length <hash-set> [ (all-unique?) ] curry all? ;
M: hash-set >alist
array>> dup zip ;