Kevin R. Thornton
Kevin R. Thornton
We have a nice set of containerized workflows for verification. But they are only mentioned in a buried reference in the tutorial.
Need to describe optimal strategies for processing data sets w/"tons" of ancient samples and the resulting speed-vs-memory trade-off. These considerations are related to all sorts of things, including #387.
See tskit-dev/msprime#1997. We have to provide a safe wrapper for this function.
https://github.com/molpopgen/fwdpp/blob/2a3a95175f235cddadaa9028d8bdfdca1c94aac4/fwdpp/internal/debug_details.hpp#L213
WIP to add a tree sequence class.
The current tree visitor is hacky. We should adopt what we've done in forrustts as a model for fwdpp. Some ownership semantics may be a bit trickier, though. It seems...
The design happening over at `tskit_rust` shows a lot of promise. Functions returning a smart pointer to something like this would be handy: ```cpp struct node_iterator { virtual void advance()...
There are currently lots of warnings due to implicit conversions. These need to be checked and fixed. A lot of the solution will be to use `auto` liberally! These flags...
Some removed symbols are being used. Doesn't affect main, just dev.