首页 发现 帮助
登录
levovix
/
Nim
镜像自地址 https://github.com/nim-lang/Nim
关注 1
点赞 0
派生 1
文件 工单管理 0 Wiki
分支: gh-pages
分支列表 标签列表
Nim
/
lists.idx

lists.idx 7.3 KB
永久链接 文件历史 原始文件

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475 
  1. nimTitle	lists	lists.html	module std/lists		0
    2. 

  2. nim	DoublyLinkedNodeObj	lists.html#DoublyLinkedNodeObj	object DoublyLinkedNodeObj		66
    3. 

  3. nim	DoublyLinkedNode	lists.html#DoublyLinkedNode	type DoublyLinkedNode		73
    4. 

  4. nim	SinglyLinkedNodeObj	lists.html#SinglyLinkedNodeObj	object SinglyLinkedNodeObj		75
    5. 

  5. nim	SinglyLinkedNode	lists.html#SinglyLinkedNode	type SinglyLinkedNode		81
    6. 

  6. nim	SinglyLinkedList	lists.html#SinglyLinkedList	object SinglyLinkedList		83
    7. 

  7. nim	DoublyLinkedList	lists.html#DoublyLinkedList	object DoublyLinkedList		88
    8. 

  8. nim	SinglyLinkedRing	lists.html#SinglyLinkedRing	object SinglyLinkedRing		93
    9. 

  9. nim	DoublyLinkedRing	lists.html#DoublyLinkedRing	object DoublyLinkedRing		98
    10. 

  10. nim	SomeLinkedList	lists.html#SomeLinkedList	type SomeLinkedList		102
    11. 

  11. nim	SomeLinkedRing	lists.html#SomeLinkedRing	type SomeLinkedRing		104
    12. 

  12. nim	SomeLinkedCollection	lists.html#SomeLinkedCollection	type SomeLinkedCollection		106
    13. 

  13. nim	SomeLinkedNode	lists.html#SomeLinkedNode	type SomeLinkedNode		108
    14. 

  14. nim	initSinglyLinkedList	lists.html#initSinglyLinkedList	proc initSinglyLinkedList[T](): SinglyLinkedList[T]		110
    15. 

  15. nim	initDoublyLinkedList	lists.html#initDoublyLinkedList	proc initDoublyLinkedList[T](): DoublyLinkedList[T]		120
    16. 

  16. nim	initSinglyLinkedRing	lists.html#initSinglyLinkedRing	proc initSinglyLinkedRing[T](): SinglyLinkedRing[T]		130
    17. 

  17. nim	initDoublyLinkedRing	lists.html#initDoublyLinkedRing	proc initDoublyLinkedRing[T](): DoublyLinkedRing[T]		140
    18. 

  18. nim	newDoublyLinkedNode	lists.html#newDoublyLinkedNode,T	proc newDoublyLinkedNode[T](value: T): DoublyLinkedNode[T]		150
    19. 

  19. nim	newSinglyLinkedNode	lists.html#newSinglyLinkedNode,T	proc newSinglyLinkedNode[T](value: T): SinglyLinkedNode[T]		159
    20. 

  20. nim	items	lists.html#items.i,SomeLinkedList[T]	iterator items[T](L: SomeLinkedList[T]): T		182
    21. 

  21. nim	items	lists.html#items.i,SomeLinkedRing[T]	iterator items[T](L: SomeLinkedRing[T]): T		198
    22. 

  22. nim	mitems	lists.html#mitems.i,SomeLinkedList[T]	iterator mitems[T](L: var SomeLinkedList[T]): var T		214
    23. 

  23. nim	mitems	lists.html#mitems.i,SomeLinkedRing[T]	iterator mitems[T](L: var SomeLinkedRing[T]): var T		231
    24. 

  24. nim	nodes	lists.html#nodes.i,SomeLinkedList[T]	iterator nodes[T](L: SomeLinkedList[T]): SomeLinkedNode[T]		248
    25. 

  25. nim	nodes	lists.html#nodes.i,SomeLinkedRing[T]	iterator nodes[T](L: SomeLinkedRing[T]): SomeLinkedNode[T]		273
    26. 

  26. nim	`$`	lists.html#$,SomeLinkedCollection[T]	proc `$`[T](L: SomeLinkedCollection[T]): string		300
    27. 

  27. nim	find	lists.html#find,SomeLinkedCollection[T],T	proc find[T](L: SomeLinkedCollection[T]; value: T): SomeLinkedNode[T]		312
    28. 

  28. nim	contains	lists.html#contains,SomeLinkedCollection[T],T	proc contains[T](L: SomeLinkedCollection[T]; value: T): bool		330
    29. 

  29. nim	prepend	lists.html#prepend,T,T	proc prepend[T: SomeLinkedList](a: var T; b: T)		346
    30. 

  30. nim	prependMoved	lists.html#prependMoved,T,T	proc prependMoved[T: SomeLinkedList](a, b: var T)		366
    31. 

  31. nim	add	lists.html#add,SinglyLinkedList[T],SinglyLinkedNode[T]	proc add[T](L: var SinglyLinkedList[T]; n: SinglyLinkedNode[T])		393
    32. 

  32. nim	add	lists.html#add,SinglyLinkedList[T],T	proc add[T](L: var SinglyLinkedList[T]; value: T)		414
    33. 

  33. nim	prepend	lists.html#prepend,SinglyLinkedList[T],SinglyLinkedNode[T]	proc prepend[T](L: var SinglyLinkedList[T]; n: SinglyLinkedNode[T])		430
    34. 

  34. nim	prepend	lists.html#prepend,SinglyLinkedList[T],T	proc prepend[T](L: var SinglyLinkedList[T]; value: T)		449
    35. 

  35. nim	copy	lists.html#copy,SinglyLinkedList[T]	proc copy[T](a: SinglyLinkedList[T]): SinglyLinkedList[T]		466
    36. 

  36. nim	addMoved	lists.html#addMoved,SinglyLinkedList[T],SinglyLinkedList[T]	proc addMoved[T](a, b: var SinglyLinkedList[T])		490
    37. 

  37. nim	add	lists.html#add,DoublyLinkedList[T],DoublyLinkedNode[T]	proc add[T](L: var DoublyLinkedList[T]; n: DoublyLinkedNode[T])		523
    38. 

  38. nim	add	lists.html#add,DoublyLinkedList[T],T	proc add[T](L: var DoublyLinkedList[T]; value: T)		547
    39. 

  39. nim	prepend	lists.html#prepend,DoublyLinkedList[T],DoublyLinkedNode[T]	proc prepend[T](L: var DoublyLinkedList[T]; n: DoublyLinkedNode[T])		566
    40. 

  40. nim	prepend	lists.html#prepend,DoublyLinkedList[T],T	proc prepend[T](L: var DoublyLinkedList[T]; value: T)		590
    41. 

  41. nim	copy	lists.html#copy,DoublyLinkedList[T]	proc copy[T](a: DoublyLinkedList[T]): DoublyLinkedList[T]		609
    42. 

  42. nim	addMoved	lists.html#addMoved,DoublyLinkedList[T],DoublyLinkedList[T]	proc addMoved[T](a, b: var DoublyLinkedList[T])		633
    43. 

  43. nim	add	lists.html#add,T,T	proc add[T: SomeLinkedList](a: var T; b: T)		668
    44. 

  44. nim	remove	lists.html#remove,SinglyLinkedList[T],SinglyLinkedNode[T]	proc remove[T](L: var SinglyLinkedList[T]; n: SinglyLinkedNode[T]): bool		688
    45. 

  45. nim	remove	lists.html#remove,DoublyLinkedList[T],DoublyLinkedNode[T]	proc remove[T](L: var DoublyLinkedList[T]; n: DoublyLinkedNode[T])		726
    46. 

  46. nim	add	lists.html#add,SinglyLinkedRing[T],SinglyLinkedNode[T]	proc add[T](L: var SinglyLinkedRing[T]; n: SinglyLinkedNode[T])		755
    47. 

  47. nim	add	lists.html#add,SinglyLinkedRing[T],T	proc add[T](L: var SinglyLinkedRing[T]; value: T)		778
    48. 

  48. nim	prepend	lists.html#prepend,SinglyLinkedRing[T],SinglyLinkedNode[T]	proc prepend[T](L: var SinglyLinkedRing[T]; n: SinglyLinkedNode[T])		795
    49. 

  49. nim	prepend	lists.html#prepend,SinglyLinkedRing[T],T	proc prepend[T](L: var SinglyLinkedRing[T]; value: T)		818
    50. 

  50. nim	add	lists.html#add,DoublyLinkedRing[T],DoublyLinkedNode[T]	proc add[T](L: var DoublyLinkedRing[T]; n: DoublyLinkedNode[T])		837
    51. 

  51. nim	add	lists.html#add,DoublyLinkedRing[T],T	proc add[T](L: var DoublyLinkedRing[T]; value: T)		863
    52. 

  52. nim	prepend	lists.html#prepend,DoublyLinkedRing[T],DoublyLinkedNode[T]	proc prepend[T](L: var DoublyLinkedRing[T]; n: DoublyLinkedNode[T])		882
    53. 

  53. nim	prepend	lists.html#prepend,DoublyLinkedRing[T],T	proc prepend[T](L: var DoublyLinkedRing[T]; value: T)		908
    54. 

  54. nim	remove	lists.html#remove,DoublyLinkedRing[T],DoublyLinkedNode[T]	proc remove[T](L: var DoublyLinkedRing[T]; n: DoublyLinkedNode[T])		927
    55. 

  55. nim	append	lists.html#append,,	proc append[T](a: var (SinglyLinkedList[T] | SinglyLinkedRing[T]);\n          b: SinglyLinkedList[T] | SinglyLinkedNode[T] | T)		949
    56. 

  56. nim	append	lists.html#append,,_2	proc append[T](a: var (DoublyLinkedList[T] | DoublyLinkedRing[T]);\n          b: DoublyLinkedList[T] | DoublyLinkedNode[T] | T)		959
    57. 

  57. nim	appendMoved	lists.html#appendMoved,T,T	proc appendMoved[T: SomeLinkedList](a, b: var T)		969
    58. 

  58. nim	toSinglyLinkedList	lists.html#toSinglyLinkedList,openArray[T]	proc toSinglyLinkedList[T](elems: openArray[T]): SinglyLinkedList[T]		977
    59. 

  59. nim	toSinglyLinkedRing	lists.html#toSinglyLinkedRing,openArray[T]	proc toSinglyLinkedRing[T](elems: openArray[T]): SinglyLinkedRing[T]		988
    60. 

  60. nim	toDoublyLinkedList	lists.html#toDoublyLinkedList,openArray[T]	proc toDoublyLinkedList[T](elems: openArray[T]): DoublyLinkedList[T]		999
    61. 

  61. nim	toDoublyLinkedRing	lists.html#toDoublyLinkedRing,openArray[T]	proc toDoublyLinkedRing[T](elems: openArray[T]): DoublyLinkedRing[T]		1010
    62. 

  62. heading	Basic Usage	lists.html#basic-usage	 Basic Usage		0
    63. 

  63. heading	Lists	lists.html#basic-usage-lists	  Lists		0
    64. 

  64. heading	Rings	lists.html#basic-usage-rings	  Rings		0
    65. 

  65. heading	See also	lists.html#see-also	 See also		0
    66. 

  66. nimgrp	remove	lists.html#remove-procs-all	proc		688
    67. 

  67. nimgrp	copy	lists.html#copy-procs-all	proc		466
    68. 

  68. nimgrp	prepend	lists.html#prepend-procs-all	proc		346
    69. 

  69. nimgrp	add	lists.html#add-procs-all	proc		393
    70. 

  70. nimgrp	addmoved	lists.html#addMoved-procs-all	proc		490
    71. 

  71. nimgrp	append	lists.html#append-procs-all	proc		949
    72. 

  72. nimgrp	items	lists.html#items-iterators-all	iterator		182
    73. 

  73. nimgrp	mitems	lists.html#mitems-iterators-all	iterator		214
    74. 

  74. nimgrp	nodes	lists.html#nodes-iterators-all	iterator		248
    75. 

  75.