diff options
author | pacien | 2018-11-30 21:02:29 +0100 |
---|---|---|
committer | pacien | 2018-11-30 21:02:29 +0100 |
commit | 3d5a87a5879aa724e47546d1bdbb7f6c9466cf94 (patch) | |
tree | a0abba7ab32e88e8daf6b7b547cfd446754cacfe /tests/tintegers.nim | |
parent | 5bbe75659aef55542268cbf35c66342cb22ce865 (diff) | |
download | gziplike-3d5a87a5879aa724e47546d1bdbb7f6c9466cf94.tar.gz |
move integers utils
Diffstat (limited to 'tests/tintegers.nim')
-rw-r--r-- | tests/tintegers.nim | 43 |
1 files changed, 0 insertions, 43 deletions
diff --git a/tests/tintegers.nim b/tests/tintegers.nim deleted file mode 100644 index 851e926..0000000 --- a/tests/tintegers.nim +++ /dev/null | |||
@@ -1,43 +0,0 @@ | |||
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 | |||
17 | import unittest, sequtils | ||
18 | import integers | ||
19 | |||
20 | suite "integers": | ||
21 | test "Round-up integer division": | ||
22 | check 42 /^ 2 == 21 | ||
23 | check 43 /^ 2 == 22 | ||
24 | |||
25 | test "truncateToUint8": | ||
26 | check truncateToUint8(0xFA'u8) == 0xFA'u8 | ||
27 | check truncateToUint8(0x00FA'u16) == 0xFA'u8 | ||
28 | check truncateToUint8(0xFFFA'u16) == 0xFA'u8 | ||
29 | |||
30 | test "bitLength": | ||
31 | check bitLength(0b1_1111) == 5 | ||
32 | check bitLength(0b1000_0000) == 8 | ||
33 | |||
34 | test "leastSignificantBits": | ||
35 | check leastSignificantBits(0xFF'u8, 3) == 0b0000_0111'u8 | ||
36 | check leastSignificantBits(0b0001_0101'u8, 3) == 0b0000_0101'u8 | ||
37 | check leastSignificantBits(0xFF'u8, 10) == 0xFF'u8 | ||
38 | check leastSignificantBits(0xFFFF'u16, 16) == 0xFFFF'u16 | ||
39 | check leastSignificantBits(0xFFFF'u16, 8) == 0x00FF'u16 | ||
40 | |||
41 | test "chunks iterator": | ||
42 | check toSeq(chunks(70, uint32)) == @[(0, 32), (1, 32), (2, 6)] | ||
43 | check toSeq(chunks(32, uint16)) == @[(0, 16), (1, 16)] | ||