d/freebsd-skq
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Don't imply O(n) removal for the doubly linked data structures.

Browse Source
This commit is contained in:
David E. O'Brien 2007-11-02 00:34:44 +00:00
parent b58389792d
commit ed741d4e2d
1 changed files with 8 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
share/man/man3/queue.3
View File

@ -179,22 +179,28 @@ Insertion of a new entry after any element in the list.
.It
O(1) removal of an entry from the head of the list.
.It
O(n) removal of any entry in the list.
.It
Forward traversal through the list.
.El
.Pp
O(n) removal of any entry in the list.
Singly-linked lists are the simplest of the four data structures
and support only the above functionality.
Singly-linked lists are ideal for applications with large datasets
and few or no removals,
or for implementing a LIFO queue.
Singly-linked lists add the following functionality:
.Bl -enum -compact -offset indent
.It
O(n) removal of any entry in the list.
.El
.Pp
Singly-linked tail queues add the following functionality:
.Bl -enum -compact -offset indent
.It
Entries can be added at the end of a list.
.It
O(n) removal of any entry in the list.
.It
They may be concatenated.
.El
However: