The sky is the limit.

[PkmnQ]

Code Select Expand

x = PolarizedList(True, [PolarizedList(True, [PolarizedList(True, 1), PolarizedList(True, 2)]), PolarizedList(True, [PolarizedList(False, 3), PolarizedList(True, 4), PolarizedList(False, 5)]), PolarizedList(True, 0), PolarizedList(False, [PolarizedList(True, 6)])])


[PkmnQ]

Code Select Expand

class PolarizedList:
    def __init__(self, polarity=True, content=0):
        self.polarity = polarity
        if type(content) is int:
            self.list = []
            for _ in range(content):
                self.list.append(PolarizedList())
        else:
            self.list = content

    def __eq__(self, other):
        return self.polarity == other.polarity and self.list == other.list
    def __len__(self):
        return len(self.list)
    def __iter__(self):
        return iter(self.list)

    def __str__(self):
        return (
            f"{'+' if self.polarity else '-'}"
            f"[{''.join([str(i) for i in self])}]"
        )

    def __neg__(self):
        return PolarizedList(not self.polarity, self.list)

    def fuse(self):
        pre_fuse = []
        for i in self:
            separator = i.polarity
            for j in i:
                pre_fuse.append((separator, j))
                separator = None
            if separator is not None:
                pre_fuse.append((separator, None))
        new_list = []
        previous_polarity = None
        for separator, element in pre_fuse:
            if element is None:
                new_list.append(PolarizedList(separator))
                previous_polarity = None
                continue
            if previous_polarity is True and element.polarity is False:
                separator = {True: None, None: False, False: True}[separator]
            previous_polarity = element.polarity
            if separator is not None:
                new_list.append(PolarizedList(separator))
            new_list[-1].list.append(-element)
        self.list[:] = new_list
    def defuse(self):
        pre_fuse = []
        for i in self:
            separator = i.polarity
            for j in i:
                pre_fuse.append((separator, j))
                separator = None
            if separator is not None:
                pre_fuse.append((separator, None))
        new_list = []
        previous_polarity = None
        for separator, element in pre_fuse:
            if element is None:
                new_list.append(PolarizedList(separator))
                previous_polarity = None
                continue
            if previous_polarity is False and element.polarity is True:
                separator = {False: None, None: True, True: False}[separator]
            previous_polarity = element.polarity
            if separator is not None:
                new_list.append(PolarizedList(separator))
            new_list[-1].list.append(-element)
        self.list[:] = new_list

    def segmented_transposition(self):
        segments = []
        segment_polarity, segment_length = None, None
        for i in self:
            if segment_polarity != i.polarity or segment_length != len(i):
                segments.append([])
            segments[-1].append(i)
        new_list = []
        previous_length = None
        for i in segments:
            if len(i) == previous_length:
                return
            previous_length = len(i)
            transposed_segment = [[*j] for j in zip(*i)]
            if len(transposed_segment) == 0:
                return
            new_list += transposed_segment
        self.list[:] = new_list
    def ignorant_reversal(self):
        subelements = [sub_i for i in self for sub_i in i]
        re_insert = iter(reversed(subelements))
        for i in self:
            for sub_i, _ in enumerate(i):
                i[sub_i] = next(re_insert)

class Thread:
    def __init__(self, stack, shiny=True, parent=None):
        self.stack = stack
        self.shiny = shiny
        self.__parent = parent
    def parent(self):
        if self.__parent is None:
            self.__parent = Thread(
                [PolarizedList(True, [PolarizedList(True, self.stack)])]
            )
        return self.__parent

    def literal(self, content):
        if len(self.stack) == 0 or self.stack[0] == -content:
            self.stack.pop(0)
        else:
            self.stack.insert(0, content)
    def illiteral(self, content):
        self.literal(-content)

    def fuse(self):
        if self.stack == []:
            return
        self.stack[0].fuse()
    def defuse(self):
        if self.stack == []:
            return
        self.stack[0].defuse()

    def summon(self):
        if len(self.stack) < 3:
            return
        self.stack.insert(0, self.stack.pop(2))
    def banish(self):
        if len(self.stack) < 3:
            return
        self.stack.insert(2, self.stack.pop(0))

    def fork(self):
        if self.stack == [] or (substacks := self.stack[0].list) == []:
            return [Thread([], False)]
        new_threads = []
        for _, stack in substacks:
            new_threads.append(Thread(stack))
        return new_threads
    # spoon is implemented separately

    def hokey(self):
        if self.stack == []:
            return
        self.stack[0].segmented_transposition()
        self.stack[0].ignorant_reversal()
    def cokey(self):
        if self.stack == []:
            return
        self.stack[0].ignorant_reversal()
        self.stack[0].segmented_transposition()

    # double checking these may be wise
    def kitten(self):
        if self.stack == []:
            return
        top = self.stack[0]
        try:
            if top.polarity:
                top.list.insert(0, self.stack.pop(1))
            else:
                self.stack.insert(1, top.list.pop(0))
        except IndexError:
            self.stack[0] = -top
    def antikitten(self):
        if self.stack == []:
            return
        top = self.stack[0]
        try:
            if not top.polarity:
                top.list.insert(0, self.stack.pop(1))
            else:
                self.stack.insert(1, top.list.pop(0))
        except IndexError:
            self.stack[0] = -top
