rsvs3D
0.0.0
Codes for the c++ implementation of the 3D RSVS
|
Provide std::vector container with hashed index mapping. More...
#include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <sstream>
#include <stdexcept>
#include <string>
#include <unordered_map>
#include <vector>
#include "warning.hpp"
#include "arraystructures_incl.cpp"
#include "snakstruct_incl.cpp"
Go to the source code of this file.
Classes | |
class | ArrayStruct< T > |
class | SnakStruct< T > |
class | ModiftrackArray< T > |
class | HashedVector< T, Q, R > |
class | HashedMap< T, Q, R > |
class | HashedVectorPair< T, Q, R, S > |
class | HashedVectorSafe< T, Q, R > |
class | ArrayStructpart |
class | snakpart |
class | modiftrackpart |
Namespaces | |
rsvs3d | |
Namespace for general purpose tools of the RSVS project. | |
Typedefs | |
typedef unsigned int | unsigned_int |
Functions | |
bool | rsvs3d::logicals::__isfound (int f) |
template<class T > | |
int | TestTemplate_ArrayStruct () |
bool | CompareFuncOut (std::function< void()> func1, std::function< void()> func2) |
template<typename T > | |
void | sort (std::vector< T > &vec) |
template<typename T > | |
void | unique (std::vector< T > &vec) |
template<typename T > | |
void | set_intersection (std::vector< T > &targVec, const std::vector< T > &vec1, const std::vector< T > &vec2, bool isSort) |
template<class T > | |
std::vector< int > | FindSubList (const std::vector< T > &keyFind, const std::vector< T > &keyList, std::unordered_multimap< T, int > &hashTable) |
template<class T > | |
std::vector< int > | FindSubList (const std::vector< T > &keyFind, const std::vector< T > &keyList, const std::unordered_multimap< T, int > &hashTable) |
template<class T , class Q > | |
void | HashVector (const std::vector< T > &elems, std::unordered_multimap< T, Q > &hashTable, const std::vector< Q > &targElems={}) |
template<class T > | |
int | FindSub (const T &key, const std::unordered_multimap< T, int > &hashTable) |
template<class T > | |
void | ConcatenateVector (std::vector< T > &vecRoot, const std::vector< T > &vecConcat) |
template<class T , class R > | |
std::vector< R > | ReturnDataEqualRange (T key, const std::unordered_multimap< T, R > &hashTable) |
template<class T , class R > | |
void | ReturnDataEqualRange (T key, const std::unordered_multimap< T, R > &hashTable, std::vector< R > &subList) |
template<class T > | |
bool | CompareDisp (T *mesh1, T *mesh2) |
template<class T > | |
int | TestReadiness (T &stackT, const char *txt, bool errTarg, bool errTargCheck) |
template<class T > | |
void | DisplayVector (std::vector< T > vec) |
template<class T > | |
void | DisplayVectorStatistics (std::vector< T > vec) |
template<class T > | |
void | PrintVector (std::vector< T > vec, std::ostream &streamout) |
template<class T , class R > | |
R | ConcatenateVectorField (const ArrayStruct< T > &arrayIn, R T::*mp, const std::vector< int > &subList) |
template<class T , class R > | |
std::vector< R > | ConcatenateScalarField (const ArrayStruct< T > &arrayIn, R T::*mp, const std::vector< int > &subList) |
template<class T , class R > | |
R | ConcatenateVectorField (const ArrayStruct< T > &arrayIn, R T::*mp, int rStart, int rEnd) |
template<class T , class R > | |
std::vector< R > | ConcatenateScalarField (const ArrayStruct< T > &arrayIn, R T::*mp, int rStart, int rEnd) |
template<class T , class R , class U , class V > | |
void | OperArrayStructMethod (const ArrayStruct< T > &arrayIn, const std::vector< int > &subList, R T::*mp, U &out, V oper) |
template<template< class Q, class R > class T, class Q , class R > | |
void | EraseKeyPair (T< Q, R > hashTable, Q key, R pos) |
Variables | |
static const int | rsvs3d::constants::__notfound = -1 |
static const int | rsvs3d::constants::__failure = -1 |
static const int | rsvs3d::constants::__success = 0 |
Provide std::vector container with hashed index mapping.
This file provides classes and methods for the handling of groups of mesh subcomponents...
Definition in file arraystructures.hpp.