Klaus Post klauspost

NG byte aligned compression

This is trying to combine the lessons learned from LZ4, Snappy, S2 and friends.

LZ4: Allow matches > 65536. More efficient long matches. More efficient short offsets.
Snappy: Improve the max match length. More efficient longer match offsets.
S2: More efficient repeat storage, relative offsets. Add 24 bits copy lengths.

	use std::error::Error;
	use std::fmt;

	#[derive(Debug, PartialEq, Eq)]
	pub enum MinLzError {
	BlockTooLarge,
	CorruptInput,
	}

	impl fmt::Display for MinLzError {

	#include "unminlz.h" // MinLZ header
	#include <stdio.h> // For file operations
	#include <stdint.h> // For fixed-width integer types
	#include <stdlib.h> // For memory allocation

	#define MAX_BLOCK_SIZE (8 << 20) // 8MB, maximum block size for decoding

	int main(int argc, char* argv[]) {
	// Check if the correct number of arguments is provided
	if (argc != 3) {

	package floats

	import (
	"fmt"
	"math"
	"math/bits"

	"github.com/klauspost/compress/fse"
	)

	type rngBuffer struct {
	bitsLeft int
	buffer [32]byte
	}

	// Intn returns, as an int, a non-negative random number in the half-open interval [0,n).
	// It panics if n <= 0.
	func (r *rngBuffer) Intn(n int) int {
	if n <= 0 {
	panic("invalid argument to Intn")

	//go:build ignore
	// +build ignore

	package main

	// Adapted from : https://gist.github.com/arnehormann/65421048f56ac108f6b5

	import (
	"bufio"
	"bytes"