A few corrections, I think fuse and defuse work properly now

[Byron_Inc_TBG]

i am simply too lazy

[PkmnQ]

Code Select Expand

x = PolarizedList(True, [PolarizedList(True, 2), PolarizedList(True, [PolarizedList(True, 1), PolarizedList(False, 1)]), PolarizedList(True, 2), PolarizedList(False, 4), PolarizedList(True, 4), PolarizedList(True, 4)])
Segmented transposition probably works correctly

[PkmnQ]

Code Select Expand

x = PolarizedList(True, [PolarizedList(True, [PolarizedList(True, 1), PolarizedList(True, 2)]), PolarizedList(False, [PolarizedList(True, 3)]), PolarizedList(), PolarizedList(True, [PolarizedList(True, 4)])])Ignorant reversal also works

[PkmnQ]

Code Select Expand

class PolarizedList:
    def __init__(self, polarity=True, content=0):
        self.polarity = polarity
        if type(content) is int:
            self.list = []
            for _ in range(content):
                self.list.append(PolarizedList())
        else:
            self.list = content

    def __eq__(self, other):
        return self.polarity is other.polarity and self.list == other.list
    def __len__(self):
        return len(self.list)
    def __iter__(self):
        return iter(self.list)

    def __getitem__(self, index):
        return self.list[index]
    def __setitem__(self, index, value):
        self.list[index] = value

    def __repr__(self):
        return (
            f"{'+' if self.polarity else '-'}"
            f"[{''.join([str(i) for i in self])}]"
        )

    def __neg__(self):
        return PolarizedList(not self.polarity, self.list)

    def fuse(self):
        pre_fuse = []
        for i in self:
            separator = i.polarity
            for j in i:
                pre_fuse.append((separator, j))
                separator = None
            if separator is not None:
                pre_fuse.append((separator, None))
        new_list = []
        previous_polarity = None
        for separator, element in pre_fuse:
            if element is None:
                new_list.append(PolarizedList(separator))
                previous_polarity = None
                continue
            if previous_polarity is True and element.polarity is False:
                separator = {True: None, None: False, False: True}[separator]
            previous_polarity = element.polarity
            if separator is not None:
                new_list.append(PolarizedList(separator))
            new_list[-1].list.append(-element)
        self.list[:] = new_list
    def defuse(self):
        pre_fuse = []
        for i in self:
            separator = i.polarity
            for j in i:
                pre_fuse.append((separator, j))
                separator = None
            if separator is not None:
                pre_fuse.append((separator, None))
        new_list = []
        previous_polarity = None
        for separator, element in pre_fuse:
            if element is None:
                new_list.append(PolarizedList(separator))
                previous_polarity = None
                continue
            if previous_polarity is False and element.polarity is True:
                separator = {False: None, None: True, True: False}[separator]
            previous_polarity = element.polarity
            if separator is not None:
                new_list.append(PolarizedList(separator))
            new_list[-1].list.append(-element)
        self.list[:] = new_list

    def segmented_transposition(self):
        segments = []
        segment_polarity, segment_length = None, None
        for i in self:
            if segment_polarity != i.polarity or segment_length != len(i):
                segments.append([])
            segment_polarity, segment_length = i.polarity, len(i)
            segments[-1].append(i)
        print(segments)
        new_list = []
        previous_polarity, previous_length = None, None
        for i in segments:
            if (
                i[0].polarity is previous_polarity and
                len(i) == previous_length
            ):
                return
            previous_polarity, previous_length = i[0].polarity, len(i)
            transposed_segment = [
                PolarizedList(i[0].polarity, [*j]) for j in zip(*i)
            ]
            if len(transposed_segment) == 0:
                return
            new_list += transposed_segment
        self.list[:] = new_list
    def ignorant_reversal(self):
        subelements = [sub_i for i in self for sub_i in i]
        re_insert = iter(reversed(subelements))
        for i in self:
            for sub_i, _ in enumerate(i):
                i[sub_i] = next(re_insert)

class Thread:
    def __init__(self, stack, shiny=True, parent=None):
        self.stack = stack
        self.shiny = shiny
        self.__parent = parent
    def parent(self):
        if self.__parent is None:
            self.__parent = Thread(
                [PolarizedList(True, [PolarizedList(True, self.stack)])]
            )
        return self.__parent

    def literal(self, content):
        if len(self.stack) == 0 or self.stack[0] == -content:
            self.stack.pop(0)
        else:
            self.stack.insert(0, content)
    def illiteral(self, content):
        self.literal(-content)

    def fuse(self):
        if self.stack == []:
            return
        self.stack[0].fuse()
    def defuse(self):
        if self.stack == []:
            return
        self.stack[0].defuse()

    def summon(self):
        if len(self.stack) < 3:
            return
        self.stack.insert(0, self.stack.pop(2))
    def banish(self):
        if len(self.stack) < 3:
            return
        self.stack.insert(2, self.stack.pop(0))

    def fork(self):
        if self.stack == [] or (substacks := self.stack[0].list) == []:
            return [Thread([], False)]
        new_threads = []
        for _, stack in substacks:
            new_threads.append(Thread(stack))
        return new_threads
    # spoon is implemented separately

    def hokey(self):
        if self.stack == []:
            return
        self.stack[0].segmented_transposition()
        self.stack[0].ignorant_reversal()
    def cokey(self):
        if self.stack == []:
            return
        self.stack[0].ignorant_reversal()
        self.stack[0].segmented_transposition()

    # double checking these may be wise
    def kitten(self):
        if self.stack == []:
            return
        top = self.stack[0]
        try:
            if top.polarity:
                top.list.insert(0, self.stack.pop(1))
            else:
                self.stack.insert(1, top.list.pop(0))
        except IndexError:
            self.stack[0] = -top
    def antikitten(self):
        if self.stack == []:
            return
        top = self.stack[0]
        try:
            if not top.polarity:
                top.list.insert(0, self.stack.pop(1))
            else:
                self.stack.insert(1, top.list.pop(0))
        except IndexError:
            self.stack[0] = -top


