From 568df00fdc714f138d3106df863665bd63c2b9f6 Mon Sep 17 00:00:00 2001 From: Ryan Oldenburg Date: Mon, 2 Nov 2020 22:30:10 -0600 Subject: [PATCH] f --- src/zippy/compress.nim | 43 +++++++++++++++++++++--------------------- 1 file changed, 21 insertions(+), 22 deletions(-) diff --git a/src/zippy/compress.nim b/src/zippy/compress.nim index 9a1e9a6..dea33b5 100644 --- a/src/zippy/compress.nim +++ b/src/zippy/compress.nim @@ -26,11 +26,6 @@ const 0xDF, 0x3F, 0xBF, 0x7F, 0xFF ] -type - Coin = object - symbols: seq[uint16] - weight: uint64 - # {.push checks: off.} template failCompress() = @@ -38,28 +33,32 @@ template failCompress() = ZippyError, "Unexpected error while compressing" ) -func quickSort(s: var seq[Coin], lo, hi: int) = - if lo >= hi: - return - - var - pivot = lo - switch_i = lo + 1 - for i in lo + 1 .. hi: - if s[i].weight < s[pivot].weight: - swap(s[i], s[switch_i]) - swap(s[pivot], s[switch_i]) - inc pivot - inc switch_i - - quickSort(s, lo, pivot - 1) - quickSort(s, pivot + 1, hi) - func huffmanCodeLengths( frequencies: seq[uint64], minCodes, maxBitLen: int ): (int, seq[uint8], seq[uint16]) = # See https://en.wikipedia.org/wiki/Huffman_coding#Length-limited_Huffman_coding + type Coin = object + symbols: seq[uint16] + weight: uint64 + + func quickSort(s: var seq[Coin], lo, hi: int) = + if lo >= hi: + return + + var + pivot = lo + switch_i = lo + 1 + for i in lo + 1 .. hi: + if s[i].weight < s[pivot].weight: + swap(s[i], s[switch_i]) + swap(s[pivot], s[switch_i]) + inc pivot + inc switch_i + + quickSort(s, lo, pivot - 1) + quickSort(s, pivot + 1, hi) + var numSymbolsUsed: int for freq in frequencies: if freq > 0: