rak1507

19 ms·

1.
Notes on writing a voxel game in Dyalog APL(homewithinnowhere.com)
3 points by rak1507 6mo ago|0 comments
2.
by rak1507 10mo ago
You won't get anything from vapourware salesmen.
3.
by rak1507 10mo ago
It seemingly takes a long time to write good software too, co-dfns is infinity+1 years in progress...
4.
by rak1507 11mo ago
There's a difference between one line and short/terse/elegant. {m:(x,x)#til x*x; r:til[x]-x div 2; 2(flip r rotate')/m} generates magic squares of odd size, and the method is much clearer. This isn't ev
5.
by rak1507 1y ago
There aren't really any complicated arguments being made, so I don't think a proof would be that involved.
6.
by rak1507 1y ago
You definitely don't need to know any of that background to be able to arrive at the answer. To fully understand everything maybe, but all it takes is: a = x^1 + x^4 + x^7 + ... = x(1 + x^3 + x^6 + ...) = x/(1-x^3) a + a^3 + a^5 +
7.
by rak1507 1y ago
Why not? All that is really required is knowing 1/(1-x) = 1+x+x^2+... and a bit of algebraic manipulation.
8.
by rak1507 1y ago
Isn't referencing a source exactly the right way to go about pointing out someone is essentially lying about their background/credentials? I'm surprised people do not care about accuracy.
9.
by rak1507 1y ago
I remembered it, and it seems like a reasonable assumption that your first experience of APL being so bad would put you off doing any more in the future.
10.
by rak1507 1y ago
Most of it is boilerplate or written like it is Java, so it is pretty small compared to any real world projects. To me professional implies production/real world/paid work, not just an unfinished academic project.
11.
by rak1507 1y ago
Well, you've said you used APL professionally, but judging by https://news.ycombinator.com/item?id=31368299 it was in a university project.
12.
by rak1507 1y ago
The append is the only thing that is O(1), finding the deletion mask is linear (≠ is linear, isn't it?) and the actual deletion is also linear (⌿ is also linear). ]runtime -repeat=1s 'v←k1 ⋄ v⌿⍨←v≠2' \* Benchmarkin
13.
by rak1507 1y ago
The problem is that this isn't a "hashmap" in any meaningful sense, because all the operations are O(n).
14.
by rak1507 2y ago
When it comes to subjective opinions, what other choice do you have? Your idea of doing studies is interesting but that's not even been done for most languages, yet claiming "python is unreadable" would clearly be laughable.
15.
by rak1507 2y ago
I had a peek at your github profile, and noticed "sqlutilpy", "Python module to efficiently query SQL databases and return numpy arrays". K is like if a language just did that by default.
16.
by rak1507 2y ago
You have been talking about array languages on HN for at least 6 years, and still refuse to believe that anyone can read them! What do you have to gain from this stance, and why don't you believe people who tell you otherwise?
17.
by rak1507 2y ago
Personally I think the best comparison would be Python+Pandas/polars+... or R+tidyverse+..., the key thing being there's less need for the "..." in a language with good table manipulation etc built in.
18.
by rak1507 2y ago
Do you mean f(x,n-1)^x or x^f(x,n-1)? With the first definition, c=1, the second, c=sqrt(2). I'm still not seeing the connection to omega.
19.
by rak1507 2y ago
What do you mean by x^x^x^... = 2? Isn't the solution to that sqrt(2)?
20.
Interactive Advent of Code Writeups in Q(q.kx.com)
10 points by rak1507 2y ago|0 comments
21.
by rak1507 2y ago
I don't know if there's a specific k4 binary but you can run k4 through the q binary.
22.
by rak1507 2y ago
It's k4, the underlying language behind Q. With slight modifications it also runs in ngn/k which is FOSS. https://ngn.codeberg.page/k/#eJxVjsFugzAMhu95iiyWik1CIGPtIVG...
23.
by rak1507 2y ago
What's so hard about Day 12? It's just +/'{x:".",x;H:(-1+;1+i-)@'+|\m*i:!#m:x=\:"#." R:(x=x)({[h;d;x;y;z](z#0),+\(((-z)_~"#"=x)&z_d>z)*(*y),(-z+1)_y-0^y h}. H)[x]&#x2F
24.
by rak1507 2y ago
Again, I'm not saying anything is impossible to do, it's just about whether or not it's worth it. 2 or 3 lines for all types for all overloads for all primitives etc adds up quickly. I don't see how k/q tables are o
25.
by rak1507 2y ago
This is (predictably) wrong.
26.
by rak1507 2y ago
None of the primitives are necessarily too complicated, but off the top of my head things like /: \: (encode, decode), all the forms of @ \ / . etc, don't have directly equivalent numpy functions. Of course you could reimplem
27.
by rak1507 2y ago
There are semantic differences too with a lot of the primitives that are hard to replicate exactly in Julia or numpy. That's without mentioning the stuff like tables and IPC, which things like pandas/polars/etc don't rea
28.
by rak1507 2y ago
Hmm, why not? Using K or a similar array language is a very different experience to using an array library like numpy.
29.
by rak1507 2y ago
It wasn't able to explain the code, it was wrong.
30.
by rak1507 2y ago
I cannot comprehend the mindset of people who decide to spam (because that is what your comment is) any forum with a page of bullshit GPT slop. Do you think it's helpful or interesting?

More ›