The random-access-lists Reference Manual

Table of Contents

Next: , Previous: , Up: (dir)   [Contents][Index]

The random-access-lists Reference Manual

This is the random-access-lists Reference Manual, version 0.0.1, generated automatically by Declt version 2.4 "Will Decker" on Wed Jun 20 12:30:09 2018 GMT+0.


Next: , Previous: , Up: Top   [Contents][Index]

1 Introduction

Random Access Lists
-------------------

This is an implementation of Random Access Lists, as described by
David Van Horn in SRFI-101: Purely Functional Random Access Pairs and
Lists.  

I've ported this library to Common Lisp but it is otherwise his work,
and is distributed under the same terms as that implementation:

>  SRFI 101: Purely Functional Random-Access Pairs and Lists
>  Copyright (c) David Van Horn 2009.  All Rights Reserved.
>
>  Permission is hereby granted, free of charge, to any person obtaining
>  a copy of this software and associated documentation
>  files (the "Software"), to deal in the Software without restriction,
>  including without limitation the rights to use, copy, modify, merge,
>  publish, distribute, sublicense, and/or sell copies of the Software,
>  and to permit persons to whom the Software is furnished to do so,
>  subject to the following conditions:
>
>  The above copyright notice and this permission notice shall be
>  included in all copies or substantial portions of the Software.
>
>  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
>  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
>  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
>  NONINFRINGEMENT. REMEMBER, THERE IS NO SCHEME UNDERGROUND. IN NO EVENT
>  SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
>  DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
>  OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR
>  THE USE OR OTHER DEALINGS IN THE SOFTWARE.

Random Access Lists are a persistent data structure with `O(1)` `cons`,
`car`, `cdr`, and so forth but with much better performance for random
access and random persistent update, `O(log(n))`.

Usage:
------

Creation: 

    (ra-list 1 2 3 4) ; -> #S(PL-CONS
      :SIZE 1
      :TREE 1
      :REST #S(PL-CONS ...))

Access:

    (setq r (ra-list 1 2 3 4))
    (ra-list-ref r 2) -> 3
    (ra-car r) -> 1
    (ra-cdr r) -> #S(PL-CONS :SIZE 3 :TREE #S(PL-NODE ...))

Update:

    (ra-list-ref (ra-list-set r 2 100) 2) -> 100
    (ra-list-ref r 2) -> 3

Updates are _persistent_, in that they do not change previous version
of the list.  They merely return a new list with the updated value in
place.

Many functions of the `ra-caddr`, `ra-cddr`, etc are also provided
along with basic list manipulation functions like `ra-map`.
    

Next: , Previous: , Up: Top   [Contents][Index]

2 Systems

The main system appears first, followed by any subsystem dependency.


Previous: , Up: Systems   [Contents][Index]

2.1 random-access-lists

Maintainer

Vincent Toups

Author

David Van Horn

Description

Persistent, random-access lists.

Version

0.0.1

Dependency

lisp-unit

Source

random-access-lists.asd (file)

Components

Next: , Previous: , Up: Top   [Contents][Index]

3 Files

Files are sorted by type and then listed depth-first from the systems components trees.


Previous: , Up: Files   [Contents][Index]

3.1 Lisp


Next: , Previous: , Up: Lisp files   [Contents][Index]

3.1.1 random-access-lists.asd

Location

random-access-lists.asd

Systems

random-access-lists (system)


Next: , Previous: , Up: Lisp files   [Contents][Index]

3.1.2 random-access-lists/package.lisp

Parent

random-access-lists (system)

Location

package.lisp

Packages

random-access-lists


Previous: , Up: Lisp files   [Contents][Index]

3.1.3 random-access-lists/random-access-lists.lisp

Dependency

package.lisp (file)

Parent

random-access-lists (system)

Location

random-access-lists.lisp

Exported Definitions
Internal Definitions

Next: , Previous: , Up: Top   [Contents][Index]

4 Packages

Packages are listed by definition order.


Previous: , Up: Packages   [Contents][Index]

