         let staticHuffmanBlockSize = bitsCount % 8 == 0 ? bitsCount / 8 : bitsCount / 8 + 1
 
         if uncompBlockSize <= staticHuffmanBlockSize {
-            // In case if according to our calculations static huffman will only make output data then input,
+            // If according to our calculations static huffman will not make output smaller than input,
             // we fallback to creating uncompressed block.
             // In this case dynamic Huffman encoding can be efficient.
             // TODO: Implement dynamic Huffman code!

                            repeatIndex = matchStartIndex + 1
                        }
                    }
                    let lengthSymbol = HuffmanTree.Constants.lengthCode[matchLength - 3]
                    let distanceSymbol = ((HuffmanTree.Constants.distanceBase.index { $0 > distance }) ?? 30) - 1
                    buffer.append(BLDCode.lengthDistance(matchLength, distance, lengthSymbol, distanceSymbol))
                    stats[lengthSymbol] += 1
                    stats[286 + distanceSymbol] += 1
                    inputIndex += matchLength
                } else {
                    buffer.append(BLDCode.byte(byte))

                guard codeOfByte.count > 0
                    else { throw DeflateError.SymbolNotFound }
                bitWriter.write(bits: codeOfByte)
            case .lengthDistance(let ld):
                let codeOfLength = mainLiterals.code(symbol: ld.lengthSymbol)
                guard codeOfLength.count > 0
                    else { throw DeflateError.SymbolNotFound }
                bitWriter.write(bits: codeOfLength)
                bitWriter.write(number: ld.lengthExtraBits, bitsCount: ld.lengthExtraBitsCount)

                let codeOfDistance = mainDistances.code(symbol: ld.distanceSymbol)
                guard codeOfDistance.count > 0
                    else { throw DeflateError.SymbolNotFound }
                bitWriter.write(bits: codeOfDistance)
                bitWriter.write(number: ld.distanceExtraBits, bitsCount: ld.distanceExtraBitsCount)
            }
        }

