This is the doubly-linked-list Reference Manual, version 0.1.0, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sun Dec 15 06:00:27 2024 GMT+0.
The main system appears first, followed by any subsystem dependency.
doubly-linked-listAn implementation of the doubly linked list data structure.
Michael Fiano <mail@mfiano.net>
MIT
0.1.0
mfiano-utils (system).
package.lisp (file).
doubly-linked-list.lisp (file).
Files are sorted by type and then listed depth-first from the systems components trees.
doubly-linked-list/doubly-linked-list.asddoubly-linked-list/package.lispdoubly-linked-list/doubly-linked-list.lispdoubly-linked-list/doubly-linked-list.asddoubly-linked-list (system).
doubly-linked-list/doubly-linked-list.lisppackage.lisp (file).
doubly-linked-list (system).
delete (function).
find (function).
head (reader).
(setf head) (writer).
insert (function).
length (function).
list (structure).
list-values (function).
make-list (function).
next (reader).
(setf next) (writer).
node (structure).
previous (reader).
(setf previous) (writer).
print-object (method).
print-object (method).
tail (reader).
(setf tail) (writer).
value (reader).
(setf value) (writer).
%length (reader).
(setf %length) (writer).
%make-list (function).
make-node (function).
node-p (function).
Packages are listed by definition order.
doubly-linked-listcommon-lisp.
delete (function).
find (function).
head (reader).
(setf head) (writer).
insert (function).
length (function).
list (structure).
list-values (function).
make-list (function).
next (reader).
(setf next) (writer).
node (structure).
previous (reader).
(setf previous) (writer).
tail (reader).
(setf tail) (writer).
value (reader).
(setf value) (writer).
%length (reader).
(setf %length) (writer).
%make-list (function).
make-node (function).
node-p (function).
Definitions are sorted by export status, category, package, and then by lexicographic order.
Delete an object from the doubly linked list ‘LIST‘.
‘OBJECT‘ can be either a NODE object, or some value that is stored in the value
of a NODE object. In the case of a non-NODE value, the list is searched
linearly for a matching node before deletion occurs. Returns two values, the
modified list, and a boolean specifying if a node was deleted.
‘KEY‘ specifies a function that is called with ‘OBJECT‘ as its only argument, if
‘OBJECT‘ is not of type node. It defaults to ‘#’IDENTITY‘. This argument has no
effect if ‘OBJECT‘ is of type NODE.
‘TEST‘ specifies a function used to compare the value of ‘OBJECT‘ as it
traverses nodes in the list. It defaults to ‘#’EQL‘. This argument has no effect
if ‘OBJECT‘ is of type NODE.
Note: As specified above, this function traverses the list linearly for an object to delete if ‘OBJECT‘ is not a NODE.
Search for a node with the given ‘VALUE‘ in the doubly linked list ‘LIST‘.
‘START‘ and ‘END‘ are NODE objects to begin and end searching, inclusively.
‘KEY‘ specifies a function that is called with ‘VALUE‘ as its only argument. It
defaults to ‘#’IDENTITY‘.
‘TEST‘ specifies a function used to compare the‘VALUE‘ as it traverses nodes in
the list. It defaults to ‘#’EQL‘.
‘FROM-END‘, when specified, traverses the list in reverse, from tail to head.
Insert a new node into the doubly linked list ‘LIST‘, constructed to hold
‘VALUE‘.
‘TARGET‘ is an existing node to place the new node adjacent to. If ‘TARGET‘ is
NIL, the head is implicitly targetted.
‘WHERE‘ can be either ‘:BEFORE‘ or ‘:AFTER‘, and specifies on which side of the target node to insert the new node. If unspecified, defaults to ‘:AFTER‘.
Return the number of elements in the doubly linked list ‘LIST‘.
Convert the doubly-linked list ‘LIST‘ into a Lisp list of its nodes’ values.
Create a new doubly linked list, optionally pre-populated with ‘VALUES‘.
A doubly linked list that holds sequential nodes which have links to their previous and next node.
A doubly linked list node with references to its previous and next node.
| Jump to: | %
(
D F H I L M N P T V |
|---|
| Jump to: | %
(
D F H I L M N P T V |
|---|
| Jump to: | %
H N P S T V |
|---|
| Jump to: | %
H N P S T V |
|---|
| Jump to: | D F L N P S |
|---|
| Jump to: | D F L N P S |
|---|