The Nineteenth Byte

« first day (3077 days earlier) ← previous day next day → last day (1766 days later) »

1:44 AM

what's happening here :|
https://tio.run/##rVjbbttGEH22vmJqqyFpS7KdpgFqy3LRJg2CInaA5iWQBYMSV9KmJFfhkpFVW/31dGYvvIp2AhS5kDs75@zs7GUOtWJJ@PLr1wPIJIM08WfsvNNZJH4U@Qlc@WmW@OEbuO/speJvFsNawj2ccbiRh@C4jn7GImXmNV36qX4dD2MRiyTgsR@OyDLBbk/3PTyox7azdwBfWDKFCxArlvipSMDl8ZzfeT2IRRZjxzwGd5UwsnX2kixk8OH6PQYxhqFMo3QEzsCBiSJbJSIVoHwQdQ/KuGfaZ3ITDZFoNdIzcEKGkQ55wGIkMc@j3OBMcUpDdrdK9Ah1JgrbMqWiQnQbcklvUxFsRg0gTasSAuaMhjKpul3jy4hmN/YHg3/6E4yJMlcPBw4gXXIJa5GFAURZ6qe4fksGKz@RLKkkgwKppoMsKhrJ40XIKB6n51yWU9r0jbIw5SvtTdGfYexznsg03DgNuOvSvGLd4dku75AgOM0dkOoCkjmP@aCwqUj43MbA50Va1HiXNu9jcFgoKWu6PbksppQT@bOUC7scZk0NXd…

MilkyWay90

@ASCII-only old TIO links don't output a program at all, it seems

ASCII-only

@MilkyWay90 ... it's a new link tho?

also click see full text maybe

MilkyWay90

@ASCII-only I mean ones from like 2018

ASCII-only

in token nonordinal:sym<string>, if you switch the sides of the alternation ||, it works tho for some reason

MilkyWay90

ohhhh

that's how it works

ASCII-only

1:45 AM

:|||||||||||||||||||

MilkyWay90

And I was wondering why it didn't work

ASCII-only

yeah m8 v2 has been up for a while

MilkyWay90

I just saw the subreddit r/AntiTeams

I think their cause is noble

To eliminate all teams from Agar.io!

ASCII-only

agar.io isn't dead?

MilkyWay90

nope

Well, it is

But not completely

Whenever my name is AntiTeams in agario, teams keep targeting me for some reason... hmm...

lirtosiast

2:03 AM

@Adám Would it be possible to add the Husk character aliases to all other languages on the language bar that share characters? They're so much easier to remember than the Jelly ones.

@Rick What is f and what is * in this example?

ASCII-only

2:20 AM

@lirtosiast "if the operation was *", unless you mean a specific example?

lirtosiast

3:07 AM

@ASCII-only I mean, what is * in the anagram example? It can't be swapping two letters of a word because that doesn't take two arguments of the same type.

1 hour later…

Adám

4:35 AM

@lirtosiast I'm not following. Are you asking that this be added to the community ad? Are there characters missing from it? Something else?

lirtosiast

5:14 AM

I want the option to type neg<tab> in the Jelly and Brachylog language bars and get `¬` rather than remember three different aliases for Husk, Jelly, and Brachylog. Husk-like three-letter aliases seem to be best to standardize on because they're easiest to remember.
Also, the Husk bar seems to be missing aliases for Greek letters e.g. Sig for `Σ`.

Unrelated String

5:41 AM

...I legitimately forgot about the keyboard shortcut part of the language bars

This whole time I've just been clicking each character one by one

New Main Posts

Q: Smallest web server

Create your smallest web server in your preferred language! Requirements Must respond to atleast 1 type of request (get,post,patch,delete), with a specified string. Smallest implementation wins! *String can be empty You may use any library you want My personal record for this was 56B in node ...

code-golf

Adám

6:32 AM

@lirtosiast Ah, that's what you mean. Each language needs a fixed number of characters for <tab> to pick up. Brachylog and Jelly already use a two-char scheme.

3 hours later…

Adám

9:13 AM

@lirtosiast Missing Husk aliases should be fixed now.

2 hours later…

New Main Posts

11:26 AM

Q: Model a todo list in Cypher

Introduction A list is a common, well-understood data structure. Neo4j's property graph model can represent any data structure. What's the best way to represent a list? Inspired by TodoMVC and Todo-Backend Challenge Manage a todo list using parameterized Cypher. Todo list items are compos...

