Next: Introduction, Previous: (dir), 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 4.0 beta 2 "William Riker" on Sun Dec 15 07:32:42 2024 GMT+0.

Next: Systems, Previous: The random-access-lists Reference Manual, Up: The random-access-lists Reference Manual [Contents][Index]

1 Introduction

Next: Files, Previous: Introduction, Up: The random-access-lists Reference Manual [Contents][Index]

2 Systems

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

random-access-lists

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

2.1 `random-access-lists`

Persistent, random-access lists.

Maintainer

Vincent Toups

Author

David Van Horn

Version

0.0.1

Dependency

lisp-unit (system).

Source

random-access-lists.asd.

Child Components

package.lisp (file).
random-access-lists.lisp (file).

Next: Packages, Previous: Systems, Up: The random-access-lists Reference Manual [Contents][Index]

3 Files

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

Lisp

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

3.1 Lisp

random-access-lists/random-access-lists.asd
random-access-lists/package.lisp
random-access-lists/random-access-lists.lisp

Next: random-access-lists/package.lisp, Previous: Lisp, Up: Lisp [Contents][Index]

3.1.1 `random-access-lists/random-access-lists.asd`

Source: random-access-lists.asd.
Parent Component: random-access-lists (system).
ASDF Systems: random-access-lists.

Next: random-access-lists/random-access-lists.lisp, Previous: random-access-lists/random-access-lists.asd, Up: Lisp [Contents][Index]

3.1.2 `random-access-lists/package.lisp`

Source: random-access-lists.asd.
Parent Component: random-access-lists (system).
Packages: random-access-lists.

Previous: random-access-lists/package.lisp, Up: Lisp [Contents][Index]

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

Dependency

package.lisp (file).

Source

random-access-lists.asd.

Parent Component

random-access-lists (system).

Public Interface

ra-caaaar (function).
ra-caaadr (function).
ra-caaar (function).
ra-caadar (function).
ra-caaddr (function).
ra-caadr (function).
ra-caar (function).
ra-cadaar (function).
ra-cadadr (function).
ra-cadar (function).
ra-caddar (function).
ra-cadddr (function).
ra-caddr (function).
ra-cadr (function).
ra-car (function).
ra-cdaaar (function).
ra-cdaadr (function).
ra-cdaar (function).
ra-cdadar (function).
ra-cdaddr (function).
ra-cdadr (function).
ra-cdar (function).
ra-cddaar (function).
ra-cddadr (function).
ra-cddar (function).
ra-cdddar (function).
ra-cddddr (function).
ra-cdddr (function).
ra-cddr (function).
ra-cdr (function).
ra-cons (function).
ra-for-each (function).
ra-length (function).
ra-linear-access-list->random-access-list (function).
ra-list (function).
ra-list-ref (function).
ra-list-ref/set (function).
ra-list-ref/update (function).
ra-list-set (function).
ra-list-tail (function).
ra-list-update (function).
ra-list? (function).
ra-make-list (function).
ra-map (function).
ra-multimap (function).
ra-none-null (function).
ra-null (special variable).
ra-random-access-list->linear-access-list (function).
ra-reverse (function).

Internals

add1 (function).
build-tree (function).
copy-pl-cons (function).
copy-pl-node (function).
else (special variable).
fold-right (function).
get-cached (function).
half (function).
largest-skew-binary (function).
make-foldl (function).
make-foldr (function).
make-pl-cons (function).
make-pl-node (function).
named-let (macro).
null? (function).
pair? (function).
pl-cons (function).
pl-cons (structure).
pl-cons-p (function).
pl-cons-rest (reader).
(setf pl-cons-rest) (writer).
pl-cons-size (reader).
(setf pl-cons-size) (writer).
pl-cons-tree (reader).
(setf pl-cons-tree) (writer).
pl-node (function).
pl-node (structure).
pl-node-left (reader).
(setf pl-node-left) (writer).
pl-node-p (function).
pl-node-right (reader).
(setf pl-node-right) (writer).
pl-node-val (reader).
(setf pl-node-val) (writer).
ra-append (function).
ra-car+cdr (function).
ra-elt (function).
ra-foldl/1 (function).
ra-foldr/1 (function).
ra-quote (macro).
skew-succ (function).
sub1 (function).
tr-make-tree (function).
tree-for-each (function).
tree-for-each/n (function).
tree-map (function).
tree-map/n (function).
tree-ref (function).
tree-ref/a (function).
tree-ref/update (function).
tree-update (function).
tree-val (function).
zero? (function).

