jyapayne/Nim
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Deploy to GitHub pages

Browse source
This commit is contained in:
github-actions[bot] 2023-03-13 00:20:19 +00:00 • committed by GitHub
commit 2ef2c469d1
850 changed files with 332608 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

33
deques.idx Normal file
View file

@ -0,0 +1,33 @@
nimTitle deques deques.html module std/deques 0
nim Deque deques.html#Deque object Deque 56
nim defaultInitialSize deques.html#defaultInitialSize const defaultInitialSize 65
nim initDeque deques.html#initDeque,int proc initDeque[T](initialSize: int = defaultInitialSize): Deque[T] 77
nim len deques.html#len,Deque[T] proc len[T](deq: Deque[T]): int 89
nim `[]` deques.html#[],Deque[T],Natural proc `[]`[T](deq: Deque[T]; i: Natural): lent T 109
nim `[]` deques.html#[],Deque[T],Natural_2 proc `[]`[T](deq: var Deque[T]; i: Natural): var T 120
nim `[]=` deques.html#[]=,Deque[T],Natural,sinkT proc `[]=`[T](deq: var Deque[T]; i: Natural; val: sink T) 131
nim `[]` deques.html#[],Deque[T],BackwardsIndex proc `[]`[T](deq: Deque[T]; i: BackwardsIndex): lent T 143
nim `[]` deques.html#[],Deque[T],BackwardsIndex_2 proc `[]`[T](deq: var Deque[T]; i: BackwardsIndex): var T 156
nim `[]=` deques.html#[]=,Deque[T],BackwardsIndex,sinkT proc `[]=`[T](deq: var Deque[T]; i: BackwardsIndex; x: sink T) 169
nim items deques.html#items.i,Deque[T] iterator items[T](deq: Deque[T]): lent T 183
nim mitems deques.html#mitems.i,Deque[T] iterator mitems[T](deq: var Deque[T]): var T 199
nim pairs deques.html#pairs.i,Deque[T] iterator pairs[T](deq: Deque[T]): tuple[key: int, val: T] 216
nim contains deques.html#contains,Deque[T],T proc contains[T](deq: Deque[T]; item: T): bool 229
nim addFirst deques.html#addFirst,Deque[T],sinkT proc addFirst[T](deq: var Deque[T]; item: sink T) 259
nim addLast deques.html#addLast,Deque[T],sinkT proc addLast[T](deq: var Deque[T]; item: sink T) 275
nim toDeque deques.html#toDeque,openArray[T] proc toDeque[T](x: openArray[T]): Deque[T] 291
nim peekFirst deques.html#peekFirst,Deque[T] proc peekFirst[T](deq: Deque[T]): lent T 305
nim peekLast deques.html#peekLast,Deque[T] proc peekLast[T](deq: Deque[T]): lent T 320
nim peekFirst deques.html#peekFirst,Deque[T]_2 proc peekFirst[T](deq: var Deque[T]): var T 335
nim peekLast deques.html#peekLast,Deque[T]_2 proc peekLast[T](deq: var Deque[T]): var T 350
nim popFirst deques.html#popFirst,Deque[T] proc popFirst[T](deq: var Deque[T]): T 368
nim popLast deques.html#popLast,Deque[T] proc popLast[T](deq: var Deque[T]): T 385
nim clear deques.html#clear,Deque[T] proc clear[T](deq: var Deque[T]) 402
nim shrink deques.html#shrink,Deque[T],int,int proc shrink[T](deq: var Deque[T]; fromFirst = 0; fromLast = 0) 417
nim `$` deques.html#$,Deque[T] proc `$`[T](deq: Deque[T]): string 448
idx deque deques.html#deque_1 Module deques 0
heading See also deques.html#see-also See also 0
nimgrp []= deques.html#[]=-procs-all proc 131
nimgrp peekfirst deques.html#peekFirst-procs-all proc 305
nimgrp peeklast deques.html#peekLast-procs-all proc 320
nimgrp [] deques.html#[]-procs-all proc 109