Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
Spoof7726
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
7 ms
·
1.
▲
by
Spoof7726
2y ago
> Fish also uses threads for its award-winning (note to editor: find an actual award) autosuggestions and syntax highlighting, and one long-term project is to add concurrency to the language. (note to editor: find an actual award)
2.
▲
by
Spoof7726
2y ago
I completely agree. I don’t think the paper is practical either; I shared it only to show that random access is possible in theory.
3.
▲
by
Spoof7726
2y ago
Because division is not trivial. Even computing x mod 3 for an n-bit integer x is O(n), if x is represented in the binary form.
4.
▲
by
Spoof7726
2y ago
This is exactly a Succinct Data Structure. The solution proposed by the author doesn't allow random access; that is, you can't access a specific A[i] unless you unpack all of them. There is some research (e.g., [1]) allowing rando