4.1 random-access-lists

Source

package.lisp (file)

Use List

common-lisp

Exported Definitions
Internal Definitions

Next: , Previous: , Up: Top   [Contents][Index]

5 Definitions

Definitions are sorted by export status, category, package, and then by lexicographic order.


Next: , Previous: , Up: Definitions   [Contents][Index]

5.1 Exported definitions


Next: , Previous: , Up: Exported definitions   [Contents][Index]

5.1.1 Special variables

Special Variable: ra-null
Package

random-access-lists

Source

random-access-lists.lisp (file)


Previous: , Up: Exported definitions   [Contents][Index]

5.1.2 Functions

Function: list->ra-list X
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-caaaar LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-caaadr LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-caaar LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-caadar LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-caaddr LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-caadr LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-caar LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-cadaar LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-cadadr LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-cadar LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-caddar LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-cadddr LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-caddr LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-cadr LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-car P
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-cdaaar LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-cdaadr LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-cdaar LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-cdadar LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-cdaddr LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-cdadr LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-cdar LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-cddaar LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-cddadr LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-cddar LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-cdddar LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-cddddr LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-cdddr LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-cddr LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-cdr P
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-cons X LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-for-each F &rest LSS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-length LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-linear-access-list->random-access-list X
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-list &rest XS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-list->list X
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-list-ref LS I
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-list-ref/set LS I V
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-list-ref/update LS I F
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-list-set LS I V
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-list-tail LS I
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-list-update LS I F
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-list? X
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-make-list K &optional OBJ
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-map F &rest LSS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-multimap F &rest THE-LISTS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-none-null LISTS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-null? X
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-pair? OBJECT
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-random-access-list->linear-access-list X
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-reverse LS
Package

random-access-lists

Source

random-access-lists.lisp (file)


Previous: , Up: Definitions   [Contents][Index]

5.2 Internal definitions


Next: , Previous: , Up: Internal definitions   [Contents][Index]

5.2.1 Special variables

Special Variable: else
Package

random-access-lists

Source

random-access-lists.lisp (file)


Next: , Previous: , Up: Internal definitions   [Contents][Index]

5.2.2 Macros

Macro: named-let NAME BINDERS &rest BODY
Package

random-access-lists

Source

random-access-lists.lisp (file)

Macro: ra-quote DATUM
Package

random-access-lists

Source

random-access-lists.lisp (file)


Next: , Previous: , Up: Internal definitions   [Contents][Index]

5.2.3 Functions

Function: add1 N
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: build-tree I F
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: copy-pl-cons INSTANCE
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: copy-pl-node INSTANCE
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: fold-right F INIT XS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: get-cached X
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: half I
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: largest-skew-binary N
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: make-foldl EMPTY? FIRST REST
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: make-foldr EMPTY? FIRST REST
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: make-pl-cons &key (SIZE SIZE) (TREE TREE) (REST REST)
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: make-pl-node &key (VAL VAL) (LEFT LEFT) (RIGHT RIGHT)
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: null? X
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: pair? X
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: pl-cons SIZE TREE REST
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: pl-cons-p OBJECT
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: pl-cons-rest INSTANCE
Function: (setf pl-cons-rest) VALUE INSTANCE
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: pl-cons-size INSTANCE
Function: (setf pl-cons-size) VALUE INSTANCE
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: pl-cons-tree INSTANCE
Function: (setf pl-cons-tree) VALUE INSTANCE
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: pl-cons? OBJECT
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: pl-node VAL LEFT RIGHT
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: pl-node-left INSTANCE
Function: (setf pl-node-left) VALUE INSTANCE
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: pl-node-p OBJECT
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: pl-node-right INSTANCE
Function: (setf pl-node-right) VALUE INSTANCE
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: pl-node-val INSTANCE
Function: (setf pl-node-val) VALUE INSTANCE
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: pl-node? OBJECT
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-append &rest LSS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-car+cdr P
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-elt SEQUENCE INDEX
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-foldl/1 CONS EMPTY LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: ra-foldr/1 CONS EMPTY LS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: skew-succ TR
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: sub1 N
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: tr-make-tree I X
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: tree-for-each F TR
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: tree-for-each/n F TS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: tree-map F TR
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: tree-map/n F TS
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: tree-ref SIZE TR I
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: tree-ref/a TR I MID
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: tree-ref/update MID TR I F
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: tree-update SIZE TR I F
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: tree-val TR
Package