[realicraft]

oh cool my tumblr account turned 6 today

[Incendiary]

H

[PkmnQ]

Code Select Expand

class PolarizedList:
    def __init__(self, polarity=True, content=0):
        self.polarity = polarity
        if type(content) is int:
            self.list = []
            for _ in range(content):
                self.list.append(PolarizedList())
        else:
            self.list = content

    def __eq__(self, other):
        return self.polarity is other.polarity and self.list == other.list
    def __len__(self):
        return len(self.list)
    def __iter__(self):
        return iter(self.list)

    def __getitem__(self, index):
        return self.list[index]
    def __setitem__(self, index, value):
        self.list[index] = value

    def __repr__(self):
        return (
            f"{'+' if self.polarity else '-'}"
            f"[{''.join([repr(i) for i in self])}]"
        )
    def __str__(self):
        return f"{'+' if self.polarity else '-'}" + (
            f"{len(self)}" if self.is_numeric()
            else f"[{''.join([repr(i) for i in self])}]"
        )

    def __neg__(self):
        return PolarizedList(not self.polarity, self.list)'

    def is_nil(self):
        return self.polarity is True and self.list == []
    def is_numeric(self):
        return all([i.is_nil() for i in self])

    def fuse(self):
        pre_fuse = []
        for i in self:
            separator = i.polarity
            for j in i:
                pre_fuse.append((separator, j))
                separator = None
            if separator is not None:
                pre_fuse.append((separator, None))
        new_list = []
        previous_polarity = None
        for separator, element in pre_fuse:
            if element is None:
                new_list.append(PolarizedList(separator))
                previous_polarity = None
                continue
            if previous_polarity is True and element.polarity is False:
                separator = {True: None, None: False, False: True}[separator]
            previous_polarity = element.polarity
            if separator is not None:
                new_list.append(PolarizedList(separator))
            new_list[-1].list.append(-element)
        self.list[:] = new_list
    def defuse(self):
        pre_fuse = []
        for i in self:
            separator = i.polarity
            for j in i:
                pre_fuse.append((separator, j))
                separator = None
            if separator is not None:
                pre_fuse.append((separator, None))
        new_list = []
        previous_polarity = None
        for separator, element in pre_fuse:
            if element is None:
                new_list.append(PolarizedList(separator))
                previous_polarity = None
                continue
            if previous_polarity is False and element.polarity is True:
                separator = {False: None, None: True, True: False}[separator]
            previous_polarity = element.polarity
            if separator is not None:
                new_list.append(PolarizedList(separator))
            new_list[-1].list.append(-element)
        self.list[:] = new_list

    def segmented_transposition(self):
        segments = []
        segment_polarity, segment_length = None, None
        for i in self:
            if segment_polarity != i.polarity or segment_length != len(i):
                segments.append([])
            segment_polarity, segment_length = i.polarity, len(i)
            segments[-1].append(i)
        print(segments)
        new_list = []
        previous_polarity, previous_length = None, None
        for i in segments:
            if (
                i[0].polarity is previous_polarity and
                len(i) == previous_length
            ):
                return
            previous_polarity, previous_length = i[0].polarity, len(i)
            transposed_segment = [
                PolarizedList(i[0].polarity, [*j]) for j in zip(*i)
            ]
            if len(transposed_segment) == 0:
                return
            new_list += transposed_segment
        self.list[:] = new_list
    def ignorant_reversal(self):
        subelements = [sub_i for i in self for sub_i in i]
        re_insert = iter(reversed(subelements))
        for i in self:
            for sub_i, _ in enumerate(i):
                i[sub_i] = next(re_insert)


[PkmnQ]

Code Select Expand

