aboutsummaryrefslogtreecommitdiff
path: root/src/lzss/lzsschain.nim
blob: ab03655f213bc72f881329561e6c41c48de02a68 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
# gzip-like LZSS compressor
# Copyright (C) 2018  Pacien TRAN-GIRARD
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU Affero General Public License as
# published by the Free Software Foundation, either version 3 of the
# License, or (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
# GNU Affero General Public License for more details.
#
# You should have received a copy of the GNU Affero General Public License
# along with this program.  If not, see <https://www.gnu.org/licenses/>.

import tables, sugar
import ../bitio/integers
import lzssnode

const maxChainByteLength = 32_000

type LzssChain* = seq[LzssNode]

proc lzssChain*(): LzssChain =
  newSeq[LzssNode]()

proc lzssChain*(chainArray: openArray[LzssNode]): LzssChain =
  @chainArray

proc decode*(lzssChain: LzssChain): seq[uint8] =
  result = newSeqOfCap[uint8](maxChainByteLength)
  for node in lzssChain:
    case node.kind:
      of character:
        result.add(node.character)
      of reference:
        let absolutePos = result.len - node.relativePos
        result.add(result.toOpenArray(absolutePos, absolutePos + node.length - 1))