|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Small example for Aleph persistent in-memory containers. More...
#include <iostream>#include <string>#include <tpl_persistent_treap.H>#include <tpl_persistent_vector.H>Go to the source code of this file.
Functions | |
| int | main () |
Small example for Aleph persistent in-memory containers.
Build with the examples target and run:
Definition in file persistent_containers_example.cc.
| int main | ( | void | ) |
Definition at line 47 of file persistent_containers_example.cc.
References Aleph::and, Aleph::blossom_maximum_cardinality_matching(), Aleph::PersistentTreapSet< Key, Compare >::contains(), Aleph::PersistentTreapSet< Key, Compare >::erase(), Aleph::PersistentTreapMap< Key, T, Compare >::find(), Aleph::PersistentVector< T >::get(), Aleph::PersistentTreapSet< Key, Compare >::insert(), Aleph::PersistentTreapMap< Key, T, Compare >::insert(), Aleph::PersistentTreapMap< Key, T, Compare >::insert_or_assign(), log(), Aleph::PersistentVector< T >::push_back(), and Aleph::PersistentVector< T >::set().