random-access-lists

Source

random-access-lists.lisp (file)

Function: zero? X
Package

random-access-lists

Source

random-access-lists.lisp (file)


Previous: , Up: Internal definitions   [Contents][Index]

5.2.4 Structures

Structure: pl-cons ()
Package

random-access-lists

Source

random-access-lists.lisp (file)

Direct superclasses

structure-object (structure)

Direct slots
Slot: size
Readers

pl-cons-size (function)

Writers

(setf pl-cons-size) (function)

Slot: tree
Readers

pl-cons-tree (function)

Writers

(setf pl-cons-tree) (function)

Slot: rest
Readers

pl-cons-rest (function)

Writers

(setf pl-cons-rest) (function)

Structure: pl-node ()
Package

random-access-lists

Source

random-access-lists.lisp (file)

Direct superclasses

structure-object (structure)

Direct slots
Slot: val
Readers

pl-node-val (function)

Writers

(setf pl-node-val) (function)

Slot: left
Readers

pl-node-left (function)

Writers

(setf pl-node-left) (function)

Slot: right
Readers

pl-node-right (function)

Writers

(setf pl-node-right) (function)


Previous: , Up: Top   [Contents][Index]

Appendix A Indexes


Next: , Previous: , Up: Indexes   [Contents][Index]

A.1 Concepts

Jump to:   F   L   R  
Index Entry  Section

F
File, Lisp, random-access-lists.asd: The random-access-lists<dot>asd file
File, Lisp, random-access-lists/package.lisp: The random-access-lists/package<dot>lisp file
File, Lisp, random-access-lists/random-access-lists.lisp: The random-access-lists/random-access-lists<dot>lisp file

L
Lisp File, random-access-lists.asd: The random-access-lists<dot>asd file
Lisp File, random-access-lists/package.lisp: The random-access-lists/package<dot>lisp file
Lisp File, random-access-lists/random-access-lists.lisp: The random-access-lists/random-access-lists<dot>lisp file

R
random-access-lists.asd: The random-access-lists<dot>asd file
random-access-lists/package.lisp: The random-access-lists/package<dot>lisp file
random-access-lists/random-access-lists.lisp: The random-access-lists/random-access-lists<dot>lisp file

Jump to:   F   L   R  

Next: , Previous: , Up: Indexes   [Contents][Index]

A.2 Functions

