« first day (2006 days earlier)      last day (3132 days later) » 

12:04
@LegionMammal978 did you actually disable it
@MᴀʀsUʟᴛᴏʀ ​
Wow, Lua screw me
unpack was moved to table.unpack D:
@Katenkyo persist and resist
and do the new challenges
Especially my new challenges
@LeakyNun I'm doing X without Y
@LeakyNun I may do it later on :p
@Katenkyo Fais les miens permier :/
12:09
@LeakyNun Je fais ceux que je vois en premier :p
> miens permier
ಠ_ಠ
i think you mean
> Fais les miens en premier :/
@TùxCräftîñg ¿Por qué incluiste la "miens"?
¯\_(ツ)_/¯
return s..a..S..b..s..f(n-2,N)..s..c..S..d..s
@TùxCräftîñg thanks
12:10
@Katenkyo huh wat
look like a obscure lambda calculus esolang
Taht return statement
@TùxCräftîñg .. in Lua is string concatenation
@TùxCräftîñg That's a retun statement in lua, concatenating looooots of things
@Katenkyo recursion, hope you don't forget to add the spaces at the beginning and the end of each row
12:12
@LeakyNun I don't quite see what you mean?
@LeakyNun I haven't, but forgot to include newlines....
@flawr You want to find the sum of this
I suggested you do this by geometric series
Chat mini-challenge: Prove that ε₁ = ω^ε₁.
FANCY GREEK LETTERS NOOOO
@LegionMammal978 definitions please
12:14
@LeakyNun But how? I can only see that working if you sum over R, but not necessarily for s?
@LegionMammal978 What is epsilon_1 and omega?
return s..C(a)..S..C(b)..s..p..f(n-2,N)..s..C(c)..S..C(d)..s..p
if ε₁ = 1 and ω = 1 then it's true
63 chars for the return statement only xD
@Katenkyo Just post your solution, je te vais aider a le golfer
> je vais t'aider a la golfer
if more correct
12:16
@TùxCräftîñg oh, la réponse
@TùxCräftîñg "à" si l'on parle d'être correct
@LeakyNun Still some bugs, seems like it's modifying the value of S during the concatenation because of the recursion
too lazy to write à
and i think si l'on veut être correct is more correct
@Katenkyo because of your recursion? I thought it returns a string
What's your terminating condition?
@TùxCräftîñg I was trying to say "talk about"
@TùxCräftîñg si l'on veut être exacte is even more correct
exact is more correct
because in plural words are at male form
12:19
@TùxCräftîñg quoi?
@LeakyNun it does, but S have a certain value in the first half of this concatenation, and an other one in the last. terminating condition is n=1 which is when we print the center
le dix-neuvième byte en français
@TùxCräftîñg By the way, did you understand this?
but le dix-neuvième byte is 21 bytes long ;_;
12:20
U:\Katenkyo\Documents\lua\lua53.exe: golf.lua:4: stack overflow
stack traceback:
        golf.lua:4: in function 'f'
        golf.lua:4: in function 'f'
        golf.lua:4: in function 'f'
        golf.lua:4: in function 'f'
        golf.lua:4: in function 'f'
        golf.lua:4: in function 'f'
        golf.lua:4: in function 'f'
        golf.lua:4: in function 'f'
        golf.lua:4: in function 'f'
        golf.lua:4: in function 'f'
        ...
        golf.lua:4: in function 'f'
        golf.lua:4: in function 'f'
@Katenkyo juste poste ta solution entiere ici
@LeakyNun i can understand this
Who the hell flagged that
@TùxCräftîñg So what
@TùxCräftîñg nice
12:21
@flawr The Nineteenth Byte is exactly 19 bytes long
function f(n,N)
  N=N or n
  e=" "
  p="\n"
  s=e:rep(n/2-.5)
  S=e:rep(n-2)
  r=math.random
  C=s.char
  R={}
  for i=1,4
  do
    x=r(33,126)
    R[i]=x~=89 and x~=121 and x or r(33,88)
  end
  a,b,c,d=table.unpack(R)
  if n==1
  then
    return s..C(a)..p
  end
  return s..C(a)..S..C(b)..s..p..f(n-2,N)..s..C(c)..S..C(d)..s..p
