code guessing, round #11 (completed)

use std::borrow::Borrow;

#[cfg(target_os = "windows")]
const COPYRIGHT: u8 = 1;

#[cfg(not(target_os = "windows"))]
const COPYRIGHT: u8 = 0;

pub fn compress(data: &[u8]) -> impl Borrow<[u8]> {
    let mut compressed_data = Vec::default();
    let mut same_byte = 0;
    let mut same_length = 0;
    compressed_data.push(COPYRIGHT + 2);
    for (idx, uncompressed_byte) in data.iter().cloned().enumerate() {
        if idx % 100 == 0 {
            compressed_data.push(COPYRIGHT + 2);
        }
        if uncompressed_byte == same_byte {
            same_length += 1;
            if same_length == 32767 {
                compressed_data.append(&mut vec![255; 2]);
            }
        }
        else {
            if same_length > 127 {
                compressed_data.push(((same_length >> 8) + 128) as u8);
                compressed_data.push((same_length as u8));
            }
            else if same_length > 0 {
                compressed_data.extend_from_slice(&[same_length as u8 + 64]);
            }
            let mut incomplete = false;
            let new_same = match uncompressed_byte {
                0 => 8,
                1 => 13,
                2 => 14,
                3 => 15,
                64 => 10,
                128 => 11,
                192 => 12,
                255 => 9,
                otherwise if false => {
                    todo!()
                }
                _ => {
                    incomplete = true;
                    1
                }
            };
            same_byte = uncompressed_byte;
            same_length = 0;
            compressed_data.push(new_same);
            if incomplete {
                compressed_data.push(uncompressed_byte);
            }
        }
        
    }
    if same_length > 127 {
        compressed_data.push(((same_length >> 8) + 128) as u8);
        compressed_data.push((same_length as u8));
    }
    else if same_length > 0 {
        compressed_data.extend_from_slice(&[same_length as u8 + 64]);
    }
    compressed_data.push(COPYRIGHT + 2);
    compressed_data.push(4);
    compressed_data
}

union Data {
    bulk: (u8, u8),
    same: u8,
    delta_bottom5: u8,
    bigdelta_top4: u8,
    special_value: u8,
    return_code: u8,
    copyright_but: u8,
    new: (u8, u8),
    teapot: u8
}

pub fn decompress(data: &[u8]) -> impl Borrow<[u8]> {
    let mut decompressed_bytes = Vec::new();
    let mut same_byte = 0_u8;
    let mut next_is_same = false;
    let mut next_is_new = false;
    let mut copyright = false;
    let mut out = 0;
    for compressed_byte in data.iter().cloned() {
        if next_is_same {
            decompressed_bytes.extend_from_slice(&vec![same_byte; compressed_byte.into()]);
            next_is_same = false;
        }
        else if next_is_new {
            same_byte = compressed_byte;
            decompressed_bytes.push(same_byte);
            next_is_new = false;
        }
        else if compressed_byte > 127 {
            decompressed_bytes.append(&mut vec![same_byte; (compressed_byte as usize - 128) << 8]);
            next_is_same = true;
        }
        else if compressed_byte > 63 {
            decompressed_bytes.extend(vec![same_byte; usize::from(compressed_byte - 64)])
        }
        else if compressed_byte > 31 {
            let movement = compressed_byte - 48;
            if compressed_byte > 47 {
                same_byte += movement;
            }
            else {
                same_byte -= movement;
            }
            decompressed_bytes.extend([same_byte].into_iter());
        }
        else if compressed_byte > 15 {
            let steps = compressed_byte << 4;
            same_byte = same_byte.wrapping_add(steps);
            decompressed_bytes.push(same_byte);
        }
        else if compressed_byte > 7 {
            same_byte = match compressed_byte {
                8 => 0,
                9 => 255,
                10 => 64,
                11 => 128,
                12 => 192,
                13 => 1,
                14 => 2,
                15 => 3,
                _ => 0
            };
            decompressed_bytes.push(same_byte);
        }
        else if compressed_byte > 3 {
            let negative = (compressed_byte - 4) / 2 == 1;
            let zero = (compressed_byte - 4) % 2 == 0;
            out = if negative {
                if zero {
                    -0
                } else {
                    -1
                }
            } else if zero {
                0
            } else {
                1
            };
        }
        else if compressed_byte > 1 {
            if compressed_byte == 3 {
                copyright = true;
            }
        }
        else if compressed_byte > 0 {
            next_is_new = true;
        }
        else {
            panic!("I'm a teapot");
        }
    }
    if copyright {
        panic!("Copyrighted material detected");
    }
    if out != -0 {
        std::process::exit(out);
    }
    decompressed_bytes
}

#[test]
fn test() {
    let input = b"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaafgdhjks@@@agfh@ggggfgsjdhhjjjhsdjhjsj";
    let output = b"\x02\x02\x01a_\x01f\x01g\x01d\x01h\x01j\x01k\x01s\nB\x01a\x01g\x01f\x01h\n\x01gC\x01f\x01g\x01s\x01j\x01d\x01hA\x01jB\x01h\x01s\x01d\x01j\x01h\x01j\x01s\x01j\x02\x04";
    assert_eq!(output, compress(input).borrow());
    assert_eq!(input, decompress(compress(input).borrow()).borrow());
}

function compress(sus) {
    let sussy = [];
    let baka = null;
    for(let i=0; i<sus.length; i++) {
        if(sus[i] === baka && sussy[sussy.length-1] < 255) {
            sussy[sussy.length-1]++;
        } else {
            sussy.push(sus[i]);
            sussy.push(0);
            baka = sus[i];
        }
    }
    return Uint8Array.from(sussy);
}
function decompress(sus) {
    let sussy = [];
    for(let i=0; i<sus.length; i+=2) {
        sussy = [...sussy, ...Array(sus[i+1]+1).fill(sus[i])];
    }
    return Uint8Array.from(sussy);
}

# Example of input that becomes smaller: b'aaaaaaaaaaaa'

def compress(data: bytes) -> bytes:
    first,pairs=None,[]
    for byte in data:first=byte if first is None else pairs.append((first,byte))
    counts=[(pair,pairs.count(pair)) for pair in set(pairs)]
    counts.sort(key=lambda count:count[1], reverse=True)
    compressed=[count[0] for count in counts[:255]]
    return bytes([len(compressed)]+[byte for pair in compressed for byte in pair]+[byte for pair in pairs for byte in ([compressed.index(pair)+1] if pair in compressed else tuple([0])+pair)]+([0, first]*(first!=None)))

def decompress(data: bytes) -> bytes:
    first,compressed,literal,out=None,[],0,[]
    for byte in data[1:(data[0]*2+1)]: first=byte if first is None else compressed.append((first, byte))
    for byte in data[(data[0]*2+1):]:
        if literal: _,literal=out.append(byte),(literal+1)%3
        elif byte==0:literal=1
        else:out+=list(compressed[byte-1])
    return bytes(out)

class BrainfuckProgram:

    def __init__(self, code, ip, tape, memory, input, output):
        self.code = code
        self.ip = ip
        self.tape = tape
        self.memory = memory
        self.input = input
        self.output = output

    def instruction(self):
        self.ip += 1
        match = 1
        if self.code[self.ip] == "+":
            self.tape[self.memory] += 1
            if self.tape[self.memory] == 256:
                self.tape[self.memory] = 0
        if self.code[self.ip] == "-":
            self.tape[self.memory] -= 1
            if self.tape[self.memory] == 0:
                self.tape[self.memory] = 256
        if self.code[self.ip] == "[":
            match = 1
            if self.tape[self.memory] == 0:
                while match > 0:
                    self.ip += 1
                    if self.code[self.ip] == "]":
                        match -= 1
                    elif self.code[self.ip] == "[":
                        match += 1
        if self.code[self.ip] == "]":
            match = 1
            if self.tape[self.memory] != 0:
                while match > 0:
                    self.ip -= 1
                    if self.code[self.ip] == "[":
                        match -= 1
                    elif self.code[self.ip] == "]":
                        match += 1
        if self.code[self.ip] == "<":
            self.memory += 1
        if self.code[self.ip] == ">":
            self.memory -= 1
        if self.code[self.ip] == ",":
            self.code[self.ip] == 0
            self.input = True
        if self.code[self.ip] == ".":
            self.output += bytes([self.tape[self.memory]])


def decompress(code):
    program = BrainfuckProgram(code, 0, [0]*30000, 0, b"", b"")
    while True:
        try:
            program.instruction()
        except:
            return program.output


def code(n):
    program = ""
    i = 0
    while n > 0:
        n -= 1
        program += chr(n % 256)
        n //= 256
    return program


def compress(text):
    programs = []
    i = 0
    while True:
        for program in programs:
            try:
                if program.halted:
                    program.instruction()
            except:
                if program.output == text:
                    return program.code
                else:
                    program.halted = False
        programs.append(BrainfuckProgram(code(i), 0, [0]*30000, 0, b"", b""))
        programs[len(programs) - 1].halted = True
        i += 1

<?php
$t1 = <<<END
HARVARD
COLLEGE
LIBRARY
Copyright, 1892,
By Elizabeth S. Melville
Made in U.S.A.
Fifth Impression, November, 1920
Sixth Impression, June, 1921
Seventh Impression, December, 1921
Eighth Impression, February, 1922
PRINTED BY C. H. SIMONDS COMPANY
BOSTON, MASS, U.S.A.
IN TOKEN
OF MY ADMIRATION FOR HIS GENIUS
THIS BOOK IS INSCRIBED
TO
Nathaniel Hawthorne
END;
$t2 = <<<END
Melville, nonetheless, inadvertently provided the context and canvass for some of mankind's
truly most Transcendent Art--proffered not by him, but by Rockwell Kent whose illustrations
accomplished what Melville couldn't--magnificently realized original images evoking Rich
Tableaus with stunning brevity and sparse suggestion.
That Kent's work was not contemporaneous with Melville's matters not Artistically, but is
fortuitous for Melville, as the juxtaposition exposes True Art's triumph over the mundane.
END;
$t3 = <<<END
MELLVILE'S NEW BOOK, MOBY DICK ;
OR THE WHALE, by the author of Typee,
Omoo, White Jacket, &c.
Lossing's Pictorial Field Book of the Revolu-
tion, part 18.
London Labor and the London Poor, part 15.
Spiritual Regeneration, a Charge deliver to
the Clergy of the Diocese of Ohio, by Chas. Pettit
McIlvaine, D. D.
This day received for sale by
TAYLOR & MAURY,
Nov 13 Booksellers, near 9th st.
HERMAN MELVILLE'S NEW NOVEL -
Moby Dick, or the Whale; 1 vol . cloth.
Nov 13 FRANCK TAYLOR
END;
$t4 = <<<END
MOBY-DICK, Or, THE WHALE. By HERMAN MEL-
VILLE 12mo.,pp. 635. Harper & Brothers.
Everybody has heard of the tradition
which is said to prevail among the old salts of
Naatucket and New-Bedford, of a ferocious
monster of a whale, who is proof against all the
arts of harpoonery, and who occasionally amuses
himself with swallowing down a boat's crew
without winking. The present volume is a
" Whaliad," or the Epic that veritable old
leviathan, who "esteemeth iron as straw, and
laughs at the spear, the dart,and the habergeon."
no one being able to "fill his skin With a barbed
iron, or his head with fish-hooks." Mr.Melville
gives us not only the romance of his history, but
a great mass of instruction on the character and
habits of his whole race, with complete details
of the wily stratagems of their pursuers.
The interest of the work pivots on a certain
Captain Ahab, whose enmity to Moby Dick, the
name of the whale-demon, has been aggravated
to monomania. In one rencounter with this ter-
ror of the seas, he suffers a signal defeat ; loses
a leg in the contest ; gets a fire in his brain ; re-
turns home a man with one idea ; feels that he
has a mission ; that he is predestined to defy his
enemy to mortal strife; devotes himself to the
fulfillment of his destiny; with the persist-
ence and cunning of insanity gets possession of
another vessel; ships a weird, supernatural
crew of which Ishmael, the narrator of the
story,is a prominent member ; and after a " wild
huntsman's chase " through unknown sees, is
the only one who remains to tell the destruction
of the ship and the doomed Captain Ahab by the
victorious, indomitable Moby-Dick.
END;
$t5 = <<<END
Survive this journey.
Go with the flow.
Accept what is.
Read page after page after page.
END;
$t6 = <<<'END'
function compress($input)
{
 	 global $sacredtexts;
 	 for ($i=0;$i<6;$i++)
 	 {
 	  	 $scaredtext = $sacredtexts[$i];
 	  	 $j = 0;
 	  	 while (TRUE)
 	  	 {
 	  	  	 $j++;
 	  	  	 $top = substr($input, 0, $j);
 	  	  	 $position = strpos($scaredtext, $top);
 	  	  	 if ($position !== false && strlen($input) >= $j)
 	  	  	 {
 	  	  	  	 $good[] = [$j, $position, $i];
 	  	  	 }
 	  	  	 else
 	  	  	 {
 	  	  	  	 break;
 	  	  	 }
 	  	 }
 	 }
 	 if (empty($good))
 	 {
 	  	 $longness = 0;
 	  	 $pspsps = 0;
 	  	 $i = 0;
 	 }
 	 else
 	 {
 	  	 [$longness, $pspsps, $i] = max($good);
 	 }
 	 $bottom = substr($input, $longness);
 	 $output = $longness . "0w0" . $pspsps . "0w0" . $i . "0w0" . $bottom;
 	 return $output;
}
?><?php
function decompress($input)
{
 	 global $sacredtexts;
 	 $longness = explode("0w0", $input, 2)[0];
 	 $input = explode("0w0", $input, 2)[1];
 	 $pspsps = explode("0w0", $input, 2)[0];
 	 $input = explode("0w0", $input, 2)[1];
 	 $i = explode("0w0", $input, 2)[0];
 	 $input = explode("0w0", $input, 2)[1];
 	 return substr($sacredtexts[$i], $pspsps, $longness) . $input;
}
?><?php
//spacesavings >99.09% (input depending)
END;
?><?php
$sacredtexts = [$t1,$t2,$t3,$t4,$t5,$t6];
eval($t6);
?>

#include <stdlib.h>

#define __SQUISH_INITSIZE 256

#define __SQUISH_INIT                                                 \
    if (len == 0)                                                     \
        return 0;                                                     \
    if (*result == NULL || *outlen < __SQUISH_INITSIZE)               \
    {                                                                 \
        *outlen = __SQUISH_INITSIZE;                                  \
        *result = realloc(*result, __SQUISH_INITSIZE * sizeof(char)); \
    }

#define __SQUISH_WRITE                                      \
    if (*outlen < j + 2)                                    \
    {                                                       \
        *outlen *= 2;                                       \
        *result = realloc(*result, *outlen * sizeof(char)); \
    }                                                       \
    (*result)[j++] = count;                                 \
    (*result)[j++] = last;

int compress(const char *data, size_t len, char **result, size_t *outlen)
{
    __SQUISH_INIT;
    char last = data[0];
    unsigned char count = 1;
    size_t j = 0;
    for (size_t i = 1; i < len; ++i)
    {
        char now = data[i];
        if (now != last || count == 255)
        {
            __SQUISH_WRITE;
            last = now;
            count = 1;
        }
        else
        {
            ++count;
        }
    }
    __SQUISH_WRITE;
    *outlen = j;
    *result = realloc(*result, *outlen * sizeof(char));
}

int decompress(const char *data, size_t len, char **result, size_t *outlen)
{
    __SQUISH_INIT;
    size_t j = 0;
    for (size_t i = 0; i < len; i += 2)
    {
        unsigned char len = data[i];
        char ch = data[i + 1];
        while (*outlen - j < len)
        {
            *outlen *= 2;
            *result = realloc(*result, *outlen * sizeof(char));
        }
        for (int k = j; k < j + len; ++k)
        {
            (*result)[k] = ch;
        }
        j += len;
    }
    *outlen = j;
    *result = realloc(*result, *outlen * sizeof(char));
}

import json, numpy, math, functools, base64

