Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
benhoyt
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
43 ms
·
511.
▲
by
benhoyt
7y ago
> SQL is just an ugly historical accident. Maybe, but as Bjarne Stroustrup said: "There are only two kinds of languages: the ones people complain about and the ones nobody uses." SQL seems like that: pragmatic, not perfect, but
512.
▲
Ask HN: Where to seek funding for agri-tech beehive monitoring startup?
1 points
by
benhoyt
7y ago
|
1 comments
513.
▲
by
benhoyt
7y ago
I co-founded a beehive monitor startup with my brothers in New Zealand (they run it now): https://hivemind.nz It's an electronic device that sits underneath your beehives and weighs the amount of honey in the hive, sending
514.
▲
Learning Elm by porting a medium-sized web front end from React
(benhoyt.com)
1 points
by
benhoyt
7y ago
|
0 comments
515.
▲
by
benhoyt
7y ago
In particular I know that Go's GC is optimized for very low latency (rather than throughput), and is not a stop the world GC. So I'm wondering why it doesn't work for games? Are the pauses still too high for games, or is he m
516.
▲
by
benhoyt
7y ago
The format feels ad-hoc to me. These are intended almost exclusively for machine-reading, so why not JSON? One of the proxy endpoints (version metadata) returns JSON, so why not this one? If I were writing the client, I'd much prefer t
517.
▲
Solving Polyomino and Polycube Puzzles
(mattbusche.org)
2 points
by
benhoyt
7y ago
|
0 comments
518.
▲
by
benhoyt
7y ago
The draft design is long, however, I don't think by itself that's an indication of complexity, and this would be a fraction of the size in the actual spec. This is tutorial-like in places, with many code examples (more than a thir
519.
▲
How to use Go's proposed try() for error handling
(faiface.github.io)
1 points
by
benhoyt
7y ago
|
0 comments
520.
▲
by
benhoyt
7y ago
I like the simplicity of this (very Go-like). However, what are the performance implications of only being able to get one pixel value at a time? Wouldn't it be much less efficient than say "get this line of pixels" or "
521.
▲
A proof-of-concept implementation of a generics proposal for Go
(github.com)
4 points
by
benhoyt
7y ago
|
0 comments
522.
▲
by
benhoyt
7y ago
They parse the script to a parse tree (abstract syntax tree) and then either interpret that directly (tree-walking interpreter) or compile to bytecode and then execute that. The original awk ("one true awk") uses a simple tree-wal
523.
▲
by
benhoyt
7y ago
Yeah, good question. I wanted to do that, but GoAccess is a web server log parser and doesn't support custom fields (you don't get screen resolution via web logs, so it kinda makes sense). See: https://goaccess.io/
524.
▲
by
benhoyt
7y ago
> I would really love it if GitHub pages or Netlify can provide some simple server-side tracking. It doesn't match GA but in some cases that's all I need. That would be a great feature for GitHub Pages! Just a simple interface
525.
▲
Show HN: I replaced Google Analytics with simple log-based analytics
(benhoyt.com)
475 points
by
benhoyt
7y ago
|
137 comments
526.
▲
Replacing Google Analytics with GoAccess
(benhoyt.com)
3 points
by
benhoyt
8y ago
|
0 comments
527.
▲
by
benhoyt
8y ago
To be fair, there aren't "banner ads" on either the Google homepage or the search results pages. Neither are there "crazy, flashy, graphical doodads flying and popping up". There are definitely ads on the search res
528.
▲
Crafting Interpreters: Global Variables
(craftinginterpreters.com)
6 points
by
benhoyt
8y ago
|
0 comments
529.
▲
by
benhoyt
8y ago
Nice! Writing a Forth in 8086 assembly was how I got into programming as a teenager too (my Dad had been into Forth as a hobby for a long time). It was a great way to start -- a Forth compiler/system is relatively simple to build yours
530.
▲
by
benhoyt
8y ago
I think this is a really good point. While I like the article's focus on depth, and thinking about the small stuff is important, saving a few bytes on headers is going to be blown out of the water by all the images, JS, CSS, and 3rd-pa
531.
▲
by
benhoyt
8y ago
Odd, I've rarely had this issue, and almost never need to do complicated math on the index of a range (maybe "multiply by two and add one" kind of stuff, but nothing from the "math" pkg). Also, note that the math.*
532.
▲
by
benhoyt
8y ago
Sure! I also don't have a formal CS background (I studied electrical engineering without doing any programming / CS courses). Bob Nystrom's free online book http://www.craftinginterpreters.com/ is excellent.
533.
▲
by
benhoyt
8y ago
I can't tell you what motivates others, but I know what motivated me with GoAWK: intellectual curiosity, and the desire to learn how to use Go's profiling tools on a non-trivial project.
534.
▲
by
benhoyt
8y ago
The Bresenham Circle Algorithm is cool too. You can draw a circle with it in just a few lines of code: https://en.wikipedia.org/wiki/Midpoint_circle_algorithm
535.
▲
by
benhoyt
8y ago
> You can write a lisp in a few lines of Forth. Seems unlikely. Forth isn't garbage collected, is untyped, etc etc. So you'd have to add those things in "a few lines". Though I guess it depends what you mean by "
536.
▲
A Lox interpreter implemented in Lox
(benhoyt.com)
3 points
by
benhoyt
8y ago
|
0 comments
537.
▲
by
benhoyt
8y ago
I'm curious what benchmarking / research you've done on how much difference it makes to use a compact value representation (like the NaN tagging used in Wren, or using the low bits of a pointer to specify object type). Is it
538.
▲
Crafting Interpreters: Strings
(craftinginterpreters.com)
107 points
by
benhoyt
8y ago
|
40 comments
539.
▲
by
benhoyt
8y ago
Heh, not quite. Go (the programming language) uses Google Groups (golang-nuts and golang-dev), and it's very alive.
540.
▲
by
benhoyt
8y ago
Couple of reasons. 1) Because I'm a fan of few dependencies and lex/yacc are non-Go dependencies. 2) I've never used them and it'd probably take me longer to learn them than hand-write a lexer and parser. 3) Writing a le
More ›