The Nineteenth Byte

7:00 PM

0

How long is your program? As this site is all about making code as short as possible, you should write a program that tells you exactly how long the program is, in bytes, in your language's native encoding. There is just one catch. Adding a no-op to the code should change the output. Therefore,...

MD XF

Speaking of sandbox, is this ready to post?

Adám

@Downgoat Dyalog APL, 100 bytes (Europe):

⎕CY'tube'⋄7160⌶' *//.*' ' +∊? ?'⎕R''{⍵/⍨' '=↑¨⍵}r(≠⊂⊢)∊(r←2⊃⎕TC),¨⍎∘'source'¨l/⍨'lpmu'∘(∨/∊)¨l←⎕NL-9

Alex K Chen

#include <stdio.h>

int main()
{
prinf("hello world");
}

Why the above code keeps showing up error ?

Erik the Outgolfer

> prinf

Dennis

@LeakyNun Both return a shallow copy of a list argument and both require a to be iterable. If there are differences, I can't find them.

MD XF

7:07 PM

flag->spam/offensive

Leaky Nun

@Dennis thanks

Alex K Chen

@EriktheOutgolfer You are alive !

Leaky Nun

talking about shallow copy, your x uses shallow copy, which causes problems @Dennis

Alex K Chen

Done, @MDXF

Dennis

@LeakyNun My x?

Leaky Nun

7:11 PM

@Dennis Jelly

Dennis

There are a lot of x's. You'll have to be more specific.

Anonymous

@LeakyNun 1) It really should be called "middle". 2) It wasn't meant to sort the elements. 3) Not everything that can be put in a list has a defined sort order, so sorting will fail on basically every heterogenous list.

Erik the Outgolfer

yeah, there are XẊxẋ...

Leaky Nun

I'm talking about x

Adám

@Downgoat Meh, Wolfram Language europe stations → (data not available) and us stations only gives 241 names. My code gives 2271 stations.

Leaky Nun

7:13 PM

