Changes between Version 1 and Version 2 of NumericVectorsAdvancedCowan


Ignore:
Timestamp:
11/22/12 16:01:16 (5 years ago)
Author:
cowan
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • NumericVectorsAdvancedCowan

    v1 v2  
    33== Folds and unfolds == 
    44 
    5 (<type>vector-fold kons knil bytevector1 bytevector2 ···) -> value 
     5`(<type>vector-fold `''kons knil bytevector1 bytevector2'' ...`)` -> value 
    66 
    7 (<type>vector-fold kons knil bytevector1 bytevector2 ...) -> value 
     7`(<type>vector-fold `''kons knil bytevector1 bytevector2'' ...`)` -> value 
    88 
    9 (<type>vector-unfold f length initial-seed ...) -> bytevector 
     9`(<type>vector-unfold `''proc length initial-seed'' ...`)` -> bytevector 
    1010 
    11 (<type>vector-unfold-right f length initial-seed ...) -> bytevector 
     11`(<type>vector-unfold-right `''proc length initial-seed'' ...`)` -> bytevector 
    1212 
    1313== Predicates == 
    1414 
    15 (<type>vector= = bytevector1 bytevector2 ...) -> boolean 
     15`(<type>vector= `''= bytevector1 bytevector2'' ...`)` -> boolean 
    1616 
    1717== Iteration == 
    1818 
    19 (<type>vector-map! proc bytevector1 bytevector2 ...) -> unspecified 
     19`(<type>vector-map! `''proc bytevector1 bytevector2'' ...`)` 
    2020 
    21 Similar to `<type>vector-map`, but rather than mapping the new elements into a new vector, the new mapped elements are destructively inserted into ``bytevector1``.  Returns an unspecified result. 
     21Similar 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. 
    2222 
    23 (<type>vector-count predicate bytevector1 bytevector2 ...) -> exact nonnegative integer 
     23`(<type>vector-count `''predicate bytevector1 bytevector2'' ...`)` 
    2424 
    25 Counts the number of parallel elements in the vectors that satisfy predicate, which is applied, for each index i in the range [0, length), where length is the length of the smallest vector argument, to i and each parallel element in the vectors at that index, in order.  
     25Counts 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.  
    2626 
    27 == Searching  
     27== Searching == 
    2828 
    29 (<type>vector-index pred? bytevector1 bytevector2 ···) -> exact nonnegative integer or #f 
     29`(<type>vector-index `''predicate bytevector1 bytevector2'' ...`)` -> exact nonnegative integer or `#f` 
    3030 
    31 (<type>vector-index-right pred? bytevector1 bytevector2 ···) -> exact nonnegative integer or #f 
     31`(<type>vector-index-right `''predicate bytevector1 bytevector2'' ...`)` -> exact nonnegative integer or `#f` 
    3232 
    33 (<type>vector-skip pred? bytevector1 bytevector2 ...) -> exact nonnegative integer or #f 
     33`(<type>vector-skip `predicate bytevector1 bytevector2'' ...`)` -> exact nonnegative integer or `#f` 
    3434 
    35 (<type>vector-skip-right pred? bytevector1 bytevector2 ...) -> exact nonnegative integer or #f 
     35`(<type>vector-skip-right `''predicate bytevector1 bytevector2'' ...`)` -> exact nonnegative integer or #f 
    3636 
    37 (<type>vector-binary-search bytevector value cmp) -> exact nonnegative integer or #f 
     37`(<type>vector-binary-search `''bytevector value cmp''`)` -> exact nonnegative integer or `#f` 
    3838 
    39 (<type>vector-any pred? bytevector1 bytevector2 ···) -> value or #f 
     39`(<type>vector-any predicate `''bytevector1 bytevector2'' ...`)` -> value or `#f` 
    4040 
    41 (<type>vector-every pred? bytevector1 bytevector2 ···) -> value or #f 
     41`(<type>vector-every predicate `''bytevector1 bytevector2'' ...`)` -> value or `#f` 
    4242 
    4343 
    4444== Swap ==  
    4545 
    46 (<type>vector-swap! bytevector i j) -> unspecified 
     46`(<type>vector-swap! `''bytevector i j''`)` -> unspecified 
    4747 
    4848Exchanges the values of the locations in ''bytevector'', when viewed as a <type>vector, at indices ''i'' and ''j''. 
     
    5151== Reverse operations == 
    5252 
    53 (<type>vector-reverse! bytevector [start [end]]) -> unspecified 
     53`(<type>vector-reverse! `''bytevector'' [ ''start'' [ ''end'' ] ] `)` 
    5454 
    55 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 process the bytevector argument, when viewed as a <type>vector, in reverse order.   
     55Destructively reverses the order of the elements in ''bytevector'' from ''start'' to ''end''. 
     56 
     57The `<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.