The Nineteenth Byte

1:52 AM

> graph
ReferenceError: graph is not defined
    at repl:1:1
    at realRunInThisContextScript (vm.js:22:35)
    at sigintHandlersWrap (vm.js:98:12)
    at ContextifyScript.Script.runInThisContext (vm.js:24:12)
    at REPLServer.defaultEval (repl.js:313:29)
    at bound (domain.js:280:14)
    at REPLServer.runBound [as eval] (domain.js:293:12)
    at REPLServer.onLine (repl.js:513:10)
    at emitOne (events.js:101:20)
    at REPLServer.emit (events.js:188:7)
> let graph = require('./LLIR/ExecutionGraph/ExecutionGraph');

dammit javascript

quartata

mfw interfacing with LLVM from JS

has science gone too far

anyways I'm guessing graph was declared but is undefined

mfw?

@quartata there is no actual LLVM interface yet >_< this is just JS

2:14 AM

@LuisMendo I think that's among the highest praises I've seen yet of our accomplishment. :P

ASCII-only

4:22 AM

@Downgoat my face when

@ASCII-only don’t you need independent clause before conjunction

ASCII-only

@Downgoat yes but since when was internet English valid English

@Downgoat also where is conjunction

4:39 AM

@ASCII-only but what is object of sentence though. His face is JS REPL? I am very confuse

ASCII-only

5:10 AM

@Downgoat I always think of it as a caption

Like <insert meme here> mfw ...

7:47 AM

Fireflame tears me apart, then Jonathan outgolfs Fireflame, then Dennis comes in and smashes everything

miles

9:12 AM

CMC: Given n, list all the numbers that can be formed by removing k consecutive digits. For example, n = 1234567 and k = 3 gives [4567, 1567, 1267, 1237, 1234]

Pavel

n=>k=>{int i=0,j=n.Length,k=n-k;for(;i<n.Length;)yield return n.Substring(i,k+i++)}

@miles SOGL, 17 bytes

10:30 AM

@miles Pyth, 17 bytes

Erik the Outgolfer

10:53 AM

@miles are you sure this isn't too biased towards jelly? ;p

Erik the Outgolfer

11:28 AM

because it's just DV⁴N¤Ƥ in jelly

Zgarb

12:00 PM

@miles Husk, 7 bytes with string input/output and not checking leading zeros or anything.

Numeric input/output is +3 bytes.

Q: How could I clarify my question?

12:42 PM

@Zgarb That solution is... "hot". I'll see myself out :P

New Meta Posts

1:10 PM

0

I've met a quite interesting problem and I thought it would be a nice task also on the code golf. Unfortunately, it is currently being held as unclear. However, the problem is for me very simple and clear. To my best knowledge, I reacted and made clear all reactions in comments, and by improvin...

1:39 PM

CMC: Given an integer N, return its prime factors deduplicated, summed and doubled.

16 -> [2, 2, 2, 2] -> [2] -> 2 -> 4

26 -> [13, 2] -> [13, 2] -> 15 -> 30

Pyth, 4 bytes

05AB1E, 3 bytes: fOx

Heh, a fox program

Husk, 4 bytes (:'-( I'm hogging my own CMC)

@Mr.Xcoder SOGL, 12 bytes

@dzaima No primefac built-in?

Jelly, 5. Probably a sneaky 4 out there

@Mr.Xcoder They are documentated, but not implemented. Prime checking built-in kind of exists (there's a 1/2^1000 chance that it'll fail :p), but as it doesn't work online, didn't use it

@dzaima Java's isprobablyprime? >___>

@Mr.Xcoder yyep :D

1:53 PM

@dzaima I have never understood that. Does it have any advantage..?

I'm lazy :p

like, why does java even have such a pointless built-in?

@Mr.Xcoder BigInteger has an option to generate a gigantic (most likely) prime number on request which utilizes it

One day I was bored and looked though the source code of BigInteger :p

quartata

@Mr.Xcoder probablistic prime tests are fast and usually the only feasible kind of test for big numbers

2:18 PM

@Mr.Xcoder 2Deorstv, 3 bytes: ÙΣT

@Mr.Xcoder Unless there's a builtin for ÆfQ, 5 bytes is as short as possible

@cairdcoinheringaahing Yeah, Agreed.

@quartata I see.

5:05 PM

@ASCII-only okay having some problems with LLIR right now

we need to update a certain variable when another is update

but I dunno if would work

like a graph is created like:

let condition = instance.make.condition([]);
instance.main.body.setAtom(condition);

but condition's 'AtomicParent' (which is instance.main.body) needs to be update when the atom is added

not sure how to do

Also, how to connect exit nodes

I basically need pointer so we can do this.exitNode = &otherNode.exitNode

but JS don't have pointer :(

5:27 PM

What happens if you initialize a list, pass it into a function, and modify it inside the function? Does the original list change or stay the same?

original list changes. Arrays are passed by reference

So there are pointers!

@El'endiaStarman doesn't mean you can extract them and do arithmetic with them

5:50 PM

there's a new feature in Python 3.7

