If this gets a post ID of 65536, we advance! (The cooler version)

[Luigis_Pizza]

[Luigis_Pizza]

[Luigis_Pizza]

[Luigis_Pizza]

[Luigis_Pizza]

[Luigis_Pizza]

[Luigis_Pizza]

[Luigis_Pizza]

[Luigis_Pizza]

 

[PkmnQ]

Today's featured article is existence

[realicraft]

[solitaire]

[Gilbert189]

Code Select Expand

.docs-grille-gm3.docs-gm .docs-material #docs-toolbar-wrapper {
  background-color: #edf2fa;
  border: none;
  border-radius: 12px;
  font-family: Google Sans,Roboto,sans-serif;
  margin: 0px 12px 2px 12px;
  min-height: 20px;
  padding: 0 4px;
  -webkit-font-smoothing: antialiased;
}

.goog-toolbar {
  min-height: 20px !important;
}

#docs-toolbar > *, #docs-side-toolbar > * {
  margin: 0px;
}

.app-switcher-button {
  left: 0px;
  height: 40px;
  width: 40px;
}

.app-switcher-button > * {
  left: 0px;
  top: 0px;
}

.companion-app-switcher-container, .docs-companion-app-switcher-container {
   width: 40px !important;
}

.companion-collapser-button-container {
  height: 40px;
  width: 40px;
}

.docs-additional-bars {
  width: calc(var(width) + 8px);
}


[Luigis_Pizza]

 

[PkmnQ]

Code Select Expand

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([(True, [(True, self.stack)])])
        return self.__parent
    def literal(self, content):
        if len(self.stack) == 0 or (self.stack[0][1] == content[1] and self.stack[0][0] != content[0]):
            self.stack.pop(0)
        else:
            self.stack.insert(0, content)
    def illiteral(self, content):
        self.literal((not content[0], content[1]))
    def fuse(self):
        raise NotImplementedError
    def defuse(self):
        raise NotImplementedError
    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 self.stack[0][1] == []:
            return [Thread([], False)]
        new_threads = []
        for _, stack in self.stack[0][1]:
            new_threads.append(Thread(stack))
    # spoon is implemented separately

[Gilbert189]

Today's featured article is existence

∃x

[Incendiary]

I

[Byron_Inc_TBG]

xs

[Incendiary]

N

[Orb Fish]

16

[PkmnQ]

Code Select Expand

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([(True, [(True, self.stack)])])
        return self.__parent
    def literal(self, content):
        if len(self.stack) == 0 or (self.stack[0][1] == content[1] and self.stack[0][0] != content[0]):
            self.stack.pop(0)
        else:
            self.stack.insert(0, content)
    def illiteral(self, content):
        self.literal((not content[0], content[1]))
    def fuse(self):
        raise NotImplementedError
    def defuse(self):
        raise NotImplementedError
    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 self.stack[0][1] == []:
            return [Thread([], False)]
        new_threads = []
        for _, stack in self.stack[0][1]:
            new_threads.append(Thread(stack))
    # spoon is implemented separately

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 __neg__(self):
        return PolarizedList(not polarity, content)

    def fuse(self):
        raise NotImplementedError
    def defuse(self):
        raise NotImplementedError

    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
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.

[PkmnQ]

Slight changes:

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 __neg__(self):
        return PolarizedList(not polarity, content)

    def fuse(self):
        raise NotImplementedError
    def defuse(self):
        raise NotImplementedError

    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)
        new_list = []
        segment_polarity, segment_length = None, None
        for i in segments:
            if segment_polarity == i[0].polarity and len(i) == segment_length:
                return
            segment_polarity, segment_length = i[0].polarity, len(i)
            transposed_segment = [PolarizedList(segment_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

[Incendiary]

G

[Luigis_Pizza]

G

iggity

[Orb Fish]

Coming soon to RW-570 . . .

The chronicle of Project Nostophobia IV has crescendoed. A firm list of three targets has been assembled from extensive research. What was meant to be a mere tech test and studio tour has holds a similarity with the project's focus. A friend rises, divergent of the wrongdoings that haunt his kin. Two and three slot together, bringing about a coincidence which is comparable to the incident with Haku, but on a completely coincidental level.

Some days, it's nice to be different for once.

P.S.: The time is 11:49pm, and I wrote this for no particular reason, other than to do something about my insomnia. I sense an audible low-frequency humming noise. Some head-turning suggests that it is coming from the general direction of the smaller backyard tree. There are two trees that overhang our backyard, and neither are rooted on our property.