Live data from Hacker News

I am no longer able to use Google with Lynx

blind.guru

331–333 of 333 posts

Re: I am no longer able to use Google with Lynx

#331

Earlier quoted context omitted.

I'm also a novice at APL, despite thousands of lines of session scrollback building up basic lines that almost work then I change one character and INSCRUTABLE ERROR, over and over. Your take,B,drop design looks simple and sensible but the repetition of N is bugging me - I tend towards codegolf more than code clarity. The kind of drop I was hoping to find would be like you can index non-contiguous indices and update…

No accounting for taste -- truer words never spoken. :) --- Abandon all hope, ye who read further. I try not to worry too much about making things tacit. But there's a neat trick you can play in J to find a tacit definition for a non-tacit expression (if one can be found). I don't know if there is a counterpart in any common APL distributions. First you define an expression in terms of values named 'x' and 'y'. Your…

Ooh that's interesting, and I can read enough J to see how the basic version works, and a bit of what the tacit version is doing; the left and right functions map to ⊣ and ⊢ in APL, I don't know that the cap [: needs an equivalent because Dyalog APL recognises two functions alone without that, and calls it an "atop" for (fg) is (f(g(x)) or "f atop g".

But I'm going to have to read more to work out what/how the tacit version works because I have no intuition for telling where the x and y or ⍺ ⍵ enter into them.

Dyalog have this document for tips for translating d-fns into tacit form: https://dfns.dyalog.com/n_tacit.htm but how that compares to what '13 :' does internally..

Re: I am no longer able to use Google with Lynx

#332

Earlier quoted context omitted.

No accounting for taste -- truer words never spoken. :) --- Abandon all hope, ye who read further. I try not to worry too much about making things tacit. But there's a neat trick you can play in J to find a tacit definition for a non-tacit expression (if one can be found). I don't know if there is a counterpart in any common APL distributions. First you define an expression in terms of values named 'x' and 'y'. Your…

Ooh that's interesting, and I can read enough J to see how the basic version works, and a bit of what the tacit version is doing; the left and right functions map to ⊣ and ⊢ in APL, I don't know that the cap [: needs an equivalent because Dyalog APL recognises two functions alone without that, and calls it an "atop" for (fg) is (f(g(x)) or "f atop g". But I'm going to have to read more to work out what/how the tacit…

Cool! I didn't know that about APL, and thanks for the Dyalog 'n_tacit' link.

This sort of feels like we are two tourists, trying to help each other translate between two languages that neither of us speaks very well. :)

These two pages might help you to build an intuition about how J does verb trains. The diagrams help to explain where the x and y values are used throughout (and where they are not).

https://code.jsoftware.com/wiki/Vocabulary/hook

https://code.jsoftware.com/wiki/Vocabulary/fork

I'm starting to be able to write long-ish forks in J without mechanical help, although I usually get them wrong the first dozen times. Practice makes perfect, I guess!

I'm planning to do this year's Advent of Code puzzles (https://adventofcode.com/) in J this year... at least until I reach a problem that explodes my brain. I'm hoping that this will give me something concrete to sharpen my skills on.

Re: I am no longer able to use Google with Lynx

#333

Earlier quoted context omitted.

"Everything is difficult in this language" made me smile. :) I mostly agree. There are things things that APL / J make amazingly easy, too, but a lot of simple things are just brutal to me. I'm not a hardcore APL programmer -- I've played with J more than APL, but I'm still a novice at both. I just enjoy the mental challenge sometimes. To insert items from B into A at point N, you could (in pseudocode, I don't have t…

I'm also a novice at APL, despite thousands of lines of session scrollback building up basic lines that almost work then I change one character and INSCRUTABLE ERROR, over and over. Your take,B,drop design looks simple and sensible but the repetition of N is bugging me - I tend towards codegolf more than code clarity. The kind of drop I was hoping to find would be like you can index non-contiguous indices and update…

Sorry about the pseudo code but I don’t have an APL font on my phone:

Vector[(iota rho Vector) set-minus indices to remove]

Post reply on HN