Next: Definitions, Previous: Files, Up: The random-access-lists Reference Manual [Contents][Index]

4 Packages

Packages are listed by definition order.

random-access-lists

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

4.1 `random-access-lists`

Source

package.lisp.

Use List

common-lisp.

Public Interface

list->ra-list (function).
ra-caaaar (function).
ra-caaadr (function).
ra-caaar (function).
ra-caadar (function).
ra-caaddr (function).
ra-caadr (function).
ra-caar (function).
ra-cadaar (function).
ra-cadadr (function).
ra-cadar (function).
ra-caddar (function).
ra-cadddr (function).
ra-caddr (function).
ra-cadr (function).
ra-car (function).
ra-cdaaar (function).
ra-cdaadr (function).
ra-cdaar (function).
ra-cdadar (function).
ra-cdaddr (function).
ra-cdadr (function).
ra-cdar (function).
ra-cddaar (function).
ra-cddadr (function).
ra-cddar (function).
ra-cdddar (function).
ra-cddddr (function).
ra-cdddr (function).
ra-cddr (function).
ra-cdr (function).
ra-cons (function).
ra-for-each (function).
ra-length (function).
ra-linear-access-list->random-access-list (function).
ra-list (function).
ra-list->list (function).
ra-list-ref (function).
ra-list-ref/set (function).
ra-list-ref/update (function).
ra-list-set (function).
ra-list-tail (function).
ra-list-update (function).
ra-list? (function).
ra-make-list (function).
ra-map (function).
ra-multimap (function).
ra-none-null (function).
ra-null (special variable).
ra-null? (function).
ra-pair? (function).
ra-random-access-list->linear-access-list (function).
ra-reverse (function).

Internals

add1 (function).
build-tree (function).
copy-pl-cons (function).
copy-pl-node (function).
else (special variable).
fold-right (function).
get-cached (function).
half (function).
largest-skew-binary (function).
make-foldl (function).
make-foldr (function).
make-pl-cons (function).
make-pl-node (function).
named-let (macro).
null? (function).
pair? (function).
pl-cons (function).
pl-cons (structure).
pl-cons-p (function).
pl-cons-rest (reader).
(setf pl-cons-rest) (writer).
pl-cons-size (reader).
(setf pl-cons-size) (writer).
pl-cons-tree (reader).
(setf pl-cons-tree) (writer).
pl-cons? (function).
pl-node (function).
pl-node (structure).
pl-node-left (reader).
(setf pl-node-left) (writer).
pl-node-p (function).
pl-node-right (reader).
(setf pl-node-right) (writer).
pl-node-val (reader).
(setf pl-node-val) (writer).
pl-node? (function).
ra-append (function).
ra-car+cdr (function).
ra-elt (function).
ra-foldl/1 (function).
ra-foldr/1 (function).
ra-quote (macro).
skew-succ (function).
sub1 (function).
tr-make-tree (function).
tree-for-each (function).
tree-for-each/n (function).
tree-map (function).
tree-map/n (function).
tree-ref (function).
tree-ref/a (function).
tree-ref/update (function).
tree-update (function).
tree-val (function).
zero? (function).

Next: Indexes, Previous: Packages, Up: The random-access-lists Reference Manual [Contents][Index]

5 Definitions

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

Public Interface
Internals

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

Next: Ordinary functions, Previous: Public Interface, Up: Public Interface [Contents][Index]

5.1.1 Special variables

Special Variable: ra-null ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Previous: Special variables, Up: Public Interface [Contents][Index]

5.1.2 Ordinary functions

Function: list->ra-list (x) ¶

Package: random-access-lists.
Alias for: ra-linear-access-list->random-access-list.

