Accueil Explorer Aide
Connexion
levovix
/
Nim
miroir de https://github.com/nim-lang/Nim
Suivre 1
Voter 0
Fork 1
Fichiers Tickets 0 Wiki
Branche: gh-pages
Branches Tags
Nim
/
deques.idx

deques.idx 2.9 KB
Lien permanent Historique Raw

123456789101112131415161718192021222324252627282930313233343536 
  1. nimTitle	deques	deques.html	module std/deques		0
    2. 

  2. nim	Deque	deques.html#Deque	object Deque		56
    3. 

  3. nim	defaultInitialSize	deques.html#defaultInitialSize	const defaultInitialSize		72
    4. 

  4. nim	initDeque	deques.html#initDeque,int	proc initDeque[T](initialSize: int = defaultInitialSize): Deque[T]		85
    5. 

  5. nim	len	deques.html#len,Deque[T]	proc len[T](deq: Deque[T]): int		98
    6. 

  6. nim	`[]`	deques.html#[],Deque[T],Natural	proc `[]`[T](deq: Deque[T]; i: Natural): lent T		118
    7. 

  7. nim	`[]`	deques.html#[],Deque[T],Natural_2	proc `[]`[T](deq: var Deque[T]; i: Natural): var T		129
    8. 

  8. nim	`[]=`	deques.html#[]=,Deque[T],Natural,sinkT	proc `[]=`[T](deq: var Deque[T]; i: Natural; val: sink T)		140
    9. 

  9. nim	`[]`	deques.html#[],Deque[T],BackwardsIndex	proc `[]`[T](deq: Deque[T]; i: BackwardsIndex): lent T		152
    10. 

  10. nim	`[]`	deques.html#[],Deque[T],BackwardsIndex_2	proc `[]`[T](deq: var Deque[T]; i: BackwardsIndex): var T		165
    11. 

  11. nim	`[]=`	deques.html#[]=,Deque[T],BackwardsIndex,sinkT	proc `[]=`[T](deq: var Deque[T]; i: BackwardsIndex; x: sink T)		178
    12. 

  12. nim	items	deques.html#items.i,Deque[T]	iterator items[T](deq: Deque[T]): lent T		192
    13. 

  13. nim	mitems	deques.html#mitems.i,Deque[T]	iterator mitems[T](deq: var Deque[T]): var T		206
    14. 

  14. nim	pairs	deques.html#pairs.i,Deque[T]	iterator pairs[T](deq: Deque[T]): tuple[key: int, val: T]		221
    15. 

  15. nim	contains	deques.html#contains,Deque[T],T	proc contains[T](deq: Deque[T]; item: T): bool		232
    16. 

  16. nim	addFirst	deques.html#addFirst,Deque[T],sinkT	proc addFirst[T](deq: var Deque[T]; item: sink T)		262
    17. 

  17. nim	addLast	deques.html#addLast,Deque[T],sinkT	proc addLast[T](deq: var Deque[T]; item: sink T)		277
    18. 

  18. nim	toDeque	deques.html#toDeque,openArray[T]	proc toDeque[T](x: openArray[T]): Deque[T]		292
    19. 

  19. nim	peekFirst	deques.html#peekFirst,Deque[T]	proc peekFirst[T](deq: Deque[T]): lent T		306
    20. 

  20. nim	peekLast	deques.html#peekLast,Deque[T]	proc peekLast[T](deq: Deque[T]): lent T		321
    21. 

  21. nim	peekFirst	deques.html#peekFirst,Deque[T]_2	proc peekFirst[T](deq: var Deque[T]): var T		336
    22. 

  22. nim	peekLast	deques.html#peekLast,Deque[T]_2	proc peekLast[T](deq: var Deque[T]): var T		351
    23. 

  23. nim	popFirst	deques.html#popFirst,Deque[T]	proc popFirst[T](deq: var Deque[T]): T		369
    24. 

  24. nim	popLast	deques.html#popLast,Deque[T]	proc popLast[T](deq: var Deque[T]): T		385
    25. 

  25. nim	clear	deques.html#clear,Deque[T]	proc clear[T](deq: var Deque[T])		401
    26. 

  26. nim	shrink	deques.html#shrink,Deque[T],int,int	proc shrink[T](deq: var Deque[T]; fromFirst = 0; fromLast = 0)		415
    27. 

  27. nim	`$`	deques.html#$,Deque[T]	proc `$`[T](deq: Deque[T]): string		444
    28. 

  28. nim	`==`	deques.html#==,Deque[T],Deque[T]	proc `==`[T](deq1, deq2: Deque[T]): bool		456
    29. 

  29. nim	hash	deques.html#hash,Deque[T]	proc hash[T](deq: Deque[T]): Hash		476
    30. 

  30. idx	deque	deques.html#deque_1	Module deques		0
    31. 

  31. heading	See also	deques.html#see-also	 See also		0
    32. 

  32. nimgrp	peekfirst	deques.html#peekFirst-procs-all	proc		306
    33. 

  33. nimgrp	[]=	deques.html#[]=-procs-all	proc		140
    34. 

  34. nimgrp	[]	deques.html#[]-procs-all	proc		118
    35. 

  35. nimgrp	peeklast	deques.html#peekLast-procs-all	proc		321
    36. 

  36.