class PolarizedList:
    def __init__(self, polarity=True, content=0):
        self.polarity = polarity
        if type(content) is int:
            self.list = []
            for _ in range(content):
                self.list.append(PolarizedList())
        else:
            self.list = content

    def __eq__(self, other):
        return self.polarity is other.polarity and self.list == other.list
    def __len__(self):
        return len(self.list)
    def __iter__(self):
        return iter(self.list)

    def __getitem__(self, index):
        return self.list[index]
    def __setitem__(self, index, value):
        self.list[index] = value

    def __repr__(self):
        return (
            f"{'+' if self.polarity else '-'}"
            f"[{''.join([repr(i) for i in self])}]"
        )
    def __str__(self):
        return f"{'+' if self.polarity else '-'}" + (
            f"{len(self)}" if self.is_numeric()
            else f"[{''.join([str(i) for i in self])}]"
        )

    def __neg__(self):
        return PolarizedList(not self.polarity, self.list)

    def is_nil(self):
        return self.polarity is True and self.list == []
    def is_numeric(self):
        return all([i.is_nil() for i in self])

    def fuse(self):
        pre_fuse = []
        for i in self:
            separator = i.polarity
            for j in i:
                pre_fuse.append((separator, j))
                separator = None
            if separator is not None:
                pre_fuse.append((separator, None))
        new_list = []
        previous_polarity = None
        for separator, element in pre_fuse:
            if element is None:
                new_list.append(PolarizedList(separator))
                previous_polarity = None
                continue
            if previous_polarity is True and element.polarity is False:
                separator = {True: None, None: False, False: True}[separator]
            previous_polarity = element.polarity
            if separator is not None:
                new_list.append(PolarizedList(separator))
            new_list[-1].list.append(-element)
        self.list[:] = new_list
    def defuse(self):
        pre_fuse = []
        for i in self:
            separator = i.polarity
            for j in i:
                pre_fuse.append((separator, j))
                separator = None
            if separator is not None:
                pre_fuse.append((separator, None))
        new_list = []
        previous_polarity = None
        for separator, element in pre_fuse:
            if element is None:
                new_list.append(PolarizedList(separator))
                previous_polarity = None
                continue
            if previous_polarity is False and element.polarity is True:
                separator = {False: None, None: True, True: False}[separator]
            previous_polarity = element.polarity
            if separator is not None:
                new_list.append(PolarizedList(separator))
            new_list[-1].list.append(-element)
        self.list[:] = new_list

    def segmented_transposition(self):
        segments = []
        segment_polarity, segment_length = None, None
        for i in self:
            if segment_polarity != i.polarity or segment_length != len(i):
                segments.append([])
            segment_polarity, segment_length = i.polarity, len(i)
            segments[-1].append(i)
        print(segments)
        new_list = []
        previous_polarity, previous_length = None, None
        for i in segments:
            if (
                i[0].polarity is previous_polarity and
                len(i) == previous_length
            ):
                return
            previous_polarity, previous_length = i[0].polarity, len(i)
            transposed_segment = [
                PolarizedList(i[0].polarity, [*j]) for j in zip(*i)
            ]
            if len(transposed_segment) == 0:
                return
            new_list += transposed_segment
        self.list[:] = new_list
    def ignorant_reversal(self):
        subelements = [sub_i for i in self for sub_i in i]
        re_insert = iter(reversed(subelements))
        for i in self:
            for sub_i, _ in enumerate(i):
                i[sub_i] = next(re_insert)

# This assumes correct syntax
def read_polarized_list(written):
    stack = [PolarizedList()]
    for i in written:
        match i:
            case "+":
                polarity = True
            case "-":
                polarity = False
            case "[":
                new_list = PolarizedList(polarity)
                stack[-1].list.append(new_list)
                stack.append(new_list)
            case "]":
                stack.pop()
            case _:
                stack[-1].list.append(PolarizedList(polarity, int(i)))
    return stack[-1][0]


Code Select Expand

from polarized_list import PolarizedList

class Thread:
    def __init__(self, stack, shiny=True, parent=None):
        self.stack = stack
        self.shiny = shiny
        self.__parent = parent
    def parent(self):
        if self.__parent is None:
            self.__parent = Thread(
                [PolarizedList(True, [PolarizedList(True, self.stack)])]
            )
        return self.__parent

    def literal(self, content):
        if len(self.stack) == 0 or self.stack[0] == -content:
            self.stack.pop(0)
        else:
            self.stack.insert(0, content)
    def illiteral(self, content):
        self.literal(-content)

    def fuse(self):
        if self.stack == []:
            return
        self.stack[0].fuse()
    def defuse(self):
        if self.stack == []:
            return
        self.stack[0].defuse()

    def summon(self):
        if len(self.stack) < 3:
            return
        self.stack.insert(0, self.stack.pop(2))
    def banish(self):
        if len(self.stack) < 3:
            return
        self.stack.insert(2, self.stack.pop(0))

    def fork(self):
        if self.stack == [] or (substacks := self.stack[0].list) == []:
            return [Thread([], False)]
        new_threads = []
        for _, stack in substacks:
            new_threads.append(Thread(stack))
        return new_threads
    # spoon is implemented separately

    def hokey(self):
        if self.stack == []:
            return
        self.stack[0].segmented_transposition()
        self.stack[0].ignorant_reversal()
    def cokey(self):
        if self.stack == []:
            return
        self.stack[0].ignorant_reversal()
        self.stack[0].segmented_transposition()

    def kitten(self):
        if self.stack == []:
            return
        top = self.stack[0]
        try:
            if top.polarity:
                top.list.insert(0, self.stack.pop(1))
            else:
                self.stack.insert(1, top.list.pop(0))
        except IndexError:
            self.stack[0] = -top
    def antikitten(self):
        if self.stack == []:
            return
        top = self.stack[0]
        try:
            if not top.polarity:
                top.list.insert(0, self.stack.pop(1))
            else:
                self.stack.insert(1, top.list.pop(0))
        except IndexError:
            self.stack[0] = -top


