last day (85 days later) » 

19:13
49 bytes Try it online!
ಠ_ಠ I forgot about reindexing from STDIN
@cairdcoinheringaahing : – Proof.
Sorry! Multiple pings
@Mr.Xcoder Markdown doesn't work like that. And you have the arguments the wrong way round
No, I don't
That's the way they are supposed to be
19:16
Yes. I don't see what's wrong
The others are f(20, 10)
You need 20 - 10 * (20 // 10)
@cairdcoinheringaahing Notice the order my Triangularity program is taking input? ಠ_ಠ
If you insist, #1 - #2 * (#1 // #2)
do we agree now @caird?
so modulo is 49 bytes...
next
Welp I think I can golf that
@cairdcoinheringaahing I just saw your PR. Analysing now
Huh, that didn't syntax error :P
19:23
@cairdcoinheringaahing Now that we have W fixed (once pulled), do you think print is still needed?
I think it's a bit like BrainFlak and BrainFlak classic. It allows for infinite printing (if you add loops)
Also, mass leave just then :P
@cairdcoinheringaahing Also, is pair really needed?
I do agree on J, though
Depends if you want to save bytes or not ¯\_(ツ)_/¯
I don't really want to save bytes :P I'd like to keep it minimalistic. Thanks for the changes to J though, is there any way to merge only one part of the code?:P
Reject the PR, then edit it yourself :P
19:27
Or accept and delete the other too. Thanks!
Maybe I'll add N back if I implement loops
@Mr.Xcoder I forgot about Python overloading :P
room topic changed to A triangular, strang Esolang: A room for the Triangularity esolang: github.com/Mr-Xcoder/Triangularity (no tags)
Welcome to Triangularity!
3
room topic changed to A triangular, strange Esolang: A room for the Triangularity esolang: github.com/Mr-Xcoder/Triangularity (no tags)
@cairdcoinheringaahing Challenge:
> Find the absolute value (e.g. f(-8192)=8192, f(11)=11)
Do you want to get an RO to move the messages across, or leave it be?
@Mr.Xcoder 49 bytes
I am writing in TNB
@cairdcoinheringaahing That was fast. Wait for me now :P
33 messages moved from The Nineteenth Byte
19:33
@Mr.Xcoder I'd already done it :P
@wizzwizz4 Woah, that was weird :P
@cairdcoinheringaahing How so?
Hmm, absolute value
@wizzwizz4 A bunch of messages just appeared, sweeping down the screen
I think 31 bytes
BTW, @cairdcoinheringaahing thanks for using my odd language and being very good at it
@Mr.Xcoder No problem, I like using obscure languages :P
It's much easier than Jelly :P
19:38
Crap, you can't multiply by 0 :(
Unless you use J which isn't live yet
Wait...
I got confused about why W was still outputting with [...] at the end, before realising it hadn't been pulled yet :/
Come on Mr. Xcoder, why r u so slow
I need coffee ಠ_ಠ
I thought you didn't drink it?
I don't.
I was talking about our conversation :)
Ok... How to implement sign...
Wait I added comparisons ಠ_ಠ Ugh
I've got to go eat dinner. Be back in about an hour o/
19:44
Ok.
Enjoy your meal. I'll solve it in the meantime I think
20:00
@cairdcoinheringaahing Absolute value: 31 bytes – Try it online!
20:38
What do you think about adding in auto-padding?
Then it would allow for bytecounts that aren't just one of a small set of values
@cairdcoinheringaahing Example?
Just on the last line?
Yeah. It would feel less annoying when you have a final line like +...........
Ok... If Dennis didn't pull it yet, I'll implement that quickly
20:44
If it were on any other lines, it would kinda defeat the purpose though, so it'd either be the last line, or no lines
Uhm, I've been thinking about it... I don't really see the point now. Not a golfing language, so ¯\_(ツ)_/¯
But I think I'll do it anyway
It does allow for byte savings that aren't 18 bytes for instance. Making a clever change, then keeping the same byte count can be quite annoying :P
Indeed.
While it can be really fun to strive for those bytes
But, it's your language. Don't feel pressured into doing it if you don;t want to
@cairdcoinheringaahing I pushed to master again:
if not all(len(elem) == length * 2 - 1 if index != len(lines) else len(elem) <= length * 2 - 1 for index, elem in enumerate(lines))
Instead of if not all(len(elem) == length * 2 - 1 for elem in lines)
Because anyways we want to prevent loopholes
20:53
You weren't kidding about the writing bad code, were you? :P
No I wasn't :P
A simple code[-1] += '.' * len(code[0]) would work :P
Uhm, no...
If code is the list of lines
Because that would make it like:
..)..
.829.
+.....
20:55
code[-1] += '.' * (len(code[0]) - len(code[-1]))
It would be code[-1] = (code[-1] + '.' * len(code[0]))[:len(code[0]))]
Or that
I am going to leave it as-is, though
Or .ljust :PPP
Yup. Now let's grab a challenge
ಠ_ಠ There's nothing you can do without map
21:27
Can you think of a challenge to do in Triangularity? I'm writing a Sandbox post (based on it)
20 messages moved to trash
I figured that we weren't really on-topic
You used the wrong trash (but yes, we were off topic) :/
No, I am not using the wrong trash...?
The owners of TNB have a separate, Gallery trash
The great 11
21:38
I'll try to think of a challenge to do in Triangularity
But if you post something on Main dedicated to it, please make it doable in it :)
That'll be very tough
It's about taking a flat string, then making it into a valid rectangle (example coming)
I see.
ABCDEFGHI

=>

..A..
.BCD.
EFGHI
I think that'll be interesting (my opinion is, of course, biased).
It's definitely impossible right now.
21:43
Without evaling Python code :/
Yeah
@cairdcoinheringaahing Challenge: Find the Nth root of an integer. Both N will be positive
9, 2 -> 3
27, 3 -> 3
32, 5 -> 2
@Mr.Xcoder 31 bytes.
When auto-completion is pulled, 26 25 bytes
Make that 26
26 bytes (auto-complete) here
Yeah, the exact same
Except that I used )@.
> Both N

  last day (85 days later) »