GitHub/SWCompression
1
0
Fork 0
mirror of https://github.com/tsolomko/SWCompression.git synced 2026-06-23 14:56:41 +00:00
Code Issues Packages Projects Releases Wiki Activity

Make HuffmanLength Comparable and use this in their sorting in HuffmanTree

Browse Source
This commit is contained in:
Timofey Solomko
2017-09-03 20:04:44 +03:00
parent f96f446827
commit cebf0555e5
3 changed files with 18 additions and 14 deletions
Download Patch File Download Diff File Expand all files Collapse all files
Sources/DecodingHuffmanTree.swift
+1 -7
View File
@@ -17,13 +17,7 @@ class DecodingHuffmanTree {
self.bitReader = bitReader
// Sort `lengths` array to calculate canonical Huffman code.
let sortedLengths = lengths.sorted { (left: HuffmanLength, right: HuffmanLength) -> Bool in
if left.codeLength == right.codeLength {
return left.symbol < right.symbol
} else {
return left.codeLength < right.codeLength
}
}
let sortedLengths = lengths.sorted()
func reverse(bits: Int, in symbol: Int) -> Int {
// Auxiliarly function, which generates reversed order of bits in a number.