room topic changed to Enlist: General discussion, feature requests, bug reports, golfing tips, and help for the Enlist Programming Language: github.com/alexander-liao/enlist [code-golf] [golfing-language,]
room topic changed to Enlist: General discussion, feature requests, bug reports, golfing tips, and help for the Enlist Programming Language: github.com/alexander-liao/enlist [code-golf] [golfing-language]
room topic changed to Enlist: General discussion, feature requests, bug reports, golfing tips, and help for the Enlist Programming Language: github.com/alexander-liao/enlist [code-golf] [enlist] [golfing-language,] [practice,]
room topic changed to Enlist: General discussion, feature requests, bug reports, golfing tips, and help for the Enlist Programming Language: github.com/alexander-liao/enlist [code-golf] [enlist] [golfing-language] [practice]
room topic changed to Enlist: General discussion, feature requests, bug reports, golfing tips, and help for the Enlist Programming Language: github.com/alexander-liao/enlist [code-golf] [enlist] [golfing-language] [language-development] [practice]
Also don't forget some important functions such as (if you haven't implemented those already): zip, interleave, transpose, justify (rjust and/or ljust), strip and group equal adjacent values.
@HyperNeutrino #F3, 4, ... 7: Modular (I think you have that already though), Chop into N pieces of similar length, Chop into pieces of length similar to N, Permutations, Combinations
@HyperNeutrino #O2: Invariant. Take a function A and a variable B and check whether A(B) == B. This has been extremely helpful in Pyth. Also this allows you to remove a potential 2-byter "Is Palindrome?" since that would be <reverse><invariant>
#I1 (an idea for the far, far future of Enlist maybe) : Canvas Mode.
(helpful in KC/ASCII-ART, highly subjective - thus completely up to you)
@HyperNeutrino That's why I said it's highly subjective and up to you. I wouldn't implement it either if I was you, I just thought it's worth mentioning.
@HyperNeutrino Also, Husk has a very interesting built-in I want to share with you (It is called "similar" and has the ≈ character there): For numbers (either floats or ints), it checks if the absolute difference between them is ≤ 1. For lists it checks if they are the same length. For Pairs (two-element lists) checks if both elements are similar, but this one is harder to implement and can be dropped, since it would require different arities.
@HyperNeutrino I think I have a better idea, but need to know smth from you: How are singleton lists of integers treated? Are they converted to integers or kept as lists?
@HyperNeutrino Drop the 1/N built-in and make reverse do that instead for plain integers (I do realize now that vectorization would be impossible though)
@HyperNeutrino A very good one borrowed from Husk, which is extremely helpful in challenges like this, this and this: Split the list A in chunks of respective lengths with the integers in B (C in Husk).
Actually that would be like ṁR in Jelly... Not sure now.
If you ever want any help with Enlist, I'd be glad to contribute once I get more familiar with its Python source code / functions (at least with ideas).
It's the first language that sounds promising for golfing developed since I am a member of PPCG, so I'd be glad to have it as a primary golfing language
Haha, cannot wait for the first time we beat Jelly in enlist
@HyperNeutrino You will need them though. Since if you try to filter for example: Say you have a list and want to filter those that equal the input: you’d need a function compositon method for = and the input function ;P