Steffan Sølvsten
Steffan Sølvsten
In all algorithms we have something akin to the following from *internal/quantify.h* ```cpp while (v.uid < t_seek) { v = in_nodes.pull(); } ``` We may as well just add a...
A problem in SAT solving is trusting the solver when it claims a formula to be *unsatisfiable*. To this end, the solver can create an *LRAT* (or just a *DRAT*)...
Currently, to get the *i-level* cut computations to work, we count the number of arcs to the *true* and the *false* terminal. Yet, if the arc is tainted, we know...
**Context** With #128 the sink arcs in an `arc_file` was split in two: the ones given in-order and the ones given out-of-order. This reduces the number of elements involved in...
We ought to move the *taint* flag from the `e.target().is_flagged()` into a separate `e.flags[REDUCE_FLAG::CUT_TAINT]`. This provides the basis for us to add many of the extensions. - For #433, we...
Some user's would like to build Adiar once and then install it. This way, you do not need to include it as a submodule to each of your projects (and...
Follow-up on #147 , #419 , and #225 : The *Restrict* and *Eval* function currently takes a `shared_file` as an input which is quite clunky. :warning: These will break when...
**Describe the bug** It is not possible to build Adiar as a shared library. **To Reproduce** Try to build the `make main` target changed such that CMake also is parsed...
Follow-up on #397 . In that refactor we provide a major clean-up of all the prior code. But, we can improve the code quality even more, by generalising the use...
In the *reduce* algorithm, all mappings due to the first reduction rule are placed in a `tpie::file_stream`. With #397 we have cleaned up Adiar's wrappers on files and streams and...