2005-01-25 19:40:57 -05:00
|
|
|
! Copyright (C) 2004, 2005 Slava Pestov.
|
2005-01-29 14:18:28 -05:00
|
|
|
! See http://factor.sf.net/license.txt for BSD license.
|
2005-01-25 19:40:57 -05:00
|
|
|
IN: vectors
|
2005-01-29 14:18:28 -05:00
|
|
|
USING: generic kernel lists math kernel-internals errors
|
|
|
|
math-internals ;
|
2005-01-25 19:40:57 -05:00
|
|
|
|
|
|
|
BUILTIN: vector 11
|
2004-12-24 02:52:02 -05:00
|
|
|
|
2005-01-27 20:06:10 -05:00
|
|
|
: vector-length ( vec -- len ) >vector 1 slot ; inline
|
2004-12-24 02:52:02 -05:00
|
|
|
|
|
|
|
IN: kernel-internals
|
2004-12-22 22:16:46 -05:00
|
|
|
|
2005-01-27 20:06:10 -05:00
|
|
|
: (set-vector-length) ( len vec -- ) 1 set-slot ; inline
|
2005-01-25 19:40:57 -05:00
|
|
|
|
|
|
|
: assert-positive ( fx -- )
|
|
|
|
0 fixnum<
|
|
|
|
[ "Vector index must be positive" throw ] when ; inline
|
2004-12-22 22:16:46 -05:00
|
|
|
|
2005-01-25 19:40:57 -05:00
|
|
|
: assert-bounds ( fx vec -- )
|
|
|
|
over assert-positive
|
|
|
|
vector-length fixnum>=
|
|
|
|
[ "Vector index out of bounds" throw ] when ; inline
|
2004-12-24 02:52:02 -05:00
|
|
|
|
2005-01-25 19:40:57 -05:00
|
|
|
: grow-capacity ( len vec -- )
|
|
|
|
#! If the vector cannot accomodate len elements, resize it
|
|
|
|
#! to exactly len.
|
2004-12-24 02:52:02 -05:00
|
|
|
[ vector-array grow-array ] keep set-vector-array ; inline
|
|
|
|
|
2005-01-25 19:40:57 -05:00
|
|
|
: ensure-capacity ( n vec -- )
|
|
|
|
#! If n is beyond the vector's length, increase the length,
|
|
|
|
#! growing the array if necessary, with an optimistic
|
|
|
|
#! doubling of its size.
|
|
|
|
2dup vector-length fixnum>= [
|
|
|
|
>r 1 fixnum+ r>
|
|
|
|
2dup vector-array array-capacity fixnum> [
|
|
|
|
over 2 fixnum* over grow-capacity
|
|
|
|
] when
|
|
|
|
(set-vector-length)
|
|
|
|
] [
|
|
|
|
2drop
|
|
|
|
] ifte ; inline
|
2004-12-24 02:52:02 -05:00
|
|
|
|
2005-01-28 23:55:22 -05:00
|
|
|
: copy-array ( to from n -- )
|
|
|
|
[ 3dup swap array-nth pick rot set-array-nth ] repeat 2drop ;
|
|
|
|
|
2004-12-22 22:16:46 -05:00
|
|
|
IN: vectors
|
2004-07-16 02:26:21 -04:00
|
|
|
|
2005-01-25 19:40:57 -05:00
|
|
|
: vector-nth ( n vec -- obj )
|
|
|
|
swap >fixnum swap >vector
|
|
|
|
2dup assert-bounds vector-array array-nth ;
|
2004-12-15 16:57:29 -05:00
|
|
|
|
2005-01-25 19:40:57 -05:00
|
|
|
: set-vector-nth ( obj n vec -- )
|
|
|
|
swap >fixnum dup assert-positive swap >vector
|
|
|
|
2dup ensure-capacity vector-array
|
|
|
|
set-array-nth ;
|
2004-12-24 02:52:02 -05:00
|
|
|
|
|
|
|
: set-vector-length ( len vec -- )
|
2005-01-25 19:40:57 -05:00
|
|
|
swap >fixnum dup assert-positive swap >vector
|
|
|
|
2dup grow-capacity (set-vector-length) ;
|
2004-12-24 02:52:02 -05:00
|
|
|
|
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-push ( obj vector -- )
|
|
|
|
#! Push a value on the end of a vector.
|
|
|
|
dup vector-length swap set-vector-nth ;
|
|
|
|
|
2004-12-26 01:42:09 -05:00
|
|
|
: vector-peek ( vector -- obj )
|
|
|
|
#! Get value at end of vector.
|
2004-12-29 03:35:46 -05:00
|
|
|
dup vector-length 1 - swap vector-nth ;
|
2004-12-26 01:42:09 -05:00
|
|
|
|
2004-07-16 02:26:21 -04:00
|
|
|
: vector-pop ( vector -- obj )
|
|
|
|
#! Get value at end of vector and remove it.
|
2004-12-29 03:35:46 -05:00
|
|
|
dup vector-length 1 - ( vector top )
|
2004-07-16 02:26:21 -04:00
|
|
|
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 ;
|
|
|
|
|
2005-01-27 20:06:10 -05:00
|
|
|
: vector>list ( vec -- list )
|
|
|
|
dup vector-length swap vector-array array>list ;
|
2005-01-23 16:47:28 -05:00
|
|
|
|
|
|
|
: vector-each ( vector quotation -- )
|
|
|
|
#! Execute the quotation with each element of the vector
|
2004-12-13 00:13:54 -05:00
|
|
|
#! pushed onto the stack.
|
2005-01-23 16:47:28 -05:00
|
|
|
>r vector>list r> each ; inline
|
2004-12-13 00:13:54 -05:00
|
|
|
|
|
|
|
: vector-map ( vector code -- vector )
|
|
|
|
#! Applies code to each element of the vector, return a new
|
|
|
|
#! vector with the results. The code must have stack effect
|
|
|
|
#! ( obj -- obj ).
|
|
|
|
over vector-length <vector> rot [
|
|
|
|
swap >r apply r> tuck vector-push
|
|
|
|
] vector-each nip ; inline
|
|
|
|
|
2005-01-10 23:08:27 -05:00
|
|
|
: vector-nappend ( v1 v2 -- )
|
2004-12-13 00:13:54 -05:00
|
|
|
#! Destructively append v2 to v1.
|
|
|
|
[ over vector-push ] vector-each drop ;
|
|
|
|
|
2005-01-10 23:08:27 -05:00
|
|
|
: vector-append ( v1 v2 -- vec )
|
|
|
|
over vector-length over vector-length + <vector>
|
|
|
|
[ rot vector-nappend ] keep
|
|
|
|
[ swap vector-nappend ] keep ;
|
|
|
|
|
2005-01-23 16:47:28 -05:00
|
|
|
: list>vector ( list -- vector )
|
|
|
|
dup length <vector> swap [ over vector-push ] each ;
|
|
|
|
|
|
|
|
: vector-project ( n quot -- vector )
|
2004-12-13 00:13:54 -05:00
|
|
|
#! Execute the quotation n times, passing the loop counter
|
|
|
|
#! the quotation as it ranges from 0..n-1. Collect results
|
|
|
|
#! in a new vector.
|
2005-01-23 16:47:28 -05:00
|
|
|
project list>vector ; inline
|
2004-12-13 00:13:54 -05:00
|
|
|
|
2005-01-28 23:55:22 -05:00
|
|
|
M: vector clone ( vector -- vector )
|
|
|
|
dup vector-length dup empty-vector [
|
|
|
|
vector-array rot vector-array rot copy-array
|
|
|
|
] keep ;
|
2004-11-25 21:51:47 -05:00
|
|
|
|
|
|
|
: vector-length= ( vec vec -- ? )
|
|
|
|
vector-length swap vector-length number= ;
|
|
|
|
|
2004-12-18 23:18:32 -05:00
|
|
|
M: vector = ( obj vec -- ? )
|
2004-11-25 21:51:47 -05:00
|
|
|
#! 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= [
|
2005-01-23 16:47:28 -05:00
|
|
|
swap vector>list swap vector>list =
|
2004-11-25 21:51:47 -05:00
|
|
|
] [
|
|
|
|
2drop f
|
|
|
|
] ifte
|
|
|
|
] [
|
|
|
|
2drop f
|
|
|
|
] ifte
|
|
|
|
] ifte ;
|
|
|
|
|
2004-12-18 23:18:32 -05:00
|
|
|
M: vector hashcode ( vec -- n )
|
2005-01-23 16:47:28 -05:00
|
|
|
dup vector-length 0 number= [
|
|
|
|
drop 0
|
|
|
|
] [
|
|
|
|
0 swap vector-nth hashcode
|
|
|
|
] ifte ;
|
2004-11-27 22:26:05 -05:00
|
|
|
|
2004-12-02 22:44:36 -05:00
|
|
|
: vector-tail ( n vector -- list )
|
2005-01-10 23:08:27 -05:00
|
|
|
#! Return a new list with all elements from the nth
|
2004-11-27 22:26:05 -05:00
|
|
|
#! index upwards.
|
|
|
|
2dup vector-length swap - [
|
|
|
|
pick + over vector-nth
|
2005-01-19 21:01:47 -05:00
|
|
|
] project 2nip ;
|
2004-11-28 19:07:24 -05:00
|
|
|
|
2004-12-02 22:44:36 -05:00
|
|
|
: vector-tail* ( n vector -- list )
|
2004-11-28 19:07:24 -05:00
|
|
|
#! 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 ;
|
2004-12-24 02:52:02 -05:00
|
|
|
|
|
|
|
! Find a better place for this
|
|
|
|
IN: kernel
|
|
|
|
|
|
|
|
: depth ( -- n )
|
|
|
|
#! Push the number of elements on the datastack.
|
|
|
|
datastack vector-length ;
|