Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
judofyr
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
33 ms
·
301.
▲
by
judofyr
7y ago
Interesting. I've always thought that there's no real reason why e.g. Ruby has to be context-sensitive. Yes, I am aware of the fact that local variables are resolved statically, but do they have to be resolved during parsing ?
302.
▲
by
judofyr
7y ago
> Basically no serious programming language uses bison or flex, https://en.wikipedia.org/wiki/GNU_Bison#Use : Ruby, PHP, GCC until 2004, Go, Bash, PostgreSQL, MySQL, Perl. Can we stop with this "duh, real progra
303.
▲
by
judofyr
7y ago
(Author here!) > This isn't the author's only reason to dismiss that alternative approach, but it's still a strange point to spend almost an entire paragraph on. If all the targets the author currently envisions are GC
304.
▲
by
judofyr
7y ago
(Author of the article here) > Many production compilers have hand-written parsers because of error reporting, not because of issues with parser-generator algorithms. Yes! I totally agree. Error reporting was one of the things I meant wh
305.
▲
by
judofyr
7y ago
Author of the article here. Thanks for your comments! > 1. You claim the algorithm used guarantees O(n^3) for all CFGs, but is different from Earley and CYK. Are there more details for this algorithm, perhaps with a rigorous mathematical
306.
▲
by
judofyr
7y ago
All of these discussions seems to forget that React hooks is two different things combined: (1) it's a new magic way of having stateful components and (2) it's a new set of APIs. I don't quite see why they _have_ to be so cou
307.
▲
by
judofyr
7y ago
No. This is a preliminary study of a new fasting method. There is no-one who is deliberately spreading this on social media to advance their own political situation.
308.
▲
by
judofyr
7y ago
I've read the README (and I've also used git-subtree in the past), but it's still a bit unclear to me how this is intended to be used. What's the typical flow? - When should I run `subtrac update`? Only once? After every
309.
▲
by
judofyr
7y ago
> Since cells need to be 32-bit for counting more than 255 words, you’ll also need to replace the few occurrences of char to int. Well, part of the fun of Brainfuck is working around the limit of 8-bit cell size. How about creating a ver
310.
▲
by
judofyr
7y ago
{any technology} {any year}: writing a post summarizing X products' issues will compel a point by point response in which a fanboy will either tell you "works for me" or "you're holding it wrong".
311.
▲
by
judofyr
7y ago
> This is non-sensical. Your examples are kinda proving yourself wrong though. > Take a highly nested JSON document and try and implement it in a relational database. You would have an O(1) lookup in MongoDB and a O(n) lookup in MySQL
312.
▲
by
judofyr
7y ago
> What is the result of "badger"+2 The same result as `convert_to_number("badger") + convert_to_number(2)`. In Z it seems that converting an invalid string to number yields NaN, so "badger" + 2 returns NaN.
313.
▲
by
judofyr
7y ago
I love seeing more Ruby implementations! Looking forward to seeing how it will progress. Are there any details on how it’s implemented? How does it execute Ruby? Does it have its own bytecode? Does it compile to machine code on the fly? Wha
314.
▲
by
judofyr
7y ago
Oh, sorry, I was imprecise: I meant " distributed database as a library". As in, you compile/bundle your application logic together with the persistence/replication/transaction logic and that is what you're ru
315.
▲
by
judofyr
7y ago
> I finally have a good reference to point folks to when I get the question about why I'm not using redis. What are you using instead?
316.
▲
by
judofyr
7y ago
This paper is very light on details. It defines "RInK architecture" as something which uses stateless application servers w/ key-value store as backend (Redis/Memcached). Section 3 then shows that it's faster to use
317.
▲
by
judofyr
8y ago
> Wait, what? Why would self-reported feelings not be taken as strong evidence? Because you might be stuck in a local maxima that's close to your global minima. I've been reading "Why We Sleep", and while I don't
318.
▲
by
judofyr
8y ago
Congratulations; this looks like some seriously nice results! I haven't used FaunaDB, but it's nice seeing your name around. I still remember your personal blog (blue/grey color; with flowers, right?) fondly from way back, an
319.
▲
by
judofyr
8y ago
Sounds like you've been shadow banned. You should contact hn@ycombinator.com and hear if there's been a mistake.
320.
▲
by
judofyr
8y ago
https://codesandbox.io/s/5vvm68k6qp . The custom effects would take functions instead of values and then `useEffect` will be executed by the component. There's certainly some issues in this implementation with rega
321.
▲
by
judofyr
8y ago
But why does Hooks need to be implemented on top of functions and not classes? The way I see it is that Hooks today implements two distinct things: (1) a composable way to handle lifecycle and (2) a custom way to store state. Why can't
322.
▲
by
judofyr
8y ago
Soo, why couldn't this be implemented as: class ToggleButton extends React.Component { flag = useState(this, true) count = useState(this, 0) other = useEffect(this, () => { ... }) render
323.
▲
by
judofyr
8y ago
> Also, they didn't define success. It's mentioned in the paper. https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3107898 > First, we examine continuation of business operations at the time of the su
324.
▲
by
judofyr
8y ago
In the Ruby world this is called "out-of-band GC" and is supported by multiple application servers: http://tmm1.net/ruby21-oobgc/
325.
▲
by
judofyr
8y ago
I’ve had that feeling, and I started making an effort to improve myself. I started time-tracking my side projects (“you can’t improve what you don’t measure”), scheduling time for learning, and set up an automatic summary sent on email ever
326.
▲
by
judofyr
8y ago
Looking at the recent patches[1] for Stockfish it seems like a rather true statement? Most of the patches are related to how it evaluates a position; not how it prunes/searches the tree of possible moves. Here's one random test wh
327.
▲
by
judofyr
8y ago
It's an awful amount of characters once you multiply it. For instance, the first example ( https://tailwindcss.com/docs/what-is-tailwind/ ) would be twice as big: <img class="block h-16 sm:h-24 ro
328.
▲
by
judofyr
8y ago
It's based on how often you use a helper. For instance, changing letter spacing is verbose ( https://tailwindcss.com/docs/letter-spacing ) as it's not something you use that often. Tweaking spacing is very co
329.
▲
by
judofyr
8y ago
> Proving I had certain information at certain time point The blockchain solves the problem of proving ownership of a transferable asset. If you just want to prove that you have certain information at a certain time point there are much
330.
▲
by
judofyr
8y ago
Yesss, finally a use-case for the `<noframes>`-hack! This is actually even better than the approach of OP since we're guaranteed to get a plain text representation of the text (instead of the browser parsing it as HTML). example.
More ›