aboutsummaryrefslogtreecommitdiff
path: root/tests/tmatchtable.nim
diff options
context:
space:
mode:
Diffstat (limited to 'tests/tmatchtable.nim')
-rw-r--r--tests/tmatchtable.nim35
1 files changed, 35 insertions, 0 deletions
diff --git a/tests/tmatchtable.nim b/tests/tmatchtable.nim
new file mode 100644
index 0000000..4b21f1d
--- /dev/null
+++ b/tests/tmatchtable.nim
@@ -0,0 +1,35 @@
1# gzip-like LZSS compressor
2# Copyright (C) 2018 Pacien TRAN-GIRARD
3#
4# This program is free software: you can redistribute it and/or modify
5# it under the terms of the GNU Affero General Public License as
6# published by the Free Software Foundation, either version 3 of the
7# License, or (at your option) any later version.
8#
9# This program is distributed in the hope that it will be useful,
10# but WITHOUT ANY WARRANTY; without even the implied warranty of
11# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12# GNU Affero General Public License for more details.
13#
14# You should have received a copy of the GNU Affero General Public License
15# along with this program. If not, see <https://www.gnu.org/licenses/>.
16
17import unittest, lists, sequtils, tables
18import matchtable
19
20suite "matchtable":
21 test "matchList":
22 let matchTable = initMatchTable(seq[int], int)
23 check toSeq(matchTable.matchList(@[0, 1, 2]).items).len == 0
24
25 test "addMatch":
26 let matchTable = initMatchTable(seq[int], int)
27 matchTable.addMatch(@[0, 1, 2], 42)
28 matchTable.addMatch(@[2, 1, 0], 24)
29 check matchTable.len == 2
30 check toSeq(matchTable.matchList(@[0, 1, 2]).items) == @[42]
31 check toSeq(matchTable.matchList(@[2, 1, 0]).items) == @[24]
32 matchTable.addMatch(@[0, 1, 2], 1337)
33 check matchTable.len == 2
34 check toSeq(matchTable.matchList(@[0, 1, 2]).items) == @[1337, 42]
35 check toSeq(matchTable.matchList(@[2, 1, 0]).items) == @[24]