s c h e m a t i c s : c o o k b o o k

This Web

Other Webs

Schematics

RSS

Scheme Links

Introduction

Vectors are efficient data structures, containing a fixed number of elements that can be accessed in constant time, and in any order. Vectors are mutable, though 'growing' a vector can be costly (as opposed to lists, which can grow at very little cost).

Vectors are represented in Scheme as a hash mark (#) followed by individual elements contained with a set of parenthesis.

(define test (vector 1 #\a "dog" 0.123 (/ 2 3)))

Like lists, vectors can contain any mixture of types. This ability allows vectors to be used to emulate object-oriented class-like mechanisms by storing functions as elements of the vector:

> (define a #(1 'a "dog" 0.123 (lambda (x) (+ 1 2))))
> a
#(1 'a "dog" 0.123 (lambda (x) (+ 1 2)))
> (vector-ref a 2)
"dog"
> ((eval (vector-ref a 4)) 1)
3 

The recipes in this section show various techniques to make the most of the vector data type.

-- BrentAFulgham - 21 Jan 2007