Yeah, to my eyes it seemed to magical i didn't realise it until i saw it being used in a APL video... Makes me wonder if there are other tricks in the editor that I'm unfamiliar with
Yeah i was reading the manual in regards to CLI usage, I wasn't expecting dyalog via cli to support the extra features (im amazed of how cool ")ed myfunc" is) but I couldn't figure out how to invoke the BK (ctrl-shift-backspace) and other shortcuts...
dzaima, you can but it'd require that you modify your terminal and termcap for your terminal, also that applications accept it. afaik it's troublesome...
i was considering making a python script to interpret `<Keystroke> as a glyph
As an idea for the APL twitter bot, it may make sense to only display an image of the output, and link to tryapl with the actual text since Twitter doesn't have code formatting
@Adám FYI. I have a computer under a centralized management. So basically I can't do nothing. The main problem with Dyalog is that registry is out of question. I can start Dyalog with DYALOG_NETCORE=1 which allows me to use binary version of .NetCore 3.1. I was able to do this with Jupyter-Lab Notebooks too. I just added it to line 233 in kernel.py like this self.dyalog_subprocess = subprocess.Popen([dyalogPath, "RIDE_SPAWNED=1", "DYALOG_NETCORE=1" , 'RIDE_INIT=SERVE::' + str( self._port).strip(), 'LOG_FILE=nul', os.path.dirname(os.path.abspath(__file__)) + '/init.dws'])
@kimmolinna Because there's no automated way to do so. Lots of questions there: Should it also write defaults? What about settings that have been set to the default to override another non-default settings, etc.
@AviFS Also utility (though you could call that "principles"). First axis functions are much more versatile than last-axis functions, and hybrids are just awkward.
@Adám currently I'm trying to keep lines short enough so they don't wrap (hence the ∙) but I also have the hard limit on total character count, so I add the "..." when I hit that.
@Adám Yeah, I'm calling them principles for lack of a better word. It's not to contrast it against practicality, but to say that the utility gained is from 'better math,' rather than hackish oddities a la C++.
Sure. Only happens in Windows IDE. Search for some text, click inside the resulting selection, then hold shift and use a movement key to select. Rather than what should be selected, everything before the caret is selected.
Solver←{
(m a t)←⍎¨¨' '∘(≠⊆⊢)¨⍵
val←(pos←val>0)⌿val←,m∘.+a
ord←⍋val ⍝ How to order possible values in ascending order.
idx←(¯1+≢val)⌊0 1∘.+val[ord]⍸⍤1 0⊢t
best←(⍉idx){⍺⊃⍨⊃⍋⍵}⍤1⊢|⍉val[ord][idx]-⍤1⊢t
⍕¨1+(≢m)(≢a)∘⊤¨(⍸pos)[ord][best]
}
{⍺⊃⍨⊃⍋⍵}⍤1 will be slow bc ⊃⍋ will be n log n, ⊃⍤⍋ will use the idiom and be much faster for large arrays, not that I suppose it particularly matters here
On top of TryAPL's default ]rows behaviour, if the full session has 101+ lines, it gets truncated to 100 lines. But if things aren't crazy-long, it shows input+output
You can give me a couple of things to try, I'll tweet them at the bot, and we can work from there.
I take all the code that was ran and join it with " ⋄ ", then I do fancy url escaping with urllib.parse.quote_plus and then I plug it into "https://tryapl.org/?q=$1&run"
@Adám This is a great textbook in that topic, if you're interested
Volumes 5 and 6 are actually new, and it looks like you can verify C programs directly now (VST project was still ongoing when I was first learning Coq)
there was some discussion in TNB about a reduce-like operator that actually works for =/, and similarly for >/ and </
i implemented it as {∧/¨ 2⍺⍺/¨ ⍺ ,/⍵} - is there a better way of doing this (in terms of actual code style / efficiency, not golfing)?
and also, if i want this to work for both monadic and dyadic (like, ⍺ might not be provided), how would I go about doing that? I'm not very familiar with implementing custom operators
@hyper-neutrino Using your above definition (which only works sensibly on simple vectors) it'd be really easy: {⍺←⊢ ⋄ ∧/¨ 2⍺⍺/¨ ⍺ ,/⍵}
@hyper-neutrino Using Stencil: {⍺←≢⍵ ⋄ (∧/2⍺⍺/↓)⌺(⍪⍺1)⊢⍵} but note that this preserves the number of elements by using shorter windows at the edges. Also note that ↓ replaces ⊢ from above. Otherwise we add padding rather than look at shorter windows.
@hyper-neutrino Yes exactly. ⍺←… is basically a conditional in that the whole expression is only run if the containing function was called monadically, but skipped if it was called dyadically:
Normally, x f⍥g y is (g x) f (g y) but if ⍺ gets a "bypass" operator value, namely a monadic operator that ignores its operand and returns its argument, then the monadic call is (g{⍵ ⋄ ⍵⍵}) f (g y) making the left g be ignored and returning the result of f (g y)
(The real ⍥ is not quite this, because it has to handle shy functions, but this version is fine for modelling.)
Dfns and dops terminate on the first statement which is neither an assignment, a guard or an error guard, so ⍺⍺ is never reached, as ⍵ is returned, but it is the mere mention of ⍺⍺ that makes it into a monadic operator.