end
@flawr Est-ce que faire quand je reçois à mon ordinateur
@zyabin101 wat
@TùxCräftîñg the french will never let the english tell them what to do
12:22
@TùxCräftîñg "Will do when I get to my computer"
Which isn't going to be sometime soon.
@zyabin101 C'est ce que je ferais lorsque je serais sur mon ordinateur?
pourkoi?
@zyabin101 It sounds like you're on your way to your computer
12:23
@flawr pourquoi
@TùxCräftîñg non
@MᴀʀsUʟᴛᴏʀ Nope, not yet.
@flawr why not?
@zyabin101 I know, it's just the wording
@TùxCräftîñg internet
12:24
@LeakyNun okay, I know where the last problem is, also the S is really modified by the recursion
I'm on phone.
Scope wrapping around itself is a thing I didn't know Oo
@Katenkyo problemes de n'utiliser pas variables locals
@Katenkyo all unlocaled variables are global
@LeakyNun No they aren't
they still are local
@Katenkyo koué
12:25
we use the keyword local to prevent overiding a global variable that uses this name
@Katenkyo can you prove this?
@Katenkyo 😮
@zyabin101 ee.m.o.j.i. aftwhudio;kjabhyukfldiq\jo;jfuhyqDLJ;IFA
GF
for instance, if you do string=function()print"you've been rekt"end, the global object string is redefined to a function
@TùxCräftîñg GF?
12:26
@Katenkyo exactement
JUST SPAMMED MY KEYBOARD
huh caps lock
but if you do local string=function()print"you've been rekt"end, the global string is still intact, but you won't be able to access it, you will only be able to use the local one
In both ways, the variable is local to its definition scope
12:27
@Katenkyo Can you prove this?
:31319149 not true, consider {+i,-i}
@LeakyNun nevermind, that's dumb
@flawr which is why I just deleted it
I don't know why I was saying that -_-
I think I need some sleep ^^'
@flawr because I realized that if my hypothesis is true, then I can remove a set of unities from another set, and the remaining set will also sum to zero, which will make my hypothesis false
12:30
@LeakyNun (won't do it now! :p)
it's 14:30 here!
@Katenkyo If you're interested, veuillez verifier ma traduction pour une chanson?
@LeakyNun Sure I am!
@Katenkyo voici
@LeakyNun My heart only beats for you. I think My heart beats for no one but you is better
12:34
@Katenkyo I' sont pareils non?
@LeakyNun My heart only beats for you seems strange to me, I read it both My heart beats for no one but you and My heart does nothing but beating for you.
(It may only be me and my bad understanding of english :p)
@Katenkyo That sounds unhealthy
@Katenkyo d'accord, edited
@LeakyNun Otherwise, that's a good translation!
12:37
@Katenkyo merci
@Katenkyo I translated this:
> Mes belles que j'aime tant,
il suffit d'un seul regard
et d'un amour délirant.
C'est peut-être le départ.
to this:
> My sweethearts whom I love very much,
It suffices to have a single glance from you.
And if we have a crazy love,
Maybe this is the start.
but I wonder if "un amour délirant" goes with "il suffit" instead
@LeakyNun Hum, I may have overlooked a point there
My sweethearts whom I love very much, is okay
It suffices to have a single glance from you and if we have a crazy love, isn't really the essence of it
what does it mean?
My sweethearts whom I love very much,
A single glance from you
and a crazy love suffice.
It may be the start/beginning
of what?
There's 2 sentences over 3 part in the strophe
the first sentence is:
12:44
the start of what?
> Mes belles que j'aime tant,
> il suffit d'un seul regard
> et d'un amour délirant.
@LeakyNun The start of a love story
@Katenkyo where's "love story"?
There's 2 part in this sentence
`Mes belles que j'aime tant, `
and
`il suffit d'un seul regard
et d'un amour délirant.`
Wouldn't delirious be a more direct translation of délirant?
@LeakyNun That's sub-text ^^
12:45
@Katenkyo alright, edited.
Mes belles que j'aime tant is well translated, but il suffit.... amour délirant is more like It suffices to (have a single glance && have a crazy/delirious love)
That's 2 conditions needed, and when met : C'est peut-être le début.

 Chez Cosette

Discussion pour french.stackexchange.com. Bienvenue à tous ! Y...
discussion ^here^
So => It may be the start
@Katenkyo Veuillez venir ici
@LeakyNun Oh, right, it may fit better Chez cosette ^^
12:48
@Katenkyo it may better fit CC/it may fit CC better
neoscript> a = 10 b = 20 c = a + b
Tokens:
[ { id: 'Identifier', value: 'a', line: 1, column: 1 },
  { id: '=', value: '=', line: 1, column: 3 },
  { id: 'Number', value: '10', line: 1, column: 5 },
  { id: 'Identifier', value: 'b', line: 1, column: 8 },
  { id: '=', value: '=', line: 1, column: 10 },
  { id: 'Number', value: '20', line: 1, column: 12 },
  { id: 'Identifier', value: 'c', line: 1, column: 15 },
  { id: '=', value: '=', line: 1, column: 17 },
  { id: 'Identifier', value: 'a', line: 1, column: 19 },
\o/
@TùxCräftîñg what about a = b = c
neoscript> a = b = c
Tokens:
[ { id: 'Identifier', value: 'a', line: 1, column: 1 },
  { id: '=', value: '=', line: 1, column: 3 },
  { id: 'Identifier', value: 'b', line: 1, column: 5 },
  { id: '=', value: '=', line: 1, column: 7 },
  { id: 'Identifier', value: 'c', line: 1, column: 9 },
  { id: 'EOF', line: 1, column: 10 } ]
AST:
[ { id: 'Assign',
    left:
     { id: 'Assign',
       left: [Object],
       value: [Object],
       line: 1,
       column: 3 },
    value: { id: 'Identifier', value: 'c', line: 1, column: 9 },
:/
Question: What happens when you run out of delete votes?
¯\_(ツ)_/¯
a bad thing probably
but since the parser dont need line separator i can do a = c b = c
12:55
@LegionMammal978 Have you Googled this?
good idea
Aw. I wanted another opportunity to make up something horrible
> I tested this by setting up a new account and asking a bad question. Unfortunately it wasn't bad enough and it was taking a while for it to get deleted, so I asked a worse question, which got promptly deleted.
13:09
what is the best syntax for a block: if expr { commands } or if expr commands end?
@TùxCräftîñg whichever is more golfier.
¯\_(ツ)_/¯
so i will keep the braces
13:21
neoscript> {x y|x+y}
Tokens:
[ { id: '{', value: '{', line: 1, column: 1 },
  { id: 'Identifier', value: 'x', line: 1, column: 2 },
  { id: 'Identifier', value: 'y', line: 1, column: 4 },
  { id: '|', value: '|', line: 1, column: 5 },
  { id: 'Identifier', value: 'x', line: 1, column: 6 },
  { id: 'Operator', value: '+', line: 1, column: 7 },
  { id: 'Identifier', value: 'y', line: 1, column: 8 },
  { id: '}', value: '}', line: 1, column: 9 },
  { id: 'EOF', line: 1, column: 10 } ]
AST:
[ { id: 'Expr',
\o/
@TùxCräftîñg Node?
node?
ah yes i am using node
@TùxCräftîñg Use util.inspect with options {depth: Infinity}
So you don't get all those [Object]s
13:23
\o/
return n<2 and s..C(a)..p or s..C(a)..S..C(b)..s..p..f(n-2,N)..s..C(c)..S..C(d)..s..p
now that's a return statement :D
85 bytes only for that
neoscript> {x y|x + y}
Tokens:
[ { id: '{', value: '{', line: 1, column: 1 },
  { id: 'Identifier', value: 'x', line: 1, column: 2 },
  { id: 'Identifier', value: 'y', line: 1, column: 4 },
  { id: '|', value: '|', line: 1, column: 5 },
  { id: 'Identifier', value: 'x', line: 1, column: 6 },
  { id: 'Operator', value: '+', line: 1, column: 8 },
  { id: 'Identifier', value: 'y', line: 1, column: 10 },
  { id: '}', value: '}', line: 1, column: 11 },
  { id: 'EOF', line: 1, column: 12 } ]
AST:
util is not defined
:/
huh i need to require it
has anybody used boehm's garbage collector? @Mego?
11
Q: Can Mario go to the end of this map

TùxCräftîñgCreate a program that determines, given an input of the path, whether Mario can reach the end, denoted by E, from the start, denoted by S. A path will look something like this: S = E ===== In a path, the various symbols and what they represent are: =: wall/floor/ceiling. Mario cannot walk t...

2d matching ftw
@NathanMerrill If you're still looking for languages to compile to, Haxe uses NekoVM. Might be worth looking into
13:32
@quartata I am, thanks
It has GC too
@quartata that looks like a scripting language
(meaning its not compiled, right)?
oh, there's Neko and NekoVM
No, it has a compiler that compiles to its own virtual machine bytecode like Java
It's relatively fast
13:48
neoscript> if 1 out:write("1"); else out:write("0");
Tokens:
[ { id: 'Kif', value: 'if', line: 1, column: 1 },
  { id: 'Number', value: '1', line: 1, column: 4 },
  { id: 'Identifier', value: 'out', line: 1, column: 6 },
  { id: ':', value: ':', line: 1, column: 9 },
  { id: 'Identifier', value: 'write', line: 1, column: 10 },
  { id: '(', value: '(', line: 1, column: 15 },
  { id: 'String', value: '"1"', line: 1, column: 16 },
  { id: ')', value: ')', line: 1, column: 19 },
  { id: ';', value: ';', line: 1, column: 20 },
7
A: Convert exponents into ASCII art

LynnPerl, 23 + 1 = 24 bytes say'';s/\^(.)/♥[A\1♥[B/ Run with the -p flag. Replace ♥ with a raw ESC byte (0x1b).

Is this answer valid?
cc @MartinEnder @Lynn
Because for input a^b it does not produce \x20b\na
¯\_(ツ)_/¯ it produce the correct output, not byte-wise, but it's the correct output
come on
15
Q: Are control characters and ANSI escape codes allowed in output?

Martin EnderRecently, I had people go crazy with escape codes on one of my ASCII art challenges. This x86 machine code answer was able to save some bytes by throwing a few colour codes at the console. At some point along the way the OP even had a version which left the output blinking. Both the above, as w...

@Doorknob ok, noted
14:00
@quartata thanks for the reference. I didn't realize that Neko was intended to be a target for compilation, so its very much what I'm looking for
14:11
When the Internet is out https://t.co/xYkyXftmkR
3
@Dennis TIO doesn't autopull yet becuse of security, right?
@NathanMerrill Lemme know if you get something working with it :) I don't know a whole lot about conpiling to it, you might want to take a peek at the Haxe Neko target source code or something
14:29
Yes, that's correct.
All right. I remember you mentioning that the sandboxing you were using with Julia didn't work with other languages, what's up with that
14:55
does the final semicolon count towards the byte-count
in java lambdas?
@mınxomaτ why?
I don't know Java. I'm just making an observation.
i know a syntax to create ranges for NeoScript
x:(step]:y
@LeakyNun the statement wouldn't evaluate to a lambda without it
15:02
@quartata it wouldn't without the Function<> also
@quartata I'm looking into Haxe...it has so many compilation targets
it's really an impressive feat
@NathanMerrill haha yes
@LeakyNun I wasn’t sure. It feels a little unfair. I think the challenge is more interesting if you disallow ANSI codes…
@Lynn how could i know beforehand?
Ideally this would have been dealt with in the Sandbox, but my Perl/Retina answers are the only ones using them, and I’m okay with deleting them, if you want to edit your question.
15:07
it's like disabling a loophole before it's proposed
Sandbox.
@Lynn keep them because.
That sounds like exactly what the Sandbox is for :)
neoscript> map({x|x*2} 10:[]:20)
Tokens:
[ { id: 'Identifier', value: 'map', line: 1, column: 1 },
  { id: '(', value: '(', line: 1, column: 4 },
  { id: '{', value: '{', line: 1, column: 5 },
  { id: 'Identifier', value: 'x', line: 1, column: 6 },
  { id: '|', value: '|', line: 1, column: 7 },
  { id: 'Identifier', value: 'x', line: 1, column: 8 },
  { id: 'Operator', value: '*', line: 1, column: 9 },
  { id: 'Number', value: '2', line: 1, column: 10 },
  { id: '}', value: '}', line: 1, column: 11 },
the range is working \o/
sandbox
i'm helping
15:20
Is there any way to get a trailing newline to show up in a code block in an answer?
I've seen it done before
I'm doing the logic gates in MarioLANG and a LOT of them have trailing newlines
30
A: Center The Text!

Doorknobvim, 43 36 35 bytes VGrx:sor G:let &tw=col("$") uu:%ce Too good not to post. Note the trailing newline; it is significant. Thanks to @Marth for saving a character! vim-friendly format: VGrx:sor<cr>G:let &tw=col("$")<cr>uu:%ce<cr> Explanation: VGrx replace every character with an "x" :sor<cr> sort (since all chars are now sa...

that answer has a trailing newline
ah, he does <code><pre>
Yeah
Thanks for finding that
15:22
I always just do a zero-width space
sometimes
I'm not sure how to type that
I'm not either. I just goggle it.

alt+0129 <-- not a "zero width space" character but it works
Question: What's the best way to support multiple operating systems for a C++ project? (in terms of allowing other users to build it)
it's U+200B
@DrGreenEggsandIronMan dont use platform specific builtin
15:24
Should I just provide each type of project? E.g. a Visual studio folder, an xcode folder, a makefile, etc.

@DrGreenEggsandIronMan use cmake and make. it's great and supported ~everywhere.
I'm not, but I want to provide more than just the source code. I want users to be able to build it in one step.
¯\_(ツ)_/¯
I'll just use <pre> tags
@Poke it's a control character
15:26
OK, cmake sounds good. Thanks Tux!
you are welcome
Guess I have to use no-width space, since < in <pre> tags just makes the text after it vanish.
hi @Downgoat
Alt + 0129 is how you do it.
@BusinessCat it's a extended control char
not a zero-width space
but it work ¯\_(ツ)_/¯
15:32
Couldn't get the space to work ;_;
Extended control is all I have I guess
¯\_(ツ)_/¯
i think i have created the ugliest syntax for a dictionary literal
Does anyone remember the ted(?) talk of a guy who made a framework for visualizations and demonstrated a lot of mathy things?
15:51
@Dennis When you get the chance, could you pull Grime, please?
@Dennis do you look at the changes when you pull?
how to capitalize a string in JS?
You mean all caps or capitalize each word?
string.toUpperCase() does all caps
no, abcd => Abcd
but i have found
Gack, I thought I had a 14-byte CG answer to that exponents question until I realized that it was adding one too many spaces because it was replacing the carets with spaces too
S(?<!\^)[^^]& &\^&`S\^.& the regex is so ugly now
16:03
neoscript> func f x y = x + y;
Tokens:
[ { id: 'Kfunc', value: 'func', line: 1, column: 1 },
  { id: 'Identifier', value: 'f', line: 1, column: 6 },
  { id: 'Identifier', value: 'x', line: 1, column: 8 },
  { id: 'Identifier', value: 'y', line: 1, column: 10 },
  { id: '=', value: '=', line: 1, column: 12 },
  { id: 'Identifier', value: 'x', line: 1, column: 14 },
  { id: 'Operator', value: '+', line: 1, column: 16 },
  { id: 'Identifier', value: 'y', line: 1, column: 18 },
  { id: ';', value: ';', line: 1, column: 19 },
huh syntax of the year
Looks like it parsed correctly, no?
yes
i have unintionaly maked it golfy
Well Haskell has you beat :P
f x y = x + y
D:
f = {x y|x + y} so
huh still longer
Alright then, after 7 days, no one has joined the Remaining Bytes.
Which confirms, yet another time, that everyone has their attention at everything except me.
16:14
the Remaining Bytes?
ah trash
or ¯\_(ツ)_/¯
A Google Spaces Space I made for PPCG.
@TùxCräftîñg I'll have to safely encrypt it so that no one could get to the Space without my permission.
You'll need your chat No. and a salt.
Choose a salt.
16:16
huh
Epsom is pretty nice
@TùxCräftîñg A salt in this case means an arbitrary string.
so worder ftw ¯\_(ツ)_/¯
how can i send you the salt?
@TùxCräftîñg encipher.it
What are your favorite vim color schemes? (Both for gvim and console) I'm looking for new ones.
16:20
@DrGreenEggsandIronMan exempt from both
i am using the default
@zyabin101 and what i do with this?
@TùxCräftîñg I already chose the salt, the salt is "w*****". (Censored because someone could intercept it if I didn't.)
@Dennis Can you pull CG? (Ignore the failing Travis build)
@TùxCräftîñg encipher.it?DUSQ
Multiply the salt by a hexagon.
^ Clue for the encryption password.
16:29
i have no brainfucking idea of what it can be
If this is your attempt at a key exchange #youredoingitwrong
Just trade public keys, encrypt the message with your private key and their public key
@quartata The service I'm using uses symmetric keys, and I don't have access to a computer to RSA encrypt it.
@TùxCräftîñg ^
16:32
ಠ_ಠ
@TùxCräftîñg Let's try again with JSEncrypt. @_@
@zyabin101 You can easily RSA encrypt things by hand
At least a very crude message
@quartata huh wat
encrypt RSA by hand
Do the three axis-aligned planes in 3D have a better name than "axis-aligned planes"? (that is, the xy-plane, yz-plane and zx-plane)
16:35
y u know that we are humans
@TùxCräftîñg I think you grossly overestimate the complexity of the actual math
¯\_(ツ)_/¯ when i saw prime number i immediatly give up
@TùxCräftîñg So, you generate a key pair with travistidwell.com/jsencrypt/demo, return me the public key and I try to encrypt the link with the public key and you try to decrypt the link with your private key.
-----BEGIN PUBLIC KEY-----
MIGeMA0GCSqGSIb3DQEBAQUAA4GMADCBiAKBgGsuOB8Z1Auu00Cg9UXuIpkFdeH/
erTQzMnhI74t8mBbvbnij6gRK1ma2h2vfZH3HtXHu8Ywx8qwrNOt57LmQlkA7/QJ
ONUNV/q9l/XKV9Ah/VNPkcBQ273giKiWdEMiwB0Dq0eA7Vo1r6akTam7DcX4Rjk7
yImZVOBjaCJlqRbzAgMBAAE=
-----END PUBLIC KEY-----
@MartinEnder Sorry, pinged the wrong person. >_>
16:38
@TùxCräftîñg M^e mod pq
@TùxCräftîñg Seems I can't edit the key pair in the demo.
¯\_(ツ)_/¯
@MartinEnder Hm
@quartata Will be home in roughly 5 hours. I'll pull asap.
@zyabin101 so you figured the best solution would be to ping that person again? ;)
(no worries, happens...)
16:40
@Dennis All right
@TùxCräftîñg Suggest an online RSA encryption method?
¯\_(ツ)_/¯
@Zgarb Will be home in roughly 5 hours. I'll pull asap.
@TùxCräftîñg Okay, so just share the link in plain text?
what link?
16:42
@TùxCräftîñg Invite link for the Remaining Bytes.
@MartinEnder I don't think there's any notable other names
That was my try. @TùxCräftîñg Did you copy?
bah, language design is difficult.
16:44
@NathanMerrill I do. The changes are minimal most of the time.
@TùxCräftîñg Okay, then run the link (you need a Google account) and see what happens.
i am on the homepage
@DrGreenEggsandIronMan Painful
I think I could do the regex better but I don't think I can beat V here...
maybe next time
@TùxCräftîñg Cool, welcome to the Remaining Bytes!
16:46
Hmm, there was another challenge I was gonna take a look at
@Tux Acquaint yourself in the Spaces help center.
If you consider the interfaces between an immutable and a mutable queue, they are, unfortunately, different. mut_queue.pop() should return T, while immut_queue.pop()should return Queue<T>
unless, you make all mutable queues return themselves (requiring a peek)
The other option is to have some magic syntax that says "update my reference"
and have immut_queue.pop() return T
but every time it'd return the same T, unless you updated your reference immut_queue&.pop()
and I have no idea what the function looks like
sre_constants.error: look-behind requires fixed-width pattern
right I forgot Python regex sucks
Well, guess I'll make my own flavor? ok
regex sucks in general
but it's useful
16:56
@TùxCräftîñg This would have worked in .NET regex
¯\_(ツ)_/¯
I can use \K though
Wait, does Python regex have that?
@MartinEnder Cartesian planes?

« first day (2006 days earlier)      last day (3132 days later) »