My goal here is, even if not making a full interpreter of Snowflake, I want to make one that allows you to use the primitives, because I don't immediately see how it's obvious that it can even get a copy of itself to modify.

First goal soon to be achieved, I'm going to make the primitives interpreter.

[PkmnQ]

I don't immediately see how it's obvious that it can even get a copy of itself to modify.

At the start of program execution, there is one shiny thread, with no parent, and one stack element: the program that is being executed.

Oh, it doesn't have to quine, because it's already provided with itself. Whoops.

[PkmnQ]

Code Select Expand

class PolarizedList:
    def __init__(self, polarity=True, content=0):
        self.polarity = polarity
        if type(content) is int:
            self.list = []
            for _ in range(content):
                self.list.append(PolarizedList())
        else:
            self.list = content

    def __eq__(self, other):
        return self.polarity is other.polarity and self.list == other.list
    def __len__(self):
        return len(self.list)
    def __iter__(self):
        return iter(self.list)

    def __getitem__(self, index):
        return self.list[index]
    def __setitem__(self, index, value):
        self.list[index] = value

    def __repr__(self):
        return (
            f"{'+' if self.polarity else '-'}"
            f"[{''.join([repr(i) for i in self])}]"
        )
    def __str__(self):
        return f"{'+' if self.polarity else '-'}" + (
            f"{len(self)}" if self.is_numeric()
            else f"[{''.join([str(i) for i in self])}]"
        )

    def __neg__(self):
        return PolarizedList(not self.polarity, self.list)

    def is_nil(self):
        return self.polarity is True and self.list == []
    def is_numeric(self):
        return all([i.is_nil() for i in self])

    def fuse(self):
        pre_fuse = []
        for i in self:
            separator = i.polarity
            for j in i:
                pre_fuse.append((separator, j))
                separator = None
            if separator is not None:
                pre_fuse.append((separator, None))
        new_list = []
        previous_polarity = None
        for separator, element in pre_fuse:
            if element is None:
                new_list.append(PolarizedList(separator))
                previous_polarity = None
                continue
            if previous_polarity is True and element.polarity is False:
                separator = {True: None, None: False, False: True}[separator]
            previous_polarity = element.polarity
            if separator is not None:
                new_list.append(PolarizedList(separator))
            new_list[-1].list.append(-element)
        self.list[:] = new_list
    def defuse(self):
        pre_fuse = []
        for i in self:
            separator = i.polarity
            for j in i:
                pre_fuse.append((separator, j))
                separator = None
            if separator is not None:
                pre_fuse.append((separator, None))
        new_list = []
        previous_polarity = None
        for separator, element in pre_fuse:
            if element is None:
                new_list.append(PolarizedList(separator))
                previous_polarity = None
                continue
            if previous_polarity is False and element.polarity is True:
                separator = {False: None, None: True, True: False}[separator]
            previous_polarity = element.polarity
            if separator is not None:
                new_list.append(PolarizedList(separator))
            new_list[-1].list.append(-element)
        self.list[:] = new_list

    def segmented_transposition(self):
        segments = []
        segment_polarity, segment_length = None, None
        for i in self:
            if segment_polarity != i.polarity or segment_length != len(i):
                segments.append([])
            segment_polarity, segment_length = i.polarity, len(i)
            segments[-1].append(i)
        print(segments)
        new_list = []
        previous_polarity, previous_length = None, None
        for i in segments:
            if (
                i[0].polarity is previous_polarity and
                len(i) == previous_length
            ):
                return
            previous_polarity, previous_length = i[0].polarity, len(i)
            transposed_segment = [
                PolarizedList(i[0].polarity, [*j]) for j in zip(*i)
            ]
            if len(transposed_segment) == 0:
                return
            new_list += transposed_segment
        self.list[:] = new_list
    def ignorant_reversal(self):
        subelements = [sub_i for i in self for sub_i in i]
        re_insert = iter(reversed(subelements))
        for i in self:
            for sub_i, _ in enumerate(i):
                i[sub_i] = next(re_insert)

    def deepcopy(self):
        # Not implementing copy.deepcopy since this implementation does not
        # have to support recursive polarized lists. If that happens,
        # that's a problem with this interpreter.
        return PolarizedList(self.polarity, [i.deepcopy() for i in self])

# This assumes correct syntax
def read_polarized_list(written):
    stack = [PolarizedList()]
    for i in written:
        match i:
            case "+":
                polarity = True
            case "-":
                polarity = False
            case "[":
                new_list = PolarizedList(polarity)
                stack[-1].list.append(new_list)
                stack.append(new_list)
            case "]":
                stack.pop()
            case _:
                stack[-1].list.append(PolarizedList(polarity, int(i)))
    return stack[-1][0]


Code Select Expand

from polarized_list import PolarizedList

