« first day (935 days earlier)      last day (460 days later) » 

2:23 PM
Is there a built-in for a[b:]? I cannot find any
In the meantime, I'll use
 
 
4 hours later…
6:15 PM
@Mr.Xcoder £ should do the trick
 
6:31 PM
@Adnan No? That's a[:b]
 
7:15 PM
@Mr.Xcoder oh oops
in that case I don't think there is a built in that does that
 
Feature-request: add one
 
hm
maybe we should start planning for 05AB1E v2 :P
 
funny that you brought that up
I've actually started a rewrite of 05ab1e
the rewrite adds the ability to create infinite lists with lazy evaluation
 
so generators
 
basically yes
 
7:21 PM
I see a lot of potential in a second version of 05AB1E: infinite lists, better matrix manipulation built-ins perhaps, overload improvements and more helpful constants
 
but the generators of python are crap
so the rewrite is in elixir
@Mr.Xcoder exactly
 
Oh and also maybe there will be additions to the canvas mode in the new version?
 
Yes, most likely
 
@Adnan wait, did you say that you started a rewrite of 05AB1E? Dennis has thought of a name of Jelly v2, jli
 
Looking forward to seeing it done! :)
 
7:23 PM
heh
(jli: the reason I brought it up, 05AB1E started showing the same effects as Jelly is currently showing, including a changed code page and sudden addition of new built-ins as well as aliasing old ones, etc.)
(it seems like those effects indicate the start of the end)
 
@EriktheOutgolfer Yes, a week ago
well, looking at the rise of new languages
in order to keep up, you must update your language
 
ahem, it's not rise season currently
but, eh, I guess that you should prepare before it comes again :P
 
but when I wrote the first lines of 05ab1e, there was no OOP or even a logical design to it
 
I think it already came. Plus, now Jelly is terser than ever
 
so adding new built-ins takes a while because of crap code maintenance
 
7:27 PM
Jelly is still the same old Jelly but with the effects I mentioned above and maybe more
hm, what if 05AB1E does cause a rise season to commence?
 
yeah, and I'm trying to convert osabie into a more functional language
hence the choice of elixir
 
Brb learning Elixir
 
(functional) + (stack-based) = (incompatibility)
 
I'm also figuring out a way to include Oasis into osabie, but that is not easy
@EriktheOutgolfer that's what you think hahaha
 
senses evil plan
 
7:31 PM
@Mr.Xcoder the syntax might be a little bit weird though
it's similar to prolog
 
That's understandable, since it's written in... Erlang or something??
 
Yes exactly
It uses the Erlang VM
 
@Adnan hm, what happens if...
(Husk) + (05AB1E) = x
would x = [05AB1E v2]?
 
I do not know Husk well enough
so I have no idea
 
7:35 PM
functional language with brute force type inference
 
what's Husks strongest point?
 
Husk's type system is completely incompatible to that of 05AB1E (very strict vs very loose), so I don't think so
I'd say Husk's forte is because it has infinite lists and very relevant built-ins for them
 
IMO, its high-order built-ins
 
oh neat
 
That too
 
7:37 PM
it does indeed have infinite lists, that's cool
 
note: + isn't addition, it's proper selection from multi-set union
 
And the downsides (imo) are that Husk can sometimes be extremely slow and requires lists to be homogeneous
 
requirement of homogeneity in array structures is a side effect of strict typing systems
 
Yes, and that is a huge downside in my opinion
 
well, the new osabie still maintains the string number == int
which seems to be a love-hate relationship between users hahaha
 
7:41 PM
Yay
 
hm, what if strings are actually lists of chars?
then we could simply call chars scalars and lists vectors
 
I have actually thought about that, but it won't work
 
can't remember why, but it doesn't
I have it written on a paper somewhere on my desk, but it is a mess :p
 
if I post a photo of my desk, you'll really see what "mess" means
 
7:45 PM
And you'll both think yours are clean if I show you mine
 
hahahaha
 
alright, I won't go further here, I don't like to clutter chat rooms :P
 
05AB1E-CMC: Given an integer, check whether the lengths of the runs of equal adjacent digits follow a pattern like this: [a, b, a, b-1, a, b-2, ..., a, 1, a (?)], where by (?). Test cases: Truthy: 12212, 355545525, 667777007778877997, Falsy: 123456789, 122232222332 I mean that the final a may appear or not, in either case giving truthy results (Was posted in TNB, but I'd like to see how you'd do it in 05AB1E)
 
that's a tough one
especially since there are a lot of ways to do that
let's see
 
lol I can already think of a solution
 
8:00 PM
For a short language comparison when we're done, the current best Jelly answer is 13 bytes and the current best Husk answer is 15
 
8:28 PM
@Mr.Xcoder Well, I'm currently stuck at 13 bytes
but I'm still trying different approaches though
 
13 bytes? O_O
 
13 bytes seems reasonable
It ties Jelly
 
05AB1E's zip doesn't work like Jelly's
 
I'll approach it in 05AB1E asap
 
and neither its ζip works like Jelly's
 
8:33 PM
@Adnan Does yours work for 66777700777887799799?
 
9:24 PM
After having tried this, indeed 13 seems waaay to low. (Unless it is invalid for test cases like ^, which should yield truthy)
 
 
1 hour later…
10:42 PM
@Mr.Xcoder Yes, my program outputs 1 for that test case
 
spoiler please?
this sounds impressive
 
@EriktheOutgolfer γ€g¬MÝâRJJsJå
 

« first day (935 days earlier)      last day (460 days later) »