Nim - This repository contains the Nim compiler, Nim's stdlib, tools, and documentation. (mirror)

diff options

Diffstat

-rw-r--r--

compiler/platform.nim

-rw-r--r--

lib/pure/concurrency/threadpool.nim

-rw-r--r--

todo.txt

3 files changed, 8 insertions, 3 deletions

discard """ cmd: "nim c --threads:on $file" output: '''true''' """ import hashes, tables, sharedtables, algorithm, sequtils proc sortedPairs[T](t: T): auto = toSeq(t.pairs).sorted const data = { "34": 123456, "12": 789, "90": 343, "0": 34404, "1": 344004, "2": 344774, "3": 342244, "4": 3412344, "5": 341232144, "6": 34214544, "7": 3434544, "8": 344544, "9": 34435644, "---00": 346677844, "10": 34484, "11": 34474, "19": 34464, "20": 34454, "30": 34141244, "40": 344114, "50": 344490, "60": 344491, "70": 344492, "80": 344497} sorteddata = { "---00": 346677844, "0": 34404, "1": 344004, "10": 34484, "11": 34474, "12": 789, "19": 34464, "2": 344774, "20": 34454, "3": 342244, "30": 34141244, "34": 123456, "4": 3412344, "40": 344114, "5": 341232144, "50": 344490, "6": 34214544, "60": 344491, "7": 3434544, "70": 344492, "8": 344544, "80": 344497, "9": 34435644, "90": 343} block tableTest1: var t = initTable[tuple[x, y: int], string]() t[(0,0)] = "00" t[(1,0)] = "10" t[(0,1)] = "01" t[(1,1)] = "11" for x in 0..1: for y in 0..1: doAssert t[(x,y)] == $x & $y doAssert t.sortedPairs == @[((x: 0, y: 0), "00"), ((x: 0, y: 1), "01"), ((x: 1, y: 0), "10"), ((x: 1, y: 1), "11")] block tableTest2: var t = initTable[string, float]() t["test"] = 1.2345 t["111"] = 1.000043 t["123"] = 1.23 t.del("111") t["012"] = 67.9 t["123"] = 1.5 # test overwriting doAssert t["123"] == 1.5 try: echo t["111"] # deleted except KeyError: discard doAssert(not hasKey(t, "111")) doAssert "123" in t doAssert("111" notin t) for key, val in items(data): t[key] = val.toFloat for key, val in items(data): doAssert t[key] == val.toFloat doAssert(not t.hasKeyOrPut("456", 4.0)) # test absent key doAssert t.hasKeyOrPut("012", 3.0) # test present key var x = t.mgetOrPut("111", 1.5) # test absent key x = x * 2 doAssert x == 3.0 x = t.mgetOrPut("test", 1.5) # test present key x = x * 2 doAssert x == 2 * 1.2345 block orderedTableTest1: var t = initOrderedTable[string, int](2) for key, val in items(data): t[key] = val for key, val in items(data): doAssert t[key] == val var i = 0 # `pairs` needs to yield in insertion order: for key, val in pairs(t): doAssert key == data[i][0] doAssert val == data[i][1] inc(i) for key, val in mpairs(t): val = 99 for val in mvalues(t): doAssert val == 99 block orderedTableTest2: var s = initOrderedTable[string, int]() t = initOrderedTable[string, int]() doAssert s == t for key, val in items(data): t[key] = val doAssert s != t for key, val in items(sorteddata): s[key] = val doAssert s != t t.clear() doAssert s != t for key, val in items(sorteddata): t[key] = val doAssert s == t block countTableTest1: var s = data.toTable var t = initCountTable[string]() for k in s.keys: t.inc(k) for k in t.keys: doAssert t[k] == 1 t.inc("90", 3) t.inc("12", 2) t.inc("34", 1) doAssert t.largest()[0] == "90" t.sort() var i = 0 for k, v in t.pairs: case i of 0: doAssert k == "90" and v == 4 of 1: doAssert k == "12" and v == 3 of 2: doAssert k == "34" and v == 2 else: break inc i block countTableTest2: var s = initCountTable[int]() t = initCountTable[int]() doAssert s == t s.inc(1) doAssert s != t t.inc(2) doAssert s != t t.inc(1) doAssert s != t s.inc(2) doAssert s == t s.inc(1) doAssert s != t t.inc(1) doAssert s == t block mpairsTableTest1: var t = initTable[string, int]() t["a"] = 1 t["b"] = 2 t["c"] = 3 t["d"] = 4 for k, v in t.mpairs: if k == "a" or k == "c": v = 9 for k, v in t.pairs: if k == "a" or k == "c": doAssert v == 9 else: doAssert v != 1 and v != 3 block SyntaxTest: var x = toTable[int, string]({:}) block zeroHashKeysTest: proc doZeroHashValueTest[T, K, V](t: T, nullHashKey: K, value: V) = let initialLen = t.len var testTable = t testTable[nullHashKey] = value doAssert testTable[nullHashKey] == value doAssert testTable.len == initialLen + 1 testTable.del(nullHashKey) doAssert testTable.len == initialLen # with empty table doZeroHashValueTest(toTable[int,int]({:}), 0, 42) doZeroHashValueTest(toTable[string,int]({:}), "", 23) doZeroHashValueTest(toOrderedTable[int,int]({:}), 0, 42) doZeroHashValueTest(toOrderedTable[string,int]({:}), "", 23) # with non-empty table doZeroHashValueTest(toTable[int,int]({1:2}), 0, 42) doZeroHashValueTest(toTable[string,string]({"foo": "bar"}), "", "zero") doZeroHashValueTest(toOrderedTable[int,int]({3:4}), 0, 42) doZeroHashValueTest(toOrderedTable[string,string]({"egg": "sausage"}), "", "spam") block clearTableTest: var t = data.toTable doAssert t.len() != 0 t.clear() doAssert t.len() == 0 block clearOrderedTableTest: var t = data.toOrderedTable doAssert t.len() != 0 t.clear() doAssert t.len() == 0 block clearCountTableTest: var t = initCountTable[string]() t.inc("90", 3) t.inc("12", 2) t.inc("34", 1) doAssert t.len() != 0 t.clear() doAssert t.len() == 0 block withKeyTest: var t: SharedTable[int, int] t.init() t.withKey(1) do (k: int, v: var int, pairExists: var bool): doAssert(v == 0) pairExists = true v = 42 doAssert(t.mget(1) == 42) t.withKey(1) do (k: int, v: var int, pairExists: var bool): doAssert(v == 42) pairExists = false try: discard t.mget(1) doAssert(false, "KeyError expected") except KeyError: discard t.withKey(2) do (k: int, v: var int, pairExists: var bool): pairExists = false try: discard t.mget(2) doAssert(false, "KeyError expected") except KeyError: discard block takeTest: var t = initTable[string, int]() t["key"] = 123 var val = 0 doAssert(t.take("key", val)) doAssert(val == 123) val = -1 doAssert(not t.take("key", val)) doAssert(val == -1) doAssert(not t.take("otherkey", val)) doAssert(val == -1) proc orderedTableSortTest() = var t = initOrderedTable[string, int](2) for key, val in items(data): t[key] = val for key, val in items(data): doAssert t[key] == val t.sort(proc (x, y: tuple[key: string, val: int]): int = cmp(x.key, y.key)) var i = 0 # `pairs` needs to yield in sorted order: for key, val in pairs(t): doAssert key == sorteddata[i][0] doAssert val == sorteddata[i][1] inc(i) # check that lookup still works: for key, val in pairs(t): doAssert val == t[key] # check that insert still works: t["newKeyHere"] = 80 orderedTableSortTest() echo "true"


context:
space:
mode: