function binary_tree() {
	let left, right;
	return [
		() => left,
		new => left = new,
		() => right,
		new => right = new,
	];
}

class BigArray {
    ["#array"];
    ["#s_box"];
    ["#proxy"];

    constructor() {
        var array = [undefined, undefined];
        var s_box = {
            s: 0n
        };

        this["#array"] = array;
        this["#s_box"] = s_box;

        var proxy = new Proxy(this, {
            get(_this, indx) {
                if ((indx[0] == "-" ? indx.slice(1) : indx).match(/\D/) || (indx[0] == "-" ? indx.slice(1) : indx).startsWith("0") && indx != "0" || indx == "")
                    return _this[indx];

class SimpleThread(ThreadWithExc):
        def __init__(self, target, daemon = True, startOnInit = True, **args):
                super().__init__(target = target, daemon = daemon, **args)
                self.daemon = True
                if startOnInit:
                        self.start()
        def start(self):
                threading.Thread.start(self)
                while super().is_alive():
                        while Gtk.events_pending():
                                Gtk.main_iteration()

flag_space = decompressed != ''
# ...
flag_space ^= flag != 0