class Thread:
    def __init__(self, stack, shiny=True, parent=None):
        self.stack = stack
        self.shiny = shiny
        self.__parent = parent
    def parent(self):
        if self.__parent is None:
            self.__parent = Thread(
                [PolarizedList(True, [PolarizedList(True, self.stack)])]
            )
        return self.__parent

    def literal(self, content):
        if len(self.stack) == 0 or self.stack[0] == -content:
            self.stack.pop(0)
        else:
            self.stack.insert(0, content)
    def illiteral(self, content):
        self.literal(-content)

    def fuse(self):
        if self.stack == []:
            return
        self.stack[0].fuse()
    def defuse(self):
        if self.stack == []:
            return
        self.stack[0].defuse()

    def summon(self):
        if len(self.stack) < 3:
            return
        self.stack.insert(0, self.stack.pop(2))
    def banish(self):
        if len(self.stack) < 3:
            return
        self.stack.insert(2, self.stack.pop(0))

    def fork(self):
        if self.stack == [] or (substacks := self.stack[0].list) == []:
            return [Thread([], False, self)]
        new_threads = []
        for _, stack in substacks:
            new_threads.append(Thread(stack, True, self))
        return new_threads
    # spoon is implemented separately

    def hokey(self):
        if self.stack == []:
            return
        self.stack[0].segmented_transposition()
        self.stack[0].ignorant_reversal()
    def cokey(self):
        if self.stack == []:
            return
        self.stack[0].ignorant_reversal()
        self.stack[0].segmented_transposition()

    def kitten(self):
        if self.stack == []:
            return
        top = self.stack[0]
        try:
            if top.polarity:
                top.list.insert(0, self.stack.pop(1))
            else:
                self.stack.insert(1, top.list.pop(0))
        except IndexError:
            self.stack[0] = -top
    def antikitten(self):
        if self.stack == []:
            return
        top = self.stack[0]
        try:
            if not top.polarity:
                top.list.insert(0, self.stack.pop(1))
            else:
                self.stack.insert(1, top.list.pop(0))
        except IndexError:
            self.stack[0] = -top


Code Select Expand

import polarized_list, threads

def one_cycle(program):
    active_threads = [threads.Thread([
        PolarizedList(True, program).deepcopy()
    ])]
    for instruction in program:
        shiny_threads = [thread for threads in active_threads if thread.shiny]
        match instruction:
            case PolarizedList(polarity=True, list=[x]):
                for thread in shiny_threads:
                    thread.literal(x)
            case PolarizedList(polarity=False, list=[x]):
                for thread in shiny_threads:
                    thread.illiteral(x)
            case PolarizedList(polarity=True, list=[_, _]):
                for thread in shiny_threads:
                    thread.fuse(x)
            case PolarizedList(polarity=False, list=[_, _]):
                for thread in shiny_threads:
                    thread.defuse(x)
            case PolarizedList(polarity=True, list=[_, _, _]):
                for thread in shiny_threads:
                    thread.summon(x)
            case PolarizedList(polarity=False, list=[_, _, _]):
                for thread in shiny_threads:
                    thread.banish(x)
            case PolarizedList(polarity=True, list=[_, _, _, _]):
                new_active_threads = []
                for thread in active_threads:
                    new_active_threads += thread.fork()
                active_threads[:] = new_active_threads
            case PolarizedList(polarity=False, list=[_, _, _, _]):
                new_active_threads = set()
                for thread in active_threads:
                    new_active_threads.add(thread.parent())
                active_threads[:] = list(new_active_threads)
            case PolarizedList(polarity=True, list=[_, _, _, _, _]):
                for thread in shiny_threads:
                    thread.hokey(x)
            case PolarizedList(polarity=False, list=[_, _, _, _, _]):
                for thread in shiny_threads:
                    thread.cokey(x)
            case PolarizedList(polarity=True, list=[_, _, _, _, _, _]):
                for thread in shiny_threads:
                    thread.kitten(x)
            case PolarizedList(polarity=False, list=[_, _, _, _, _, _]):
                for thread in shiny_threads:
                    thread.antikitten(x)
            case _:
                pass
    return active_threads
Probably better if I stop it here for today, I'll have plenty of time tomorrow anyway

[PkmnQ]

That's not tested by the way, and I don't know if I'm even returning the useful information, that stuff is to figure out tomorrow

Anyway time to run the script and generate a new leaderboard

[PkmnQ]

Code Select Expand

