Mesh Oriented datABase
(version 5.4.1)
Array-based unstructured mesh datastructure
|
#include <vector>
#include <set>
#include <iostream>
#include <map>
#include <algorithm>
#include <bitset>
#include <numeric>
#include <cmath>
#include <tr1/unordered_map>
#include <limits>
Go to the source code of this file.
Classes | |
class | moab::common_tree::Box< T > |
struct | moab::common_tree::_Element_data< T1, T2 > |
Namespaces | |
namespace | moab |
Class representing axis-aligned bounding box. | |
namespace | moab::common_tree |
Defines | |
#define | NUM_DIM 3 |
#define | TREE_DEBUG |
Functions | |
template<typename T , typename Stream > | |
void | moab::common_tree::print_vector (const T &v, Stream &out) |
template<typename T > | |
void | moab::common_tree::print_vector (const T &begin, const T &end) |
template<typename _Box , typename _Point > | |
bool | moab::common_tree::box_contains_point (const _Box &box, const _Point &p, const double tol) |
template<typename _Box > | |
bool | moab::common_tree::box_contains_box (const _Box &a, const _Box &b, const double tol) |
template<typename Vector > | |
void | moab::common_tree::compute_box_center (Vector &max, Vector &min, Vector ¢er) |
template<typename Box > | |
Box::value_type | moab::common_tree::compute_box_center (const Box &box, const int dim) |
template<typename T > | |
std::ostream & | moab::common_tree::operator<< (std::ostream &out, const Box< T > &box) |
template<typename Entities , typename Iterator > | |
void | moab::common_tree::assign_entities (Entities &entities, const Iterator &begin, const Iterator &end) |
template<typename Coordinate , typename Coordinate_iterator > | |
void | moab::common_tree::update_bounding_max (Coordinate &max, Coordinate_iterator j) |
template<typename Coordinate , typename Coordinate_iterator > | |
void | moab::common_tree::update_bounding_min (Coordinate &min, Coordinate_iterator j) |
template<typename Box > | |
void | moab::common_tree::update_bounding_box (Box &a, const Box &b) |
template<typename Entity_map , typename Ordering > | |
void | moab::common_tree::construct_ordering (Entity_map &entity_map, Ordering &entity_ordering) |
template<typename Entity_handles , typename Element_map , typename Bounding_box , typename Moab > | |
void | moab::common_tree::construct_element_map (const Entity_handles &elements, Element_map &map, Bounding_box &bounding_box, Moab &moab) |
#define NUM_DIM 3 |
common_tree.hpp Ryan H. Lewis (C) 2012 Functionality common to all trees.
Definition at line 20 of file common_tree.hpp.
Referenced by moab::Bvh_tree< _Entity_handles, _Box, _Moab, _Parametrizer >::establish_buckets(), moab::Bvh_tree< _Entity_handles, _Box, _Moab, _Parametrizer >::find_split(), and moab::Bvh_tree< _Entity_handles, _Box, _Moab, _Parametrizer >::initialize_splits().
#define TREE_DEBUG |
Definition at line 21 of file common_tree.hpp.