Also vectorizing?

@HyperNeutrino Yes

Okay.

So the it's { a[1] OR (b[1] AND (1 in a)), etc. }.

@HyperNeutrino Correct.

So at an index i, the value is truthy if:

> a[1]

> b[1] and 1 in a

well that was obvious

@HyperNeutrino Yes. And Yes it was.

I don't think this can be simplified, but I'm not sure.

In APL: a∨b∧∨/a

Are you sure APL's not a golfing language...

@HyperNeutrino Absolutly. Proof: Need two symbols to ask if any of a is truthy.

Sure.

Wait hold on, 1 and 0 are booleans; this isn't all integers?

@HyperNeutrino What? Booleans are 1 and 0, which are integers, in APL.

a and b are Boolean lists, i.e. lists of ones and zeros.

Ohhhh

So first of all, if a is all false then the end result will be all false.

Otherwise, the end result will just be a OR b

so it's any(a) OR (a OR b)

@HyperNeutrino No. Because then any true b's will pass through despite all-false a.

I meant any(a) AND (a OR b)

Except any is a single value...

Nope, won't be any simpler.

@HyperNeutrino That's fine, because a OR b will be a list, so the single any(a) will vectorise.

Right.

So no short-circuiting?

@HyperNeutrino What?

Like, a AND b will still evaluate b even if a is false?

@HyperNeutrino In APL you mean?

Yes.

How does K order function arguments to functions?

@Adám send me the list, I'll see if I can cover some of them

@HyperNeutrino Well, firstly, you don't get to a until b is evaluated because APL functions associate right. I guess ∧ could pass 0 right away without looking at its the other argument, as soon as it sees that the first one has 0, but Booleans are outsourced to the processor, so I don't think we worry about it.

@Uriel How? Can you email adam@ ?

omg my computer just randomly reset

@ZacharyT I'm not sure I understand.

Oh it's right to left? Interesting. But yeah, okay, then that works.

rip my 2+ hour FTL game

FTL? What's that?

@Adám Sorry, it should say how does K handle

@HyperNeutrino If APL did have a single char 1∊, say $, then it could be written tacitly as ∨∧∘$ taking a as right argument and b as left argument.

Interesting.

@HyperNeutrino But as it stands, it would be ∨∧∘(∧/)

'@Mendeleev, what is FTL?

