2004-07-22 19:48:50 -04:00
|
|
|
! :folding=indent:collapseFolds=1:
|
2004-07-16 02:26:21 -04:00
|
|
|
|
|
|
|
! $Id$
|
|
|
|
!
|
|
|
|
! Copyright (C) 2004 Slava Pestov.
|
|
|
|
!
|
|
|
|
! 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: vectors
|
|
|
|
USE: kernel
|
2004-07-31 14:58:16 -04:00
|
|
|
USE: lists
|
2004-08-26 22:21:17 -04:00
|
|
|
USE: math
|
2004-07-16 02:26:21 -04:00
|
|
|
USE: stack
|
2004-11-25 21:51:47 -05:00
|
|
|
USE: combinators
|
2004-07-16 02:26:21 -04:00
|
|
|
|
2004-11-05 17:41:54 -05:00
|
|
|
: 2vector-nth ( n vec vec -- obj obj )
|
|
|
|
>r over >r vector-nth r> r> vector-nth ;
|
|
|
|
|
2004-08-10 19:53:54 -04:00
|
|
|
: empty-vector ( len -- vec )
|
|
|
|
#! Creates a vector with 'len' elements set to f. Unlike
|
|
|
|
#! <vector>, which gives an empty vector with a certain
|
|
|
|
#! capacity.
|
|
|
|
dup <vector> dup >r set-vector-length r> ;
|
|
|
|
|
2004-07-16 02:26:21 -04:00
|
|
|
: vector-empty? ( obj -- ? )
|
|
|
|
vector-length 0 = ;
|
|
|
|
|
2004-11-03 23:35:36 -05:00
|
|
|
: vector-clear ( vector -- )
|
2004-07-16 02:26:21 -04:00
|
|
|
#! Clears a vector.
|
|
|
|
0 swap set-vector-length ;
|
|
|
|
|
|
|
|
: vector-push ( obj vector -- )
|
|
|
|
#! Push a value on the end of a vector.
|
|
|
|
dup vector-length swap set-vector-nth ;
|
|
|
|
|
|
|
|
: vector-peek ( vector -- obj )
|
|
|
|
#! Get value at end of vector without removing it.
|
|
|
|
dup vector-length pred swap vector-nth ;
|
|
|
|
|
|
|
|
: vector-pop ( vector -- obj )
|
|
|
|
#! Get value at end of vector and remove it.
|
|
|
|
dup vector-length pred ( vector top )
|
|
|
|
2dup swap vector-nth >r swap set-vector-length r> ;
|
|
|
|
|
2004-07-18 18:12:32 -04:00
|
|
|
: >pop> ( stack -- stack )
|
|
|
|
dup vector-pop drop ;
|
|
|
|
|
2004-07-16 02:26:21 -04:00
|
|
|
DEFER: vector-map
|
|
|
|
|
2004-08-25 20:51:19 -04:00
|
|
|
: vector-clone ( vector -- vector )
|
2004-07-16 02:26:21 -04:00
|
|
|
#! Shallow copy of a vector.
|
|
|
|
[ ] vector-map ;
|
2004-11-25 21:51:47 -05:00
|
|
|
|
|
|
|
: ?vector= ( n vec vec -- ? )
|
|
|
|
#! Reached end?
|
2004-11-27 00:33:17 -05:00
|
|
|
drop vector-length number= ;
|
2004-11-25 21:51:47 -05:00
|
|
|
|
|
|
|
: (vector=) ( n vec vec -- ? )
|
|
|
|
3dup ?vector= [
|
|
|
|
3drop t ( reached end without any unequal elts )
|
|
|
|
] [
|
|
|
|
3dup 2vector-nth = [
|
|
|
|
>r >r succ r> r> (vector=)
|
|
|
|
] [
|
|
|
|
3drop f
|
|
|
|
] ifte
|
|
|
|
] ifte ;
|
|
|
|
|
|
|
|
: vector-length= ( vec vec -- ? )
|
|
|
|
vector-length swap vector-length number= ;
|
|
|
|
|
|
|
|
: vector= ( obj vec -- ? )
|
|
|
|
#! Check if two vectors are equal. Two vectors are
|
|
|
|
#! considered equal if they have the same length and contain
|
|
|
|
#! equal elements.
|
|
|
|
2dup eq? [
|
|
|
|
2drop t
|
|
|
|
] [
|
|
|
|
over vector? [
|
|
|
|
2dup vector-length= [
|
|
|
|
0 -rot (vector=)
|
|
|
|
] [
|
|
|
|
2drop f
|
|
|
|
] ifte
|
|
|
|
] [
|
|
|
|
2drop f
|
|
|
|
] ifte
|
|
|
|
] ifte ;
|
|
|
|
|
|
|
|
: ?vector-nth ( n vec -- obj/f )
|
|
|
|
2dup vector-length >= [ 2drop f ] [ vector-nth ] ifte ;
|
|
|
|
|
|
|
|
: vector-hashcode ( vec -- n )
|
|
|
|
0 swap 4 [
|
|
|
|
over ?vector-nth hashcode rot bitxor swap
|
|
|
|
] times* drop ;
|
2004-11-27 22:26:05 -05:00
|
|
|
|
|
|
|
: vector-tail ( n vector -- vector )
|
|
|
|
#! Return a new vector, with all elements from the nth
|
|
|
|
#! index upwards.
|
|
|
|
2dup vector-length swap - [
|
|
|
|
pick + over vector-nth
|
|
|
|
] vector-project nip nip ;
|
2004-11-28 19:07:24 -05:00
|
|
|
|
|
|
|
: vector-tail* ( n vector -- vector )
|
|
|
|
#! Unlike vector-tail, n is an index from the end of the
|
|
|
|
#! vector. For example, if n=1, this returns a vector of
|
|
|
|
#! one element.
|
|
|
|
[ vector-length swap - ] keep vector-tail ;
|