File: LinkedList.schelp

package info (click to toggle)
supercollider 1%3A3.13.0%2Brepack-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 80,292 kB
  • sloc: cpp: 476,363; lisp: 84,680; ansic: 77,685; sh: 25,509; python: 7,909; makefile: 3,440; perl: 1,964; javascript: 974; xml: 826; java: 677; yacc: 314; lex: 175; objc: 152; ruby: 136
file content (43 lines) | stat: -rw-r--r-- 921 bytes parent folder | download | duplicates (6)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
CLASS::LinkedList
summary::doubly linked list
categories:: Collections>Ordered

DESCRIPTION::
LinkedList implements a doubly linked list.

Most methods are inherited from the superclasses.

INSTANCEMETHODS::

method::addFirst
Add an item to the head of the list.

method::add
Add an item to the tail of the list.

method::remove
Remove an item from the list.

method::pop
Remove and return the last item in the list.

method::popFirst
Remove and return the first item in the list.

method::first
Return the first item in the list.

method::last
Return the last item in the list.

method::at
Return the item at the given index in the list.
This requires a scan of the list and so is O(n).

method::put
Put the item at the given index in the list.
This requires a scan of the list and so is O(n).

method::removeAt
Remove and return the item at the given index in the list.
This requires a scan of the list and so is O(n).