Home Explore Help
Sign In
levovix
/
Nim
mirror of https://github.com/nim-lang/Nim
Watch 1
Star 0
Fork 1
Files Issues 0 Wiki
Tree: 1a4643a625
Branches Tags
Nim
/
algorithm.idx

algorithm.idx 4.8 KB
History Raw

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748 
  1. nimTitle	algorithm	algorithm.html	module std/algorithm		0
    2. 

  2. nim	Descending	algorithm.html#Descending	SortOrder.Descending		52
    3. 

  3. nim	Ascending	algorithm.html#Ascending	SortOrder.Ascending		52
    4. 

  4. nim	SortOrder	algorithm.html#SortOrder	enum SortOrder		52
    5. 

  5. nim	`*`	algorithm.html#*,int,SortOrder	proc `*`(x: int; order: SortOrder): int		55
    6. 

  6. nim	fill	algorithm.html#fill,openArray[T],Natural,Natural,T	proc fill[T](a: var openArray[T]; first, last: Natural; value: T)		77
    7. 

  7. nim	fill	algorithm.html#fill,openArray[T],T	proc fill[T](a: var openArray[T]; value: T)		90
    8. 

  8. nim	reverse	algorithm.html#reverse,openArray[T],Natural,Natural	proc reverse[T](a: var openArray[T]; first, last: Natural)		101
    9. 

  9. nim	reverse	algorithm.html#reverse,openArray[T]	proc reverse[T](a: var openArray[T])		123
    10. 

  10. nim	reversed	algorithm.html#reversed,openArray[T]	proc reversed[T](a: openArray[T]): seq[T]		138
    11. 

  11. nim	reversed	algorithm.html#reversed,openArray[T],Natural,int	proc reversed[T](a: openArray[T]; first: Natural; last: int): seq[T]		151
    12. 

  12. nim	binarySearch	algorithm.html#binarySearch,openArray[T],K,proc(T,K)	proc binarySearch[T, K](a: openArray[T]; key: K;\n                   cmp: proc (x: T; y: K): int {.closure.}): int		160
    13. 

  13. nim	binarySearch	algorithm.html#binarySearch,openArray[T],T	proc binarySearch[T](a: openArray[T]; key: T): int		211
    14. 

  14. nim	lowerBound	algorithm.html#lowerBound,openArray[T],K,proc(T,K)	proc lowerBound[T, K](a: openArray[T]; key: K; cmp: proc (x: T; k: K): int {.closure.}): int		222
    15. 

  15. nim	lowerBound	algorithm.html#lowerBound,openArray[T],T	proc lowerBound[T](a: openArray[T]; key: T): int		258
    16. 

  16. nim	upperBound	algorithm.html#upperBound,openArray[T],K,proc(T,K)	proc upperBound[T, K](a: openArray[T]; key: K; cmp: proc (x: T; k: K): int {.closure.}): int		272
    17. 

  17. nim	upperBound	algorithm.html#upperBound,openArray[T],T	proc upperBound[T](a: openArray[T]; key: T): int		308
    18. 

  18. nim	sort	algorithm.html#sort,openArray[T],proc(T,T)	proc sort[T](a: var openArray[T]; cmp: proc (x, y: T): int {.closure.};\n        order = SortOrder.Ascending)		369
    19. 

  19. nim	sort	algorithm.html#sort,openArray[T]	proc sort[T](a: var openArray[T]; order = SortOrder.Ascending)		422
    20. 

  20. nim	sorted	algorithm.html#sorted,openArray[T],proc(T,T)	proc sorted[T](a: openArray[T]; cmp: proc (x, y: T): int {.closure.};\n          order = SortOrder.Ascending): seq[T]		432
    21. 

  21. nim	sorted	algorithm.html#sorted,openArray[T]	proc sorted[T](a: openArray[T]; order = SortOrder.Ascending): seq[T]		454
    22. 

  22. nim	sortedByIt	algorithm.html#sortedByIt.t,untyped,untyped	template sortedByIt(seq1, op: untyped): untyped		472
    23. 

  23. nim	isSorted	algorithm.html#isSorted,openArray[T],proc(T,T)	proc isSorted[T](a: openArray[T]; cmp: proc (x, y: T): int {.closure.};\n            order = SortOrder.Ascending): bool		508
    24. 

  24. nim	isSorted	algorithm.html#isSorted,openArray[T]	proc isSorted[T](a: openArray[T]; order = SortOrder.Ascending): bool		535
    25. 

  25. nim	merge	algorithm.html#merge,seq[T],openArray[T],openArray[T],proc(T,T)	proc merge[T](result: var seq[T]; x, y: openArray[T];\n         cmp: proc (x, y: T): int {.closure.})		555
    26. 

  26. nim	merge	algorithm.html#merge,seq[T],openArray[T],openArray[T]	proc merge[T](result: var seq[T]; x, y: openArray[T])		632
    27. 

  27. nim	product	algorithm.html#product,openArray[seq[T]]	proc product[T](x: openArray[seq[T]]): seq[seq[T]]		647
    28. 

  28. nim	nextPermutation	algorithm.html#nextPermutation,openArray[T]	proc nextPermutation[T](x: var openArray[T]): bool		684
    29. 

  29. nim	prevPermutation	algorithm.html#prevPermutation,openArray[T]	proc prevPermutation[T](x: var openArray[T]): bool		724
    30. 

  30. nim	rotateLeft	algorithm.html#rotateLeft,openArray[T],HSlice[int,int],int	proc rotateLeft[T](arg: var openArray[T]; slice: HSlice[int, int]; dist: int): int		813
    31. 

  31. nim	rotateLeft	algorithm.html#rotateLeft,openArray[T],int	proc rotateLeft[T](arg: var openArray[T]; dist: int): int		851
    32. 

  32. nim	rotatedLeft	algorithm.html#rotatedLeft,openArray[T],HSlice[int,int],int	proc rotatedLeft[T](arg: openArray[T]; slice: HSlice[int, int]; dist: int): seq[T]		871
    33. 

  33. nim	rotatedLeft	algorithm.html#rotatedLeft,openArray[T],int	proc rotatedLeft[T](arg: openArray[T]; dist: int): seq[T]		901
    34. 

  34. heading	Basic usage	algorithm.html#basic-usage	 Basic usage		0
    35. 

  35. heading	See also	algorithm.html#see-also	 See also		0
    36. 

  36. nimgrp	rotateleft	algorithm.html#rotateLeft-procs-all	proc		813
    37. 

  37. nimgrp	sort	algorithm.html#sort-procs-all	proc		369
    38. 

  38. nimgrp	issorted	algorithm.html#isSorted-procs-all	proc		508
    39. 

  39. nimgrp	lowerbound	algorithm.html#lowerBound-procs-all	proc		222
    40. 

  40. nimgrp	reverse	algorithm.html#reverse-procs-all	proc		101
    41. 

  41. nimgrp	sorted	algorithm.html#sorted-procs-all	proc		432
    42. 

  42. nimgrp	reversed	algorithm.html#reversed-procs-all	proc		138
    43. 

  43. nimgrp	binarysearch	algorithm.html#binarySearch-procs-all	proc		160
    44. 

  44. nimgrp	merge	algorithm.html#merge-procs-all	proc		555
    45. 

  45. nimgrp	rotatedleft	algorithm.html#rotatedLeft-procs-all	proc		871
    46. 

  46. nimgrp	fill	algorithm.html#fill-procs-all	proc		77
    47. 

  47. nimgrp	upperbound	algorithm.html#upperBound-procs-all	proc		272
    48. 

  48.