@orlp ?

new_dict = {**dict1, **dict2}

:O

you can unpack dictionaries inside dictionary literals

Ermagherd!

5:54 PM

@LeakyNun what this also means

is that we can use dictionary stuff inside recursive lambda functions

@El'endiaStarman fails to tell which accent you're imitating

for example to generate the dictionary {1: 1, 2: 2, 3: 3, ..., n: n}

f=lambda n:n and{**f(n-1),n:n}or{}

@LeakyNun I have no idea what accent that's imitating, if any.

@El'endiaStarman well the initial "er" should be brittish?

f=lambda n:n and{**f(n-1),n:n}or{}
lambda n:dict((i,i)for i in range(1,n+1))

(in this example lambda n:{i:i for i in range(1,n+1)} is shorter)

5:56 PM

lol

actually

it's NOT shorter

@LeakyNun Know Your Meme: Ermahgerd (Turns out I spelled it wrong too.)

:O

so even in my random example

it's better :D

@LeakyNun but the important part is that we can now update dictionaries in expressions

I'm sure there are some golfing applications here

I see

orthodonic retainer...

A: Sandbox for Proposed Challenges

6:09 PM

I mean, ertherdernerk rerterner

New Sandboxed Posts

0

Probably not included Introduction There is this theorem in probability that is called the inclusion-exclusion principle. It deals with different sets of events and it gives (among others) a way to calculate the probability that exactly one the the sets of events occurs. Because this codegolf i...

6:30 PM