[1] NotAJumbleOfNumbers: 3,733 points.
[2] RedHoodLover: 1,553 points.
[3] 30-1: 1,236 points.
[4] sportsdude: 623 points.
[5] PkmnQ: 611 points.
[6] sanjayraj: 521 points.
[7] tbg52: 489 points.
[8] realicraft: 382 points.
[9] derpmeup: 376 points.
[10] bookworm: 319 points.
[11] redgreenandblue: 316 points.
[12] Byron_Inc_TBG: 249 points.
[13] Shadow: 215 points.
[14] Dark: 191 points.
[15] solitaire: 184 points.
[16] Zan: 147 points.
[17] awesome-llama: 119 points.
[18] shpeters: 89 points.
[19] QisEpic: 82 points.
[20] 360-International: 80 points.
[21] Alex The JPEG: 75 points.
[22] bluecat600: 66 points.
[23] jji7skyline: 41 points.
[24] Incendiary: 34 points.
[25] NoxSpooth: 26 points.
[26] PhirripSyrrip: 26 points.
[27] SausageMcSauce: 24 points.
[28] Luigis_Pizza: 24 points.
[29] joefarebrother: 23 points.
[30] Wolfslime123: 22 points.
[31] Faressain: 21 points.
[32] Gilbert189: 21 points.
[33] tailskirbyyoshifan: 20 points.
[34] CoolTBGGaming: 20 points.
[35] GalaxySugarFox: 19 points.
[36] fahrenheit451: 18 points.
[37] Fishmael: 18 points.
[38] GeonoTRON2000: 18 points.
[39] Ryasis: 16 points.
[40] Tai-Guy: 14 points.
[41] Bklecka: 14 points.
[42] PreoKid: 13 points.
[43] SuperJedi224: 12 points.
[44] Waffle27: 12 points.
[45] JakubMzTrencina: 12 points.
[46] friendoffriend: 11 points.
[47] -Terrariadude555-: 9 points.
[48] fred: 8 points.
[49] Dino: 8 points.
[50] Flowermanvista: 8 points.
[51] Kuq Mujq Gho: 8 points.
[52] ROSMan: 7 points.
[53] dvd4: 6 points.
[54] Tymewalk: 6 points.
[55] Mokat: 6 points.
[56] iAlwaysWin: 5 points.
[57] SuperKamekArea: 5 points.
[58] SilverEagle: 4 points.
[59] ev3commander: 4 points.
[60] Seanbobe: 4 points.
[61] SpicyMeatball: 4 points.
[62] LiberianPrince: 4 points.
[63] scratcher7_13: 4 points.
[64] JustMeMeMe: 4 points.
[65] benjamin2: 3 points.
[66] ka-doink4545o0: 3 points.
[67] mythbusteranimator: 3 points.
[68] whizzer: 3 points.
[69] Uzi's Alternate Account: 3 points.
[70] CellularData: 3 points.
[71] TheLetterThorn: 3 points.
[72] azaquaz: 2 points.
[73] JJROCKER: 2 points.
[74] Flyboy: 2 points.
[75] scratchisthebest: 2 points.
[76] Upsilon920: 2 points.
[77] Uzi: 2 points.
[78] the2000: 2 points.
[79] jirachi: 2 points.
[80] Sugary120: 2 points.
[81] Orifan1: 2 points.
[82] BajaBlast98: 2 points.
[83] Purvitekriwal: 2 points.
[84] BiphA: 2 points.
[85] Obsidiana: 1 point.
[86] curiouscrab: 1 point.
[87] scratcher: 1 point.
[88] Rehydration: 1 point.
[89] Necro: 1 point.
[90] SomeNights-: 1 point.
[91] jrbc1: 1 point.
[92] epicepicman: 1 point.
[93] laser314: 1 point.
[94] Fusion44: 1 point.
[95] Consequence: 1 point.
[96] TurquoiseTabby: 1 point.
[97] Shpore: 1 point.
[98] (8435-alt)LexiaTheArrow: 1 point.
[99] xX-Catriona-Xx: 1 point.
[100] TheTealWashableMarker: 1 point.
[101] Ash_TBG: 1 point.
[102] Karanrimé: 1 point.
[103] Prism: 1 point.
[104] ColorMaster: 1 point.
[105] manosysltia: 1 point.
[106] Chir': 1 point.
[107] Blunderbus: 1 point.
[108] Murphmario: 1 point.
[109] DownsGameClub: 1 point.
[110] Turtle84375: 1 point.
[111] iwantpie21: 1 point.
[112] Reid: 1 point.
[113] donotforgetmycode: 1 point.

Wait a minute, that's not right

[PkmnQ]

Code Select Expand

