This is the dlist Reference Manual, generated automatically by Declt version 4.0 beta 2 "William Riker" on Mon Feb 26 16:18:08 2024 GMT+0.
The main system appears first, followed by any subsystem dependency.
dlistAn implementation of the doubly-linked list in Common Lisp.
Krzyszxtof Drewniak <krzysdrewniak@gmail.com>
3-Clause BSD
package.lisp (file).
dcons.lisp (file).
dlist.lisp (file).
modification.lisp (file).
mapping.lisp (file).
more-ops.lisp (file).
generic-sequences.lisp (file).
Files are sorted by type and then listed depth-first from the systems components trees.
dlist/dlist.asddlist/package.lispdlist/dcons.lispdlist/dlist.lispdlist/modification.lispdlist/mapping.lispdlist/more-ops.lispdlist/generic-sequences.lispdlist/dcons.lisppackage.lisp (file).
dlist (system).
data (function).
(setf data) (function).
dcons (function).
dcons (structure).
dconsp (function).
next (function).
(setf next) (function).
prev (function).
(setf prev) (function).
copy-dcons (function).
dcons-data (reader).
(setf dcons-data) (writer).
dcons-next (reader).
(setf dcons-next) (writer).
dcons-p (function).
dcons-prev (reader).
(setf dcons-prev) (writer).
make-dcons (function).
dlist/dlist.lispdcons.lisp (file).
dlist (system).
describe-object (method).
dlist (function).
dlist (class).
dlist->list (function).
dlist-first (function).
(setf dlist-first) (function).
dlist-last (function).
(setf dlist-last) (function).
dlist-nth (function).
(setf dlist-nth) (function).
dlist= (function).
dlistp (function).
nthdcons (function).
print-object (method).
%dlist-first (reader method).
(setf %dlist-first) (writer method).
%dlist-last (reader method).
(setf %dlist-last) (writer method).
dcons-append (function).
dlist-cons-on (function).
dlist/modification.lispdlist.lisp (file).
dlist (system).
dlist-nconc (function).
dlist-pop (macro).
dlist-push (macro).
dlist/mapping.lispmodification.lisp (file).
dlist (system).
dlist/more-ops.lispmapping.lisp (file).
dlist (system).
copy-dlist (function).
dlist-append (function).
dlist-length (function).
dlist-reverse (function).
make-dlist (function).
dlist/generic-sequences.lispmore-ops.lisp (file).
dlist (system).
adjust-sequence (method).
(setf elt) (method).
elt (method).
(setf iterator-element) (method).
iterator-element (method).
iterator-endp (method).
iterator-index (method).
iterator-step (method).
length (method).
make-sequence-iterator (method).
make-sequence-like (method).
reverse (method).
Packages are listed by definition order.
dlistcommon-lisp.
copy-dlist (function).
data (function).
(setf data) (function).
dcons (function).
dcons (structure).
dconsp (function).
dlist (function).
dlist (class).
dlist->list (function).
dlist-append (function).
dlist-first (function).
(setf dlist-first) (function).
dlist-last (function).
(setf dlist-last) (function).
dlist-length (function).
dlist-nconc (function).
dlist-nth (function).
(setf dlist-nth) (function).
dlist-pop (macro).
dlist-push (macro).
dlist-reverse (function).
dlist= (function).
dlistp (function).
dodcons (macro).
dodlist (macro).
make-dlist (function).
mapdcon (function).
mapdcons (function).
mapdlist (function).
next (function).
(setf next) (function).
nthdcons (function).
prev (function).
(setf prev) (function).
%dlist-first (generic reader).
(setf %dlist-first) (generic writer).
%dlist-last (generic reader).
(setf %dlist-last) (generic writer).
copy-dcons (function).
dcons-append (function).
dcons-data (reader).
(setf dcons-data) (writer).
dcons-next (reader).
(setf dcons-next) (writer).
dcons-p (function).
dcons-prev (reader).
(setf dcons-prev) (writer).
dlist-cons-on (function).
make-dcons (function).
Definitions are sorted by export status, category, package, and then by lexicographic order.
Pops an element from dlist and returns it. If ‘from-end’ is non-‘nil’, the element will be popped from the end of the dlist. Otherwise, it will be popped from the begining.
Pushes ‘obj’ onto ‘dlist’. If ‘at-end’ is not-nil, the element is added to the end of dlist, otherwise it is added to the begining.
Loops over the dconses in ‘dlist’, binding ‘var’ to each in turn. If ‘from-end’ is non-nil, the loop proceeds from the last element of ther list to the first. This is basically ‘dolist’ for dlists.
Loops over the elements in ‘dlist’, binding each to ‘var’ in turn, then executing ‘body’. If ‘from-end’ is non-nil, the loop proceeds from the end of the list to the begining.
Copies ‘dlist’, returning a new dlist with the same elements as ‘dlist’. If ‘deep-copy’ is true, ‘copy-dlist’ deep-copies dlists and sequences.
Accesses the ‘data’ slot of a dcons. The ‘data’ of nil is nil.
Sets the ‘data’ slot of ‘place’ (which must be a ‘dcons’) to ‘val’
Constructs a ‘dcons’ with the given ‘prev’, ‘data’, and ‘next’
Returns T if ‘object’ is a dcons
Returns a doubly-linked list (dlist) with the elements in ‘elements’
Converts a dlist to a list
Appends ‘dlists’ non-derstructively by calling ‘dlist-nconc’ with shallow copies of each dlist.
Gets the first ‘dcons’ in a ‘dlist’
Gets the last ‘dcons’ in a ‘dlist’
Returns the length of ‘dlist’
Appends ‘dlists’. This works like ‘nconc’ for singly-linked lists, except it is destructive and the resuld will share structure with the input dlists. This function should have running time proportional to the number of lists being appended.
Returns the nth element of ‘dlist’, as the primary value. If n is >= the length of the list, NIL will be returned. The secondary value will be T if the value was actually found in the list, and NIL otherwise. If ‘from-end’ is true, ‘dlist-nth’ returns the @code{n}th element from the end, subject to the rules above.
Sets the data of the nth dcons in ‘dlist’ to ‘val’. If ‘from-end’ is true, sets the @code{n}th element from the end.
Reverses dlist non-destructively.
Tests dlists for equality by element, recursively descending into sub-dlists.
Tests if ‘object’ is a dlist.
Creates a dlist that contains ‘initial-element’ ‘size’ times.
Maps ‘function’ over ‘dlist’ the dconses in ‘dlist’, then returns ‘dlist’
Maps over the dconses in ‘dlist’ and ‘more-dlists’. If ‘more-dlists’ contains the keyword :from-end, the value after it in the argumnt list will be taken as the value of :from-end, and both will be removed from ‘more-dlists’. The order of elements in the result is the same as the oder in which the elements are returned from the function.
Behaves like ‘mapdcons’, except the function will be passed the ‘data’ of each dcons.
Accesses the ‘next’ slot of a dcons. The ‘next’ of nil is nil.
Sets the ‘next’ slot of ‘place’ (which must be a ‘dcons’) to ‘val’
Returns the @code{n}th dcons in ‘dlist’ (zero-based). If n is >= the length of the list, returns NIL. If ‘from-end’ is true, returns the @code{n}th dcons from the end.
Accesses the ‘prev’ slot of a dcons. The ‘prev’ of nil is nil.
Sets the ‘prev’ slot of ‘place’ (which must be a ‘dcons’) to ‘val’
dlist) length &key initial-element initial-contents) ¶sb-sequence.
dlist) length &key initial-element initial-contents) ¶sb-sequence.
A three-member cons cell for doubly-linked lists, which has ‘prev’, ‘data’ and ‘next’ slots
Creates a dcons whose ‘data’ is ‘object’ and appends it to ‘dcons’, returning ‘dcons’ with a pointer to the new dcons in ‘dcons”s next.
data.
next.
prev.
Returns a dlist whose elements are ‘object’ and the elements of ‘dlist’. ‘dlist’ is destructively mosified. This is intended to have the same use as @code{(cons object list)} for regular lists.
| Jump to: | %
(
A C D E F G I L M N P R |
|---|
| Jump to: | %
(
A C D E F G I L M N P R |
|---|
| Jump to: | D F L N P S |
|---|
| Index Entry | Section | ||
|---|---|---|---|
| | |||
| D | |||
data: | Public structures | ||
| | |||
| F | |||
first: | Public classes | ||
| | |||
| L | |||
last: | Public classes | ||
| | |||
| N | |||
next: | Public structures | ||
| | |||
| P | |||
prev: | Public structures | ||
| | |||
| S | |||
Slot, data: | Public structures | ||
Slot, first: | Public classes | ||
Slot, last: | Public classes | ||
Slot, next: | Public structures | ||
Slot, prev: | Public structures | ||
| | |||
| Jump to: | D F L N P S |
|---|
| Jump to: | C D F G M P S |
|---|
| Jump to: | C D F G M P S |
|---|