Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
anderskaseorg
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
17 ms
·
61.
▲
by
anderskaseorg
4y ago
Because, what, Python doesn’t have any language details related to method lookup that might require a sentence or two of technical explanation? __getattr__, __getattribute__, __get__, base classes, metaclasses, __mro__, __mro_entries__, __
62.
▲
by
anderskaseorg
4y ago
> With the code above, Rust does not know whether we want to clone Arc or the actual inner value, so the code above will fail. This is incorrect. The code works fine as written; Rust will let you write .clone() and it will clone the A
63.
▲
by
anderskaseorg
4y ago
The finite difference method of that video is only useful for finding polynomial sequences. Of course, any finite sequence can be extended to some polynomial, but in many cases (such as this one) that’s not the result you’re looking for.
64.
▲
by
anderskaseorg
4y ago
DoT is DNS over TLS: https://techdocs.akamai.com/etp/docs/configure-dot-doh , https://www.cloudflare.com/learning/dns/dns-over-tls/ , https://developers.google.com/spe
65.
▲
by
anderskaseorg
4y ago
Perhaps the most important difference is that expressions re-evaluate automatically on changes. You don’t have to go manually rerun all the dependent expressions, or wait for the kernel to restart, or worry that some of the results you’re
66.
▲
by
anderskaseorg
4y ago
The context is > For your dependency/versioning issue, use a virtualenv per-project and pin your dependency versions in requirements.txt requirements.txt is not uploaded to PyPI and has no effect on your package’s dependencies whe
67.
▲
by
anderskaseorg
4y ago
> For example, you basically never care whether something is exactly of type list, you care about things like whether you can iterate over it or index into it. This is an odd complaint. typing.Sequence[T] has been there since the first
68.
▲
by
anderskaseorg
4y ago
Yes, as of last month. I’m not sure if it works with YAPF; it’s designed to work with Black and doesn’t currently have many of isort’s configuration options. Worth a try!
69.
▲
by
anderskaseorg
4y ago
You should not pin the public requirements that get uploaded with a library (listed in setup.py, setup.cfg, or pyproject.toml), since that will restrict your downstream users, leading to version conflicts and persistent security vulnerabili
70.
▲
by
anderskaseorg
4y ago
If you aren’t happy with Flake8, Pylint, and isort (or maybe if you are!), I recommend checking out Ruff: https://github.com/charliermarsh/ruff It’s literally 100 times faster, with comparable coverage to Flake8 plus d
71.
▲
by
anderskaseorg
4y ago
A passively safe reactor was demonstrated 36 years ago. https://en.wikipedia.org/wiki/Experimental_Breeder_Reactor_I... Most reactors today are older or based on older designs, but this is largely for regulatory reason
72.
▲
by
anderskaseorg
4y ago
SHA-256 is vulnerable to a length extension attack. This is well-known to cryptographers; it doesn’t matter for some applications and can be worked around in others. But it still catches some developers unaware. https://en.wiki
73.
▲
by
anderskaseorg
4y ago
The creator of the original Markdown requested that the standardized version be renamed to avoid using the word “Markdown”. https://blog.codinghorror.com/standard-markdown-is-now-commo...
74.
▲
by
anderskaseorg
4y ago
There’s no “larger glider”. The name “glider” refers to a single specific pattern of five cells. https://en.wikipedia.org/wiki/Glider_(Conway%27s_Life)
75.
▲
by
anderskaseorg
4y ago
Your code does deadlock. https://play.rust-lang.org/?version=stable&mode=debug&editio... The parent comment correctly explained that it would be incorrect for a Mutex<A> to hand out unique references &mut
76.
▲
by
anderskaseorg
4y ago
You may want to take a look at the monotonic commit numbering scheme that Git already has, before trying to hack one into the hashes: https://git-scm.com/docs/git-describe
77.
▲
by
anderskaseorg
4y ago
The article’s objection to “parenthesized nonsense” is about the nonsense, not the parentheses. 3(%edi,%ebx,8) is hiding a multiplication, two additions, and a memory access, in an order that you wouldn’t guess from the syntax.
78.
▲
by
anderskaseorg
4y ago
https://www.cnbc.com/2022/10/13/el-salvadors-bitcoin-holding... shows a pretty different picture of both the prevalence and the usefulness of Bitcoin in El Salvador.
79.
▲
by
anderskaseorg
4y ago
Yeah, title should be Memtest86+ 6.0.0, not Memtest86 6.0.0. The original (PassMark) Memtest86 has been proprietary since 2013.
80.
▲
by
anderskaseorg
4y ago
An even more fine-grained binary search technique for isolating compiler bugs is optimization fuel: http://blog.ezyang.com/2011/06/debugging-compilers-with-opti...
81.
▲
by
anderskaseorg
4y ago
Why use tar | pigz -0 when you can just use tar?
82.
▲
by
anderskaseorg
4y ago
Type guards in TypeScript are not sound: the language makes no effort to prevent you from defining an incorrect type guard that, when used, narrows your variables to incorrect types. Your mistake won’t be caught at compile or at runtime (u
83.
▲
by
anderskaseorg
4y ago
The post doesn’t suggest there’s any mandated quota for hiring or promotion—only for interviews or consideration. And it doesn’t suggest any secrecy about this policy.
84.
▲
by
anderskaseorg
4y ago
I think part of the parent’s complaint is that, although 23976/1000 fps is much more accurate than 24 fps, it’s still very slightly slower than the correct value 24000/1001 fps, by about 2.1 frames per day.
85.
▲
by
anderskaseorg
4y ago
There are false negatives, such as the one mentioned in the post after “A particularly dangerous pitfall with set -e is combining functions with conditionals.”
86.
▲
by
anderskaseorg
4y ago
The post expresses no opinion on whether placing Tailwind class names directly on the HTML tags is better or worse than placing them in CSS. It’s merely saying that the mini-language of Tailwind class names themselves (regardless of where
87.
▲
by
anderskaseorg
4y ago
The sense in which the Lisp code (list 'lambda (list 'x) x) evaluates to the data representation of (lambda (x) x) is exactly the same as the sense in which the lambda calculus code λa. λb. λc. c (λx. λa. λb. λc. a x) evaluates to
88.
▲
by
anderskaseorg
4y ago
Yes, I was clear above that I know ' means quote. My experiment is to compare Lisp to a restriction of Lisp where quote only works on symbols. This restriction doesn’t make it any harder to write a self-interpreter. > If we have
89.
▲
by
anderskaseorg
4y ago
The situation with Lisp is exactly the same. To run a Lisp self-interpreter, we don’t pass it a Lisp function: (interpret (lambda (x) x)) but rather an encoded version of that Lisp function’s code: (interpret (cons 'lam
90.
▲
by
anderskaseorg
4y ago
There is. Using the Mogensen–Scott encoding, a self-interpreter can be written in lambda calculus as (λf.ff)(λf.λt.t(λx.x)(λm.λn.ffm(ffn))(λm.λv.ff(mv))), which is a direct translation of the equivalent Haskell code data Term t = Var
More ›