[1] NotAJumbleOfNumbers: 3,733 points.
[2] RedHoodLover: 1,553 points.
[3] 30-1: 1,236 points.
[4] PkmnQ: 775 points.
[5] sportsdude: 623 points.
[6] sanjayraj: 521 points.
[7] tbg52: 489 points.
[8] realicraft: 460 points.
[9] derpmeup: 376 points.
[10] bookworm: 319 points.
[11] redgreenandblue: 317 points.
[12] Byron_Inc_TBG: 304 points.
[13] Shadow: 215 points.
[14] solitaire: 194 points.
[15] Dark: 191 points.
[16] Zan: 176 points.
[17] awesome-llama: 119 points.
[18] shpeters: 89 points.
[19] QisEpic: 82 points.
[20] 360-International: 80 points.
[21] Alex The JPEG: 75 points.
[22] bluecat600: 66 points.
[23] Incendiary: 50 points.
[24] jji7skyline: 41 points.
[25] Gilbert189: 40 points.
[26] JakubMzTrencina: 40 points.
[27] Luigis_Pizza: 33 points.
[28] NoxSpooth: 26 points.
[29] PhirripSyrrip: 26 points.
[30] SausageMcSauce: 24 points.
[31] joefarebrother: 23 points.
[32] Wolfslime123: 22 points.
[33] Faressain: 21 points.
[34] tailskirbyyoshifan: 20 points.
[35] CoolTBGGaming: 20 points.
[36] GalaxySugarFox: 19 points.
[37] fahrenheit451: 18 points.
[38] Fishmael: 18 points.
[39] GeonoTRON2000: 18 points.
[40] Ryasis: 16 points.
[41] Tai-Guy: 14 points.
[42] Bklecka: 14 points.
[43] PreoKid: 13 points.
[44] SuperJedi224: 12 points.
[45] Waffle27: 12 points.
[46] friendoffriend: 11 points.
[47] -Terrariadude555-: 9 points.
[48] fred: 8 points.
[49] Dino: 8 points.
[50] Flowermanvista: 8 points.
[51] Kuq Mujq Gho: 8 points.
[52] ROSMan: 7 points.
[53] dvd4: 6 points.
[54] Tymewalk: 6 points.
[55] Mokat: 6 points.
[56] Starlight Glimmer: 6 points.
[57] iAlwaysWin: 5 points.
[58] SuperKamekArea: 5 points.
[59] SilverEagle: 4 points.
[60] ev3commander: 4 points.
[61] Seanbobe: 4 points.
[62] SpicyMeatball: 4 points.
[63] LiberianPrince: 4 points.
[64] scratcher7_13: 4 points.
[65] JustMeMeMe: 4 points.
[66] donotforgetmycode: 4 points.
[67] benjamin2: 3 points.
[68] ka-doink4545o0: 3 points.
[69] mythbusteranimator: 3 points.
[70] whizzer: 3 points.
[71] Uzi's Alternate Account: 3 points.
[72] CellularData: 3 points.
[73] TheLetterThorn: 3 points.
[74] azaquaz: 2 points.
[75] JJROCKER: 2 points.
[76] Flyboy: 2 points.
[77] scratchisthebest: 2 points.
[78] Upsilon920: 2 points.
[79] Uzi: 2 points.
[80] the2000: 2 points.
[81] jirachi: 2 points.
[82] Sugary120: 2 points.
[83] Orifan1: 2 points.
[84] BajaBlast98: 2 points.
[85] Purvitekriwal: 2 points.
[86] BiphA: 2 points.
[87] ridium: 2 points.
[88] Obsidiana: 1 point.
[89] curiouscrab: 1 point.
[90] scratcher: 1 point.
[91] Rehydration: 1 point.
[92] Necro: 1 point.
[93] SomeNights-: 1 point.
[94] jrbc1: 1 point.
[95] epicepicman: 1 point.
[96] laser314: 1 point.
[97] Fusion44: 1 point.
[98] Consequence: 1 point.
[99] TurquoiseTabby: 1 point.
[100] Shpore: 1 point.
[101] (8435-alt)LexiaTheArrow: 1 point.
[102] xX-Catriona-Xx: 1 point.
[103] TheTealWashableMarker: 1 point.
[104] Ash_TBG: 1 point.
[105] Karanrimé: 1 point.
[106] Prism: 1 point.
[107] ColorMaster: 1 point.
[108] manosysltia: 1 point.
[109] Chir': 1 point.
[110] Blunderbus: 1 point.
[111] Murphmario: 1 point.
[112] DownsGameClub: 1 point.
[113] Turtle84375: 1 point.
[114] iwantpie21: 1 point.
[115] Reid: 1 point.
[116] Europe2048: 1 point.
[117] Thered9: 1 point.
[118] HardComet177081: 1 point.
[119] adummy: 1 point.Must've ran it too early before everything loaded
This is point #776

[PkmnQ]

Which means this is 777

[Zan]

Which means this is 777

I saw this image and I immediately clicked it
It's like stimulus.

[Zan]

178

[PkmnQ]

Which means this is 777

I saw this image and I immediately clicked it
It's like stimulus.

I'm guessing you saw the alt text

[Zan]

Which means this is 777

I saw this image and I immediately clicked it
It's like stimulus.

I'm guessing you saw the alt text

Not until you mentioned it
You predict future

[PkmnQ]

[PkmnQ]

Wrong thread but I mean it works I guess

[Byron_Inc_TBG]

w

[Gilbert189]

What started as a thought of implementing Urea Geller into 0CC-FamiTracker ended up with this parable about copyright:

It started as a simple curiosity. A thought of connecting two or more things that may just work out. A personal challenge and/or a learning experience. Or maybe just as a joke. You decided to go for it and make your silly, lightbulb idea a reality. In the end, it worked. You feel proud of yourself.

You've then decided to show it to others; see what you've made. Everyone praised it. Words soon spread on your masterpiece. You felt even more proud that everyone appreciates your work. But then disaster struck.

A bunch of figures in tuxedo suits whose face you can't see approached you. On their hands are images of something you've just made and showed. "This is ours," they said in a monotone voice. "You stole them." You explained in detail why you made them and why it doesn't count as stealing, but they won't budge. "Take it down, or we'll do it ourselves."

Seeing no path left to escape, you've decided to give in and get your piece out the conversing room. You don't want to get in trouble with the law. However, not everyone was happy with this decision. They rioted over it, as they too do not get why the creation of this piece counts as theft. Some fault it on the figure's overly strict rules. Some blamed it on the figure sender's boastful attitude. Some even had the audacity protesting to abandon this ownership system for good.

I guess sometimes my writing skills just came in out of nowhere.

[PkmnQ]

EWOW 5B!