Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
aptxkid
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
9 ms
·
31.
▲
by
aptxkid
5y ago
LOL sure. I think it's arguably terrible behind the curtain. But the interface provided is pretty elegant IMO.
32.
▲
by
aptxkid
5y ago
Well if this is an improvement or not depends on the use case. E.g. std::function does exactly this. What it achieves is exactly erasing the type (conforming to an affordance). The cost is definitely there. You pay vtable lookup when using
33.
▲
by
aptxkid
5y ago
However the Type Erasure described here doesn't need to know T even when you use it. E.g. it enables things like for (auto x : vec) { x.foo(); }
34.
▲
Type Erasure in C++ Explained
(blog.the-pans.com)
43 points
by
aptxkid
5y ago
|
51 comments
35.
▲
Paxos Commit with Constraints
(blog.the-pans.com)
2 points
by
aptxkid
6y ago
|
0 comments
36.
▲
How C++ typeid operator works
(blog.the-pans.com)
2 points
by
aptxkid
6y ago
|
0 comments
37.
▲
by
aptxkid
6y ago
https://blog.the-pans.com/understanding-paxos/ It’s much easier to understand Paxos as a read-modify-write transaction. I wrote to Lamport about it. Here’s part of Lamport’s reply It’s nice that you found an apparently
38.
▲
RUM Conjecture for Caching
(twitter.com)
1 points
by
aptxkid
6y ago
|
0 comments
39.
▲
std:: Atomic from Bottom Up
(blog.the-pans.com)
1 points
by
aptxkid
6y ago
|
0 comments
40.
▲
Linear scalable read-write lock
(blog.the-pans.com)
1 points
by
aptxkid
6y ago
|
0 comments
41.
▲
Global Data Locality – Why and How
(blog.the-pans.com)
11 points
by
aptxkid
6y ago
|
0 comments
42.
▲
by
aptxkid
6y ago
I don't think this is true. Continuous transition can't be modeled as a state machine as far as I know.
43.
▲
Every Computer System Is a State Machine
(blog.the-pans.com)
71 points
by
aptxkid
6y ago
|
68 comments
44.
▲
by
aptxkid
6y ago
The hard thing to do, which Bezos does very well, is to stay focused, patient and stay invested. Now it’s even easier to be even more patient as amazon has a very deep pocket.
45.
▲
Morse Code Telegraph on a Breadboard
(youtube.com)
1 points
by
aptxkid
6y ago
|
0 comments
46.
▲
2 plus 2 can be 22
(blog.the-pans.com)
1 points
by
aptxkid
6y ago
|
0 comments
47.
▲
API for Assigning Timestamp
(blog.the-pans.com)
2 points
by
aptxkid
6y ago
|
0 comments
48.
▲
Notes on the Google Spanner Paper
(blog.the-pans.com)
2 points
by
aptxkid
6y ago
|
0 comments
49.
▲
Understanding Paxos as a Read-Modify-Write Transaction
(blog.the-pans.com)
2 points
by
aptxkid
7y ago
|
0 comments
50.
▲
Debugging Stack Overflow
(blog.the-pans.com)
1 points
by
aptxkid
7y ago
|
0 comments
51.
▲
Re-Entrant vs. Thread-Safe
(blog.the-pans.com)
3 points
by
aptxkid
7y ago
|
0 comments
52.
▲
by
aptxkid
8y ago
To me, using vim is more about forcing me to understand how things work, or rely less on some IDE magic. IDEs are powerful. It’s too powerful that I don’t know how certain functionalities work. Maybe it’s just me lol.
53.
▲
Discover Paxos via 2pc
(blog.the-pans.com)
1 points
by
aptxkid
8y ago
|
0 comments
54.
▲
How to compare small versions that wrap around
(blog.the-pans.com)
1 points
by
aptxkid
8y ago
|
0 comments
55.
▲
by
aptxkid
8y ago
Thanks! That makes much more sense!
56.
▲
Notes on the Amazon Aurora Paper
(blog.the-pans.com)
139 points
by
aptxkid
8y ago
|
42 comments
57.
▲
Two Phase Commit or Not
(blog.the-pans.com)
1 points
by
aptxkid
8y ago
|
0 comments
58.
▲
Debugging Random Program Behavior
(blog.the-pans.com)
1 points
by
aptxkid
8y ago
|
0 comments
59.
▲
by
aptxkid
8y ago
If you read it closely, this is very similar to RAMP transaction. Both has pretty significant write amplification for storing transaction metadata and multiple versions of each key. By storing txn metadata and multiple versions, it provides
60.
▲
Consistent Badge Count at Scale
(blog.the-pans.com)
1 points
by
aptxkid
8y ago
|
0 comments
More ›