diff options
| author | Amjad Ben Hedhili <amjadhedhili@outlook.com> | 2023-08-24 19:57:49 +0100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2023-08-24 20:57:49 +0200 |
| commit | fc6a388780c9a0e2eb6c5eff4e291e7bcfcd5f7a (patch) | |
| tree | 178dd19620daf34b3c3e71f3be55558290bd8929 | |
| parent | 101337885459decedc9dc3301b1ff04cf8c54c32 (diff) | |
| download | Nim-fc6a388780c9a0e2eb6c5eff4e291e7bcfcd5f7a.tar.gz | |
Add `cursor` to lists iterator variables (#22531)
* followup #21507
| -rw-r--r-- | lib/pure/collections/lists.nim | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/lib/pure/collections/lists.nim b/lib/pure/collections/lists.nim index 6e3ddf397..e1d32e737 100644 --- a/lib/pure/collections/lists.nim +++ b/lib/pure/collections/lists.nim @@ -286,7 +286,7 @@ iterator nodes*[T](L: SomeLinkedList[T]): SomeLinkedNode[T] = x.value = 5 * x.value - 1 assert $a == "[49, 99, 199, 249]" - var it = L.head + var it {.cursor.} = L.head while it != nil: let nxt = it.next yield it @@ -311,7 +311,7 @@ iterator nodes*[T](L: SomeLinkedRing[T]): SomeLinkedNode[T] = x.value = 5 * x.value - 1 assert $a == "[49, 99, 199, 249]" - var it = L.head + var it {.cursor.} = L.head if it != nil: while true: let nxt = it.next @@ -733,7 +733,7 @@ proc remove*[T](L: var SinglyLinkedList[T], n: SinglyLinkedNode[T]): bool {.disc if L.tail.next == n: L.tail.next = L.head # restore cycle else: - var prev = L.head + var prev {.cursor.} = L.head while prev.next != n and prev.next != nil: prev = prev.next if prev.next == nil: |