Dave Abrahams
Dave Abrahams
From looking at the code, I think the things being labeled as x86 binaries are actually x64 binaries; `TARGET_CPU` doesn't get used for anything but choosing the names of files.
Fixes #33
``` ++++++++Bison: pure parsing conflicts: 1 shift/reduce In file included from /Users/dave/src/yaep/test/compare_parsers/test_yyparse.c:44: y.tab.c:1937:16: error: call to undeclared function 'get_lex'; ISO C99 and later do not support implicit function declarations [-Wimplicit-function-declaration]...
``` -- The C compiler identification is AppleClang 16.0.0.16000026 -- The CXX compiler identification is AppleClang 16.0.0.16000026 -- Detecting C compiler ABI info -- Detecting C compiler ABI info -...
Not really a bug report, but that feature of the implementation surprised me. A traditional heap stores its elements directly, and as far as I know no heap operations depend...
The problem is that `withUnsafeMutableBufferPointer` forces a copy if the storage is not uniquely referenced. If you are going to then rewrite/move a significant number of elements, the original copies...
An indexed heap is required for a traditional implementation of Dijkstra's shortest paths algorithm. It adds a *DECREASE-KEY* operation that optimally alters the priority of an existing element in the...
Years ago I was involved in the [Boost Graph Library](https://www.boost.org/doc/libs/1_87_0/libs/graph/doc/index.html), which applies Stepanov's principles of Generic Programming to the graph domain. Structurally, there are opportunities for efficiency, composability, and code...
The optimization is described [here](https://stackoverflow.com/a/79306350/125349), with references to proofs of correctness and complexity.
When I start bisecting with a script, magit will display something like this in the main buffer. ``` Bisecting: 42 revisions left to test after this (roughly 6 steps) [38d73a9251147b661002ec02aeeebcfc3a538843]...