Jump to:   (  
A   B   C   F   G   H   L   M   N   P   R   S   T   Z  
Index Entry  Section

(
(setf pl-cons-rest): Internal functions
(setf pl-cons-size): Internal functions
(setf pl-cons-tree): Internal functions
(setf pl-node-left): Internal functions
(setf pl-node-right): Internal functions
(setf pl-node-val): Internal functions

A
add1: Internal functions

B
build-tree: Internal functions

C
copy-pl-cons: Internal functions
copy-pl-node: Internal functions

F
fold-right: Internal functions
Function, (setf pl-cons-rest): Internal functions
Function, (setf pl-cons-size): Internal functions
Function, (setf pl-cons-tree): Internal functions
Function, (setf pl-node-left): Internal functions
Function, (setf pl-node-right): Internal functions
Function, (setf pl-node-val): Internal functions
Function, add1: Internal functions
Function, build-tree: Internal functions
Function, copy-pl-cons: Internal functions
Function, copy-pl-node: Internal functions
Function, fold-right: Internal functions
Function, get-cached: Internal functions
Function, half: Internal functions
Function, largest-skew-binary: Internal functions
Function, list->ra-list: Exported functions
Function, make-foldl: Internal functions
Function, make-foldr: Internal functions
Function, make-pl-cons: Internal functions
Function, make-pl-node: Internal functions
Function, null?: Internal functions
Function, pair?: Internal functions
Function, pl-cons: Internal functions
Function, pl-cons-p: Internal functions
Function, pl-cons-rest: Internal functions
Function, pl-cons-size: Internal functions
Function, pl-cons-tree: Internal functions
Function, pl-cons?: Internal functions
Function, pl-node: Internal functions
Function, pl-node-left: Internal functions
Function, pl-node-p: Internal functions
Function, pl-node-right: Internal functions
Function, pl-node-val: Internal functions
Function, pl-node?: Internal functions
Function, ra-append: Internal functions
Function, ra-caaaar: Exported functions
Function, ra-caaadr: Exported functions
Function, ra-caaar: Exported functions
Function, ra-caadar: Exported functions
Function, ra-caaddr: Exported functions
Function, ra-caadr: Exported functions
Function, ra-caar: Exported functions
Function, ra-cadaar: Exported functions
Function, ra-cadadr: Exported functions
Function, ra-cadar: Exported functions
Function, ra-caddar: Exported functions
Function, ra-cadddr: Exported functions
Function, ra-caddr: Exported functions
Function, ra-cadr: Exported functions
Function, ra-car: Exported functions
Function, ra-car+cdr: Internal functions
Function, ra-cdaaar: Exported functions
Function, ra-cdaadr: Exported functions
Function, ra-cdaar: Exported functions
Function, ra-cdadar: Exported functions
Function, ra-cdaddr: Exported functions
Function, ra-cdadr: Exported functions
Function, ra-cdar: Exported functions
Function, ra-cddaar: Exported functions
Function, ra-cddadr: Exported functions
Function, ra-cddar: Exported functions
Function, ra-cdddar: Exported functions
Function, ra-cddddr: Exported functions
Function, ra-cdddr: Exported functions
Function, ra-cddr: Exported functions
Function, ra-cdr: Exported functions
Function, ra-cons: Exported functions
Function, ra-elt: Internal functions
Function, ra-foldl/1: Internal functions
Function, ra-foldr/1: Internal functions
Function, ra-for-each: Exported functions
Function, ra-length: Exported functions
Function, ra-linear-access-list->random-access-list: Exported functions
Function, ra-list: Exported functions
Function, ra-list->list: Exported functions
Function, ra-list-ref: Exported functions
Function, ra-list-ref/set: Exported functions
Function, ra-list-ref/update: Exported functions
Function, ra-list-set: Exported functions
Function, ra-list-tail: Exported functions
Function, ra-list-update: Exported functions
Function, ra-list?: Exported functions
Function, ra-make-list: Exported functions
Function, ra-map: Exported functions
Function, ra-multimap: Exported functions
Function, ra-none-null: Exported functions
Function, ra-null?: Exported functions
Function, ra-pair?: Exported functions
Function, ra-random-access-list->linear-access-list: Exported functions
Function, ra-reverse: Exported functions
Function, skew-succ: Internal functions
Function, sub1: Internal functions
Function, tr-make-tree: Internal functions
Function, tree-for-each: Internal functions
Function, tree-for-each/n: Internal functions
Function, tree-map: Internal functions
Function, tree-map/n: Internal functions
Function, tree-ref: Internal functions
Function, tree-ref/a: Internal functions
Function, tree-ref/update: Internal functions
Function, tree-update: Internal functions
Function, tree-val: Internal functions
Function, zero?: Internal functions

G
get-cached: Internal functions

H
half: Internal functions

L
largest-skew-binary: Internal functions
list->ra-list: Exported functions

M
Macro, named-let: Internal macros
Macro, ra-quote: Internal macros
make-foldl: Internal functions
make-foldr: Internal functions
make-pl-cons: Internal functions
make-pl-node: Internal functions

N
named-let: Internal macros
null?: Internal functions

P
pair?: Internal functions
pl-cons: Internal functions
pl-cons-p: Internal functions
pl-cons-rest: Internal functions
pl-cons-size: Internal functions
pl-cons-tree: Internal functions
pl-cons?: Internal functions
pl-node: Internal functions
pl-node-left: Internal functions
pl-node-p: Internal functions
pl-node-right: Internal functions
pl-node-val: Internal functions
pl-node?: Internal functions

R
ra-append: Internal functions
ra-caaaar: Exported functions
ra-caaadr: Exported functions
ra-caaar: Exported functions
ra-caadar: Exported functions
ra-caaddr: Exported functions
ra-caadr: Exported functions
ra-caar: Exported functions
ra-cadaar: Exported functions
ra-cadadr: Exported functions
ra-cadar: Exported functions
ra-caddar: Exported functions
ra-cadddr: Exported functions
ra-caddr: Exported functions
ra-cadr: Exported functions
ra-car: Exported functions
ra-car+cdr: Internal functions
ra-cdaaar: Exported functions
ra-cdaadr: Exported functions
ra-cdaar: Exported functions
ra-cdadar: Exported functions
ra-cdaddr: Exported functions
ra-cdadr: Exported functions
ra-cdar: Exported functions
ra-cddaar: Exported functions
ra-cddadr: Exported functions
ra-cddar: Exported functions
ra-cdddar: Exported functions
ra-cddddr: Exported functions
ra-cdddr: Exported functions
ra-cddr: Exported functions
ra-cdr: Exported functions
ra-cons: Exported functions
ra-elt: Internal functions
ra-foldl/1: Internal functions
ra-foldr/1: Internal functions
ra-for-each: Exported functions
ra-length: Exported functions
ra-linear-access-list->random-access-list: Exported functions
ra-list: Exported functions
ra-list->list: Exported functions
ra-list-ref: Exported functions
ra-list-ref/set: Exported functions
ra-list-ref/update: Exported functions
ra-list-set: Exported functions
ra-list-tail: Exported functions
ra-list-update: Exported functions
ra-list?: Exported functions
ra-make-list: Exported functions
ra-map: Exported functions
ra-multimap: Exported functions
ra-none-null: Exported functions
ra-null?: Exported functions
ra-pair?: Exported functions
ra-quote: Internal macros
ra-random-access-list->linear-access-list: Exported functions
ra-reverse: Exported functions

S
skew-succ: Internal functions
sub1: Internal functions

T
tr-make-tree: Internal functions
tree-for-each: Internal functions
tree-for-each/n: Internal functions
tree-map: Internal functions
tree-map/n: Internal functions
tree-ref: Internal functions
tree-ref/a: Internal functions
tree-ref/update: Internal functions
tree-update: Internal functions
tree-val: Internal functions

Z
zero?: Internal functions

Jump to:   (  
A   B   C   F   G   H   L   M   N   P   R   S   T   Z  

Next: , Previous: , Up: Indexes   [Contents][Index]

A.3 Variables

Jump to:   E   L   R   S   T   V  
Index Entry  Section

E
else: Internal special variables

L
left: Internal structures

R
ra-null: Exported special variables
rest: Internal structures
right: Internal structures

S
size: Internal structures
Slot, left: Internal structures
Slot, rest: Internal structures
Slot, right: Internal structures
Slot, size: Internal structures
Slot, tree: Internal structures
Slot, val: Internal structures
Special Variable, else: Internal special variables
Special Variable, ra-null: Exported special variables

T
tree: Internal structures

V
val: Internal structures

Jump to:   E   L   R   S   T   V  

Previous: , Up: Indexes   [Contents][Index]

A.4 Data types

Jump to:   P   R   S  
Index Entry  Section

P
Package, random-access-lists: The random-access-lists package
pl-cons: Internal structures
pl-node: Internal structures

R
random-access-lists: The random-access-lists system
random-access-lists: The random-access-lists package

S
Structure, pl-cons: Internal structures
Structure, pl-node: Internal structures
System, random-access-lists: The random-access-lists system

Jump to:   P   R   S