Concepts

Collections

• LISTs (single-linked or double-linked). LIST is a collection with sequential access.
  (list

  type value...) ; use default list
  (single-listtype value...) ; use single-linked list
  (double-listtype value...) ; use double-linked list
  These functions create list of items (with specified type) and add some values to this list.
  

• ARRAYs and VECTORs (array and vector is the same). ARRAY is a collection with random access.
  (arraytype value...)
  (vectortype value...)
  These functions create array of items (with specified type) and add some values to this array.
  

• HASHes and MAPs. HASH is a 'hash table'. MAP is a 'binary tree'. HASH and MAP allow to access to 'value' by it 'key'.
  (hashkey-type=>:value-type (key => value)...)
  (mapkey-type=>:value-type (key => value)...)
  These functions create hash or map. This hash/map stores values (with type value-type) for they keys (with type key-type).