#include <algorithm>#include <iostream>#include <set>#include <sstream>Classes | |
| class | walberla::AllSet< T > |
| A class for managing sets that supports the ability to define a set that represents all possible elements. More... | |
| class | walberla::AllSet< T > |
| A class for managing sets that supports the ability to define a set that represents all possible elements. More... | |
Namespaces | |
| walberla | |
| \file TimestepTracker.h \ingroup lbm \author Frederik Hennig frede.nosp@m.rik..nosp@m.henni.nosp@m.g@fa.nosp@m.u.de | |
Functions | |
| template<typename T > | |
| AllSet< T > | walberla::setIntersection (const AllSet< T > &a, const AllSet< T > &b) |
| template<typename T > | |
| AllSet< T > | walberla::setUnion (const AllSet< T > &a, const AllSet< T > &b) |
| template<typename T > | |
| AllSet< T > | walberla::setDifference (const AllSet< T > &a, const AllSet< T > &b) |
| template<typename T > | |
| bool | walberla::setIsEqual (const AllSet< T > &a, const AllSet< T > &b) |
| template<typename T > | |
| std::ostream & | walberla::operator<< (std::ostream &os, const AllSet< T > &set) |