Debugged ZigzagPersistence (having added heavier consistency checking) * Added DEBUG_CONTAINERS option (uses std::__debug::* containers for chains and in ZigzagPersistence) * Added SizeStorage specialization for std::deque<T> * ZigzagPersistence got a lot more consistency checking (in debug mode only, which now crawls); as a result it's been debugged (running on non-trivial examples) * examples/rips/rips-zigzag takes command-line options * added ChainWrapper::clear() * added Simplex::VertexDimensionComparison * added PairwiseDistances class (for computing distances between points in a container according to a distance functor)

From: Dmitriy Morozov <dmitriy@mrzv.org>
Date: Sat, 20 Dec 2008 21:21:53
State: new
Subject: Specialize ChainWrapper<C>::add() for linked lists
Message-Id: <de674a2ac5f6c18c-0-artemis@rufus>

The current implementation of add() in ChainWrapper is container agnostic: it
uses a temporary container, and then swaps it into place. There should be a
specialized add() for linked lists (in particular, List from circular_list.h)
since it is would likely be more efficient then the generic one.