Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
gct
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
13 ms
·
91.
▲
by
gct
7y ago
Usually they specify the stock part in dollars, it doesn't turn into a concrete number of shares until after you start.
92.
▲
by
gct
7y ago
I'm curious, why encrypt Netflix video traffic at all?
93.
▲
by
gct
7y ago
Money spent by non-profits that don't have to report their donors (hence "dark")
94.
▲
by
gct
7y ago
Amazon vests 5/15/40/40, even worse than you said.
95.
▲
by
gct
7y ago
I was in TIP. Hanging out with smart, kind kids every summer was the highlight of my year. Lotta great memories. Public school...not so much.
96.
▲
by
gct
7y ago
There's a book called "The Killing Star" where humanity is wiped out by an alien species because "Why take a risk?" That's a hyper rational position.
97.
▲
by
gct
7y ago
It's a canonical fact that one of The Joker's super powers is hypersanity.
98.
▲
by
gct
7y ago
I bought at $5.75 and held for the past 11 years...
99.
▲
by
gct
7y ago
The magnets are on the outside of the containment vessel, their whole point is to keep the plasma in the center. What little leaks out ablates the walls of the container, it never even touches the magnets.
100.
▲
by
gct
7y ago
Peter Thiel is a blithering idiot, film at 11
101.
▲
by
gct
7y ago
Remember when Gates and Ballmer tried to screw Allen out of his shares because his productivity had gone down due to cancer? https://www.cnet.com/news/paul-allen-gates-ballmer-tried-to-...
102.
▲
by
gct
7y ago
I'd just like to say, I'm generally hard to please on software, but Blend2D is good stuff, those guys are s-m-r-t.
103.
▲
by
gct
7y ago
I write FIR filters in software all the time, it's plenty fast for what I do. Why use analog circuit elements to emulate a fundamentally digital technique? Build an analog circuit with similar filtering characteristics. You can even
104.
▲
by
gct
8y ago
Yeah I had a startup offer me 50K shares or something like that and I started poking at what their full diluted share count is and they hemmed and hawwed. Pass.
105.
▲
by
gct
8y ago
They just project a periodic signal onto a basis of orthogonal complex exponentials, what's so hard? (/s)
106.
▲
by
gct
8y ago
Is the data time tagged?
107.
▲
by
gct
8y ago
Magit is one of the packages I can't live without now that I've given it an honest try. It's that good.
108.
▲
by
gct
8y ago
I shelled out ~$600 for two new in-box model Ms from the 80s last year, worth it.
109.
▲
by
gct
8y ago
There's dozens of us!
110.
▲
by
gct
8y ago
Hear hear. Everyone that's making excuses for one based is wrong. You need a zero in your set of integers to form a Ring modulo N. I hereby declare everyone that wants 1 based indexing out of some naive sense of it being easier a sc
111.
▲
by
gct
8y ago
In the tradition of naming things terribly this is called std::nth_element in C++
112.
▲
by
gct
8y ago
Even after working with it for 15 years I still find new and interesting things about it.
113.
▲
by
gct
8y ago
x86 caches uses virtual address for indexing (physical bits for tag), so this'll increase cache pressure too.
114.
▲
by
gct
8y ago
MFW people don't realize where MSNBC came from
115.
▲
by
gct
8y ago
Here's an article on it that was posted awhile back: https://medium.com/@smcallis_71148/complex-arithmetic-is-com... The gist is that you can get Nan+jNan for some operations where you wanted "infinity",
116.
▲
by
gct
8y ago
Yeah I guess it depends on what you're trying to optimize (they use web mercator because roads didn't meet at right angles up north for example). But if you're mostly interested in indexing physical areas with polygon approx
117.
▲
by
gct
8y ago
I'm still puzzled why they went with 6 quad-trees, instead of doing an equal-area projection with 2:1 ratio and quad-treeing that instead. You lose a bit for half the map but you do with 6 sides too (takes 3 bits).
118.
▲
by
gct
8y ago
They don't really, they tried to glue IEEE semantics onto their complex numbers, so they're largely broken in the modern era of auto-vectorizing compilers.
119.
▲
by
gct
8y ago
I'd kind of like to see a screen shot of this
120.
▲
by
gct
8y ago
If you have a reasonable hash function, why is power-of-two and bitmasking bad? If you're uniformly distributed over a range N you'll be uniformly distributed over N/2
More ›