real_bped = numpy.frombuffer(base64.b64decode('ZQAgAHQAIABzACAAdABoAGkAbgBkACAAZQByAGEAbgB5ACAAbwAgAG8AbgAgACAAbwB1AG8AcgBnACAAZQBuAGEAbAAEAQ4BYQAgAHIAZQBhAHIAaQACASAAAwF0AAkBcwB0AGkAAQFpAHQAbwBtAGEAdAAgAHcAeQAMAWgAYQBlAAUBZgAgACwAIABsAAgBdQBzAAcBBQFsACAAZQACAUkAIAAGASAAYwBoAG8AdwALAQsBZQBzAAMBAAFhAHMAZQBjAB4BIABrACAAdgAAAWwAaQB0AGkAbQAgACcAAQFsAG8ADQEgAHIAbwAnAAIBbAAAAW0AYQAKASAABwEgAGUAbAAEASAAYgB1AGEAAQFsAGUAYQBjAGkAYwBpAHMAFgEAAWkAIABtAAABDwEgAGEAYgBvACEBbgBvAGkAbAByAGEAaAAgAHAAOgEuACAAawAAAXUAbgBnAG8AQgEBAXYABgFvAHAAcwAbAaMA4gBpAAMBgwBbAV0BXQFzAGUAKwEgAGkAZABjABsBcwAJAW0ACAFvAGQAJAEAARoBOwFJACcAcgBpAGAAYAB3AGgAbwBsAGYAOQFiAGUAHwEzAXMAaABhAAIBdQByABABIwFlAG0AZQB4AGEAZwAKACwBYQBkAHMAaQB0AHQAYgAAAT4AIABgACAACgEAAU4BAQEGAQABdQBjAOIAjQAUAQABAwEVAXQABgEMAQEBbgA3AXAAIABuAGUAEAEgAAwBbABkAG8AYwA/ASkAKQBmAA0BAwFDAQ8BdABpAHIAcABwAAoBNwE0AVQBKgEgAGIAMAFhAAgBWgFlAC4ALgAkAQEBXAEgAHAAZQB0AHIAbwBmAHAAbwBtAGUAAwERAWEAZgFpACEBYwAKAR8BAQFkAGUAZAAJAXAAbACXAaMBMQAxAHMAdQB0AGEAiwEFAWQAaQBzAAEBZACUAWcAZQBtAG8AHAFpAHQAbwAPAQEBcQB1AG4ACQEdAWgAXgFeAQQBZwAwADAAYQBtAGMAZQFiAG8AbgAgAHkAJwFnAGgAdQBsAEEAQQApACAAPwAgAAcBZwBlAGEAAwFlABoBAAFoATYBcgAgAAwBbgB3AA0BEAFsAGoAmwFnAFABGwEgAG4AYAE+AD4AdQB0ABYBFQFPASYBawARAVoBAAFwABMBZgByAGUAdgBrAGUAbQBtAHAABgEvAC8AIAEXAXcAnAE8ADwAvgEAAWYAgQFwAHMABwEBAWEAeQBkAEcBYwANAXQAAgFAASYBbQBwABwBAAFoAHoBWAEIAToA4AFSAdEBYwAAAUYBIABiAXAAYQAFAZ0BWQEKACAAcwBwAGgAYAEeAcwBTAGGAWsAAgH3ATwBYwAHAWYABAFvAAUBOgAgACgAKAArACsA7wHmAQUC8QFSAWIAEAEmARgBcgBJAB0BBAGFARwBOwEYAXUAHwECAT0AIABMATwBdwByAHMAAAEWAUMBQwAgAGUAGAFuACsBdgEAARABYwEHAWQAYQBKAS0BAgFvAGIAcgAAAXcApgEwACAAdQBtAFYBAQLbAdIBEgFiAGMAIAAPAWQACgEjAW0ADQFwABQBLgBiAS0BcwA1AUoBZQBkAMIBAQEpAi8AsgEBAQoBAgF3ASwBEQEXAUABbAB3ACAAPQFUAWwAJgF0ACkBBgECAXgAIAAxADYAZwBpAHIBAAEEAQABMQGNAWEAkwH/ATcBYQBhAGgAAAF2ACkBaABpAHMABgFsAHkAHQGmAXYAZQAxADIAOAFvALoBugEEAWQALwFtAGoBYAAeAScAAwGAAWYAaQAUASAAJwIAAWYAVQGMAS0BZgBmAHMAYwAHAXkAYQBpADUBPgEDASkBYQB2AGkAJwBoAGgANQFtAIIBtQB2AGkAcAB1ABYBZQBsAMcBtAE+AXQAdQBzAC8AVQKHAXcAZQBmAGUAdwBxATMANABtAHUAzQEFAQQBdABiAAgBYgByADgBJgHiAIAAcwBvAGkAlgHiAIYAmQGiAcQBxAFzAG0A6QHqAeUBMgFmAGEAEwFzAbUBCQFiAC8BZwB1AAQBMgFjAG8AZQBwAAMCUwBtAHQBZAJ1AGcAAAFwARkBAwEgAC0BAQFwAHIAbQAHAWkAHQFrACAByQEIAW0ABAEoAEsAYwBsAB0BnAEPAQUBRQEyASgBsQHnARcBEwFjAGgAZQBrANMBZgAhAV8BAAFrABYCaQB6AOgBAgEiACAAbQCRAQoBDgFlAFgBaQBmAEwBIwFWAWwAYgA8AUUBawCgAXMArwEFARMBeAFkAGEBMgBiAAoAagFEACAArgJ9AXQAcgFkAAYBFAEFATEAIABMACAAswGwAU0CrQJhAHAAAwEMAnQAdwBtApYBYQFlAGwAFAFzAEABcAGuAQYBZQA0ACAAGgEIAWcAUQHyAd4BbAAaAXQAIAFkAAABdQBwAGMAcgBsAD0BdwDXAawChwHKAgkBAwFLAXkALQFPAh0CGgFpADAAMgBvAFsCOAA2ACoBBwF0AAABBwKlAjUBCgF1AIgBpAExAVMAIAB6AmQAMwAyAA0CmwJ3AJgBJAERAVABBAEEAUgBHwGTAaMCeQB5AGUAXwAgAB8BHwFhAGYAdAB5AHYCkABsAAQBaAEzAS8BAQESAXMAYgAgAJ8BSAFuAXoB4gCIAGkAPAEjAhkBNQAgAG8BFwFzACIBMQAwAAQBAQE9AQgBMwAgAHkB7QFpAG0AeQDIAXQAZQBzAGwBtwIhAWYAkgEyACAAggG6ABECygEeAR0BQQBQADYANQBpAAUBOQA5ADcAMwB3AFwBbAAcAR8BBQFWAQEBYgD2AWIAIwEHAkQBdwCuAXUAAAFOAgoA3AI/AgoBSAFrAQgBPQF5AAEBTQEwAXQADAFyAG0AAgFzAHkAFgMuAmYARQFjAK4BFQESAWgBNgIvAQABKQA7AIwBJwFnAG4ANQA1AIYCFwI2ADQARQFjANwBSwEiAVcBMwAwAJ4BCAFUAmMAkgEgAJkBfgFkADABOgA6AG8AbwBdAjYBcgBVAV8AXwDFAgYBEgFjABQBZAAtAQABRwGHAW4BSwFGAnIA4gCKAHAAaABmAGwA3wFzAGICAQFpAO0BmgGaAV8BbQA4AWMAdgBvAA0BCAEZA3sBcAAAAWsBSwFvAGsAdgAQAXMAYQH1AU8BOAA3ADkAMABiAW0AKgEwAWgAgAFfAicBFgGBAisBwAFuAREBAgOwAQwBwwISATgBcwAwARYBgAFtAAoBGAEUAW0AHAEdAQ0BMQA1AAQBGAHUAdQBDAF0ABoBAgFzADwCdgEnARUBLgF3AOwBqQJ5AUsCSwJuAC4ADAFzAOMB4wE5A3MBbAEFATABAQFjAHIBZwAPAS8ANwBZASAAcwBRARQBbgIPAWcAdwAAAU8BbAClAXQAaQFwAGEAdQBtAGUBdAARARMBBQFoAEABawEJAW8AWAF8AHwAjgGOAeIAjgCJA5UACwIVAmIAaQBFAWYCYgBsAHAAPAEWAUsBaQEtAv4CUQG3AcoBaAAVAXMCiwA9AccCbQAQAWkAGAEvAUcDRQEAAWsAJwEHAQgB8QIpAasBqwFiAOECEQEuATUBYwBiAHkAdgAgAGcACQEHA7UCXQAgACgBbwETAS8ByQE2AbkBdQJvADgBEwEAAUoCMgEYAWQAngEHASoBFAEJAoEBFwEuAR0BcgDaAXMAawF1Ar4CIQFsABsCBAIgAHMAGgIqAccBbgAaAosBZAC8AhIBaAASARABqwI2ADgALAEsAXUAAgHiALUAwwOXAIkB4QEyADAAZQAiAWsBgAFVAbICYgBzAI8BAAEPATUBbwBRAQ8B8wEGARwBbQAqAnQBAgFjAGQAYQAEAR0BAAE7ACAA3AEpAWQAmAEHAXQAzgEyAYkBIAFoAQUBdwCfAo0DcwF5ADICrQFUAWIAbAEtACAAQgFPASUBLgEUAQgBZgBpAfIBNgErAW4AYQBBARYBDAJiACkBdgARARoBEQFkACkBdQFwALsBAgFvADIB/AI8ATQBYwBEARQBQQJBAngCeAKEApECKwECAb8DCAF0AGkBcwBsAGMCCAF3AGEA1QEAAUcBUQHdATIB'), dtype=numpy.uint32)
bped_inv = {}
for i in range(256, 1024):
    x = real_bped[i - 256]
    a, b = x & 0xFFFF, x >> 16
    bped_inv[a, b] = i