Function: ra-caaaar (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-caaadr (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-caaar (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-caadar (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-caaddr (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-caadr (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-caar (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-cadaar (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-cadadr (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-cadar (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-caddar (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-cadddr (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-caddr (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-cadr (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-car (p) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-cdaaar (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-cdaadr (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-cdaar (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-cdadar (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-cdaddr (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-cdadr (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-cdar (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-cddaar (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-cddadr (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-cddar (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-cdddar (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-cddddr (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-cdddr (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-cddr (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-cdr (p) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-cons (x ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-for-each (f &rest lss) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-length (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-linear-access-list->random-access-list (x) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-list (&rest xs) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-list->list (x) ¶

Package: random-access-lists.
Alias for: ra-random-access-list->linear-access-list.

Function: ra-list-ref (ls i) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-list-ref/set (ls i v) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-list-ref/update (ls i f) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-list-set (ls i v) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-list-tail (ls i) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-list-update (ls i f) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-list? (x) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-make-list (k &optional obj) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-map (f &rest lss) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-multimap (f &rest the-lists) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-none-null (lists) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-null? (x) ¶

Package: random-access-lists.
Alias for: null?.

Function: ra-pair? (object) ¶

Package: random-access-lists.
Alias for: pl-cons-p.

Function: ra-random-access-list->linear-access-list (x) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-reverse (ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

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

5.2 Internals

Special variables
Macros
Ordinary functions
Structures

Next: Macros, Previous: Internals, Up: Internals [Contents][Index]

5.2.1 Special variables

Special Variable: else ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Next: Ordinary functions, Previous: Special variables, Up: Internals [Contents][Index]

5.2.2 Macros

Macro: named-let (name binders &rest body) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Macro: ra-quote (datum) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Next: Structures, Previous: Macros, Up: Internals [Contents][Index]

5.2.3 Ordinary functions

Function: add1 (n) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: build-tree (i f) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: copy-pl-cons (instance) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: copy-pl-node (instance) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: fold-right (f init xs) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: get-cached (x) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: half (i) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: largest-skew-binary (n) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: make-foldl (empty? first rest) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: make-foldr (empty? first rest) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: make-pl-cons (&key size tree rest) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: make-pl-node (&key val left right) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: null? (x) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: pair? (x) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: pl-cons (size tree rest) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: pl-cons-p (object) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Reader: pl-cons-rest (instance) ¶

Writer: (setf pl-cons-rest) (instance) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.
Target Slot: rest.

Reader: pl-cons-size (instance) ¶

Writer: (setf pl-cons-size) (instance) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.
Target Slot: size.

Reader: pl-cons-tree (instance) ¶

Writer: (setf pl-cons-tree) (instance) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.
Target Slot: tree.

Function: pl-cons? (object) ¶

Package: random-access-lists.
Alias for: pl-cons-p.

Function: pl-node (val left right) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Reader: pl-node-left (instance) ¶

Writer: (setf pl-node-left) (instance) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.
Target Slot: left.

Function: pl-node-p (object) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Reader: pl-node-right (instance) ¶

Writer: (setf pl-node-right) (instance) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.
Target Slot: right.

Reader: pl-node-val (instance) ¶

Writer: (setf pl-node-val) (instance) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.
Target Slot: val.

Function: pl-node? (object) ¶

Package: random-access-lists.
Alias for: pl-node-p.

Function: ra-append (&rest lss) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-car+cdr (p) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-elt (sequence index) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-foldl/1 (cons empty ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: ra-foldr/1 (cons empty ls) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: skew-succ (tr) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: sub1 (n) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: tr-make-tree (i x) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: tree-for-each (f tr) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: tree-for-each/n (f ts) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: tree-map (f tr) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: tree-map/n (f ts) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: tree-ref (size tr i) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: tree-ref/a (tr i mid) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: tree-ref/update (mid tr i f) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: tree-update (size tr i f) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: tree-val (tr) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Function: zero? (x) ¶

Package: random-access-lists.
Source: random-access-lists.lisp.

Previous: Ordinary functions, Up: Internals [Contents][Index]

5.2.4 Structures

Structure: pl-cons ¶

Package

random-access-lists.

Source

random-access-lists.lisp.

Direct superclasses

structure-object.

Direct slots

Slot: size ¶

Readers: pl-cons-size.
Writers: (setf pl-cons-size).

Slot: tree ¶

Readers: pl-cons-tree.
Writers: (setf pl-cons-tree).

Slot: rest ¶

Package: common-lisp.
Readers: pl-cons-rest.
Writers: (setf pl-cons-rest).

Structure: pl-node ¶

Package

random-access-lists.

Source

random-access-lists.lisp.

Direct superclasses

structure-object.

Direct slots

Slot: val ¶

Readers: pl-node-val.
Writers: (setf pl-node-val).

Slot: left ¶

Readers: pl-node-left.
Writers: (setf pl-node-left).

Slot: right ¶

Readers: pl-node-right.
Writers: (setf pl-node-right).

Previous: Definitions, Up: The random-access-lists Reference Manual [Contents][Index]

Appendix A Indexes

Concepts
Functions
Variables
Data types

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

A.1 Concepts

Next: Variables, Previous: Concepts, 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)`:	Private ordinary functions
	`(setf pl-cons-size)`:	Private ordinary functions
	`(setf pl-cons-tree)`:	Private ordinary functions
	`(setf pl-node-left)`:	Private ordinary functions
	`(setf pl-node-right)`:	Private ordinary functions
	`(setf pl-node-val)`:	Private ordinary functions

A
	`add1`:	Private ordinary functions

B
	`build-tree`:	Private ordinary functions

C
	`copy-pl-cons`:	Private ordinary functions
	`copy-pl-node`:	Private ordinary functions

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

G
	`get-cached`:	Private ordinary functions

H
	`half`:	Private ordinary functions

L
	`largest-skew-binary`:	Private ordinary functions
	`list->ra-list`:	Public ordinary functions

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

N
	`named-let`:	Private macros
	`null?`:	Private ordinary functions

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

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

S
	`skew-succ`:	Private ordinary functions
	`sub1`:	Private ordinary functions

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

Z
	`zero?`:	Private ordinary functions

Next: Data types, Previous: Functions, Up: Indexes [Contents][Index]

A.3 Variables

Jump to:	E L R S T V

	Index Entry	Section

E
	`else`:	Private special variables

L
	`left`:	Private structures

R
	`ra-null`:	Public special variables
	`rest`:	Private structures
	`right`:	Private structures

S
	`size`:	Private structures
	`Slot, left`:	Private structures
	`Slot, rest`:	Private structures
	`Slot, right`:	Private structures
	`Slot, size`:	Private structures
	`Slot, tree`:	Private structures
	`Slot, val`:	Private structures
	`Special Variable, else`:	Private special variables
	`Special Variable, ra-null`:	Public special variables

T
	`tree`:	Private structures

V
	`val`:	Private structures

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

A.4 Data types

Jump to:	F P R S

	Index Entry	Section

F
	`File, package.lisp`:	The random-access-lists/package․lisp file
	`File, random-access-lists.asd`:	The random-access-lists/random-access-lists․asd file
	`File, random-access-lists.lisp`:	The random-access-lists/random-access-lists․lisp file

P
	`Package, random-access-lists`:	The random-access-lists package
	`package.lisp`:	The random-access-lists/package․lisp file
	`pl-cons`:	Private structures
	`pl-node`:	Private structures

R
	`random-access-lists`:	The random-access-lists system
	`random-access-lists`:	The random-access-lists package
	`random-access-lists.asd`:	The random-access-lists/random-access-lists․asd file
	`random-access-lists.lisp`:	The random-access-lists/random-access-lists․lisp file

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

The random-access-lists Reference Manual

Table of Contents

1 Introduction

2 Systems

2.1 random-access-lists

3 Files

3.1 Lisp

3.1.1 random-access-lists/random-access-lists.asd

3.1.2 random-access-lists/package.lisp

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

4 Packages

4.1 random-access-lists

5 Definitions

5.1 Public Interface

5.1.1 Special variables

5.1.2 Ordinary functions

5.2 Internals

5.2.1 Special variables

5.2.2 Macros

5.2.3 Ordinary functions

5.2.4 Structures

Appendix A Indexes

A.1 Concepts

A.2 Functions

A.3 Variables

A.4 Data types

2.1 `random-access-lists`

3.1.1 `random-access-lists/random-access-lists.asd`

3.1.2 `random-access-lists/package.lisp`

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

4.1 `random-access-lists`