Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
nomemory
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
15 ms
·
151.
▲
by
nomemory
5y ago
> He’s a good son. I also have a daughter. She was a women’s and gender studies major in college. Naturally, she loathes mayonnaise. This is gold.
152.
▲
by
nomemory
5y ago
Well, I don't consider I've insulted someone by saying I like the way Wikipedia is.
153.
▲
by
nomemory
5y ago
Not at all a complimensult. I can appreciate the work of someone, if even I won't use it. I don't know how to put it otherwise.
154.
▲
by
nomemory
5y ago
I am one of those people who actually like Wikipedia the way it is. It's what I hoped the web to become. But i am sure there are people who will appreciate your effort. Thank you for your work.
155.
▲
by
nomemory
5y ago
So without playing dumb or anything, you say they say: "We have security issues every year because we program in unsafe languages like C, and to solve this, we should start rewriting things in Rust because it's 'memory safe&#
156.
▲
by
nomemory
5y ago
So it's more like a "Look, it's possible to do this in Rust!" than "We did it in Rust, and we believe it's better because ..." ?
157.
▲
by
nomemory
5y ago
> Many GNU, Linux and other utilities are useful, and obviously some effort has been spent in the past to port them to Windows. However, those projects are written in platform-specific C, a language considered unsafe compared to Rust, an
158.
▲
by
nomemory
5y ago
Coding is just electrons having fun.
159.
▲
Open Vim – An interactive Vim tutorial
(openvim.com)
3 points
by
nomemory
5y ago
|
0 comments
160.
▲
by
nomemory
5y ago
You can have hash tables that cannot be targeted by DoS attacks. You can use a family of hash functions and seed the hash table instance with a key. The attacker won't be able to do make assumptions regarding collisions because he does
161.
▲
by
nomemory
5y ago
The point of the article was too prove that it's hard to do Open Adressing in Java and beat HashMap performance, that uses Separate Chaining. The article contains also a Robin Hood implementation that overall works worse than HashMap.
162.
▲
by
nomemory
5y ago
I didn't perform any deletes, and I've tried to keep everything clean without allocating intermediary objects. But one the pitfalls is that I cannot play easily on the memory lane with Java. For example in the entries and bins imp
163.
▲
by
nomemory
5y ago
Didn't have time to write about it, but I've used a GCProfiler as well. With a few exceptions, all the 5 implementations are comparable.
164.
▲
by
nomemory
5y ago
I've assumed they were inline initially, until I profiled and found out one of the swap methods was not. I believe there's also a limit on the amount of bytecode to inline, so no matter how hot a method, if the associated bytecode
165.
▲
by
nomemory
5y ago
Maybe it was even more terrible, because it tried to be "smart".
166.
▲
by
nomemory
5y ago
Exactly, in Java i couldn't even inline my functions, and had zero control over the underlying memory layout.
167.
▲
by
nomemory
5y ago
I consider myself an optimist.
168.
▲
by
nomemory
5y ago
For me it was faster on average and with less variance. But the micro-benchmarks are flawed by default, so I believe it's room to improve them. Also maybe there are some tricks that can be done, to have a faster Open Addressing impleme
169.
▲
by
nomemory
5y ago
Exactly. Looking at some discussions the open-jdk team had, they decided to continue with Separate Chaining. I don't have the link, but then I got interested to see how some Open Addressing (nothing fancy) will behave in Java, so this
170.
▲
A Tale of Java Hash Tables
(andreinc.net)
128 points
by
nomemory
5y ago
|
87 comments
171.
▲
by
nomemory
5y ago
I would love to see Nim used more in web development. I have a strong irrational dislike for go, and Nim feels right to me as alternative. Unfortunately without corporate support, it's hard...
172.
▲
by
nomemory
5y ago
harps , sharps, I believe this is pure parody, right, right ?
173.
▲
by
nomemory
5y ago
I remember when I was a kid, my father did this to a qbasic game with two monkeys throwing bananas. He eventually modified it so they can throw two instead of one.
174.
▲
by
nomemory
5y ago
I am a math hobbyist, and I wanted to work on my linear algebra knowledge. So I've decided to implement some of the most common algorithms from the CS curricula. After some work, I've come-up with this small library. It has no pro
175.
▲
As a hobbyist, I've written my own matrices library in C
(andreinc.net)
6 points
by
nomemory
5y ago
|
1 comments
176.
▲
I've written a Kotlin DSL to perform simple transformation on JSONs
(github.com)
2 points
by
nomemory
5y ago
|
0 comments
177.
▲
by
nomemory
5y ago
I don't think there's consensus and very few people have a total grasp of the subject. Look Java and python for example. The people working on the languages are quite smart, and they decided to take different routes. Who was right
178.
▲
by
nomemory
5y ago
There are a few valid points, but also unfounded pessimism. The amount of stable libraries and stable innovative products is amazing. It's normal there's chaos, but what is good will survive the test of time.