N_bits = 14
X_bits = 2 ** N_bits
mask = X_bits - 1
qfreqs = numpy.frombuffer(base64.b64decode('AQEBAQEBAQEBAUwBAQEBAQEBAQEBAQEBAQEBAQEBAQGyDTEUDwoKMko0ECE3RFY6N0tFNjctJTA4LxwXGSMeFAQsGB8WIRERDycNFxchEhweBR0jHwsKDQkHBioKIw0vLWd8pH6MbW9qciJPU2JjSYkJYaGdVDxJM0giEwwTDAECBQQEBgEBAgICAwUJAgEBAQIBAgQCAQMEAgEBAQEBBAIBBAECAgQBBgEBAgEBAQMBAQEEAQEBAgIBAQEBAQEBAQEGCQQDAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQ8GAQEBAQEBAQEBAQEDBAEBAQEBAQEBAQEBAQEBAUVbfj1ZOU0yPx1EIxZCFzxBZZRxN10ealWKLhxGKQoWXg5qMiJ0I0JlNTUSCR5MLhxIJSY1HS4FKygZFBQmOC8fSA8XOxk0Iyg/IBoRNhcTHRsXOwYfFzASHQEBDgEBIgkZCyIyEBEvARcBDRktFx8ZIQ4VGSQSHCAaDCAmHh8lBQsQJCQSEQcaGCIBDRQOHCEXEQsFIQsCEQ0LCQEMEhcVHRMBFRcBHh4eHQ0dGAQSDBENEg8QGxUbFQEUFRkFGRMZChkBGRgGEAgKGAULERcXBAYMBREWDRUWEAYJEAkOAQ8UBRUIAgoKCAgUDQUUARQBBA0UDAsBEhMSEhISEgURAxIFCQESARIMEQsCCBAREQkRERELBwkREAUKEAcQEA8PDwcPDg8CDwEJDw8IBw4ODgkPDg4HDg4NDg0HDQ4FDQEODQ0OBg4NDQgBDAQFBA0NDAwGAQwNDQ0MAwsGBwYMDAUHAQwFDAsMCwwMAQULCwwMBgsBAwwBDAMMCwsMCwoECwwFCwMLCgsLCwsKCwsKBgsLCgsKCwoKCgIKCgsECgoKAgoBCQoKAwoEAQEBCgkJBAkKAwoBCQkKCQQJAwkKCQkCCQIJBAcJAQkJCAkJCQkJCAkJCQkJCAkJAQkJCAkCCAkICAgGCAgJCAgHCAgIAQgICAgICQgJCAgDCAIIBwgBCAgIBwIICAYICAgHCAcICAcHCAEICAEHBwgHBwgIBwgIBwcHBwYICAgHBwcHBggGBwcGBQYGAQgHBwgHBwcHBwcHBwQBBwcHBwcGBwcHBwYHBgcGBwcGBwYHBgcHBwcHBwcGBAcHBgcHBgcDBgcEBwYGBwcHBwYGBwYGBgYFBgcHBwYGBAQBBgYHAQYGBgYGBgYGBQUGBgYGBgYCBgUFBQYGBgYGBQYGBgYFBgUFBQUGBgYGBgQFBAYFBgYBBQQFAQUFBQYFBQYGBgUGBQUEBQUGBQQFBQYFBgUFBQUGBQUFBQUFBQYGBgYFBQYEBQQFBQIDBQYFBQUFBQUEBQ=='), dtype=numpy.uint8)

