mirrors/Nim
1
0
Fork 0
mirror of https://github.com/nim-lang/Nim.git synced 2026-02-14 07:13:27 +00:00
Code Issues Packages Projects Releases Wiki Activity

enable experimental:strictDefs (#24225)

Browse Source
This commit is contained in:
ringabout
2024-11-24 05:01:39 +08:00
committed by GitHub
parent 555191a3f0
commit 2df633180a
86 changed files with 276 additions and 255 deletions
Download Patch File Download Diff File Expand all files Collapse all files

32
tests/stdlib/talgorithm.nim
View File

@@ -124,7 +124,7 @@ proc main() =
var x = @[1, 7, 8, 11, 21, 33, 45, 99]
var y = @[6, 7, 9, 12, 57, 66]
var merged: seq[int]
var merged: seq[int] = @[]
merged.merge(x, y)
doAssert merged.isSorted
doAssert merged == sorted(x & y)
@@ -133,7 +133,7 @@ proc main() =
var x = @[111, 88, 76, 56, 45, 31, 22, 19, 11, 3]
var y = @[99, 85, 83, 82, 69, 64, 48, 42, 33, 31, 26, 13]
var merged: seq[int]
var merged: seq[int] = @[]
merged.merge(x, y, (x, y) => -system.cmp(x, y))
doAssert merged.isSorted((x, y) => -system.cmp(x, y))
doAssert merged == sorted(x & y, SortOrder.Descending)
@@ -142,7 +142,7 @@ proc main() =
var x: seq[int] = @[]
var y = @[1]
var merged: seq[int]
var merged: seq[int] = @[]
merged.merge(x, y)
doAssert merged.isSorted
doAssert merged.isSorted(SortOrder.Descending)
@@ -152,7 +152,7 @@ proc main() =
var x = [1, 3, 5, 5, 7]
var y: seq[int] = @[]
var merged: seq[int]
var merged: seq[int] = @[]
merged.merge(x, y)
doAssert merged.isSorted
doAssert merged == @x
@@ -167,26 +167,26 @@ proc main() =
block:
var x: array[0, int]
var x = default(array[0, int])
var y = [1, 4, 6, 7, 9]
var merged: seq[int]
var merged: seq[int] = @[]
merged.merge(x, y)
doAssert merged.isSorted
doAssert merged == @y
block:
var x: array[0, int]
var y: array[0, int]
var x: array[0, int] = []
var y: array[0, int] = []
var merged: seq[int]
var merged: seq[int] = @[]
merged.merge(x, y)
doAssert merged.isSorted
doAssert merged.len == 0
block:
var x: array[0, int]
var y: array[0, int]
var x: array[0, int] = []
var y: array[0, int] = []
var merged: seq[int] = @[99, 99, 99]
merged.setLen(0)
@@ -195,10 +195,10 @@ proc main() =
doAssert merged.len == 0
block:
var x: seq[int]
var y: seq[int]
var x: seq[int] = @[]
var y: seq[int] = @[]
var merged: seq[int]
var merged: seq[int] = @[]
merged.merge(x, y)
doAssert merged.isSorted
doAssert merged.len == 0
@@ -245,7 +245,7 @@ proc main() =
var x = @[r(-12), r(1), r(3), r(8), r(13), r(88)]
var y = @[r(4), r(7), r(12), r(13), r(77), r(99)]
var merged: seq[Record]
var merged: seq[Record] = @[]
merged.setLen(0)
merged.merge(x, y, ascendingCmp)
doAssert merged.isSorted(ascendingCmp)
@@ -267,7 +267,7 @@ proc main() =
doAssert merged == sorted(x & y, ascendingCmp)
var x: seq[(int, int)]
var x: seq[(int, int)] = @[]
x.merge([(1,1)], [(1,2)], (a,b) => a[0] - b[0])
doAssert x == @[(1, 1), (1, 2)]