noctune

9 ms·

31.
by noctune 4y ago
That is true, but assuming file I/O is blocking you also have to pay for a context switch to take advantage of that. But I guess you could avoid that using eg. io_uring.
32.
by noctune 4y ago
Akka's new license is highly likely incompatible with the Apache Software Foundation requirements for third party licenses. "Additional use grant" might mean a OSS project does not have to pay, but it still puts heavy restric
33.
by noctune 5y ago
I think it's a difference in what one considers to be "the API". Linux is very much to the de facto API side, whereas some other project might be more one the de jure API side with a rigid specification and allowing any chang
34.
by noctune 5y ago
What if you have something like (relatee_a_id, relatee_b_id, [rest of relation fields ...]) with the constraint that relatee_a_id < relatee_b_id? Granted, it might not be very nice to query.
35.
by noctune 5y ago
>High-performance Java is indeed basically writing C in Java, including using you own byte array for memory. Oh, I wish. For example, in C you can easily return multiple values through pointers. In Java, you have no such luxury without a
36.
by noctune 5y ago
IMO, it's much the same and pretty much only a question of API. Property-based testing (like QuickCheck) generates randomness using a PRNG, creates a structure from that, and checks that some property holds for that structure. A fuzzer
37.
by noctune 5y ago
It's similar in Denmark. I basically got three months pay in compensation when I changed jobs while under a non-compete - which ironically incentivizes finding a new job.
38.
by noctune 5y ago
Both those situations are race conditions, but neither are data races. Rust only prevents data races, which is a specific kind of race condition, but it does not prevent race conditions in general.
39.
by noctune 5y ago
Nice site. I'm not sure the dropdown looks great on OS X though. On OS X, the selected option is prepended with √, so it looks like √ Feature √ Feature √ No Feature Selecting the second element then shows Feature
40.
by noctune 5y ago
I did something similar to this and saw a significant performance boost. It was OLAP though - so very read heavy and few to no random writes.
41.
by noctune 5y ago
I especially feel the proposed solution could be problematic given that the data is supposed to be transient. How are keys deleted from the "id | value" tables when rows are deleted from the main table? Does it just keep accumulat
42.
by noctune 5y ago
>Calculating the average value for some observation in a time bucket, where some buckets may have no observation (resulting in 0/0=nan) But there are many ways such a calculation could result in NaN besides a division. For example,
43.
by noctune 5y ago
> - The cost associated with purchasing tokens needed to initialize an account on the blockchain would serve as a spam prevention mechanism; an alternative to SIM cards which most centralized services rely on today as a cost barrier to l
44.
by noctune 5y ago
You should check their MH17 coverage.
45.
by noctune 5y ago
It's the same dilemma though. Now you are raising the humidity around you, making other peoples' sweat less effective at cooling them. Although lowering humidity can be more easily done with just ventilation.
46.
by noctune 5y ago
IMO, search is a pretty significant part of docs and I haven't seen a good way doing that without either javascript or a web server. But other than that, yeah, you don't really need JS.
47.
by noctune 5y ago
This leads to fun things like the regex [a-z][a-z] not matching the string "aa" in SQL Server when using the Danish collation.
48.
by noctune 5y ago
The entropy of 1e6 sorted 32 bit integers is log2((2*32+1e6-1) choose 1e6) bits or about 1.61 MiB, so it should be possible. Really difficult, obviously, but possible.
49.
by noctune 6y ago
It is Turing complete if you access the tape using something like fread/fwrite.
50.
by noctune 6y ago
You could change the drop semantics to drop as soon as a variable is no longer used/borrowed (as opposed to now when it goes out of scope). But IMO that does not seem like it's worth it considering how less predictable it would ma
51.
by noctune 6y ago
Until Russia starts catching the leakers using something like a canary trap [1]. [1]: https://en.wikipedia.org/wiki/Canary_trap
52.
by noctune 6y ago
Just write JSON and pretend it's YAML. YAML is a superset of JSON so there's no need to generate "nice" YAML if there isn't a human reading or writing it.
53.
by noctune 6y ago
> * Try implementing an on-disk hash table in Python and you're stuck manually packing ints and longs in an out of arrays. In C++ it could a simple template used with a memory-mapped file. This is only simpler if you don't need
54.
by noctune 6y ago
`using` composes badly. It won't work with eg. a list of Disposables or Linq.
55.
by noctune 6y ago
And if you only need a monotone priority queue (i.e. priority queue where the popped elements are monotonically increasing/decreasing) you should consider using a radix heap. This monotone requirement can be satisfied more than you wou
56.
by noctune 6y ago
>if he is really rigging elections, would he really go for such unrealistic number You are assuming someone has an overview of the rigging being done. It's probably more chaotic than that. If 1000 different people are chucking oppon
57.
by noctune 6y ago
Bizarre - the site has javascript that disables selecting text on the article because "Content is protected".
58.
by noctune 6y ago
My uncle spent some weeks doing DIY projects with asbestos. Hes has mesothelioma now. Turns out he has (along with many in our family) a genetic disorder that makes certain cancers like mesothelioma much more likely.
59.
by noctune 6y ago
>And deeply nested object hierarchies are a no-go, too, because of the inability to do "partial borrows" of just a single field of a struct. I'm not totally sure if this is what you mean, but FYI you can borrow multiple fi
60.
by noctune 6y ago
> Both min and max should return NaN, if any of their parameters is NaN. That's not a given, though. IEEE 754-2008 defined min and max as returning the non-NaN parameter. They have been removed in IEEE 754-2019 though.

More ›