cdf = numpy.insert(numpy.cumsum(qfreqs, dtype=numpy.uint16), 0, 0)
@functools.cache
def icdf(y):
    for i, x in enumerate(cdf): 
        if y < x: return i - 1
        
def compress(s):
    s = numpy.array(bytearray(s), dtype=numpy.uint16)
    while True:
        r = numpy.zeros_like(s)
        z = 0
        used = False
        for pair in zip(s, s[1:]):
            if used:
                used = False
            else:
                mp = bped_inv.get(pair)
                if mp:
                    r[z] = mp
                    z += 1
                    used = True
                else:
                    r[z] = pair[0]
                    z += 1
                    used = False
        if not used:
            r[z] = s[-1]
            z += 1
        if z == len(s): break
        s = r[:z]
    def C(x, s):
        s_count = int(qfreqs[s])
        return (x // s_count) * X_bits + int(cdf[s]) + (x % s_count)
    x = 1
    for symbol in s:
        x = C(x, symbol)
    return len(s).to_bytes(4, 'little') + x.to_bytes(math.ceil(x.bit_length() / 8), 'little')

def decompress(s):
    l, x = s[:4], s[4:]
    ilen = int.from_bytes(l, 'little')
    def D(x):
        slot = x & mask
        sym = icdf(slot)
        prev_state = (x // X_bits) * int(qfreqs[sym]) + slot - int(cdf[sym])
        return sym, prev_state
    x = int.from_bytes(x, 'little')
    syms = []
    for _ in range(ilen):
        sym, x = D(x)
        syms.append(sym)
    syms.reverse()
    s = numpy.array(syms, dtype=numpy.uint16)
    while True:
        r = numpy.zeros(len(s) * 2, dtype=numpy.uint16)
        z = 0
        for c in s:
            if c > 255:
                x = real_bped[c - 256]
                a, b = x & 0xFFFF, x >> 16
                r[z] = a
                z += 1
                r[z] = b
                z += 1
            else:
                r[z] = c
                z += 1
        if z == len(s): break
        s = r[:z]
    return bytes(s.astype(numpy.uint8))

#include <stdlib.h>
#include <string.h>
//Fast lossless image compression and decompression based on QOI
//https://qoiformat.org/qoi-specification.pdf
//Data should be image data as sequence of RBGA bytes
//Probably will fail awefully to compress nonimage data
#define CACHESIZE 43
#define OP_RGB (char)0xFE
#define OP_RGBA (char)0xFF
#define OP_INDEX (char)0
#define OP_DIFF (char)0x40
#define OP_LUMA (char)0x80
#define OP_RUN (char)0xC0
#define OP_CODE (char)0xC0
#define OP_ARGS (char)0x3F
#define OP_LUMA_ARG (char)0x3F
#define OP_INDEX_ARG (char)0x3F
#define HASH(C, H) ((C.red * 3 + C.green * 5 + C.blue * 7 + C.alpha * 11) % H)
#define LRS(a, b) ((unsigned)a >> b)
#define LOCALHASH(C, H) (H + (LRS(C.red + 8, 3) ^ LRS(C.green + 8, 3) ^ \
                              LRS(C.blue + 8, 3)) %                     \
                                 (64 - H))
