Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
ttfkam
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
33 ms
·
361.
▲
by
ttfkam
3y ago
> I read it far enough Clearly not since the crux of both lawsuits has nothing to do with the build quality of cups or lids. Entertaining overview: https://youtu.be/KNWh6Kw3ejQ Lawyer's examination: https:/&#x
362.
▲
by
ttfkam
3y ago
Tell us you didn't read the linked article or the history of the original hot coffee lawsuit without actually saying you didn't read it.
363.
▲
by
ttfkam
3y ago
1. New product! 2. Why can't we get more traction? 3. Refuse to see pattern that folks won't adopt a service they expect to disappear. 4. Kill product! 5. Goto 1 La plus ça change, la plus même chose.
364.
▲
by
ttfkam
3y ago
Some people, when confronted with a problem, think, “I know, I’ll use threads,” and then two they hav erpoblesms. – Ned Batchelder
365.
▲
by
ttfkam
3y ago
> Thinking about the kind of life they had terrorizes me. I don't get how, for the longest time, people were fine with that. A non-trivial number of these mine workers were arrested on trumped up charges like "vagrancy" fo
366.
▲
by
ttfkam
3y ago
I think you mean findOneAndUpdate, and while simple, I wouldn't call it solid. https://stackoverflow.com/a/76821755
367.
▲
by
ttfkam
3y ago
This is excellent, if bare bones. It's meant for "the clean slate" style of CSS development. To be honest, I do less and less of starting from zero. Another style is a more built up starting point like PicoCSS. https:/&
368.
▲
by
ttfkam
3y ago
Non-blocking I/O channels use fewer threads (native or green) than tasks. Some programming languages ARE designed to handle this: they use async/await. You could argue that Go does this more elegantly with goroutines, but this fur
369.
▲
by
ttfkam
3y ago
Naive threads and async are for fundamentally different tasks: Threads are for working in parallel, splitting a single compute-intensive tasks into many. Async is for waiting in parallel for disk I/O results, database queries, network
370.
▲
by
ttfkam
3y ago
That's completely true. A concede the point.
371.
▲
by
ttfkam
3y ago
You obviously keep the amount of JS logic to a minimum in your templates. I have encountered many React codebases that did not do this.
372.
▲
by
ttfkam
3y ago
Svelte Stores are observables, just without the extra boilerplate.
373.
▲
by
ttfkam
3y ago
But have you used 2-way binding with a more modern framework? Or are you still hanging on to your experience with a defunct framework like Knockout from over a decade ago? And don't get me started on React's "put all the logi
374.
▲
by
ttfkam
3y ago
Let's be honest: the state (see what I did there?) of React state management is a dumpster fire. https://fe-tool.com/awesome-react-state-management That's an article listing the top 18 state management libraries f
375.
▲
by
ttfkam
3y ago
> An analogous concept might be quite interesting to implement in all these signal based frameworks as well. Which is what Svelte 5 is doing with its compiler. > […] given a large enough codebase, that sort of spaghetti mess will emer
376.
▲
by
ttfkam
3y ago
This was more informative than I expected it to be.
377.
▲
by
ttfkam
3y ago
Seriously underrated library.
378.
▲
by
ttfkam
3y ago
Excellent, thank you for the response.
379.
▲
by
ttfkam
3y ago
Yup. "SQL doesn't have first-class query objects and isn't composable." Uh… views, set-returning functions, temporary tables, CTEs… "No, not like that! Something not declarative and set-oriented!" SQL is declar
380.
▲
by
ttfkam
3y ago
> Doesn't it seem weird that dozens of application languages have become popular since the 1970s, but we're still using dialects of the same old database query language? Indeed. Do you honestly believe that a half-century of da
381.
▲
by
ttfkam
3y ago
How would LINQ make jsonpath queries or unroll arrays on the database with unnest?
382.
▲
by
ttfkam
3y ago
Might be. Schools have a lot of roof space and busses are generally used only twice a day at low speeds with multiple-minute stops for a total of 60-90 minutes per interval. A lot of sun in Los Angeles to charge between 8:30a-2pm and 4pm-su
383.
▲
by
ttfkam
3y ago
> For context, PRQL's Readme specifically states Be honest. If a different project touted itself as a standard and a firm foundation on its public website but had this disclaimer on the source repo's README file, what would you
384.
▲
by
ttfkam
3y ago
You can in Postgres. It's not often a good idea since it would constitute an optimization fence and potentially buffer large values in memory, but you can absolutely do this in a function variable. record[] some_table_name[]
385.
▲
by
ttfkam
3y ago
When viewed as a DSL for set theory, views, CTEs, set-returning functions, et al are indeed proper first-class query abstractions. When viewed through the lens of general purpose imperative or functional programming languages, it's eas
386.
▲
by
ttfkam
3y ago
USING just presumes the columns have the same name on both ends. There is no logical "combining", only a lexical one. It's why many DB admins/engineers use "foo_id" instead of "id" in their schemas as
387.
▲
by
ttfkam
3y ago
Agreed. Got off on the wrong foot. I and others have noted what appeared to be overzealous marketing, and I previously asked questions regarding DB engine-specific features like jsonpath, unnest for arrays, etc. The responses from the PQRL
388.
▲
by
ttfkam
3y ago
Wonderful! Just some possibilities for optimization of the recursive CTE. (I haven't tested it and don't know if it'd automatically improve things.) WITH RECURSIVE _recursive_cte AS MATERIALIZED ( … ) https:/&#
389.
▲
by
ttfkam
3y ago
Agreed. Also, someone who ISN'T good at SQL can look at EXPLAIN output and see where the query planner HAS gone wrong. Adding PRQL to the mix unambiguously makes that analysis and optimization step harder.
390.
▲
by
ttfkam
3y ago
Be honest. C to object code to linker to final binary are a MUCH bigger leap than PRQL to SQL. You make it sound like SQL is some insurmountable hurdle while PRQL is a bunny slope. You're not getting anywhere with that nonsense. [Discl
More ›