Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
mortoray
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
11 ms
·
61.
▲
by
mortoray
12y ago
I'm going on what wikipedia describes as [lock-free]( https://en.wikipedia.org/wiki/Lock-free ). In that theoretical sense there is no difference between a mutex lock and a spin-lock. But, they may both be "loc
62.
▲
by
mortoray
12y ago
Note it's important to be "wait-free" and not just "lock-free". The first item here does appear to be "wait-free".
63.
▲
by
mortoray
12y ago
That definitely looks like it's providing the same functionality my ring buffer did. It's impossible to say whether it is as efficient as mine was without profiling it. It's possible. Even if it's almost as efficient, or
64.
▲
by
mortoray
12y ago
It is very unfortunate. On that project we looked at all sorts of ways to avoid burning cores but they all had significant latency issues. If it involved going to the kernel then there was a major context switch overhead. But the big killer
65.
▲
by
mortoray
12y ago
My loop continually checked the buffers and the locks, it never did a noop. Those fenced instructions are probably not the most power efficient. Power consumption was not a concern, latency was our primary goal.
66.
▲
Wait-free queueing and ultra-low latency logging
(mortoray.com)
81 points
by
mortoray
12y ago
|
55 comments
67.
▲
by
mortoray
13y ago
This is a followup to my article "The string type is broken" http://mortoray.com/2013/11/27/the-string-type-is-broken/
68.
▲
Strings and Text are not the same
(mortoray.com)
2 points
by
mortoray
13y ago
|
1 comments
69.
▲
Cannot create a proper clone method with shared_ptr
(mortoray.com)
1 points
by
mortoray
13y ago
|
0 comments
70.
▲
Rejuvenating the ternary conditional with optionals
(mortoray.com)
7 points
by
mortoray
13y ago
|
0 comments
71.
▲
Why do we need pointers/references?
(mortoray.com)
2 points
by
mortoray
14y ago
|
0 comments
72.
▲
by
mortoray
14y ago
That syntax certainly fixes a major problem when dealing with immutables. The mutable-like syntax I find is the cleanest way to construct complex data types. I keep thinking about using only immutables in my language, but I don't think it w
73.
▲
Immutable Values and Invariant Names
(mortoray.com)
1 points
by
mortoray
14y ago
|
2 comments
74.
▲
Why I have my own Android game framework
(mortoray.com)
2 points
by
mortoray
14y ago
|
0 comments
75.
▲
Android NDK Cross-Compile Setup (libpng and freetype)
(mortoray.com)
1 points
by
mortoray
14y ago
|
0 comments
76.
▲
Complexity of simple data types
(mortoray.com)
2 points
by
mortoray
14y ago
|
0 comments
77.
▲
Why I don’t use a Parser Generator
(mortoray.com)
3 points
by
mortoray
14y ago
|
0 comments
78.
▲
Pitfalls of Performance Testing
(mortoray.com)
1 points
by
mortoray
14y ago
|
0 comments
79.
▲
by
mortoray
14y ago
The signature says how you can curry the function, but what I'm saying is that the body of the function is written essentially oblivious to that currying. For example, the body of the function would be written the same if the signature were
80.
▲
by
mortoray
14y ago
It is only a minor issue of inconsistancy (I just don't like picking on the same languages all the time, so I look for examples elsewhere). What I mean is that the signatures have a curried notation, like x -> y -> z, but the functi
81.
▲
Can a language be safe?
(mortoray.com)
2 points
by
mortoray
14y ago
|
5 comments
82.
▲
No new language will stop your program from crashing
(mortoray.com)
1 points
by
mortoray
14y ago
|
0 comments
83.
▲
Preprocessor Case Study: Message Dispatching
(mortoray.com)
1 points
by
mortoray
14y ago
|
0 comments
84.
▲
Abstract Machines, Interpreters and Compilers
(mortoray.com)
2 points
by
mortoray
14y ago
|
0 comments