Like Prometheus, but for logs.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 
loki/vendor/github.com/andybalholm/brotli
..
matchfinder
LICENSE
README.md
backward_references.go
backward_references_hq.go
bit_cost.go
bit_reader.go
bitwriter.go
block_splitter.go
block_splitter_command.go
block_splitter_distance.go
block_splitter_literal.go
brotli_bit_stream.go
cluster.go
cluster_command.go
cluster_distance.go
cluster_literal.go
command.go
compress_fragment.go
compress_fragment_two_pass.go
constants.go
context.go
decode.go
dictionary.go
dictionary_hash.go
encode.go
encoder.go
encoder_dict.go
entropy_encode.go
entropy_encode_static.go
fast_log.go
find_match_length.go
h5.go
h6.go
h10.go
hash.go
hash_composite.go
hash_forgetful_chain.go
hash_longest_match_quickly.go
hash_rolling.go
histogram.go
http.go
huffman.go
literal_cost.go
memory.go
metablock.go
metablock_command.go
metablock_distance.go
metablock_literal.go
params.go
platform.go
prefix.go
prefix_dec.go
quality.go
reader.go
ringbuffer.go
state.go
static_dict.go
static_dict_lut.go
symbol_list.go
transform.go
utf8_util.go
util.go
write_bits.go
writer.go

README.md

This package is a brotli compressor and decompressor implemented in Go. It was translated from the reference implementation (https://github.com/google/brotli) with the c2go tool at https://github.com/andybalholm/c2go.

I have been working on new compression algorithms (not translated from C) in the matchfinder package. You can use them with the NewWriterV2 function. Currently they give better results than the old implementation (at least for compressing my test file, Newton’s Opticks) on levels 2 to 6.

I am using it in production with https://github.com/andybalholm/redwood.

API documentation is found at https://pkg.go.dev/github.com/andybalholm/brotli?tab=doc.