Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
geal
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
8 ms
·
31.
▲
How We Cut Latency Down by 30k% on Our Git Server
(clever-cloud.com)
9 points
by
geal
11y ago
|
2 comments
32.
▲
by
geal
11y ago
That's nice to know, thanks!
33.
▲
by
geal
11y ago
Nom works on stable, but there are nice things you can do if you use the nightly, like matching on error codes with slice or box patterns ( https://github.com/Geal/nom/wiki/Error-management#with-slice... ) or
34.
▲
by
geal
11y ago
Parser combinators are recursive descent parsers, so they do not manage ambiguities at compile time. At runtime, the first parsing path that works will win. Nom can handle easily regular, context-free and context sensitive grammars (a lot o
35.
▲
by
geal
11y ago
I have never used pyparsing, but the approach seems similar. Right now, the only real limitation is that I still have a few combinators to implement. Otherwise, anything complex you might want can be done by writing a simple function.
36.
▲
by
geal
11y ago
I do not know if it is faster, I should add it to the benchmarks :) The biggest difference here is the use of a syntax extension to parse the grammar. This is something I would like to do at some point, because it can make the code nicer. R
37.
▲
by
geal
11y ago
That's a fun numbering scheme, but it might be cumbersome in the long run, right? It's named that way because a nom parser takes a byte of data ;)
38.
▲
by
geal
11y ago
yes, that's the plan! I had to take care of the basic tools and the plumbing first, but I'll add better algorithms.
39.
▲
by
geal
11y ago
The parser combinators are a common approach in functional languages. Basically, instead of generating the whole parser from a grammar, you assemble a lot of small functions, in other functions. The resulting code often ressembles the gramm
40.
▲
by
geal
11y ago
I really like your approach with trait objects. This is something I would have liked in nom when I started it, but macros proved more useful for my experimentations (less types to rewrite when I change something). For the streaming part, it
41.
▲
by
geal
11y ago
Hi all, Nom's author here. I wrote this paper in January 2015, so some things changed in the meantime: - the benchmarks have been optimized a bit, and someone contributed a cereal parser that beats nom ( https://github.com&#
42.
▲
by
geal
12y ago
If you have any questions, feel free to poke me. This tutorial was fun to do :)
43.
▲
Smalltalk in 2015, heading for the cloud
(clever-cloud.com)
18 points
by
geal
12y ago
|
1 comments
44.
▲
A world without certificate authorities
(unhandledexpression.com)
1 points
by
geal
12y ago
|
0 comments
45.
▲
Programming VS Mathematics and other pointless debates
(unhandledexpression.com)
1 points
by
geal
12y ago
|
0 comments
46.
▲
by
geal
12y ago
This is a really interesting perspective. THe most important secret you have to manage is often the private key used for TLS, but in usual architectures, it must be present on all of your front servers. This is a good way to compartmentaliz
47.
▲
by
geal
12y ago
We don't really like that kind of advertisement in our workplace. He brought it there just to share the WTF moments. PCSoft never ceases to amaze us. A very bad language and an even worse marketing strategy, but the company still works
48.
▲
You've convinced me boss, I'll work with Windev and PC Soft
(blog.clement.delafargue.name)
35 points
by
geal
12y ago
|
11 comments
49.
▲
The problem with the meritocracy
(unhandledexpression.com)
4 points
by
geal
13y ago
|
0 comments
50.
▲
by
geal
13y ago
In fact, the app ships with a bunch of RSA 2048 keys that are used for that part. But there is no revocation support.
51.
▲
by
geal
13y ago
I wrote that article, and I think you are right. That was not the right tone for a review of a new product, even if Telegram's attitude (in particular here https://news.ycombinator.com/item?id=6913456 ) has been of den
52.
▲
by
geal
13y ago
That would be a good idea. That way, everytime someones enters their key, the app can answer that it is not there, check its presence in the database, then get the money :p It will never get the entire list anyway...
53.
▲
by
geal
13y ago
Yup, improving the screenshots would be a good idea. The result pretty much displays as is in the app (in fullscreen), with only one icon above.
54.
▲
Show HN: HDBT, an Android alternative to FrontBack written in Scala
(play.google.com)
1 points
by
geal
13y ago
|
2 comments
55.
▲
Handling IO failure
(unhandledexpression.com)
2 points
by
geal
13y ago
|
0 comments
56.
▲
Digging the gold from the App Store
(accidentaltechnologist.com)
1 points
by
geal
13y ago
|
0 comments
57.
▲
MySQL is to SQL like MongoDB to NoSQL
(use-the-index-luke.com)
97 points
by
geal
13y ago
|
124 comments
58.
▲
by
geal
13y ago
What were the reasons for this lateness? IIRC there were patent issues for some curves, but is that the only reason?
59.
▲
by
geal
13y ago
Increasing key length has been the main way to protect crypto from Moore's law. That law is somewhat predictable: we can now how much time a key can hold depending on ressources needed to crack it. The real problem here: cryptanalysis
60.
▲
by
geal
13y ago
Basically, Diffie Hellman is a key exchange algorithm, without authentication. So using just this algorithm would not protect from MITM. But the OTR protocol can be effectively adapted to email. It would need a few emails to establish the o
More ›