Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
philix001
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
7 ms
·
1.
▲
Compressed Apache Arrow Tables over HTTP
(felipe.rs)
4 points
by
philix001
2y ago
|
0 comments
2.
▲
by
philix001
4y ago
The spec might not even contain the level of detail necessary for that to be possible. That possibility is what makes modeling easier than implementing the spec. Through a process of manual refinement, you can derive an implementation from
3.
▲
by
philix001
4y ago
People that can write proofs in Coq and Isabelle might prefer that over the TLC approach of exhaustively checking all the possible states allowed by a TLA+ spec. But writing proofs in Coq/Isabelle/Lean/HOL is a more sophistic
4.
▲
by
philix001
5y ago
Start looking for small opportunities to do something different and bold. Do that before you're asked to do it. Sooner or later you will get "hired" for the kind of job where you get to do the things you described here. That&
5.
▲
by
philix001
6y ago
You might want to follow the Rust developments in this area: https://areweguiyet.com/
6.
▲
Blend2D – 2D Vector Graphics Engine
(blend2d.com)
159 points
by
philix001
7y ago
|
41 comments
7.
▲
Demystifying JOIN Algorithms
(blog.felipe.rs)
3 points
by
philix001
8y ago
|
0 comments
8.
▲
by
philix001
8y ago
Check my own B+-Tree implementation that I did as an exercise. It's clean and well-commented. https://gist.github.com/philix/236f82183bbb27bd01033f94fe42e... Real database systems are more sophisticated, but the m
9.
▲
by
philix001
8y ago
Goetz Graefe [1] published interesting surveys on B-Trees, query optimization... The Red Book can give you many ideas [2]. Mark Callaghan has been published a lot of stuff related to LSM recently [3]. [1] http://citeseerx.ist.psu
10.
▲
by
philix001
8y ago
Enough material here to scare anyone about databases https://jepsen.io/talks
11.
▲
by
philix001
8y ago
Check Regel. It's very flexible and allows you to generate code for different programming languages. It can also work with binary data. Its main application is generation of optimized network protocol scanners.
12.
▲
In-memory B+ Tree implementation in JavaScript
(gist.github.com)
1 points
by
philix001
9y ago
|
0 comments
13.
▲
Papers I've Read in 2017
(blog.felipe.rs)
16 points
by
philix001
9y ago
|
0 comments
14.
▲
Monorepo First, Submodules Later
(blog.felipe.rs)
2 points
by
philix001
9y ago
|
0 comments
15.
▲
by
philix001
9y ago
They are. I avoided introducing an explanation of Curry-Howard isomorphism because I think that would not be very intuitive to many people because the most commonly used type systems have very little power to express logical properties abou
16.
▲
by
philix001
9y ago
I don't think it's common for programmers to have in depth opinions about type systems. And most of the ones who do may not really know what they're talking about.
17.
▲
Where Do Type Systems Come From?
(blog.felipe.rs)
285 points
by
philix001
9y ago
|
164 comments
18.
▲
Id Software Programming Principles
(blog.felipe.rs)
340 points
by
philix001
10y ago
|
76 comments
19.
▲
by
philix001
10y ago
And some neovim patches are merged upstream.
20.
▲
by
philix001
10y ago
async plugins? true color support? If you have a 32-bit color capable terminal you can use any colorscheme and get real RGB colors.
21.
▲
by
philix001
10y ago
People are free to fork open source projects. tarruda tried to merge the async job system before forking vim. Bram has the right to deny the patches, but the most successful projects are the ones that attract good contributors and don'
22.
▲
by
philix001
10y ago
"Tim Sweeney claims that Microsoft will remove Win32, destroy Steam" http://arstechnica.com/information-technology/2016/07/now-ti...
23.
▲
Leveraging Zero-Cost Abstractions in C++: Variadic Templates
(blog.felipe.rs)
9 points
by
philix001
12y ago
|
0 comments
24.
▲
by
philix001
12y ago
MASM, MS-DOS... 32/64 bit? The hardest thing about learning x86 Assembly is finding a manual that deals mostly with the CPUs ans OSes we use these days.
25.
▲
by
philix001
12y ago
Accounting is actually a language. It's the language of finance. You're probably confusing accounting with finance.
26.
▲
by
philix001
12y ago
To add on what @aktau said: soon we will have much more robust UI tests. The current UI tests are hard to write and based on the ASCII output [2] of the commands of the test [1]. By using the Neovim API we will be able to rewrite these test
27.
▲
by
philix001
13y ago
What if they use BTC as a store of value and not a currency?
28.
▲
by
philix001
13y ago
For a sufficiently big input (N) polynomial will be faster without any doubt.
29.
▲
by
philix001
13y ago
There are cases where the lower bound to solve some problems (e.g. sorting) have been proved to be less than any known algorithm at the time. If you prove that the lower bound for any NP-Complete problem is O(p) where p is a polynomial, the
30.
▲
by
philix001
13y ago
The offer/demand will adjust the price of the remaining bitcoins. Think of lost bitcoins as a small donation to all bitcoin users.
More ›