@Mr.Xcoder Minkolang, 40 bytes: n(i2+$d%5&dz+$z($d%7&d1R:r1!0)xd1)z2*N.`

Lol

TIL Minkolang is a thing

I saw that CMC before church but didn't have time to finish it. :P

Hello everyone. I'm back from the Dyalog '17 User Meeting. I hope I managed to recruit a few new code golfers there.

@El'endiaStarman TIL you're a mod on Christianity.SE :D

Also, it was the first time I experienced a code golf tournament IRL, with real prizes.

6:33 PM

@Adám How was it?

@Mr.Xcoder Well, there were only two prizes, and I come in at a shared third place :-(

@Mr.Xcoder Also, stressful, but really fun and exciting.

does anyone logic here?

by logic i mean provability, model, etc.

@LeakyNun Aside from you, I don't think so.

:c

We could see the scores (but not the solutions) of the others, and since it was all in APL, if someone managed to get one character less, you knew it could be done, so you had to try to shorten yours too. The answers were checked in real time, and you could re-submit as much as you wanted.

6:36 PM

@Adám cool

@Adám How did you end up on the third place though?

@Mr.Xcoder Simple, I was out-golfed. Actually, there were nine holes, and I did very well on seven, but on the remaining two I was one of the worst.

@Adám Did marinus also participate?

@Mr.Xcoder Of course. Both in the tournament, and also in my code golf workshop. Appears the there are some very fierce APLers out there. One of our customers bought the codegolf.co.uk domain (they are based in England) and hosted the competition.

@Adám Cool :D

@Mr.Xcoder Funny that after the deadline, Gil managed to outgolf the winner.

6:42 PM

:O Wow

Too slow though

Yeah, it was so cool to actually golf together with PPCGers IRL.

I have never met a real PPCGer :'-(

by real I mean, *in person*

@Mr.Xcoder I was excited before first meeting Marinus. He was the first PPCGer I met IRL, AFAIK.

DJMcMayhem

It would be really funny to find out that someone you've met before is a PPCGer and you didn't know it

@DJMcMayhem Yeah lol

6:56 PM

@DJMcMayhem The winner of the Dyalog APL student competition turned out to be a PPCGer, but from before my time here.

DJMcMayhem

No way!

Who was it?

code-golf math code-challenge palindrome number string popularity-contest

Eelvex, Greece

4.1k 1 15 36

@Adám For real... LOL

A: Find the Serialized Integer

1

J, 26 bytes (>i:1:)([:+/\[:>.10^.1+i.) ((>i:1:)([:+/\[:>.10^.1+i.))"0 ] 5 11 12 1024 2000 20000 100000 1000000 4 9 10 377 702 5276 22221 185184

Jul 12

@Mr.Xcoder Look at his activity. He wasn't active after May '15, only to reappear at the competition time.

7:01 PM

@Adám I see

@Mr.Xcoder And he use to be a J golfer. Menwhile, he picked up APL (which he likes better, btw).

@ConorO'Brien do you know how to add a generator as a field like for (let item of myClass.generator)

I feel there should be a shorter way than:

class Node {
    *_parents() { ... }
    get parents() { return this._parents() }
}

hi music people here might be interested: github.com/alexander-liao/hack-the-north-2017

you need to input things as midi but there are some songs recorded in there already

@HyperNeutrino this is MIDI player?

It's MIDI in, autoharmonize, MIDI out

7:13 PM

O_o how is Java and JavaScript, Rhino?

?

github.com/alexander-liao/hack-the-north-2017/blob/master/… Is JavaScript but has Java functions etc.

JJS

It's like Jython but for Java -> JavaScript

If you want to test like Twinkle Twinkle Little Star or something like that you can clone it and go to hack-the-north and open a terminal in that directory and run

cat twinkletwinkle.json | bash recorder-conglomerate/harmnz.sh | python note-player/main.py | python delay/main.py 5 | jjs synthesizer/main.js

(we built everything as individual components so there are a ton of pipes lol)

mınxomaτ

That's ... unfortunate

We made some scripts to have fewer than 10 pipes in CLI though :P

twinkle twinkle is harmonized almost perfectly but unfortunately viva la vida is... subideal...

7:20 PM

@HyperNeutrino are you still developing it or is hackathon finished?

hackathon is done

I mean it technically finished at 9 but we had a few more commits to make sure our presentation didn't fail

CMC: output the following:

is this a cayley table for something

yes

bonus challenge for you :P

lol I'm not even sure how I guessed that :P

7:23 PM

@LeakyNun is there some pattern? I am missing

@HyperNeutrino Me neither but when you suggested it, I was like "oh yeah, good eye!".

@Downgoat x * y % 9

Ah :P

@Downgoat not much that would help you golf it

Oh I think I see what this is

@LeakyNun SOGL, 30 bytes

7:24 PM

@El'endiaStarman nah

@HyperNeutrino which group is it?

@El'endiaStarman no it's not symmetrical but multiplication is commutative

@LeakyNun I think D4

@HyperNeutrino correct

yay :P

@LeakyNun

“ÐdœḋĖ/£ƈ"ƭ¢;ṾżḋṭİẹƑY½Ṙ÷yT⁼kỵ6°RfṙĿø=⁴ṫ⁼ṃ{ṃƒṗ%\OC⁸ıṀƑỤ4 ḃƙX/Ɠ~Ṭ¿\ø½vMỌɗ£6Ċ»

(75 bytes)

The top left quarter block gave it away to me because it's all rotations of the other rows

7:25 PM

Wait, it's not symmetrical? [squints] ... D:

@Mr.Xcoder ಠ_ಠ

@El'endiaStarman second row reads 23416785 while second column reads 23418567

@El'endiaStarman too many digits, too confuzzling if you don't look at the digits very very carefully individually :P

@Mr.Xcoder try to compress it better

@LeakyNun No thanks, joke

7:26 PM

I wonder if an implementation of D4 would actually be shorter than some good compression scheme

@LeakyNun "慎俑뿰䀧ꃘ(ℏ鄮羱"::[].map(s=>s.charCodeAt())).join`\n`

@Downgoat I think that's an es7/8 proposal, but I'm not sure

@Downgoat Chinese @_@

@HyperNeutrino I leave that to you :P

:P

@Downgoat Now do it in Swift :DD

7:27 PM

I'm not sure how to efficiently in Jelly but I will try :P

inb4 GAP

math language?

right

@Mr.Xcoder "慎俑뿰䀧ꃘ(ℏ鄮羱".unicodeScalars.map(String.init).joined("\n")

I dunno if that would work, not 100% sure

@Downgoat Does that actually work

lol

7:29 PM

that should work I think

not sure about the String.init though

@Downgoat Can't you just do .map{String($0)}?

@Mr.Xcoder Then I'd need parens for the .joined("\n") though

meh

actually:

"慎俑뿰䀧ꃘ(ℏ鄮羱".unicodeScalars.map({"\($0)\n"}).joined()

I'm not sure if unicodeScalars is an array

@Downgoat It is

@Downgoat you'd need print though

7:33 PM

ok I tested in swift REPL this works: print("慎俑뿰䀧ꃘ(ℏ鄮羱".unicodeScalars.map({"\($0.value)\n"}).joined())

@Downgoat ಠ_ಠ Xcode says: Unprintable ASCII character found in source file.

@Downgoat Is that shorter than just printing a regular literal string?

@El'endiaStarman it is.

@El'endiaStarman only in chars lol. It's 7 bytes longer otherwise

@Downgoat Wait swift has """?

7:36 PM

only in swift 4

how did I miss that

Like:

huh apparently strings are now Collections

@Mr.Xcoder @_@

you're so funny

7:38 PM

@Downgoat in swift 4 they are

@ConorO'Brien who me?

yup :p

I'm glad the string.substring(string.startIndex, string.index(string.endIndex, offsetBy: -1)) BS is gone

@Downgoat it's not

stacked, 63 bytes: [lprec'\SoklbbnhJ\}(uc.]<^-;^4r3gd>gxx+'decompnum repr 8#<LF#`]; Try it online!

can't we do now like string[string.startIndex..<string.endIndex]

7:41 PM

@Downgoat oh yeah but it's not gone completely

TIL that [tag:**ಠ_ಠ**] used to work

@cairdcoinheringaahing ಠ_ಠ

@cairdcoinheringaahing How can that not work?! (ノ°Д°）ノ︵ ┻━┻

Pavel

ಠ_ಠ

@ATaco Chat Commands bug: foo /o_o yields fooಠ__ಠ

Notice the extra underscore and removed space