Etusivu Tutki Apua
Kirjaudu sisään
levovix
/
Nim
peilaus alkaen https://github.com/nim-lang/Nim
Tarkkaile 1
Äänestä 0
Fork 1
Tiedostot Ongelmat 0 Wiki
Puu: e3e974c79f
Branchit Tagit
Nim
/
sequtils.idx

sequtils.idx 4.3 KB
Historia Raaka

123456789101112131415161718192021222324252627282930313233343536373839404142434445 
  1. nimTitle	sequtils	sequtils.html	module std/sequtils		0
    2. 

  2. nim	concat	sequtils.html#concat,varargs[seq[T]]	proc concat[T](seqs: varargs[seq[T]]): seq[T]		119
    3. 

  3. nim	addUnique	sequtils.html#addUnique,seq[T],sinkT	proc addUnique[T](s: var seq[T]; x: sink T)		144
    4. 

  4. nim	count	sequtils.html#count,openArray[T],T	proc count[T](s: openArray[T]; x: T): int		160
    5. 

  5. nim	cycle	sequtils.html#cycle,openArray[T],Natural	proc cycle[T](s: openArray[T]; n: Natural): seq[T]		175
    6. 

  6. nim	repeat	sequtils.html#repeat,T,Natural	proc repeat[T](x: T; n: Natural): seq[T]		193
    7. 

  7. nim	deduplicate	sequtils.html#deduplicate,openArray[T],bool	proc deduplicate[T](s: openArray[T]; isSorted: bool = false): seq[T]		206
    8. 

  8. nim	minIndex	sequtils.html#minIndex,openArray[T]	proc minIndex[T](s: openArray[T]): int		234
    9. 

  9. nim	maxIndex	sequtils.html#maxIndex,openArray[T]	proc maxIndex[T](s: openArray[T]): int		251
    10. 

  10. nim	minmax	sequtils.html#minmax,openArray[T]	proc minmax[T](x: openArray[T]): (T, T)		268
    11. 

  11. nim	zip	sequtils.html#zip,,	proc zip[S, T](s1: openArray[S]; s2: openArray[T]): seq[(S, T)]		320
    12. 

  12. nim	unzip	sequtils.html#unzip,openArray[]	proc unzip[S, T](s: openArray[(S, T)]): (seq[S], seq[T])		322
    13. 

  13. nim	distribute	sequtils.html#distribute,seq[T],Positive	proc distribute[T](s: seq[T]; num: Positive; spread = true): seq[seq[T]]		336
    14. 

  14. nim	map	sequtils.html#map,openArray[T],proc(T)	proc map[T, S](s: openArray[T]; op: proc (x: T): S {.closure.}): seq[S]		392
    15. 

  15. nim	apply	sequtils.html#apply,openArray[T],proc(T)	proc apply[T](s: var openArray[T]; op: proc (x: var T) {.closure.})		418
    16. 

  16. nim	apply	sequtils.html#apply,openArray[T],proc(T)_2	proc apply[T](s: var openArray[T]; op: proc (x: T): T {.closure.})		437
    17. 

  17. nim	apply	sequtils.html#apply,openArray[T],proc(T)_3	proc apply[T](s: openArray[T]; op: proc (x: T) {.closure.})		457
    18. 

  18. nim	filter	sequtils.html#filter.i,openArray[T],proc(T)	iterator filter[T](s: openArray[T]; pred: proc (x: T): bool {.closure.}): T		466
    19. 

  19. nim	filter	sequtils.html#filter,openArray[T],proc(T)	proc filter[T](s: openArray[T]; pred: proc (x: T): bool {.closure.}): seq[T]		489
    20. 

  20. nim	keepIf	sequtils.html#keepIf,seq[T],proc(T)	proc keepIf[T](s: var seq[T]; pred: proc (x: T): bool {.closure.})		516
    21. 

  21. nim	delete	sequtils.html#delete,seq[T],Slice[int]	proc delete[T](s: var seq[T]; slice: Slice[int])		546
    22. 

  22. nim	delete	sequtils.html#delete,seq[T],Natural,Natural	proc delete[T](s: var seq[T]; first, last: Natural)		586
    23. 

  23. nim	insert	sequtils.html#insert,seq[T],openArray[T],int	proc insert[T](dest: var seq[T]; src: openArray[T]; pos = 0)		610
    24. 

  24. nim	filterIt	sequtils.html#filterIt.t,untyped,untyped	template filterIt(s, pred: untyped): untyped		644
    25. 

  25. nim	keepItIf	sequtils.html#keepItIf.t,seq,untyped	template keepItIf(varSeq: seq; pred: untyped)		674
    26. 

  26. nim	countIt	sequtils.html#countIt.t,untyped,untyped	template countIt(s, pred: untyped): int		704
    27. 

  27. nim	all	sequtils.html#all,openArray[T],proc(T)	proc all[T](s: openArray[T]; pred: proc (x: T): bool {.closure.}): bool		722
    28. 

  28. nim	allIt	sequtils.html#allIt.t,untyped,untyped	template allIt(s, pred: untyped): bool		740
    29. 

  29. nim	any	sequtils.html#any,openArray[T],proc(T)	proc any[T](s: openArray[T]; pred: proc (x: T): bool {.closure.}): bool		764
    30. 

  30. nim	anyIt	sequtils.html#anyIt.t,untyped,untyped	template anyIt(s, pred: untyped): bool		782
    31. 

  31. nim	toSeq	sequtils.html#toSeq.t,untyped	template toSeq(iter: untyped): untyped		847
    32. 

  32. nim	foldl	sequtils.html#foldl.t,untyped,untyped	template foldl(sequence, operation: untyped): untyped		885
    33. 

  33. nim	foldl	sequtils.html#foldl.t,,,	template foldl(sequence, operation, first): untyped		934
    34. 

  34. nim	foldr	sequtils.html#foldr.t,untyped,untyped	template foldr(sequence, operation: untyped): untyped		961
    35. 

  35. nim	mapIt	sequtils.html#mapIt.t,typed,untyped	template mapIt(s: typed; op: untyped): untyped		1003
    36. 

  36. nim	applyIt	sequtils.html#applyIt.t,untyped,untyped	template applyIt(varSeq, op: untyped)		1068
    37. 

  37. nim	newSeqWith	sequtils.html#newSeqWith.t,int,untyped	template newSeqWith(len: int; init: untyped): untyped		1089
    38. 

  38. nim	mapLiterals	sequtils.html#mapLiterals.m,untyped,untyped	macro mapLiterals(constructor, op: untyped; nested = true): untyped		1130
    39. 

  39. nim	items	sequtils.html#items.i	iterator items[T](xs: iterator (): T): T		1156
    40. 

  40. idx	seq	sequtils.html#seq_1	Module sequtils		0
    41. 

  41. heading	See also	sequtils.html#see-also	 See also		0
    42. 

  42. nimgrp	apply	sequtils.html#apply-procs-all	proc		418
    43. 

  43. nimgrp	delete	sequtils.html#delete-procs-all	proc		546
    44. 

  44. nimgrp	foldl	sequtils.html#foldl-templates-all	template		885
    45. 

  45.