@ZacharyT IIRC, f[] means the function itself (i.e. don't apply it).

@ZacharyT faster than light (travel)

@ZacharyT faster than light

also a game with spaceships and ftl travel

Ninja'd

@ZacharyT ftlgame.com

No. I don't want to play it.

Why not?

It's awesome

0/10 advertising :P /s

So, does /suffixing a /s fix everything?

no /s

So, yes?

yes /s

Stop hyper contradicting yourself.

wrong room

Hence the cross.

Why is "hyper" even in that message

Meme-like-quantity. chat.stackexchange.com/rooms/61333/…

Why does that even exist ಠ_ಠ

I dunno.

I feel stupid today. Just can't think right.

Hooray for unreadable golfed APL:

{~'.''`+-|'∊⍨m←2 2⌷⍵:m⋄⊃(1+2⊥x∨(m∊¨v,h,h,v)∧∨/x←((9⍴0 1)/,⍵)∊¨∊¨⌽(↓(4⍴2)⊤⌽⍳15)/¨⊂c)⊃m,⌽c←'┼┴┤┘├└',v,v,'┬',h,'┐',h,'┌',⊃,/h v←⊂¨'─-∊~#∇+→⊖' '│|↓⌽'}⌺3 3⍣≡

:o

What on earth does that do??

│| oh god no.

Actually, for a PPCG challenge, I can golf it some more.

// Poll:

while (true) {
    // foo
}

//or

while (true)
{
    //foo
}

while (true)
     {
  // foo
     }

@Phoenix first one 10/10

Yes

@HyperNeutrino No

@Phoenix First one.

for(;;)/*foo*/;

But really, first one.

while (
true  )
      {  // foo
         // bar     }

@Mendeleev What monstrosity is that

You're only allowed to select a brace style other than the two listed if you can show actual code you've written using that style for non-PPCG purposes.

foo⍣{0}

First one IMO.

while
(
true
)
{
// foo
}

:38466181 Perfect Programming Puzzles and Code Golf

So nothing?

{∇foo}

while             (
  true            ){
    something     (
      param1      ,
      param2      );
    somethingelse ();

@HyperNeutrino LOL

foo ⋄ →⎕LC

@HyperNeutrino Today on TNB: HyperNeutrino's brainchildren of horrendous code styles that someone probably uses in production somewhere

@HyperNeutrino RHB users will be shot on sight

@Phoenix I guess it's a shame you can't see me :D

@HyperNeutrino This one is good for those that only like whitespace-determined-blocks languages, but are forced to use a bracy language.

@Phoenix RHB?

Right Hand Bracket

Right-Hand Brace actually

@HyperNeutrino Li-ar

We have a challenge about converting sane code to RHB style

@StepHen That's my GitHub >.< Not me

@HyperNeutrino XD

@HyperNeutrino ninjad

What is happening...

@Adám ^^^^

I suspect that Zachary is the star spammer

I'm just gonna say it

What's funny is how you people bring that message up, yes it's me.

Srsly. Who starred that.

Not me, and certainly not you at least.

did he just admit to starspamming?

Yes. I was just testing a feed @ chat.stackexchange.com/rooms/61277/tnb-stars

You could have asked me to link Sandbox into it too >.<

I tested it last night using Sandbox already >.<

@ThatREDACTEDGuy have you been in this hellhole of a chat before?

@ZacharyT how dare you

@ZacharyT You're too kind

I'm going to go on a limb here and say that there was a flag.

Actually no, Redacted guy doesn't seem to have enough rep to be summoned

Guys, guys, relax! Someone, quick, a CMC please!

@Phoenix 1.4k on AskUbuntu

You need 10k to be pinged by flags

@ZacharyT If I can only be here if I've been here before, then obviously no one can be here, at all.

@Adám cmc: answer a question in someone elses esolang, that isn't a super trivial question

Oh. You were talking about the summoning by flags.

But no, never been here before. Someone flagged a message and I came to see what it was about.

@Adám CMC: Remove every other character in a string.

@DestructibleLemon Lots of Jelly answers out there.

@ThatREDACTEDGuy Okay, run.

(Prolly a dupe ¯\_(ツ)_/¯)

Too easy.

m2

Jelly, 2 bytes. Done.

Keeps the first element and then every other element.

Wait how does @ThatREDACTEDGuy Get notified by chatflags?

@ZacharyT Nah, too lazy to run, I'd rather have ice cream. But I ride my bike once each too months sometimes.

'1234' => '24' or '13'?

@HyperNeutrino I... know people.

lol

This guy seems like a personality.

@Phoenix APL: ⊢(/⍨)0 1⍴⍨≢

Try it online!

@HyperNeutrino we had some fun with my solution in this chat btw and now the solution is down to 429 bytes (and completely incomprehensible)

@ZacharyT Well I was trying not to say but actually I am [REDACTED]

@CensoredUsername Yup. And almost impossible to outgolf :(

if there's one thing I've learned from this it's that there's always a way to improve it

I'm just too stupid to see it

Yup :P

My rep is great. Exactly 6666 :D

It would appear to be 8013

That's network rep.

I'm actually not sure if this answer would be larger or smaller in python2

Because of SO.

cause need to revert some inlining due to the print statement, but you can tabconvert some indentation to decrease bytes there

CMC: Given a list, determine if it is a + b × n

@Adám Please elaborate.

@ZacharyT E.g. 10 13 16 19 or 5 5 5 5 5 5 or 7 5 3 1 -1 -3, but not 1 2 3 5 or 10 20 29.

So IE in Jelly?

check if the delta is always the same?

@DestructibleLemon Yes.

@HyperNeutrino >.< IE, disgusting

@HyperNeutrino Dunno. what is I and what is E?

I is compute increments (delta) and E is all-equal. So yes.

@ZacharyT ಠ_ಠ

@HyperNeutrino And FF doesn't work?

...

IQL=1 works too if you hate IE so much.

Flatten flatten. I guess your jokes fell ... flat

:P

I've got a legit answer there too.

Should I enlist you into my team of bad pun makers?

@ZacharyT :38466668 Nice ∊

That one didn't make sense.

∊ is called enlist, right?

@HyperNeutrino ∊ is enlist which is flatten.

Oh.

Also @cairdcoinheringaahing Congrats on crossing 2k rep! :P

@ZacharyT Missed opportunity: Should I enlist you to become a member of my team of bad pun makers?

Some opportunities are best left missed. ಠ_ಠ

Let's stop before this gets taken into trash.

@ZacharyT Missed opportunity: Let's drop this before this gets taken too far and our messages go to trash. Get it?

there shouldn't be this many puns on the starboard

CMC: Figure out how I accidentally generated this sequence, and golf it

anyone want my FTL modpack?

OK, this is too much even for me... so let's stop. This will proabably get nuked.

@StepHen Looks like every time the modulus is below a certain value, you substitute with 2.

Game looks like this:

@Adám Uh maybe, but that's not how I generated it

@SocraticPhoenix, here 'cause of a flag?

@Adám I was working exclusively with primes

@ZacharyT APL puns

@HyperNeutrino IQṖṆ 4 bytes :p

@ZacharyT what flag?

Never mind then.

@LeakyNun sure :P

@Adám The pseudo code that generated it was next prime after previous - next prime after n + next prime after previous

I was gonna ask if anyone knew how to get a language on TIO... the next one I'm creating is meant to be "my best one yet" (it won't be, but still, I can't develop web stuff and TIO is used nearly universally here_

@StepHen oh, primes... I never thought about primes

Link to your language?

@SocraticPhoenix you ping dennis for it

doesn't exist yet xD

@SocraticPhoenix If your language can run on command line Fedora and doesn't need network access, just ask Dennis nicely: chat.stackexchange.com/rooms/44255/talk-tryitonline-net

@SocraticPhoenix also you need to give a hello world or something

@Adám How do you get JS interpreters up? :P

@StepHen It already has Babel Node and Node.js

@Adám No, interpreters written in JS (since they don't run on command line AFAIK)

@SocraticPhoenix Why are you worried about getting it on TIO if it doesn't exist yet?

@ZacharyT planning ahead :)

@Adám it'll be a Java jar

My life is finally complete: chat.stackexchange.com/rooms/61277/tnb-stars

@StepHen If the interpreter is just a JS script, I'm sure it can fed to the existing JS on TIO.

@Adám Can it be sandboxed and whatnot then though?

@StepHen Everything on TIO is sandboxed.

@Adám OH I get what you mean mb

CMC: Determine if a given list can be described as a + b × n + c × n²

@Adám so IIE?

I'll get this out of the way for cubic functions: IIIE

I'm out, ping me if there are any more APL puns (or apple puns)

CMC: Determine if a given list can be described as a + b × sin n

@Adám lolno.

@ZacharyT Did you read all those on the linked page?

I hate floats with a passion

Then program B.

B-cause I'm out of here

Now, Alt+F4

1,2,2,3,3,1,1,1,2,2,2,3,1,2,3,3,1,1,2,2

@Adám What's the domain of a and b? Will the list start with n = 0?

@Dennis a and b are any real numbers, and no, n start with any integer.

@Dennis It was mostly a joke though.

I say it's fast impossible

Yeah, I have to agree with lolno on that one.

and Dennis understood me :p

@Dennis ⍨

@Dennis does TIO have support for custom character encodings? Or is it all SBPC?

TIO uses UTF-8 internally, with very few exceptions.

I mean for the byte counting

Right. There's currently UTF-8, SBCS, and xxd. Unless it's very complicated, others could be added though.

@Dennis xxd?

Hexdumps

It is very complicated... it recognizes language constructs like string & character literals... xD

Could provided a -count flag though... Just wondering really, language is currently in the works & residing on a hard drive which appears to be corrupted xD

@Dennis Let's say NARS APL somehow could run on TIO, could you have 2BCS?

UTF-16?

@SocraticPhoenix If you provide a byte counter in JavaScript, I can add it.

@Dennis while you're here, if I want to get a language written in vanilla JS onto TIO, how should I make the output work? Since I can't really (AFAIK) write to STDOUT

@Dennis guess ive got to learn JavaScript, but thanks for the info :)

@StepHen JavaScript is perfectly capable of this. Node writes to STDOUT when you use console.log.

@Dennis Yeah.

@Adám Since JavaScript uses UTF-16 internally, that's even easier than UTF-8.

@Dennis same with console.error (to STDERR)? Cool. Thanks :)

Yes.

@Dennis OK.

@Dennis No modals (alert), right?

No, alert doesn't exist in Node.

;    for (int y = 0; y < 11; y++)
;  {
;  for (int x = 0; x < 10; x++)
;{
;System.out.println(x)
;System.err.println(x)
;}
;  }

Reverse Indentation Brackets :D

See starboard for my opinion

lol

well anyway gtg now, have fun o/

Survey: best syntax for variable declarations?

I'm planning out a programming language.

x is 3

@PhiNotPi Golfing or no?

um, how about #asdas# sets the one variable to "asdas"?

@StepHen "normal"

@PhiNotPi you're looking for something other than type name = val or name = val?

One of the other popular options is name: type = val which is used in Scala and some others.

Also Cheddar/Eiffel/Pascal uses that.

@PhiNotPi you going to allow declarations without a type or no?

obviously, you only declare the variable, and then you have variable changing operations

var x; x+=10

@PhiNotPi if you can declare with or without types type: name = val might make some sense

And I can see the advantage of that second option types get complicated.

and then drop the type:

maybe something like name(type) = val if you aren't using parens in the standard way

Thanks for the input, I think I'm just gonna stick to type name = val where type could be replaced with var if there's not any specific type involved.

I'm literally going down a list of syntax features and picking what I like: rigaux.org/language-study/syntax-across-languages.html

add a max operator instead of a max function

what's the difference?

max(a,b) vs a~b

@DestructibleLemon I think bit operators are usually more used than max

yup. but do it anyway

I'm trying to decide to what extent I should lean towards English words vs. symbols.

Example: for x in y vs for x : y

symbols when an english word would make no sense, and also when it is very obvious what it is

@PhiNotPi former unless golf or something like bash/perl/command line lang

Anyone else remember the flash game "Run 2"

yes

I used to play it ALL THE TIME in 6th grade

Never got past the 24th (I think?) level

CMC:What function generates this sequence: 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 1 0

(more terms available upon request)

@EinkornEnchanter what does your new name mean?

Einkorn is a type of wheat, enchanter is a type of wizard

CMC: Figure out what the beeps here mean

@Mendeleev probably something about the game

@DestructibleLemon ffs

I've already lost like 5 times today

you did this to me

the only way not to lose the game is to constantly think about it

Not true

That way, you're always losing

or die

@Mendeleev no, because you can only lose after you start playing

@DestructibleLemon You're always playing from the moment you learn about it

@Mendeleev you're not very good at this game

Right

@DestructibleLemon this

"FiNGERTIP ROTATOR"

@EinkornEnchanter a whole bunch

is it thue morse?

@DestructibleLemon 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0

There's 1000 terms

@DestructibleLemon No it is not

Or maybe it is. Hm

hmmmm indeed

alternate definition fun

It is the number of 1s in the binary representation mod 2

huh?

Nah, it's definitely a big zig zaggy pattern..

binary representation of n?

You take the binary representation of x, count the 1s and mod 2

Why this seems to be exactly the same as the thue morse I do not know

It lists it on the wikipedia page but I can't find a proof anywhere.

magic

In Thue-Morse via copying in inverting, f(n) is the opposite of f(n - largest power of 2 less than n), by definition.

Ah, I see

f(n) = 1 xor f(n - largest power of 2 less than n) is also true for the other definition, because subtracting that power of 2 flips 1 bit.

Patriot returned the wrong SSD in an RMA...

I had a Blaze ssd