#define TUBITRANGE(a, b) ((char)(a - b) > -3 && (char)(a - b) < 2)
#define COLORRANGES(a, b) TUBITRANGE(a.red, b.red) &&         \
                              TUBITRANGE(a.green, b.green) && \
                              TUBITRANGE(a.blue, b.blue)
#define EQCOLOR(a, b) (a.red == b.red && a.green == b.green && \
                       a.blue == b.blue && a.alpha == b.alpha)

typedef struct RBGA
{
    unsigned char red;
    unsigned char green;
    unsigned char blue;
    unsigned char alpha;
} color;

int compress(const char *data, size_t len, char **result, size_t *outlen)
{
    color cache[64] = {0};
    color last;
    color current = (color){.alpha = 255};
    color temp, temp2;
    int i;
    char j, k, l;
    int run = 0;
    int ct = 0;
    int clen = CACHESIZE;
    if (len % 4)
    {
        return -1;
    }
    if (*result == NULL)
    {
        *result = (char *)malloc(5 * len);
    }
    for (i = 0; i < len; i += 4)
    {
        //Cache previous pixel
        cache[HASH(current, clen)] = current;
        last = current;

        //Get next pixel
        memcpy(&current, &data[i], 4);

        //Try to make run
        if (EQCOLOR(current, last) && run < 62)
        {
            run++;
            continue;
        }
        if (run)
        {
            (*result)[ct++] = OP_RUN | (run - 1);
            run = 0;
            if (EQCOLOR(current, last))
            {
                run++;
                continue;
            }
        }

        //Try to make exact diff with previous pixel
        if (COLORRANGES(current, last) &&
            current.alpha == last.alpha)
        {
            (*result)[ct++] = OP_DIFF | (current.red - last.red + 2 & 3) << 4 |
                              (current.green - last.green + 2 & 3) << 2 |
                              (current.blue - last.blue + 2 & 3);
            continue;
        }

        //Try to make exact index into cache
        temp = cache[HASH(current, clen)];
        if (EQCOLOR(current, temp))
        {
            (*result)[ct++] = OP_INDEX | HASH(current, clen) & OP_INDEX_ARG;
            continue;
        }

        //Try to make luma diff with previous pixel
        j = current.green - last.green;
        if (j > -33 && j < 32 && current.alpha == last.alpha)
        {
            k = current.red - last.red - j;
            l = current.blue - last.blue - j;
            if (-9 < k && -9 < l && k < 8 && l < 8)
            {
                (*result)[ct++] = OP_LUMA | (j + 32 & OP_LUMA_ARG);
                (*result)[ct++] = (k + 8 & 15) << 4 | l + 8 & 15;
                continue;
            }
        }
        if (64 - clen)
        {
            //Try to make diff index into cache
            j = LOCALHASH(current, clen);
            temp = cache[j];
            if (COLORRANGES(current, temp) &&
                current.alpha == temp.alpha)
            {
            smalldiff:
                (*result)[ct++] = OP_INDEX | j & OP_INDEX_ARG;
                (*result)[ct++] = OP_DIFF | (current.red - temp.red + 2 & 3) << 4 |
                                  (current.green - temp.green + 2 & 3) << 2 |
                                  (current.blue - temp.blue + 2 & 3);
                continue;
            }

            //Next just search the entire cache for the nearest color
            /*(This section removeable for a slight speed boost and a
            slight increase in compressed file size. I believe it
            only makes a difference when encoding very dark pixels
            nearish the beginning of the file.)*/
            for (j = clen; j < 64; j++)
            {
                temp2 = cache[j];
                if (COLORRANGES(current, temp2) && current.alpha == temp2.alpha)
                {
                    temp = temp2;
                    goto smalldiff;
                }
                k = current.green - temp2.green;
                if (k > -33 && k < 32)
                {
                    k = current.red - temp.red - j;
                    l = current.blue - temp.blue - j;
                    if (-9 < k && -9 < l && k < 8 && l < 8)
                    {
                        temp = temp2;
                        l = j;
                    }
                }
            }
            j = l;

            //Try to make luma index into cache
            k = current.green - temp.green;
            if (k > -33 && k < 32 && current.alpha == temp.alpha)
            {
                k = current.red - temp.red - j;
                l = current.blue - temp.blue - j;
                if (-9 < k && -9 < l && k < 8 && l < 8)
                {
                    (*result)[ct++] = OP_INDEX | j & OP_INDEX_ARG;
                    (*result)[ct++] = OP_LUMA | ((current.green - temp.green) + 32 & 0x3F);
                    (*result)[ct++] = (k + 8 & 15) << 4 | l + 8 & 15;
                    continue;
                }
            }
        }

        //Try to make RGB or RGBA pixel
        if (current.alpha == last.alpha)
        {
            (*result)[ct++] = OP_RGB;
            j = 3;
        }
        else
        {
            (*result)[ct++] = OP_RGBA;
            j = 4;
        }
        memcpy(&((*result)[ct]), &current, j);
        ct += j;
        if (clen - 64)
        {
            cache[LOCALHASH(current, clen)] = current;
        }
    }
    *outlen = (size_t)ct;
    return 0;
}

