aboutsummaryrefslogtreecommitdiff
path: root/tests
diff options
context:
space:
mode:
Diffstat (limited to 'tests')
-rw-r--r--tests/tbitio.nim28
-rw-r--r--tests/tintegers.nim43
2 files changed, 26 insertions, 45 deletions
diff --git a/tests/tbitio.nim b/tests/tbitio.nim
index 0391974..91b9cbf 100644
--- a/tests/tbitio.nim
+++ b/tests/tbitio.nim
@@ -15,8 +15,32 @@
15# along with this program. If not, see <https://www.gnu.org/licenses/>. 15# along with this program. If not, see <https://www.gnu.org/licenses/>.
16 16
17import unittest, streams, sugar, sequtils 17import unittest, streams, sugar, sequtils
18import integers 18import bitio/integers, bitio/bitreader, bitio/bitwriter
19import bitio/bitreader, bitio/bitwriter 19
20suite "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)]
20 44
21suite "bitreader": 45suite "bitreader":
22 test "readBool": 46 test "readBool":
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
17import unittest, sequtils
18import integers
19
20suite "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)]