factor/library/assoc.factor

84 lines
3.1 KiB
Factor
Raw Normal View History

! :folding=indent:collapseFolds=1:
2004-07-16 02:26:21 -04:00
! $Id$
!
! Copyright (C) 2004, 2005 Slava Pestov.
2004-07-16 02:26:21 -04:00
!
! Redistribution and use in source and binary forms, with or without
! modification, are permitted provided that the following conditions are met:
!
! 1. Redistributions of source code must retain the above copyright notice,
! this list of conditions and the following disclaimer.
!
! 2. Redistributions in binary form must reproduce the above copyright notice,
! this list of conditions and the following disclaimer in the documentation
! and/or other materials provided with the distribution.
!
! THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
! INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
! FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
! DEVELOPERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
! SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
! PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
! OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
! WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
! OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
! ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
IN: lists
USE: kernel
2004-10-16 21:55:13 -04:00
! An association list is a list of conses where the car of each
! cons is a key, and the cdr is a value. See the Factor
! Developer's Guide for details.
2004-07-16 02:26:21 -04:00
: assoc? ( list -- ? )
2004-10-16 21:55:13 -04:00
#! Push if the list appears to be an alist.
2004-07-16 02:26:21 -04:00
dup list? [ [ cons? ] all? ] [ drop f ] ifte ;
: assoc* ( key alist -- [[ key value ]] )
2004-07-16 02:26:21 -04:00
#! Looks up the key in an alist. Push the key/value pair.
#! Most of the time you want to use assoc not assoc*.
[ car = ] some-with? dup [ car ] when ;
2004-07-16 02:26:21 -04:00
: assoc ( key alist -- value )
2004-10-16 21:55:13 -04:00
#! Looks up the key in an alist.
assoc* dup [ cdr ] when ;
2004-07-16 02:26:21 -04:00
2004-10-16 21:55:13 -04:00
: remove-assoc ( key alist -- alist )
#! Remove all key/value pairs with this key.
[ car = not ] subset-with ;
2004-10-16 21:55:13 -04:00
2004-08-03 20:21:43 -04:00
: acons ( value key alist -- alist )
2004-10-16 21:55:13 -04:00
#! Adds the key/value pair to the alist. Existing pairs with
#! this key are not removed; the new pair simply shadows
#! existing pairs.
2004-08-03 20:21:43 -04:00
>r swons r> cons ;
2004-07-16 02:26:21 -04:00
: set-assoc ( value key alist -- alist )
2004-10-16 21:55:13 -04:00
#! Adds the key/value pair to the alist.
dupd remove-assoc acons ;
2004-08-21 02:55:37 -04:00
2004-08-21 03:30:52 -04:00
: assoc-apply ( value-alist quot-alist -- )
2004-08-21 02:55:37 -04:00
#! Looks up the key of each pair in the first list in the
#! second list to produce a quotation. The quotation is
#! applied to the value of the pair. If there is no
#! corresponding quotation, the value is popped off the
#! stack.
swap [
unswons rot assoc* dup [ cdr call ] [ 2drop ] ifte
] each-with ;
: 2cons ( car1 car2 cdr1 cdr2 -- cons1 cons2 )
rot swons >r cons r> ;
2004-12-26 02:16:38 -05:00
: zip ( list list -- list )
#! Make a new list containing pairs of corresponding
#! elements from the two given lists.
dup [ 2uncons zip >r cons r> cons ] [ 2drop [ ] ] ifte ;
2004-12-26 02:16:38 -05:00
: unzip ( assoc -- keys values )
#! Split an association list into two lists of keys and
#! values.
[ uncons >r uncons r> unzip 2cons ] [ [ ] [ ] ] ifte* ;