This site is a static rendering of the Trac instance that was used by R7RS-WG1 for its work on R7RS-small (PDF), which was ratified in 2013. For more information, see Home.

Source for wiki NumericVectorsAdvancedCowan version 3

author

cowan

comment

ipnr

69.195.55.172

name

NumericVectorsAdvancedCowan

readonly

text

This page is an extension of NumericVectorsCowan that adds numeric vector versions of the following [http://srfi.schemers.org/srfi-43/srfi-43.html SRFI 43] procedures:

== Folds and unfolds ==

`(<type>vector-fold `''kons knil bytevector1 bytevector2'' ...`)` -> value

`(<type>vector-fold `''kons knil bytevector1 bytevector2'' ...`)` -> value

`(<type>vector-unfold `''proc length initial-seed'' ...`)` -> bytevector

`(<type>vector-unfold-right `''proc length initial-seed'' ...`)` -> bytevector

== Predicates ==

`(<type>vector= `''= bytevector1 bytevector2'' ...`)` -> boolean

== Iteration ==

`(<type>vector-map! `''proc bytevector1 bytevector2'' ...`)`

Similar to `<type>vector-map`, but rather than mapping the new elements into a newly allocated bytevector, the results are destructively inserted into ``bytevector1``.  Returns an unspecified value.  Returns an unspecified value.

`(<type>vector-count `''predicate bytevector1 bytevector2'' ...`)`

Counts the number of parallel elements in the bytevectors, when viewed as <type>vectors</i>, that satisfy ''predicate'', and returns the count as an exact non-negative integer.  The procedure is applied for each index ''i'' in the range from 0 (inclusive) to ''length'' (exclusive), where ''length'' is the length of the smallest bytevector argument, to ''i'' and the ''i''th element in each bytevector when viewed as a <type>vector, in order. 

== Searching ==

`(<type>vector-index `''predicate bytevector1 bytevector2'' ...`)` -> exact nonnegative integer or `#f`

`(<type>vector-index-right `''predicate bytevector1 bytevector2'' ...`)` -> exact nonnegative integer or `#f`

`(<type>vector-skip `''predicate bytevector1 bytevector2'' ...`)` -> exact nonnegative integer or `#f`

`(<type>vector-skip-right `''predicate bytevector1 bytevector2'' ...`)` -> exact nonnegative integer or #f

`(<type>vector-binary-search `''bytevector value cmp''`)` -> exact nonnegative integer or `#f`

`(<type>vector-any predicate `''bytevector1 bytevector2'' ...`)` -> value or `#f`

`(<type>vector-every predicate `''bytevector1 bytevector2'' ...`)` -> value or `#f`


== Swap == 

`(<type>vector-swap! `''bytevector i j''`)` -> unspecified

Exchanges the values of the locations in ''bytevector'', when viewed as a <type>vector, at indices ''i'' and ''j''.


== Reverse operations ==

`(<type>vector-reverse! `''bytevector'' [ ''start'' [ ''end'' ] ] `)`

Destructively reverses the order of the elements in ''bytevector'' from ''start'' to ''end''.

The `<type>vector-reverse-copy`, `<type>reverse-vector->vector`, `<type>reverse-vector->list`, `<type>reverse-list->vector`, and `<type>reverse-list->list` procedures are identical to their regular counterparts, but produce the bytevector argument, when viewed as a <type>vector, in reverse element order.

time

2012-11-23 05:09:08