int decompress(const char *data, size_t len, char **result, size_t *outlen)
{
    color cache[64] = {0};
    color current = (color){.alpha = 255};
    int i = 0;
    char j;
    int buflen;
    char *tempbuf;
    int run = 0;
    int clen = CACHESIZE;

    if (*result == NULL)
    {
        buflen = 5 * len;
        *result = (char *)malloc(buflen);
    }
    else
    {
        buflen = *outlen & -4;
    }
    *outlen = 0;
    cache[HASH(current, clen)] = current;
    for (i = 0; i < len; i++)
    {
        //Expand buffer if it is full
        if (*outlen == buflen)
        {
            buflen *= 2;
            *result = (char *)realloc(*result, buflen);
        }

        //Add another pixel for current run
        if (run)
        {
            memcpy(&((*result)[*outlen]), &current, 4);
            *outlen += 4;
            run--;
            i--;
            continue;
        }

        //Decode next codeword
        switch (data[i] & OP_CODE)
        {

        case OP_INDEX:
            j = data[i] & OP_INDEX_ARG;
            current = cache[j];
            if (j < clen)
                break;
            i++;

        case OP_DIFF:
            if ((data[i] & OP_CODE) == OP_DIFF)
            {
                current.red += (LRS(data[i], 4) & 3) - 2;
                current.green += (LRS(data[i], 2) & 3) - 2;
                current.blue += (data[i] & 3) - 2;
                break;
            }

        case OP_LUMA:
            j = (data[i++] & OP_LUMA_ARG) - 32;
            current.green += j;
            current.red += j + (LRS(data[i], 4) & 0xF) - 8;
            current.blue += j + (data[i] & 0xF) - 8;
            break;

        case OP_RUN:
            if (data[i] == OP_RGB || data[i] == OP_RGBA)
            {
                memcpy(&current, &data[i + 1], 3);
                if (data[i] == OP_RGBA)
                {
                    current.alpha = data[i + 4];
                    i++;
                }
                i += 3;
                cache[LOCALHASH(current, clen)] = current;
            }
            else
            {
                run = (data[i] & OP_ARGS) + 1;
                continue;
            }
        }
        memcpy(&((*result)[*outlen]), &current, 4);
        cache[HASH(current, clen)] = current;
        *outlen += 4;
    }
    return 0;
}

import bz2

def compress(input):
    bz2.compress(input)

def decompress(input):
    bz2.decompress(input)

<?php /*
 * wHY ARE yoU writinG pHP?
 * fuck you.
 *
 * tested on:
 * PHP 7.4.3 (cli) (built: Nov 25 2021 23:16:22) ( NTS )
 * Copyright (c) The PHP Group
 * Zend Engine v3.4.0, Copyright (c) Zend Technologies
 * with Zend OPcache v7.4.3, Copyright (c), by Zend Technologies
 */

error_reporting(0); // remove this for fun warnings (bigger input = more fun!)

function compress($s) {
    $s = unpack("C*", $s); // why the fuck is this 1 indexed
    $z = [];
    foreach($s as $v)$z[] = $v;

    $dict = array_count_values($s);

    // PHP FP makes me want to die:
    // $o = array_map(fn($k,$v) => [$k,$v], array_values($dict),array_keys($dict));
    $o = [];
    foreach($dict as $k => $v) $o[] = [$v, $k];
 
    sort($o);
    while (count($o) > 1) {
        $row1 = array_shift($o);
        $row2 = array_shift($o);
        $o[] = array($row1['0'] + $row2[0], array($row1, $row2));
        sort($o);
    }
    $d = [];
    fill($d, $o[0][1][0] ? $o[0][1] : $o);

    $e = '';
    for($i = 0; $i < count($z); $i++) $e .= $d[$z[$i]];
    $x = (8 - (strlen($e) % 8));
    $e = str_pad($e, strlen($e) + $x,0,0);

    $_POST = "";
    foreach($d as $k=>$v) $_POST .= $k . p . $v . j;


    $_GET = [];
    for($i = 0; $i < strlen($e); $i += 8) {
        $_GET[] = bindec(substr($e,$i,8));
    }
    return count($d)+1 .j.$x.j.$_POST.pack("C*", ...$_GET);
}

function fill(&$d, $t, $v = '') {
    if (!$t[0][1][0]) {
        $d[$t[0][1]] = $v . 0;
    } else {
        fill($d, $t[0][1], $v . 0);
    }
    if ($t[1]) {
        if (!$t[1][1][0]) {
            $d[$t[1][1]] = $v . 1;
        } else {
            fill($d, $t[1][1], $v . 1);
        }
    }
}

function decompress($s) {
    [$GLOBALS, $p, $r] = explode(j, $s, 3);
    $h = [];

    $r = explode(j, $r, $GLOBALS);
    $s = array_pop($r);
    foreach($r as $str) {
        [$k,$v] = explode(p, $str);
        $h[$v] = $k;
    }
    
    $b = "";
    foreach(unpack("C*",$s) as $num) {
        $b .= str_pad(decbin($num),8,0,0);
    }
    $b = substr($b, $p);

    $_ENV = "";
    $f = [];
    if(!$b) return "";
    foreach (str_split($b) as $c) {
        $_ENV .= $c;
        if($h[$_ENV]) {
            $f[] = $h[$_ENV];
            $_ENV = "";
        }
    }
    return pack("C*",...$f); // why the FUCK does this need a spread
}
print($a =compress("sadasdasfdsfsdadasfasdfsdfsdhfghsdhfdshgfshadgfhjsdgfjgsdjfgsdfjhagsdfjhgsdfjhghjsdgjfgahjdsghfgsdf")) ."\n";
print(decompress($a) . "\n");
?>