code-golf graph-theory

New Main Posts

11:46 AM

Q: n-level Ouroboros Quine

This 128-language quine ouroboros (a program which outputs a program in another language, which outputs a program in yet another language, (125 languages later), which outputs the original program) is pretty impressive. But unfortunately, it has a static number of iterations. Write a program whi...

code-golf quine

1 hour later…

New Sandboxed Posts

1:08 PM

A: Sandbox for Proposed Challenges

Manage a todo list using Cypher (WIP) Introduction A list is a common, well-understood data structure. Neo4j's property graph model can represent any data structure. Using the Cypher query language, write a collection of statements for managing a todolist inspired by TodoMVC and Todo-Backend ...

1 hour later…

New Main Posts

2:26 PM

Q: Code golf: Binary adder using "Baba Is You"

Recently, someone made Conway's Game of Life using the rules of the titular game. The game actually appear to have potential as a programming environment. The challenge here is to create a set up wherein any user can do the following: Specify two binary addends, each representing 1 or 0 Confir...

function simulation language-design

New Main Posts

3:06 PM

Q: Machine Learning Golf: Fashion MNIST

The first instance of Machine Learning Golf received a lot of intention but also revealed some problems (mostly caused by people in this community being too clever ;-)). I intend to address those issues in this second installment: Fashion MNIST is a dataset of 60,000 labelled 28x28 pixel graysc...

image-processing atomic-code-golf neural-networks

MilkyWay90

3:20 PM

I'm going to start calling this site C̶̙͌G̴̘̿C̵̯̅C̵͍͆

MilkyWay90

3:32 PM

I just saw a musical on tail-call optimization on SO Blogs. What has this world come to?

Anush

algo question. Consider a graph with n nodes. The only operation supported is add-and-report which adds an edge to the graph and reports which triangles contain the new edge

can this be done in time proportional to the number of reported triangles?

1 hour later…

Veskah

5:03 PM

Hmm, how would someone capture n characters in regex and then capture n characters later (not necessarily the same string of characters)?

I feel like I'm tap-dancing around the solution

New Main Posts

5:27 PM

Q: Find the nearest neighbor and return its original array value

I have 2-d array value X = [[1,1],[1,2],[1,3],[1,4],[1,5],[2,1],[2,2],[2,4],[2,5],[3,1],[3,2],[3,5],[4,1],[4,4],[4,5],[5,1],[5,2],[5,3],[5,4],[5,5]] y = [[2,3],[3,3],[3,4],[4,2],[4,3]] Calculate the nearest neighbors of every y value to X value, and then return its array value. Example, y[0]'...

code-challenge array-manipulation python

John Dvorak

@Anush that would allow you to recognize triangle-free graphs in linear time, so no.

Anush

@JohnDvorak interesting! You mean add one edge at a time of the graph each time asking if it has a triangle

at the end you have taken O(m) time where m is the number of edges

which is too fast?

John Dvorak

yes

Anush

well that's a very nice answer. Thank you!

so you must take at least m^0.41 time per edge at the least it seems

John Dvorak

If your graph is given as an adjacency list, your best bet is to use a set intersection algorithm. You might get some pretty good runtime if you use binary tree sets and you're lucky on the graph labeling.

with the straightforward implementation you'd expect O(m * avg degree) = O(m * m/n)

Rick

5:42 PM

f is the function that maps between two groups, such that it preserves the structure in each group. So if our sets are A and B our function maps
A -> B
Such that * is an operation of the two groups (in this case a single swap between any two characters from our original string ).
Our anagram "ABC" will have a bipartite graph where the eccentricity and radius of our central vertex ABC is equal to one,
and the possibility space is the periphery of vertexes consisting of {ACB, CBA, BAC} equal to a diameter/eccentricity of two.

So we can say if we have a permutation of our anagram
{ABC, ACB, BAC, BCA, CAB, CBA }
we know that our peripheral vertices will form an injective non-surjective with the periphery of our bipartite graph
{ACB CBA BAC}. If we continue forming bipartite graphs from the periphery we would generate a permutation graph which would include the entire set of permutation. If however, we were not interested in the entire set of possibilities, but instead the number of groups in set { ACB, CBA, BAC} we would have only taken the minimum number of steps in the permutation graph from any one of the vert…

1 hour later…