But ẋ is more apparent in the code @Dennis :

	'ẋ': attrdict(
		arity = 2,
		rdepth = 0,
		call = lambda x, y: iterable(x) * int(y)

Anonymous

@LeakyNun List comprehensions are usually faster.

Leaky Nun

the iterable(x) is a shallow copy

Helka Homba

Ia Amazon down for anyone else? I keep getting dog images

Anonymous

@HelkaHomba Nope

Dennis

@LeakyNun It is not. And if it were, why would that be a problem?

Leaky Nun

7:15 PM

@Mego I beg to differ

Anonymous

Also isup.me/site is an easy way to check

Leaky Nun

@Dennis I mean, it's a shallow copy after you use * int(y)

because it causes problem when using mold

DJMcMayhem

@HelkaHomba Same here

Anonymous

@LeakyNun usually != always

Leaky Nun

@Mego how can list comprehension be faster than a built-in method?

please change a so that the list comprehension is faster

Dennis

7:16 PM

@LeakyNun Instead of feeding me information piece by piece, could you simply tell me what the problem is?

Anonymous

@LeakyNun Depends on the type of a I think

Leaky Nun

@Dennis ok, a second

@Mego just give me an example

@Dennis here

Helka Homba

@Mego I get 503 error for some things but not all

Leaky Nun

@Dennis compare this

Anonymous

@LeakyNun You're going to have to wait until I am not busy so I can find the SO post that detailed how comprehensions are faster in cases. Alternatively, you could look for it yourself.

Leaky Nun

7:21 PM

> The list comprehension executes the loop in Python bytecode, just like a regular for loop.

The list() call iterates entirely in C code, which is far faster.

13

A: Python list() vs list comprehension building speed

The list comprehension executes the loop in Python bytecode, just like a regular for loop. The list() call iterates entirely in C code, which is far faster. The bytecode for the list comprehension looks like this: >>> import dis >>> dis.dis(compile("[x for x in xrange(1000000)]", '<stdin>', 'e...

@Mego

Anonymous

I guess I had it backwards

Dennis

@LeakyNun Oh, so the problem is that it's not a deep copy. Not sure if I should fix that in the repeat or the mold atom.

Leaky Nun

@Dennis in the repeat atom, I would say

like, obviously mold isn't the only atom uncompatible with shallow copies

start, stop, step = (b+[None]*3)[:3]

what kind of code is this

Dennis

Looks like Python.

Leaky Nun

I know

I mean, what on the world is this style of code, meaning that I don't like this style

quartata

7:28 PM

Hey @Downgoat, remember how I complained about how I somehow had more Node JS modules than CPAN modules even though I never use Node and I use Perl every day, then I nuked my node_modules directory? Well six months later:

$ ls node_modules | wc -l
571

I don't even know how this happened, it's like an infection

That's twice as many from last time:

Feb 24 at 16:49, by quartata

$ ls -l node_modules/ | wc -l
267

I think it's because I installed Yeoman?

MD XF

Solution: Don't use Node

quartata

I don't

MD XF

It's probably the solution to all programming problems IMO

Downgoat

@quartata sounds likely

quartata

I just wanted Yeoman so I didn't need VS to make an empty ASP.NET project

New Main Posts

7:30 PM

0

Q: Trivial Brainf**k Substitution Interpreter

Brainf**k is the most famous esoteric programming language and is the inspiration for hundreds of other esoteric languages. In fact, there are quite a few languages that are so heavily based off of Brainf**k that the only difference is the characters used. Your challenge is to interpret one of th...

Downgoat

Why are you not using pug

quartata

?

$ pip list | wc -l
DEPRECATION: The default format will switch to columns in the future. You can use --format=(legacy|columns) (or define a format=(legacy|columns) in your pip.conf under the [list] section) to disable this warning.
100
$

Downgoat

@quartata why are you make app in .NET and not Node

quartata

@Downgoat Because I don't like Node?

totallyhuman

who does

Leaky Nun

7:32 PM

[x for x in itertools.islice(a,b,b+1)][0]

Downgoat

But... but... you can if you install babel

quartata

That's not the point at any rate

Leaky Nun

Can I just replace ^ with list(a)[b]?

quartata

@Downgoat Nah, Node as a web framework by itself is way too minimalist.

Downgoat

@totallyhuman idk 3M people?

@quartata opls it's more bloated than rails stack

quartata

7:34 PM

Not really. The one time I tried it basically felt like working with sockets

for example

Downgoat

@quartata see this is why project have 593 dependencies

Ono wat ur using createServer not express

quartata

Looks like the runner up in "most packages" is Ruby (which I also don't use that much):

$ gem list | wc -l
114

$ perldoc perllocal | grep "installed into" | wc -l
113

for CPAN

@Downgoat Express isn't part of Node, right?

Downgoat

It's a node.js library it's ubiquitous for all servers in node

quartata

Eh, whatever

MD XF

Okay what on earth

There are so many differences I don't even know where to start

Alex K Chen

7:41 PM

Cannot open output file [redacted]. permission denied - ld.exe; Why this is happening ?

quartata

@MDXF Nah, it's basically the same. Just need to replace the characters

Alex K Chen

#include <stdio.h>

main()
{
double c;

for (c=0; getchar() != EOF; ++c)
;
printf("%.0f",c);

}

Here.

Poke

@AlexKChen is the output file an exe

and is it running

Leaky Nun

@Mego you keep talking about "this"

I don't know which line you're referring to

Alex K Chen

@Poke I have no idea what you're talking about - I'm just saying while running that code; I'm getting that error message.

Oh OK now got it.

You have to kill it from task manager.

Poke

7:53 PM

My guess is that it starts running when you run your program and you're either not waiting for the program to complete or terminating it in such a way that it leaves that file open. You can either continue to kill it from task manager or there should be a stop button of some sort in your ide that you can use

Jonathan Allan

Can some experienced users take a look, I am perfectly fine with having made a mistake. I don't see reopen votes flooding in but MD XF seems quite certain I am wrong...

0

Q: Trivial Brainf**k Substitution Interpreter

Brainf**k is the most famous esoteric programming language and is the inspiration for hundreds of other esoteric languages. In fact, there are quite a few languages that are so heavily based off of Brainf**k that the only difference is the characters used. Your challenge is to interpret one of th...

code-golf interpreter brainfuck substitution

@MDXF If I have, please do accept my apologies!

MD XF

If it, in fact, is a dupe, accept mine for getting angry. I don't appreciate wasting my time but it was not your fault :P

Stephen S

@MDXF IMO substituting but not interpreting isn't a dupe, but the hardest part of the challenge currently is interpreting

MD XF

@StephenS So I should change it to be "TrivialBrainf**kSubstitution Transpiler" or something along those lines?

Stephen S

@MDXF don't change it just because of me (and wait for more senior opinions), but if I was making the challenge, it would just be "Input the 8 replacements and the source, and output the BF code" (so yes)

MD XF

8:00 PM

Yeah that might be a better challenge regardless of duplicates

@JonathanAllan While I can see your reasoning for it not adding interest to the "Interpret Brainf**k" challenge, and I agree that I should modify my challenge, I stand firm that it is not a duplicate. Yes, the differences don't change much, but there are still enough differences that it ~~isn't a dupe~~ doesn't seem like a dupe to me. Either way I'll be fixing it.

New Sandboxed Posts

0

A: Sandbox for Proposed Challenges

Diagonal Alphabet code-golf kolmogorov-complexity Given no input, your task is to generate the following: a b c d e f g h i j k l m n o p q r...

mınxomaτ

Native unix programming in C# feels very similar to summoning multiple demons at once.

6

totallyhuman

why was the "must be data and code in a quine" definition chosen?

i don't see the reason

quartata

@mınxomaτ And yet it was the language of choice for GNOME apps for quite a long time. It boggles the mind.

Stephen S

@totallyhuman because languages that print their own source make really boring quines? At least compared to languages with boilerplate and whatnot

@totallyhuman and it was chosen my community consensus, remember

Kritixi Lithos

8:12 PM

May 8 at 13:12, by Leaky Nun

CMC (credits to Kritixi Lithos): Output this:

btw

totallyhuman

print'this:'

mınxomaτ

@quartata I mean, it's actually pretty painless. I've ported a system that messes with netlink, namespaces, cgroups et al to C# and apart from having to use Syscall. before every ... syscall, it has been entirely painless.

Stephen S

@KritixiLithos I was unaware of that (deep in a chatroom I'm not in) - what happens next?

mınxomaτ

Much more productive than my first attempts at doing the same thing with Rust.

Kritixi Lithos

@StephenS it's just a CMC, don't fret, you can still post your challenge :)

Adám

8:21 PM

No competition on JSON metro stations?

Anonymous

@LeakyNun Those are line comments. Look at the commit to see them with context.

Adám

8:47 PM

Would it be too big a challenge to take a klc file and generate a keyboard map?

DJMcMayhem

CMC: Given a string 's', find the length of the longest run of 'a's in s.

"Hello world" --> 0
"aaaa" --> 4
"abcdef" --> 1
"a aa a aaa a aaaa a aa" --> 4

MD XF

CMC: Given a string s and a character a, find the longest run of as in s.

I kinda want to post mine now

Also, question: Are there any esoteric languages that use only 12 commands and don't get too large?

DJMcMayhem

@MDXF That's almost exactly what I just said

MD XF

commands like Brainf**k's <, or ., etc. Not commands like Bash commands.

@DJMcMayhem But a bit more complicated

e.g. "Hello world",'l' --> 2

"aaaa",'a' --> 4

DJMcMayhem

But you posted essentially the exact same CMC seconds after me

MD XF

8:50 PM

@DJMcMayhem It was based on yours, yes

I saw yours and thought "oh that could be a good challenge for main with one simple modification" (IMO)

Adám

9:07 PM

@DJMcMayhem The longest run in "hello world" is not 0.

DJMcMayhem

The longest run of the letter 'a'

Adám

@DJMcMayhem APL, 10 bytes: ⌈/'a+'⎕S 1

@DJMcMayhem There are no a runs, so none have a length of 0.

Jan Dvorak

Retina, 16 bytes. Try it online!

Probably very inefficient

DJMcMayhem

15 bytes in V: Try it online!

Jan Dvorak

Ugh. My second attempt is even worse, [18 bytes](Try it online!)

MD XF

9:20 PM

@JanDvorak How did you bork that formatting?

DJMcMayhem

I'm guessing it's [18 bytes]([Try it online](link))

Jan Dvorak

I tried to put a link markdown inside a link markdown as if the former was a URL

DJMcMayhem

chat.stackexchange.com/messages/37955307/history

MD XF

Oh nice

New Sandboxed Posts

0

A: Sandbox for Proposed Challenges

Me, Me, Me! Your code is clearly superior to all other code. In fact , your code is so great that it prints itself when the opportunity arises (but not when any other, inferior code is around.) Task Write a program that takes a string as input. If the string is equal to your source code, then ...

New Sandboxed Posts

10:38 PM

0

A: Sandbox for Proposed Challenges

Fence Matrix code-golf Given a positive integer n, output the 2n+1 x 2n+1 "fence"-matrix 0 1 0 1 ... 0 1 2 1 2 ... 1 0 1 0 1 ... 0 1 2 1 2 ... 1 ⋮ ⋮ ⋮ ⋮ ⋮ 0 1 0 1 ... 0 Examples n = 1 0 1 0 1 2 1 0 1 0 n = 2 0 1 0 1 0 1 2 1 2 1 0 1 ...

New Main Posts

11:01 PM

0

Q: Math matrix in 2D array

I am coding for a few months now and I have just finished a project that brought me face to face with a couple of interesting challenges. One of them demanded the construction of a math matrix out of two given arrays, and its subsequent "transformation" in a 2D array. I came up with the followin...

array-manipulation javascript matrix

New Sandboxed Posts

11:15 PM

0

A: Sandbox for Proposed Challenges

Lazy Click and Drag code-golf internet image-processing Your task is to write a program or function that, given two nonzero integers x and y, returns a truthy value if the image at coordinates x east and y north of xkcd's click and drag comic is mostly white and a falsey value otherwise. Spe...

Downgoat

11:35 PM

@DJMcMayhem cheddar: @.sort((>)).map(@.length).max

New Main Posts

0

Q: Rooting for Trees With the Right Nodes

Background A rooted tree is an acyclic graph such that there is exactly one path from one node, called the root, to each other node. A node v is called the parent of another node u if and only if the path from the root to u goes through v and there is an edge connecting u and v. If node v is the...

code-golf graph-theory tree-traversal

Luis Mendo

@DJMcMayhem 10 bytes: 'a+'XXc&n&

Or Y'w97=)X>s

Transcript for