ot

30 ms·

421.
std::format in C++20(zverovich.net)
6 points by ot 7y ago|0 comments
422.
The Last Working Olivetti Mainframe Sits in a Tuscan High School(spectrum.ieee.org)
6 points by ot 7y ago|0 comments
423.
by ot 7y ago
It's like a visual version of the Shepard tone https://en.wikipedia.org/wiki/Shepard_tone
424.
by ot 7y ago
This is mentioned in the article, together with a method to keep the order by decorating with the line number before sorting.
425.
by ot 7y ago
No, most implementations of sort use a bounded memory buffer and an external-memory algorithm, spilling to disk.
426.
Understanding Real-World Concurrency Bugs in Go [pdf](songlh.github.io)
2 points by ot 7y ago|0 comments
427.
Estimating branch probability using Intel LBR feature(easyperf.net)
69 points by ot 7y ago|13 comments
428.
by ot 7y ago
> Does the clock speed permanently reduce as soon as you use a vector instruction? I would have thought that the clock speed goes back up once the temperature has gone down. It's not about temperature, some instructions lower the cl
429.
Open-sourcing F14 for memory-efficient hash tables(code.fb.com)
225 points by ot 7y ago|45 comments
430.
The Science Behind the Mental Clarity Diet – Elemental by Medium(elemental.medium.com)
1 points by ot 8y ago|0 comments
431.
The creation of the io.latency block I/O controller(lwn.net)
51 points by ot 8y ago|12 comments
432.
by ot 8y ago
> The author claimes Goedel's phi(n) is polynomially bounded if and only if P=NP. Do you disagree with that statement? It would be trivially true if Godel was talking about propositional logic (proof size is polinomially bounded by
433.
by ot 8y ago
A few comments imply that this introduces the question of P ?= NP, and while it indeed is defining a complexity problem, this is about satisfiability of first order predicates logic , that is formulas with sets and quantifiers, while SAT i
434.
by ot 8y ago
Now do it when v is a vector of vectors.
435.
by ot 8y ago
> A difference is that most common mixers are not collision-free. That is not true, most modern hash implementations use invertible mixers. See Bob Jenkins' notes on hash function design: http://burtleburtle.net/bob&
436.
by ot 8y ago
Yeah the terminology is a bit misleading, it would be better to call this a "bijective" or "invertible" integer hash function, or mixer. It's really nice work though! Invertible mixers are usually building blocks fo
437.
‘Attachment Styles,’ and How They Sabotage Your Work-Life Balance(nytimes.com)
2 points by ot 8y ago|0 comments
438.
Meet the Bots That Review and Write Snippets of Facebook's Code(spectrum.ieee.org)
2 points by ot 8y ago|0 comments
439.
A Tiny Screw Shows Why iPhones Won’t Be ‘Assembled in U.S.A.’(nytimes.com)
111 points by ot 8y ago|121 comments
440.
Towards a hands-free query optimizer through deep learning(blog.acolyer.org)
7 points by ot 8y ago|0 comments
441.
C++20 Ranges(ericniebler.com)
196 points by ot 8y ago|160 comments
442.
C++20 Ranges(ericniebler.com)
1 points by ot 8y ago|0 comments
443.
Propaganda and the Weakening of Trust in Government(schneier.com)
1 points by ot 8y ago|0 comments
444.
by ot 8y ago
Although not explicitly advertised, it is possible to implement external dictionary compression with both gzip and lz4 by using their streaming interfaces.
445.
by ot 8y ago
See also F14 ( https://github.com/facebook/folly/blob/master/folly/containe... ), it uses a similar design to SwissTable but was opensourced a few months earlier. Interestingly it is faster than Swiss
446.
A Remarkable Man Among Remarkable Men and Women(nytimes.com)
1 points by ot 8y ago|0 comments
447.
by ot 8y ago
The authors claim their algorithm is novel, but it actually had been a well known folklore technique for quite a while. For example it was used in Folly as early as Jan 2016: https://github.com/facebook/folly/commi
448.
Impossible Bugs(blog.eitanadler.com)
3 points by ot 8y ago|0 comments
449.
RFC 8478 – Zstandard Compression and the Application/zstd Media Type(tools.ietf.org)
7 points by ot 8y ago|0 comments
450.
by ot 8y ago
> Bill Gates programmed in BASIC in the 1970s and not in low-level C/C++/assembly He didn't program in BASIC, he programmed a BASIC interpreter in 8080 assembly.

More ›