|
Function Name  |
Hit count  |
| moab::BSPTree::BSPTree(moab::Interface*, bool, char const*, unsigned int) |
0 |
| moab::BSPTree::delete_tree(unsigned long) |
0 |
| moab::BSPTree::find_all_trees(moab::Range&) |
0 |
| moab::BSPTree::set_tree_box(unsigned long, double const*, double const*) |
0 |
| moab::BSPTree::split_leaf(moab::BSPTreeIter&, moab::BSPTree::Plane, moab::Range const&, moab::Range const&) |
0 |
| moab::BSPTreeBoxIter::calculate_polyhedron(moab::BSPTreePoly&) const |
0 |
| moab::BSPTreeBoxIter::sibling_side(moab::BSPTreeBoxIter::SideBits&) const |
0 |
| moab::BSPTreeIter::up() |
0 |
| _GLOBAL__sub_I_BSPTree.cpp |
1 |
| __static_initialization_and_destruction_0(int, int) |
1 |
| moab::BSPTree::get_tree_end_iterator(unsigned long, moab::BSPTreeIter&) |
2 |
| moab::BSPTree::merge_leaf(moab::BSPTreeIter&) |
2 |
| moab::BSPTree::create_tree(unsigned long&) |
3 |
| moab::BSPTree::Plane::set(double const*, double const*, double const*) |
4 |
| moab::BSPTreeBoxIter::volume() const |
4 |
| moab::BSPTreeIter::volume() const |
4 |
| moab::cross(double*, double const*, double const*) |
4 |
| moab::dot(double const*, double const*) |
4 |
| moab::BSPTreeIter::sibling_is_forward() const |
5 |
| moab::point_in_box(double const (*) [3], double const*) |
6 |
| moab::BSPTreeIter::is_sibling(unsigned long) const |
9 |
| moab::BSPTreeIter::is_sibling(moab::BSPTreeIter const&) const |
10 |
| moab::BSPTree::create_tree(double const*, double const*, unsigned long&) |
12 |
| moab::BSPTreeBoxIter::intersects(moab::BSPTree::Plane const&) const |
12 |
| moab::corners_from_box(double const*, double const*, double (*) [3]) |
12 |
| moab::subtr(double*, double const*, double const*) |
12 |
| moab::BSPTree::leaf_containing_point(unsigned long, double const*, moab::BSPTreeIter&) |
14 |
| moab::BSPTree::BSPTree(moab::Interface*, char const*, unsigned int) |
15 |
| moab::BSPTree::create_tree(double const (*) [3], unsigned long&) |
15 |
| moab::BSPTree::init_tags(char const*) |
15 |
| moab::BSPTree::set_tree_box(unsigned long, double const (*) [3]) |
15 |
| moab::BSPTree::~BSPTree() |
15 |
| moab::BSPTreeBoxIter::splits(moab::BSPTree::Plane const&) const |
16 |
| moab::BSPTreeIter::down(moab::BSPTree::Plane const&, moab::BSPTreeIter::Direction) |
16 |
| moab::BSPTree::split_leaf(moab::BSPTreeIter&, moab::BSPTree::Plane, std::vector<unsigned long, std::allocator<unsigned long> > const&, std::vector<unsigned long, std::allocator<unsigned long> > const&) |
19 |
| moab::BSPTreeBoxIter::initialize(moab::BSPTree*, unsigned long, double const*) |
19 |
| moab::BSPTree::get_tree_box(unsigned long, double*) |
24 |
| moab::BSPTreeIter::calculate_polyhedron(moab::BSPTreePoly&) const |
24 |
| moab::sum(double*, double const*, double const*, double const*, double const*) |
24 |
| moab::BSPTreeBoxIter::get_box_corners(double (*) [3]) const |
26 |
| moab::BSPTree::leaf_containing_point(unsigned long, double const*, unsigned long&) |
28 |
| moab::BSPTree::get_tree_iterator(unsigned long, moab::BSPTreeIter&) |
30 |
| moab::BSPTreeIter::get_parent_split_plane(moab::BSPTree::Plane&) const |
35 |
| moab::BSPTreeBoxIter::step(moab::BSPTreeIter::Direction) |
38 |
| moab::BSPTreeIter::initialize(moab::BSPTree*, unsigned long, double const*) |
46 |
| bool moab::ray_intersect_halfspaces<moab::BSPTreePlaneIter>(moab::CartVect const&, moab::CartVect const&, moab::BSPTreePlaneIter const&, moab::BSPTreePlaneIter const&, double&, double&) |
53 |
| moab::BSPTreeBoxIter::intersect_ray(double const*, double const*, double&, double&) const |
53 |
| moab::BSPTreeIter::intersect_ray(double const*, double const*, double&, double&) const |
53 |
| moab::BSPTreePlaneIter::BSPTreePlaneIter() |
53 |
| moab::BSPTreePlaneIter::BSPTreePlaneIter(moab::BSPTree*, unsigned long const*, int) |
53 |
| moab::BSPTreePlaneIter::BSPTreePlaneIter(moab::BSPTreePlaneIter const&) |
53 |
| moab::BSPTreeBoxIter::face_corners(moab::BSPTreeBoxIter::SideBits, double const (*) [3], double (*) [3]) |
68 |
| moab::BSPTreeBoxIter::get_neighbors(moab::BSPTreeBoxIter::SideBits, std::vector<moab::BSPTreeBoxIter, std::allocator<moab::BSPTreeBoxIter> >&, double) const |
68 |
| moab::BSPTree::get_tree_box(unsigned long, double (*) [3]) |
72 |
| moab::BSPTreeIter::step(moab::BSPTreeIter::Direction) |
72 |
| moab::BSPTree::split_leaf(moab::BSPTreeIter&, moab::BSPTree::Plane) |
82 |
| moab::BSPTreeBoxIter::down(moab::BSPTree::Plane const&, moab::BSPTreeIter::Direction) |
94 |
| moab::BSPTree::set_split_plane(unsigned long, moab::BSPTree::Plane const&) |
101 |
| moab::BSPTree::split_leaf(moab::BSPTreeIter&, moab::BSPTree::Plane, unsigned long&, unsigned long&) |
101 |
| bool moab::ray_intersect_halfspaces<moab::BoxPlaneIter>(moab::CartVect const&, moab::CartVect const&, moab::BoxPlaneIter const&, moab::BoxPlaneIter const&, double&, double&) |
106 |
| moab::BoxPlaneIter::BoxPlaneIter() |
106 |
| moab::BoxPlaneIter::BoxPlaneIter(double const (*) [3]) |
106 |
| moab::BSPTreePlaneIter::operator!=(moab::BSPTreePlaneIter const&) const |
107 |
| moab::BSPTreePlaneIter::operator++() |
107 |
| moab::BSPTreeBoxIter::step_to_first_leaf(moab::BSPTreeIter::Direction) |
111 |
| moab::BSPTreeIter::step_to_first_leaf(moab::BSPTreeIter::Direction) |
119 |
| moab::BSPTreePlaneIter::operator->() const |
132 |
| moab::BSPTreePlaneIter::~BSPTreePlaneIter() |
159 |
| moab::BSPTreeBoxIter::up() |
186 |
| moab::BSPTreeBoxIter::side_on_plane(double const (*) [3], moab::BSPTree::Plane const&) |
210 |
| moab::plane_uncut_box(double const (*) [3], double (*) [3], moab::BSPTree::Plane const&) |
210 |
| moab::plane_cut_box(double (*) [3], double (*) [3], moab::BSPTree::Plane const&) |
211 |
| moab::copy_coords(double const*, double*) |
272 |
| moab::BSPTreeBoxIter::side_above_plane(double const (*) [3], moab::BSPTree::Plane const&) |
367 |
| moab::BoxPlaneIter::operator++() |
564 |
| moab::BoxPlaneIter::operator!=(moab::BoxPlaneIter const&) const |
670 |
| moab::plane_cut_edge(double*, double const*, double*, moab::BSPTree::Plane const&) |
676 |
| moab::copy_coords(double*, double const*) |
840 |
| moab::BoxPlaneIter::operator->() const |
1428 |