diff options
author | pacien <pacien.trangirard@pacien.net> | 2018-11-26 12:58:43 +0100 |
---|---|---|
committer | pacien <pacien.trangirard@pacien.net> | 2018-11-27 10:34:34 +0100 |
commit | 4e483bb01abf89b164e21c77003ead033fa92e08 (patch) | |
tree | a1bd93aeca7b7d0b2376b7c433e64733ebedc829 /lib | |
parent | eb919c35b29afee8fb26a2145d88f4db9e6c332b (diff) | |
download | Nim-4e483bb01abf89b164e21c77003ead033fa92e08.tar.gz |
add SinglyLinkedList.append procs
Diffstat (limited to 'lib')
-rw-r--r-- | lib/pure/collections/lists.nim | 15 |
1 files changed, 15 insertions, 0 deletions
diff --git a/lib/pure/collections/lists.nim b/lib/pure/collections/lists.nim index 0b3708a7c..15ce5d074 100644 --- a/lib/pure/collections/lists.nim +++ b/lib/pure/collections/lists.nim @@ -140,11 +140,26 @@ proc contains*[T](L: SomeLinkedCollection[T], value: T): bool {.inline.} = ## exist, true otherwise. result = find(L, value) != nil +proc append*[T](L: var SinglyLinkedList[T], + n: SinglyLinkedNode[T]) {.inline.} = + ## appends a node `n` to `L`. Efficiency: O(1). + n.next = nil + if L.tail != nil: + assert(L.tail.next == nil) + L.tail.next = n + L.tail = n + if L.head == nil: L.head = n + +proc append*[T](L: var SinglyLinkedList[T], value: T) {.inline.} = + ## appends a value to `L`. Efficiency: O(1). + append(L, newSinglyLinkedNode(value)) + proc prepend*[T](L: var SinglyLinkedList[T], n: SinglyLinkedNode[T]) {.inline.} = ## prepends a node to `L`. Efficiency: O(1). n.next = L.head L.head = n + if L.tail == nil: L.tail = n proc prepend*[T](L: var SinglyLinkedList[T], value: T) {.inline.} = ## prepends a node to `L`. Efficiency: O(1). |