#include <Range.hpp>

Collaboration diagram for moab::Range:

Classes
class	const_iterator
	a const iterator which iterates over an Range More...

class	const_pair_iterator

class	const_reverse_iterator
	a const reverse iterator which iterates over an Range More...

class	pair_iterator
	used to iterate over sub-ranges of a range More...

struct	PairNode

Public Types
typedef const_iterator	iterator

typedef const_reverse_iterator	reverse_iterator

typedef EntityHandle	value_type
	for short hand notation, lets typedef the container class that holds the ranges More...

Public Member Functions
Range &	operator-= (const Range &rhs)
	just like subtract, but as an operator More...

	Range ()
	default constructor More...

	Range (const Range &copy)
	copy constructor More...

	Range (EntityHandle val1, EntityHandle val2)
	another constructor that takes an initial range More...

Range &	operator= (const Range &copy)
	operator= More...

	~Range ()
	destructor More...

const_iterator	begin () const
	return the beginning const iterator of this range More...

const_reverse_iterator	rbegin () const
	return the beginning const reverse iterator of this range More...

const_iterator	end () const
	return the ending const iterator for this range More...

const_reverse_iterator	rend () const
	return the ending const reverse iterator for this range More...

size_t	size () const
	return the number of values this Ranges represents More...

size_t	psize () const
	return the number of range pairs in the list More...

bool	empty () const
	return whether empty or not always use "if(!Ranges::empty())" instead of "if(Ranges::size())" More...

iterator	insert (iterator hint, EntityHandle val)

iterator	insert (EntityHandle val)
	insert an item into the list and return the iterator for the inserted item More...

iterator	insert (iterator hint, EntityHandle first, EntityHandle last)
	insert a range of items into this list and return the iterator for the first inserted item More...

iterator	insert (EntityHandle val1, EntityHandle val2)
	insert a range of items into this list and return the iterator for the first inserted item More...

template<typename T >
iterator	insert_list (T begin_iter, T end_iter)

template<class T >
iterator	insert (typename T::const_iterator begin_iter, typename T::const_iterator end_iter)

template<typename T >
iterator	insert (const T begin_iter, const T end_iter)

iterator	erase (iterator iter)
	remove an item from this list and return an iterator to the next item More...

iterator	erase (iterator iter1, iterator iter2)
	remove a range of items from the list More...

iterator	erase (EntityHandle val)
	erases a value from this container More...

const EntityHandle &	front () const
	get first entity in range More...

const EntityHandle &	back () const
	get last entity in range More...

EntityHandle	pop_front ()
	remove first entity from range More...

EntityHandle	pop_back ()
	remove last entity from range More...

const_iterator	find (EntityHandle val) const
	find an item int the list and return an iterator at that value More...

const_iterator	lower_bound (EntityHandle val) const

const_iterator	upper_bound (EntityHandle val) const

const_iterator	lower_bound (EntityType type) const

const_iterator	upper_bound (EntityType type) const

std::pair< const_iterator, const_iterator >	equal_range (EntityType type) const

const_iterator	lower_bound (EntityType type, const_iterator first) const

const_iterator	upper_bound (EntityType type, const_iterator first) const

bool	all_of_type (EntityType type) const
	True if all entities in range are of passed type (also true if range is empty) More...

bool	all_of_dimension (int dimension) const
	True if all entities in range are of passed dimension (also true if range is empty) More...

unsigned	num_of_type (EntityType type) const

unsigned	num_of_dimension (int dim) const

void	clear ()
	clears the contents of the list More...

const std::string	str_rep (const char *indent_prefix=NULL) const
	for debugging More...

void	print (const char *indent_prefix=NULL) const

void	print (std::ostream &s, const char *indent_prefix=NULL) const

unsigned long	get_memory_use () const

double	compactness () const

void	insert (Range::const_iterator begin, Range::const_iterator end)

void	merge (const Range &range)
	merges this Range with another range More...

void	merge (Range::const_iterator beginr, Range::const_iterator endr)
	merge a subset of some other range More...

void	swap (Range &range)
	swap the contents of this range with another one More...

void	sanity_check () const
	check for internal consistency More...

bool	contains (const Range &other) const
	Check if this range is a non-strict superset of some other range. More...

Range	subset_by_type (EntityType t) const
	return a subset of this range, by type More...

Range	subset_by_dimension (int dim) const
	return a subset of this range, by dimension More...

EntityHandle	operator[] (EntityID index) const

int	index (EntityHandle handle) const

pair_iterator	pair_begin ()

pair_iterator	pair_end ()

const_pair_iterator	const_pair_begin () const

const_pair_iterator	const_pair_end () const

const_pair_iterator	pair_begin () const

const_pair_iterator	pair_end () const

template<typename Iterator >
Range::iterator	insert_list (Iterator begin_iter, Iterator end_iter)

Static Public Member Functions
static const_iterator	lower_bound (const_iterator first, const_iterator last, EntityHandle val)
	return an iterator to the first value >= val More...

static const_iterator	upper_bound (const_iterator first, const_iterator last, EntityHandle val)

Protected Member Functions
void	delete_pair_node (PairNode *dead_node)
	if dead_node is not mHead, remove it from the list and free it's memory. More...

Protected Attributes
PairNode	mHead
	the head of the list that contains pairs that represent the ranges this list is sorted and unique at all times More...

Friends
Range	intersect (const Range &, const Range &)
	intersect two ranges, placing the results in the return range More...

Range	subtract (const Range &, const Range &)
	subtract range2 from this, placing the results in the return range More...

Detailed Description

the class Range

Examples: ComputeTriDual.cpp, GenLargeMesh.cpp, and LaplacianSmoother.cpp.

Definition at line 191 of file Range.hpp.

Member Typedef Documentation

◆ iterator

typedef const_iterator moab::Range::iterator

Examples: DirectAccessNoHoles.cpp, DirectAccessWithHoles.cpp, ExtractLand.cpp, GetEntities.cpp, LloydRelaxation.cpp, QuadTriConv.cpp, ReadPartFile.cpp, SetsNTags.cpp, TestExodusII.cpp, addPCdata.cpp, and copyPartition.cpp.

Definition at line 197 of file Range.hpp.

◆ reverse_iterator

typedef const_reverse_iterator moab::Range::reverse_iterator

Definition at line 198 of file Range.hpp.

◆ value_type

typedef EntityHandle moab::Range::value_type

for short hand notation, lets typedef the container class that holds the ranges

Definition at line 208 of file Range.hpp.

Constructor & Destructor Documentation

◆ Range() [1/3]

moab::Range::Range ( )

inline

default constructor

Definition at line 846 of file Range.hpp.

 {
  // set the head node to point to itself
  mHead.mNext = mHead.mPrev = &mHead;
  mHead.first = mHead.second = 0;
 }

References mHead, moab::Range::PairNode::mNext, and moab::Range::PairNode::mPrev.

◆ Range() [2/3]

moab::Range::Range ( const Range & copy )

copy constructor

Definition at line 179 of file Range.cpp.

 {
  // set the head node to point to itself
  mHead.mNext = mHead.mPrev = &mHead;
  mHead.first = mHead.second = 0;
  
  const PairNode* copy_node = copy.mHead.mNext;
  PairNode* new_node = &mHead;
  for( ; copy_node != &( copy.mHead ); copy_node = copy_node->mNext )
  {
  PairNode* tmp_node = alloc_pair( new_node->mNext, new_node, copy_node->first, copy_node->second );
  new_node->mNext->mPrev = tmp_node;
  new_node->mNext = tmp_node;
  new_node = tmp_node;
  }
 }

References alloc_pair(), mHead, moab::Range::PairNode::mNext, and moab::Range::PairNode::mPrev.

◆ Range() [3/3]

moab::Range::Range	(	EntityHandle	val1,
		EntityHandle	val2
	)

another constructor that takes an initial range

Definition at line 172 of file Range.cpp.

 {
  mHead.mNext = mHead.mPrev = alloc_pair( &mHead, &mHead, val1, val2 );
  mHead.first = mHead.second = 0;
 }

References alloc_pair(), mHead, moab::Range::PairNode::mNext, and moab::Range::PairNode::mPrev.

◆ ~Range()

moab::Range::~Range ( )

inline

destructor

Definition at line 854 of file Range.hpp.

 {
  clear();
 }

References clear().

Member Function Documentation

◆ all_of_dimension()

bool moab::Range::all_of_dimension ( int dimension ) const

True if all entities in range are of passed dimension (also true if range is empty)

Definition at line 884 of file Range.cpp.

 {
  return empty() || ( CN::Dimension( TYPE_FROM_HANDLE( front() ) ) == dimension &&
  CN::Dimension( TYPE_FROM_HANDLE( back() ) ) == dimension );
 }

References back(), moab::CN::Dimension(), empty(), front(), and moab::TYPE_FROM_HANDLE().

Referenced by moab::Skinner::find_skin(), moab::Skinner::find_skin_vertices_1D(), moab::Skinner::find_skin_vertices_2D(), moab::Skinner::find_skin_vertices_3D(), and moab::Core::get_vertices().

◆ all_of_type()

bool moab::Range::all_of_type ( EntityType type ) const

True if all entities in range are of passed type (also true if range is empty)

Definition at line 879 of file Range.cpp.

 {
  return empty() || ( TYPE_FROM_HANDLE( front() ) == type && TYPE_FROM_HANDLE( back() ) == type );
 }

References back(), empty(), front(), and moab::TYPE_FROM_HANDLE().

Referenced by moab::WriteNCDF::gather_mesh_information(), moab::ReorderTool::handle_order_from_sets_and_adj(), iMOAB_GetBlockInfo(), moab::ReorderTool::int_order_from_sets_and_adj(), moab::OrientedBoxTreeTool::join_trees(), main(), moab::GeomQueryTool::measure_area(), moab::GeomQueryTool::measure_volume(), and moab::WriteNCDF::write_elementblocks().

◆ back()

const EntityHandle & moab::Range::back ( ) const

inline

get last entity in range

Definition at line 912 of file Range.hpp.

 {
  return mHead.mPrev->second;
 }

References mHead, and moab::Range::PairNode::mPrev.

Referenced by all_of_dimension(), all_of_type(), moab::WriteNCDF::gather_mesh_information(), moab::WriteUtil::gather_nodes_from_elements(), moab::ReadHDF5::get_partition(), moab::AdaptiveKDTree::merge_leaf(), moab::BSPTree::merge_leaf(), pop_back(), moab::ReadHDF5::read_elems(), moab::ReadHDF5::read_sparse_tag_indices(), and moab::GeomTopoTool::resize_rootSets().

◆ begin()

Range::const_iterator moab::Range::begin ( ) const

inline

return the beginning const iterator of this range

Examples: ComputeTriDual.cpp.

Definition at line 860 of file Range.hpp.

 {
  return const_iterator( mHead.mNext, mHead.mNext->first );
 }

References mHead, and moab::Range::PairNode::mNext.

◆ clear()

void moab::Range::clear ( )

clears the contents of the list

Examples: ComputeTriDual.cpp.

Definition at line 197 of file Range.cpp.

 {
  PairNode* tmp_node = mHead.mNext;
  while( tmp_node != &mHead )
  {
  PairNode* to_delete = tmp_node;
  tmp_node = tmp_node->mNext;
  free_pair( to_delete );
  }
  mHead.mNext = &mHead;
  mHead.mPrev = &mHead;
 }

References free_pair(), mHead, moab::Range::PairNode::mNext, and moab::Range::PairNode::mPrev.

Referenced by MetisPartitioner::assemble_graph(), ZoltanPartitioner::assemble_graph(), MetisPartitioner::assemble_taggedents_graph(), moab::ReadUtil::assign_ids(), moab::Skinner::classify_2d_boundary(), moab::TempestRemapper::clear(), moab::OrientedBoxTreeTool::closest_to_location(), moab::MeshTopoUtil::construct_aentities(), moab::DualTool::construct_hp_parent_child(), moab::GeomTopoTool::construct_vertex_ranges(), moab::TempestRemapper::convert_mesh_to_tempest_private(), moab::TempestRemapper::convert_overlap_mesh_sorted_by_source(), moab::WriteHDF5::count_set_size(), moab::ReadGmsh::create_geometric_topology(), moab::ParallelComm::create_iface_pc_links(), moab::ReadABAQUS::create_instance_of_part(), moab::AEntityFactory::create_vert_elem_adjacencies(), moab::Core::create_vertices(), moab::Core::delete_entities(), do_test_mode(), dot_get_sets(), moab::WriteHDF5Parallel::exchange_file_ids(), moab::ParallelComm::filter_pstatus(), moab::AdaptiveKDTree::find_close_triangle(), moab::MergeMesh::find_merged_to(), moab::ReadHDF5::find_sets_containing(), moab::DualTool::fs_get_quads(), moab::DualTool::fsr_get_fourth_quad(), moab::WriteHDF5Parallel::gather_interface_meshes(), moab::WriteVtk::gather_mesh(), moab::WriteHDF5::gather_mesh_info(), moab::ReadUtil::gather_related_ents(), get_adjacent_elems(), moab::MeshTopoUtil::get_bridge_adjacencies(), moab::GeomTopoTool::get_ct_children_by_dimension(), moab::DualTool::get_graphics_points(), moab::Coupler::get_matching_entities(), get_max_volume(), moab::DualTool::get_opposite_verts(), moab::ParallelComm::get_sent_ents(), moab::ReadABAQUS::get_set_elements(), moab::ReadABAQUS::get_set_nodes(), moab::WriteCCMIO::get_sets(), moab::ParallelComm::get_shared_entities(), moab::SharedSetData::get_shared_sets(), moab::WriteHDF5::get_sparse_tagged_entities(), moab::WriteHDF5::get_tag_data_length(), moab::WriteHDF5::get_write_entities(), moab::FBEngine::getAdjacentEntities(), moab::FBEngine::getEntities(), moab::TempestRemapper::GetOverlapAugmentedEntities(), iMOAB_UpdateMeshInfo(), ZoltanPartitioner::include_closure(), moab::SmoothFace::init_gradient(), moab::WriteHDF5::initialize_mesh(), moab::ReorderTool::int_order_from_sets_and_adj(), moab::AdaptiveKDTree::intersect_children_with_elems(), moab::Intx2Mesh::intersect_meshes(), moab::Intx2Mesh::intersect_meshes_kdtree(), moab::ReadCGNS::load_file(), moab::ReadGmsh::load_file(), moab::ReadHDF5::load_file_impl(), moab::ReadSms::load_file_impl(), moab::WriteGMV::local_write_mesh(), main(), make_tris_from_quads(), moab::GeomQueryTool::measure_area(), moab::GeomQueryTool::measure_volume(), moab::MergeMesh::merge_higher_dimensions(), moab::AdaptiveKDTree::merge_leaf(), moab::BSPTree::merge_leaf(), moab::DualTool::next_loop_vertex(), operator=(), moab::ParallelComm::pack_entities(), ZoltanPartitioner::partition_owned_cells(), moab::GeomQueryTool::point_in_volume_slow(), moab::ParallelMergeMesh::PopulateMySkinEnts(), moab::Core::print(), moab::AdaptiveKDTree::ray_intersect_triangles(), moab::OrientedBoxTreeTool::ray_intersect_triangles(), moab::ReadABAQUS::read_element_set(), DeformMeshRemap::read_file(), McnpData::read_mcnpfile(), moab::ReadABAQUS::read_node_set(), moab::ReadHDF5VarLen::read_offsets(), moab::ReadHDF5::read_sparse_tag_indices(), remove_entities_from_sets(), moab::ParallelComm::resolve_shared_sets(), moab::GeomTopoTool::restore_topology_from_adjacency(), moab::FBEngine::separate(), moab::ReadHDF5Dataset::set_all_file_ids(), moab::OrientedBoxTreeTool::sphere_intersect_triangles(), moab::split_box(), moab::MeshTopoUtil::split_entities_manifold(), moab::FBEngine::split_surface(), moab::MeshTopoUtil::star_next_entity(), tag_depth(), moab::ParallelComm::tag_iface_entities(), moab::DualTool::traverse_hyperplane(), moab::NestedRefine::update_global_ahf_1D_sub(), moab::NestedRefine::update_special_tags(), MetisPartitioner::write_aggregationtag_partition(), moab::WriteCCMIO::write_cells_and_faces(), moab::WriteNCDF::write_file(), moab::WriteSLAC::write_file(), moab::WriteTemplate::write_file(), moab::WriteHDF5::write_finished(), MetisPartitioner::write_partition(), ZoltanPartitioner::write_partition(), and ~Range().

◆ compactness()

double moab::Range::compactness ( ) const

inline

Definition at line 952 of file Range.hpp.

 {
  unsigned int num_ents = size();
  return ( num_ents ? ( (double)get_memory_use() / (double)( num_ents * sizeof( EntityHandle ) ) ) : -1 );
 }

References get_memory_use(), and size().

Referenced by moab::TempestRemapper::convert_mesh_to_tempest_private(), moab::TempestRemapper::convert_overlap_mesh_sorted_by_source(), moab::ParallelComm::exchange_ghost_cells(), moab::ParallelComm::exchange_owned_mesh(), and moab::ParallelComm::send_entities().

◆ const_pair_begin()

const_pair_iterator moab::Range::const_pair_begin ( ) const

inline

Definition at line 748 of file Range.hpp.

  {
  return const_pair_iterator( mHead.mNext );
  }

References moab::Range::PairNode::mNext.

Referenced by moab::RangeSetIterator::build_pair_vec(), moab::BitTag::clear_data(), moab::convert_to_ranged_ids(), moab::ReadHDF5::delete_non_side_elements(), moab::BitTag::get_data(), index(), moab::MeshSet::insert_entity_ranges(), moab::ReadHDF5::insert_in_id_map(), moab::DebugOutput::list_ints_real(), moab::DebugOutput::list_range_real(), moab::merge_ranged_ids(), num_of_dimension(), num_of_type(), operator-=(), moab::operator==(), moab::PACK_RANGE(), moab::ParallelComm::pack_range_map(), psize(), moab::WriteHDF5::range_to_blocked_list(), moab::WriteHDF5::range_to_id_list(), moab::ReadHDF5VarLen::read_offsets(), moab::ReadHDF5::read_set_data(), moab::BitTag::remove_data(), moab::MeshSet::remove_entity_ranges(), moab::BitTag::set_data(), str_rep(), and moab::IODebugTrack::~IODebugTrack().

◆ const_pair_end()

const_pair_iterator moab::Range::const_pair_end ( ) const

inline

Definition at line 752 of file Range.hpp.

  {
  return const_pair_iterator( &mHead );
  }

Referenced by moab::RangeSetIterator::build_pair_vec(), moab::BitTag::clear_data(), moab::convert_to_ranged_ids(), moab::VarLenDenseTag::find_entities_with_value(), moab::DenseTag::find_entities_with_value(), moab::BitTag::get_data(), index(), moab::MeshSet::insert_entity_ranges(), moab::ReadHDF5::insert_in_id_map(), moab::DebugOutput::list_ints_real(), moab::DebugOutput::list_range_real(), moab::merge_ranged_ids(), num_of_dimension(), num_of_type(), moab::operator==(), moab::PACK_RANGE(), moab::ParallelComm::pack_range_map(), psize(), moab::WriteHDF5::range_to_blocked_list(), moab::WriteHDF5::range_to_id_list(), moab::ReadHDF5VarLen::read_offsets(), moab::ReadHDF5::read_set_data(), moab::BitTag::remove_data(), moab::MeshSet::remove_entity_ranges(), moab::BitTag::set_data(), str_rep(), and moab::IODebugTrack::~IODebugTrack().

◆ contains()

bool moab::Range::contains ( const Range & other ) const

Check if this range is a non-strict superset of some other range.

Definition at line 1005 of file Range.cpp.

 {
  if( othr.empty() ) return true;
  if( empty() ) return false;
  
  // neither range is empty, so both have valid pair nodes
  // other than dummy mHead
  const PairNode* this_node = mHead.mNext;
  const PairNode* othr_node = othr.mHead.mNext;
  for( ;; )
  {
  // Loop while the node in this list is entirely before
  // the node in the other list.
  while( this_node->second < othr_node->first )
  {
  this_node = this_node->mNext;
  if( this_node == &mHead ) return false;
  }
  // If other node is not entirely contained in this node
  // then other list is not contained in this list
  if( this_node->first > othr_node->first ) break;
  // Loop while other node is entirely contained in this node.
  while( othr_node->second <= this_node->second )
  {
  othr_node = othr_node->mNext;
  if( othr_node == &othr.mHead ) return true;
  }
  // If other node overlapped end of this node
  if( othr_node->first <= this_node->second ) break;
  }
  
  // should be unreachable
  return false;
 }

References empty(), mHead, and moab::Range::PairNode::mNext.

Referenced by moab::WriteHDF5::check_dense_format_tag(), and moab::Skinner::find_skin_scd().

◆ delete_pair_node()

void moab::Range::delete_pair_node ( PairNode * dead_node )

protected

if dead_node is not mHead, remove it from the list and free it's memory.

Definition at line 471 of file Range.cpp.

 {
  if( node != &mHead )
  { // pop_front() and pop_back() rely on this check
  node->mPrev->mNext = node->mNext;
  node->mNext->mPrev = node->mPrev;
  free_pair( node );
  }
 }

References free_pair(), mHead, moab::Range::PairNode::mNext, and moab::Range::PairNode::mPrev.

Referenced by erase(), operator-=(), pop_back(), and pop_front().

◆ empty()

bool moab::Range::empty ( ) const

inline

return whether empty or not always use "if(!Ranges::empty())" instead of "if(Ranges::size())"

Definition at line 885 of file Range.hpp.

 {
  return ( mHead.mNext == &mHead );
 }

References mHead, and moab::Range::PairNode::mNext.

◆ end()

Range::const_iterator moab::Range::end ( ) const

inline

return the ending const iterator for this range

Examples: ComputeTriDual.cpp.

Definition at line 872 of file Range.hpp.

 {
  return const_iterator( &mHead, mHead.first );
 }

References mHead.

◆ equal_range()

std::pair< Range::const_iterator, Range::const_iterator > moab::Range::equal_range ( EntityType type ) const

Definition at line 867 of file Range.cpp.

 {
  std::pair< Range::const_iterator, Range::const_iterator > result;
  int err;
  EntityHandle handle = CREATE_HANDLE( type, 0, err );
  result.first = err ? end() : lower_bound( begin(), end(), handle );
  // if (type+1) overflows, err will be true and we return end().
  handle = CREATE_HANDLE( type + 1, 0, err );
  result.second = err ? end() : lower_bound( result.first, end(), handle );
  return result;
 }

References begin(), moab::CREATE_HANDLE(), end(), and lower_bound().

Referenced by moab::ParallelComm::add_verts(), moab::SparseTag::find_entities_with_value(), moab::VarLenSparseTag::find_entities_with_value(), moab::ReadUtil::gather_related_ents(), moab::BitTag::get_entities_with_bits(), moab::WriteHDF5::initialize_mesh(), and subset_by_type().

◆ erase() [1/3]

Range::iterator moab::Range::erase ( EntityHandle val )

inline

erases a value from this container

Definition at line 891 of file Range.hpp.

 {
  return erase( find( val ) );
 }

References erase(), and find().

◆ erase() [2/3]

Range::iterator moab::Range::erase ( iterator iter )

remove an item from this list and return an iterator to the next item

erases an item from this list and returns an iterator to the next item

Examples: LaplacianSmoother.cpp.

Definition at line 364 of file Range.cpp.

 {
  // one of a few things could happen
  // 1. shrink a range
  // 2. split a range
  // 3. remove a range
  
  if( iter == end() ) return end();
  
  // the iterator most likely to be returned
  iterator new_iter = iter;
  ++new_iter;
  
  PairNode* kter = iter.mNode;
  
  // just remove the range
  if( kter->first == kter->second )
  {
  kter->mNext->mPrev = kter->mPrev;
  kter->mPrev->mNext = kter->mNext;
  free_pair( kter );
  return new_iter;
  }
  // shrink it
  else if( kter->first == iter.mValue )
  {
  kter->first++;
  return new_iter;
  }
  // shrink it the other way
  else if( kter->second == iter.mValue )
  {
  kter->second--;
  return new_iter;
  }
  // split the range
  else
  {
  PairNode* new_node = alloc_pair( iter.mNode->mNext, iter.mNode, iter.mValue + 1, kter->second );
  new_node->mPrev->mNext = new_node->mNext->mPrev = new_node;
  iter.mNode->second = iter.mValue - 1;
  new_iter = const_iterator( new_node, new_node->first );
  return new_iter;
  }
 }

References alloc_pair(), end(), free_pair(), moab::Range::PairNode::mNext, moab::Range::const_iterator::mNode, moab::Range::PairNode::mPrev, and moab::Range::const_iterator::mValue.

◆ erase() [3/3]

Range::iterator moab::Range::erase	(	iterator	iter1,
		iterator	iter2
	)

remove a range of items from the list

Definition at line 411 of file Range.cpp.

 {
  iterator result;
  
  if( iter1.mNode == iter2.mNode )
  {
  if( iter2.mValue <= iter1.mValue )
  {
  // empty range OK, otherwise invalid input
  return iter2;
  }
  
  // If both iterators reference the same pair node, then
  // we're either removing values from the front of the
  // node or splitting the node. We can never be removing
  // the last value in the node in this case because iter2
  // points *after* the last entry to be removed.
  
  PairNode* node = iter1.mNode;
  if( iter1.mValue == node->first )
  {
  node->first = iter2.mValue;
  result = iter2;
  }
  else
  {
  PairNode* new_node = alloc_pair( node->mNext, node, iter2.mValue, node->second );
  new_node->mNext->mPrev = new_node;
  new_node->mPrev->mNext = new_node;
  node->second = iter1.mValue - 1;
  result = iterator( new_node, new_node->first );
  }
  }
  else
  {
  if( iter1.mNode == &mHead ) return iter1;
  PairNode* dn = iter1.mNode;
  if( iter1.mValue > dn->first )
  {
  dn->second = iter1.mValue - 1;
  dn = dn->mNext;
  }
  if( iter2.mNode != &mHead ) iter2.mNode->first = iter2.mValue;
  while( dn != iter2.mNode )
  {
  PairNode* dead = dn;
  dn = dn->mNext;
  
  dead->mPrev->mNext = dead->mNext;
  dead->mNext->mPrev = dead->mPrev;
  // dead->mPrev = dead->mNext = 0;
  delete_pair_node( dead );
  }
  
  result = iter2;
  }
  
  return result;
 }

References alloc_pair(), delete_pair_node(), mHead, moab::Range::PairNode::mNext, moab::Range::const_iterator::mNode, moab::Range::PairNode::mPrev, and moab::Range::const_iterator::mValue.

◆ find()

Range::const_iterator moab::Range::find ( EntityHandle val ) const

find an item int the list and return an iterator at that value

finds a value in the list. this method is preferred over other algorithms because it can be found faster this way.

Definition at line 510 of file Range.cpp.

 {
  // iterator through the list
  PairNode* iter = mHead.mNext;
  for( ; iter != &mHead && ( val > iter->second ); iter = iter->mNext )
  ;
  return ( ( iter->second >= val ) && ( iter->first <= val ) ) ? const_iterator( iter, val ) : end();
 }

References end(), mHead, and moab::Range::PairNode::mNext.

Referenced by moab::Core::check_adjacencies(), moab::DualTool::check_dual_adjs(), moab::AEntityFactory::check_equiv_entities(), moab::Skinner::classify_2d_boundary(), moab::FBEngine::compute_intersection_points(), moab::GeomTopoTool::duplicate_model(), erase(), moab::Skinner::find_skin_noadj(), moab::ReadUtil::gather_related_ents(), moab::GeomTopoTool::geometrize_surface_set(), moab::FBEngine::getAdjacentEntities(), moab::FBEngine::getEntType(), ZoltanPartitioner::include_closure(), moab::Intx2Mesh::intersect_meshes(), moab::GeomTopoTool::is_owned_set(), moab::FBEngine::isEntAdj(), merge_duplicate_vertices(), moab::HiReconstruction::obtain_nring_ngbvs(), moab::WriteHDF5Parallel::remove_remote_entities(), moab::WriteHDF5Parallel::remove_remote_sets(), moab::FBEngine::separate(), moab::ParallelComm::settle_intersection_points(), moab::FBEngine::split_boundary(), moab::DualTool::split_pair_nonmanifold(), moab::DualTool::traverse_hyperplane(), moab::vector_remove_range(), moab::FBEngine::weave_lateral_face_from_edges(), and moab::WriteSLAC::write_matsets().

◆ front()

const EntityHandle & moab::Range::front ( ) const

inline

get first entity in range

Definition at line 907 of file Range.hpp.

 {
  return mHead.mNext->first;
 }

References mHead, and moab::Range::PairNode::mNext.

Referenced by add_dead_elems_to_impl_compl(), all_of_dimension(), all_of_type(), moab::ReadMCNP5::average_with_existing_tally(), moab::MeshTag::clear_data(), moab::OrientedBoxTreeTool::closest_to_location(), moab::ReadIDEAS::create_elements(), moab::ReadHDF5::delete_non_side_elements(), moab::GeomTopoTool::entity_by_id(), fix_surface_senses(), moab::WriteNCDF::gather_mesh_information(), moab::WriteUtil::gather_nodes_from_elements(), moab::MeshTag::get_data(), moab::ParallelComm::get_part_handle(), moab::ReadHDF5::get_partition(), moab::ReadHDF5::insert_in_id_map(), moab::Intx2Mesh::intersect_meshes(), orient_faces_outward(), pop_front(), moab::ReadHDF5::read_elems(), moab::ReadHDF5VarLen::read_offsets(), moab::MeshTag::remove_data(), replace_faceted_cgm_surfs(), moab::GeomTopoTool::resize_rootSets(), moab::GeomTopoTool::restore_topology_from_adjacency(), moab::MeshTag::set_data(), and moab::OrientedBoxTreeTool::sphere_intersect_triangles().

◆ get_memory_use()

unsigned long moab::Range::get_memory_use ( ) const

Definition at line 997 of file Range.cpp.

 {
  unsigned long result = 0;
  for( const PairNode* n = mHead.mNext; n != &mHead; n = n->mNext )
  result += sizeof( PairNode );
  return result;
 }

References mHead, and moab::Range::PairNode::mNext.

Referenced by compactness().

◆ index()

int moab::Range::index ( EntityHandle handle ) const

inline

Examples: LaplacianSmoother.cpp.

Definition at line 936 of file Range.hpp.

 {
  if( handle < *begin() || handle > *rbegin() ) return -1;
  
  unsigned int i = 0;
  Range::const_pair_iterator pit = const_pair_begin();
  while( handle > ( *pit ).second && pit != const_pair_end() )
  {
  i += ( *pit ).second - ( *pit ).first + 1;
  ++pit;
  }
  if( handle < ( *pit ).first || pit == const_pair_end() ) return -1;
  
  return i + handle - ( *pit ).first;
 }

References begin(), const_pair_begin(), const_pair_end(), and rbegin().

◆ insert() [1/7]

template<typename T >

iterator moab::Range::insert	(	const T *	begin_iter,
		const T *	end_iter
	)

inline

Definition at line 276 of file Range.hpp.

  {
  return insert_list( begin_iter, end_iter );
  }

◆ insert() [2/7]

iterator moab::Range::insert ( EntityHandle val )

inline

insert an item into the list and return the iterator for the inserted item

Definition at line 250 of file Range.hpp.

  {
  return insert( begin(), val );
  }

◆ insert() [3/7]

iterator moab::Range::insert	(	EntityHandle	val1,
		EntityHandle	val2
	)

inline

insert a range of items into this list and return the iterator for the first inserted item

Definition at line 261 of file Range.hpp.

  {
  return insert( begin(), val1, val2 );
  }

◆ insert() [4/7]

Range::iterator moab::Range::insert	(	Range::iterator	prev,
		EntityHandle	first,
		EntityHandle	last
	)

insert a range of items into this list and return the iterator for the first inserted item

Definition at line 295 of file Range.cpp.

 {
  if( val1 == 0 || val1 > val2 ) return end();
  
  // Empty
  if( mHead.mNext == &mHead )
  {
  assert( prev == end() );
  PairNode* new_node = alloc_pair( &mHead, &mHead, val1, val2 );
  mHead.mNext = mHead.mPrev = new_node;
  return iterator( mHead.mNext, val1 );
  }
  
  PairNode* iter = prev.mNode;
  // If iterator is at end, set it to last.
  // Thus if the hint was to append, we start searching
  // at the end of the list.
  if( iter == &mHead ) iter = mHead.mPrev;
  // if hint (prev) is past insert position, reset it to the beginning.
  if( iter != &mHead && iter->first > val2 + 1 ) iter = mHead.mNext;
  
  // If hint is bogus then search backwards
  while( iter != mHead.mNext && iter->mPrev->second >= val1 - 1 )
  iter = iter->mPrev;
  
  // Input range is before beginning?
  if( iter->mPrev == &mHead && val2 < iter->first - 1 )
  {
  PairNode* new_node = alloc_pair( iter, &mHead, val1, val2 );
  mHead.mNext = iter->mPrev = new_node;
  return iterator( mHead.mNext, val1 );
  }
  
  // Find first intersecting list entry, or the next entry
  // if none intersects.
  while( iter != &mHead && iter->second + 1 < val1 )
  iter = iter->mNext;
  
  // Need to insert new pair (don't intersect any existing pair)?
  if( iter == &mHead || iter->first - 1 > val2 )
  {
  PairNode* new_node = alloc_pair( iter, iter->mPrev, val1, val2 );
  iter->mPrev = iter->mPrev->mNext = new_node;
  return iterator( iter->mPrev, val1 );
  }
  
  // Make the first intersecting pair the union of itself with [val1,val2]
  if( iter->first > val1 ) iter->first = val1;
  if( iter->second >= val2 ) return iterator( iter, val1 );
  iter->second = val2;
  
  // Merge any remaining pairs that intersect [val1,val2]
  while( iter->mNext != &mHead && iter->mNext->first <= val2 + 1 )
  {
  PairNode* dead = iter->mNext;
  iter->mNext = dead->mNext;
  dead->mNext->mPrev = iter;
  
  if( dead->second > val2 ) iter->second = dead->second;
  free_pair( dead );
  }
  
  return iterator( iter, val1 );
 }

References alloc_pair(), end(), moab::GeomUtil::first(), free_pair(), mHead, moab::Range::PairNode::mNext, moab::Range::const_iterator::mNode, and moab::Range::PairNode::mPrev.

◆ insert() [5/7]

Range::iterator moab::Range::insert	(	Range::iterator	hint,
		EntityHandle	val
	)

inserts a single value into this range

Definition at line 229 of file Range.cpp.

 {
  // don't allow zero-valued handles in Range
  if( val == 0 ) return end();
  
  // if this is empty, just add it and return an iterator to it
  if( &mHead == mHead.mNext )
  {
  mHead.mNext = mHead.mPrev = alloc_pair( &mHead, &mHead, val, val );
  return iterator( mHead.mNext, val );
  }
  
  // find the location in the list where we can safely insert
  // new items and keep it ordered
  PairNode* hter = hint.mNode;
  PairNode* jter = hter->first <= val ? hter : mHead.mNext;
  for( ; ( jter != &mHead ) && ( jter->second < val ); jter = jter->mNext )
  ;
  PairNode* iter = jter;
  jter = jter->mPrev;
  
  // if this val is already in the list
  if( ( iter->first <= val && iter->second >= val ) && ( iter != &mHead ) )
  {
  // return an iterator pointing to this location
  return iterator( iter, val );
  }
  
  // one of a few things can happen at this point
  // 1. this range needs to be backwardly extended
  // 2. the previous range needs to be forwardly extended
  // 3. a new range needs to be added
  
  // extend this range back a bit
  else if( ( iter->first == ( val + 1 ) ) && ( iter != &mHead ) )
  {
  iter->first = val;
  // see if we need to merge two ranges
  if( ( iter != mHead.mNext ) && ( jter->second == ( val - 1 ) ) )
  {
  jter->second = iter->second;
  iter->mPrev->mNext = iter->mNext;
  iter->mNext->mPrev = iter->mPrev;
  free_pair( iter );
  return iterator( jter, val );
  }
  else
  {
  return iterator( iter, val );
  }
  }
  // extend the previous range forward a bit
  else if( ( jter->second == ( val - 1 ) ) && ( iter != mHead.mNext ) )
  {
  jter->second = val;
  return iterator( jter, val );
  }
  // make a new range
  else
  {
  PairNode* new_node = alloc_pair( iter, iter->mPrev, val, val );
  iter->mPrev = new_node->mPrev->mNext = new_node;
  return iterator( new_node, val );
  }
 }

References alloc_pair(), end(), free_pair(), mHead, moab::Range::PairNode::mNext, moab::Range::const_iterator::mNode, and moab::Range::PairNode::mPrev.

Referenced by moab::ReadSms::add_entities(), moab::GeomTopoTool::add_geo_set(), moab::SharedSetData::append_local_handles(), moab::ParallelComm::assign_global_ids(), moab::ReadUtil::assign_ids(), moab::DualTool::atomic_pillow(), moab::FBEngine::BreakTriangle2(), moab::MeshGeneration::BrickInstance(), moab::ReadRTT::build_moab(), moab::ParallelComm::check_clean_iface(), moab::DualTool::check_dual_equiv_edges(), moab::ParallelComm::check_my_shared_handles(), moab::ParallelComm::check_sent_ents(), moab::Skinner::classify_2d_boundary(), moab::MeshTopoUtil::common_entity(), moab::WriteHDF5Parallel::communicate_shared_set_ids(), moab::TempestRemapper::ComputeOverlapMesh(), moab::DualTool::construct_dual_cells(), moab::DualTool::construct_dual_edges(), moab::DualTool::construct_dual_faces(), moab::DualTool::construct_dual_vertices(), moab::DualTool::construct_hp_parent_child(), moab::GeomTopoTool::construct_obb_tree(), moab::GeomTopoTool::construct_obb_trees(), moab::TempestRemapper::ConstructCoveringSet(), moab::DamselUtil::container_to_range(), moab::Tqdcfr::convert_nodesets_sidesets(), moab::ReadHDF5::convert_range_to_handle(), moab::convert_to_ranged_ids(), moab::BVHTree::convert_tree(), moab::copy_set_contents(), moab::copy_sorted_file_ids(), moab::ReadGmsh::create_elements(), moab::NCHelperMPAS::create_gather_set_cells(), moab::ReadABAQUS::create_instance_of_part(), moab::ParallelComm::create_interface_sets(), moab::NCHelperESMF::create_local_cells(), moab::NCHelperMPAS::create_local_cells(), moab::ScdNCHelper::create_mesh(), moab::NCHelperDomain::create_mesh(), moab::NCHelperESMF::create_mesh(), moab::NCHelperGCRM::create_mesh(), moab::NCHelperHOMME::create_mesh(), moab::NCHelperMPAS::create_mesh(), moab::NCHelperScrip::create_mesh(), moab::FBEngine::create_new_gedge(), moab::NCHelperESMF::create_padded_local_cells(), moab::NCHelperGCRM::create_padded_local_cells(), moab::NCHelperMPAS::create_padded_local_cells(), moab::ParallelComm::create_part(), moab::ScdInterface::create_scd_sequence(), moab::ReadGmsh::create_sets(), moab::ReadTemplate::create_sets(), moab::SpectralMeshTool::create_spectral_elems(), moab::ReadCGM::create_surface_facets(), moab::ReadOBJ::create_tri_faces(), moab::Core::create_vertices(), moab::ReadIDEAS::create_vertices(), moab::DualTool::delete_dual_entities(), moab::Core::delete_entities(), moab::ParallelComm::delete_entities(), moab::ReadHDF5::delete_non_side_elements(), moab::ReadParallel::delete_nonlocal_entities(), moab::GeomTopoTool::delete_obb_tree(), moab::FBEngine::divide_triangle(), moab::GeomTopoTool::duplicate_model(), moab::Core::estimated_memory_use(), moab::DualTool::face_shrink(), moab::ParallelComm::filter_pstatus(), moab::ScdInterface::find_boxes(), moab::Skinner::find_geometric_skin(), moab::Skinner::find_inferred_edges(), moab::find_map_values(), moab::ReadHDF5::find_sets_containing(), moab::Skinner::find_skin_noadj(), moab::Skinner::find_skin_vertices_1D(), moab::Skinner::find_skin_vertices_2D(), moab::Skinner::find_skin_vertices_3D(), moab::find_tag_values(), moab::DualTool::foc_delete_dual(), moab::DualTool::foc_get_ents(), moab::ParCommGraph::form_mesh_from_tuples(), moab::DualTool::fs_get_quad_loops(), moab::DualTool::fsr_get_fourth_quad(), moab::WriteSLAC::gather_interior_exterior(), moab::WriteVtk::gather_mesh(), moab::WriteHDF5::gather_mesh_info(), moab::WriteUtil::gather_nodes_from_elements(), moab::ReadUtil::gather_related_ents(), moab::GeomTopoTool::geometrize_surface_set(), moab::get_adjacencies_union(), moab::MeshTopoUtil::get_bridge_adjacencies(), moab::DualTool::get_cell_points(), moab::Core::get_connectivity(), moab::ReadDamsel::get_contents(), moab::GeomTopoTool::get_ct_children_by_dimension(), moab::AEntityFactory::get_down_adjacency_elements_poly(), moab::DualTool::get_dual_entities(), moab::ReadABAQUS::get_elements_by_id(), moab::TypeSequenceManager::get_entities(), moab::MeshSet::get_entities_by_dimension(), moab::MeshSet::get_entities_by_type(), moab::DualTool::get_graphics_points(), moab::MeshTopoUtil::get_manifold(), moab::ReadABAQUS::get_nodes_by_id(), moab::MeshSet::get_non_set_entities(), moab::ParallelComm::get_pstatus_entities(), moab::ReadHDF5::get_tagged_entities(), moab::TempestRemapper::GetOverlapAugmentedEntities(), moab::IntxUtils::global_gnomonic_projection(), iMOAB_DeregisterApplication(), insert(), insert_list(), moab::AdaptiveKDTree::intersect_children_with_elems(), moab::Intx2Mesh::intersect_meshes(), moab::ReadParallel::load_file(), moab::ReadHDF5::load_file_impl(), main(), make_tris_from_quads(), moab::MergeMesh::merge_entities(), moab::MergeMesh::merge_higher_dimensions(), moab::merge_ranged_ids(), moab::DualTool::next_loop_vertex(), moab::HiReconstruction::obtain_nring_ngbvs(), moab::range_inserter::operator=(), ZoltanPartitioner::partition_owned_cells(), perform_laplacian_smoothing(), perform_lloyd_relaxation(), moab::LloydSmoother::perform_smooth(), moab::AdaptiveKDTree::print(), moab::print_type_sets(), moab::ReadDamsel::process_ent_info(), process_partition_file(), moab::ReadCCMIO::read_cells(), moab::ReadHDF5::read_dense_tag(), moab::ReadTetGen::read_elem_file(), moab::ReadNCDF::read_elements(), moab::ReadTemplate::read_elements(), moab::ReadHDF5::read_elems(), McnpData::read_mcnpfile(), moab::ReadHDF5::read_node_adj_elems(), moab::ReadTetGen::read_node_file(), moab::ReadNCDF::read_nodes(), moab::ReadHDF5VarLen::read_offsets(), moab::ReadHDF5::read_set_data(), moab::ReadHDF5::read_sparse_tag_indices(), moab::ReadHDF5::read_tag_values_partial(), moab::ReadTemplate::read_vertices(), moab::MeshSetSequence::recursive_get_sets(), remove_entities_from_sets(), moab::IntxUtils::remove_padded_vertices(), moab::WriteHDF5Parallel::remove_remote_entities(), moab::WriteHDF5Parallel::remove_remote_sets(), moab::ParallelComm::resolve_shared_sets(), moab::DualTool::rev_atomic_pillow(), moab::DualTool::rev_face_shrink(), moab::BitPage::search(), moab::GeomTopoTool::separate_by_dimension(), moab::ReadHDF5Dataset::set_all_file_ids(), moab::Core::side_element(), moab::Skinner::skin_box(), moab::split_box(), moab::MeshTopoUtil::split_entities_manifold(), moab::MeshTopoUtil::split_entity_nonmanifold(), moab::FBEngine::split_internal_edge(), moab::ParCommGraph::split_owned_range(), moab::DualTool::split_pair_nonmanifold(), moab::FBEngine::split_surface_with_direction(), moab::MeshTopoUtil::star_next_entity(), moab::ReadHDF5::store_file_ids(), moab::ReadHDF5::store_sets_file_ids(), subset_by_dimension(), subset_by_type(), tag_depth(), moab::ParallelComm::tag_iface_entities(), moab::ScdInterface::tag_shared_vertices(), moab::DualTool::traverse_hyperplane(), moab::unite(), moab::UNPACK_RANGE(), moab::ParallelComm::unpack_sets(), moab::ReadNCDF::update(), moab::ReorderTool::update_set_contents(), moab::ReadVtk::vtk_read_polydata(), moab::ReadVtk::vtk_read_rectilinear_grid(), moab::ReadVtk::vtk_read_structured_grid(), moab::ReadVtk::vtk_read_structured_points(), moab::ReadVtk::vtk_read_unstructured_grid(), MetisPartitioner::write_aggregationtag_partition(), moab::WriteCCMIO::write_cells_and_faces(), moab::WriteGmsh::write_file(), MetisPartitioner::write_partition(), ZoltanPartitioner::write_partition(), moab::WriteHDF5::write_set_data(), and moab::IODebugTrack::~IODebugTrack().

◆ insert() [6/7]

void moab::Range::insert	(	Range::const_iterator	begini,
		Range::const_iterator	endi
	)

merges another Range with this one

Definition at line 523 of file Range.cpp.

 {
  if( begini == endi ) return;
  
  PairNode* node = begini.mNode;
  if( endi.mNode == node )
  {
  insert( *begini, ( *endi ) - 1 );
  return;
  }
  
  Range::iterator hint = insert( *begini, node->second );
  node = node->mNext;
  while( node != endi.mNode )
  {
  hint = insert( hint, node->first, node->second );
  node = node->mNext;
  }
  
  if( *endi > node->first )
  {
  if( *endi <= node->second )
  insert( hint, node->first, *(endi)-1 );
  else
  insert( hint, node->first, node->second );
  }
 }

References insert(), moab::Range::PairNode::mNext, and moab::Range::const_iterator::mNode.

◆ insert() [7/7]

template<class T >

iterator moab::Range::insert	(	typename T::const_iterator	begin_iter,
		typename T::const_iterator	end_iter
	)

inline

Definition at line 270 of file Range.hpp.

  {
  return insert_list( begin_iter, end_iter );
  }

◆ insert_list() [1/2]

template<typename Iterator >

Range::iterator moab::Range::insert_list	(	Iterator	begin_iter,
		Iterator	end_iter
	)

Definition at line 959 of file Range.hpp.

 {
  size_t n = std::distance( begin_iter, end_iter );
  EntityHandle* sorted = new EntityHandle[n];
  std::copy( begin_iter, end_iter, sorted );
  std::sort( sorted, sorted + n );
  iterator hint = begin();
  size_t i = 0;
  while( i < n )
  {
  size_t j = i + 1;
  while( j < n && sorted[j] == 1 + sorted[j - 1] )
  ++j;
  hint = insert( hint, sorted[i], sorted[i] + ( ( j - i ) - 1 ) );
  i = j;
  }
  delete[] sorted;
  return hint;
 }

References begin(), and insert().

◆ insert_list() [2/2]

template<typename T >

iterator moab::Range::insert_list	(	T	begin_iter,
		T	end_iter
	)

Referenced by moab::GeomTopoTool::delete_obb_tree().

◆ lower_bound() [1/4]

Range::const_iterator moab::Range::lower_bound	(	Range::const_iterator	first,
		Range::const_iterator	last,
		EntityHandle	val
	)

static

return an iterator to the first value >= val

Definition at line 809 of file Range.cpp.

 {
  // Find the first pair whose end is >= val
  PairNode* iter;
  for( iter = first.mNode; iter != last.mNode; iter = iter->mNext )
  {
  if( iter->second >= val )
  {
  // This is the correct pair. Either 'val' is in the range, or
  // the range starts before 'val' and iter->first IS the lower_bound.
  if( iter->first > val ) return const_iterator( iter, iter->first );
  return const_iterator( iter, val );
  }
  }
  
  if( iter->first >= val )
  return const_iterator( iter, iter->first );
  else if( *last > val )
  return const_iterator( iter, val );
  else
  return last;
 }

References moab::GeomUtil::first(), moab::Range::PairNode::mNext, and moab::Range::const_iterator::mNode.

Referenced by MetisPartitioner::assemble_taggedsets_graph(), moab::OrientedBox::compute_from_vertices(), moab::OrientedBox::covariance_data_from_tris(), moab::ReadHDF5::delete_non_side_elements(), equal_range(), moab::VarLenDenseTag::find_entities_with_value(), moab::DenseTag::find_entities_with_value(), moab::WriteVtk::gather_mesh(), moab::ReadHDF5::get_partition(), moab::ParallelComm::get_shared_entities(), moab::intersect(), moab::AdaptiveKDTree::intersect_children_with_elems(), moab::ReadHDF5::load_file_partial(), moab::WriteGMV::local_write_mesh(), lower_bound(), moab::ReadHDF5::read_tag_values_partial(), moab::WriteHDF5Parallel::remove_remote_entities(), moab::ParallelComm::resolve_shared_ents(), moab::ParallelComm::resolve_shared_sets(), moab::OrientedBoxTreeTool::sphere_intersect_triangles(), subset_by_dimension(), moab::ParallelMergeMesh::TagSharedElements(), moab::BoundBox::update(), and upper_bound().

◆ lower_bound() [2/4]

const_iterator moab::Range::lower_bound ( EntityHandle val ) const

inline

Definition at line 306 of file Range.hpp.

  {
  return lower_bound( begin(), end(), val );
  }

◆ lower_bound() [3/4]

Range::const_iterator moab::Range::lower_bound ( EntityType type ) const

Definition at line 839 of file Range.cpp.

 {
  int err;
  EntityHandle handle = CREATE_HANDLE( type, 0, err );
  return err ? end() : lower_bound( begin(), end(), handle );
 }

References begin(), moab::CREATE_HANDLE(), end(), and lower_bound().

◆ lower_bound() [4/4]

Range::const_iterator moab::Range::lower_bound	(	EntityType	type,
		const_iterator	first
	)		const

Definition at line 845 of file Range.cpp.

 {
  int err;
  EntityHandle handle = CREATE_HANDLE( type, 0, err );
  return err ? end() : lower_bound( first, end(), handle );
 }

References moab::CREATE_HANDLE(), end(), moab::GeomUtil::first(), and lower_bound().

◆ merge() [1/2]

void moab::Range::merge ( const Range & range )

inline

merges this Range with another range

Examples: ComputeTriDual.cpp.

Definition at line 346 of file Range.hpp.

  {
  insert( range.begin(), range.end() );
  }

References begin(), and end().

◆ merge() [2/2]

void moab::Range::merge	(	Range::const_iterator	beginr,
		Range::const_iterator	endr
	)

inline

merge a subset of some other range

Definition at line 352 of file Range.hpp.

  {
  insert( beginr, endr );
  }

◆ num_of_dimension()

unsigned moab::Range::num_of_dimension ( int dim ) const

Definition at line 911 of file Range.cpp.

 {
  const_pair_iterator iter = const_pair_begin();
  while( iter != const_pair_end() && CN::Dimension( TYPE_FROM_HANDLE( ( *iter ).second ) ) < dim )
  ++iter;
  
  int junk;
  unsigned count = 0;
  for( ; iter != const_pair_end(); ++iter )
  {
  int start_dim = CN::Dimension( TYPE_FROM_HANDLE( ( *iter ).first ) );
  int end_dim = CN::Dimension( TYPE_FROM_HANDLE( ( *iter ).second ) );
  if( start_dim > dim ) break;
  
  EntityHandle sh = start_dim < dim ? CREATE_HANDLE( CN::TypeDimensionMap[dim].first, 1, junk ) : ( *iter ).first;
  EntityHandle eh =
  end_dim > dim ? CREATE_HANDLE( CN::TypeDimensionMap[dim].second, MB_END_ID, junk ) : ( *iter ).second;
  count += eh - sh + 1;
  }
  
  return count;
 }

References const_pair_begin(), const_pair_end(), moab::CREATE_HANDLE(), dim, moab::CN::Dimension(), moab::GeomUtil::first(), MB_END_ID, moab::TYPE_FROM_HANDLE(), and moab::CN::TypeDimensionMap.

Referenced by main().

◆ num_of_type()

unsigned moab::Range::num_of_type ( EntityType type ) const

Definition at line 890 of file Range.cpp.

 {
  const_pair_iterator iter = const_pair_begin();
  while( iter != const_pair_end() && TYPE_FROM_HANDLE( ( *iter ).second ) < type )
  ++iter;
  
  unsigned count = 0;
  for( ; iter != const_pair_end(); ++iter )
  {
  EntityType start_type = TYPE_FROM_HANDLE( ( *iter ).first );
  EntityType end_type = TYPE_FROM_HANDLE( ( *iter ).second );
  if( start_type > type ) break;
  
  EntityID sid = start_type < type ? 1 : ID_FROM_HANDLE( ( *iter ).first );
  EntityID eid = end_type > type ? MB_END_ID : ID_FROM_HANDLE( ( *iter ).second );
  count += eid - sid + 1;
  }
  
  return count;
 }

References const_pair_begin(), const_pair_end(), moab::ID_FROM_HANDLE(), MB_END_ID, and moab::TYPE_FROM_HANDLE().

◆ operator-=()

Range & moab::Range::operator-= ( const Range & rhs )

just like subtract, but as an operator

Definition at line 730 of file Range.cpp.

 {
  const bool braindead = false;
  
  if( braindead )
  {
  // brain-dead implementation right now
  Range res( *this );
  for( Range::const_iterator rit = range2.begin(); rit != range2.end(); ++rit )
  res.erase( *rit );
  
  return *this;
  }
  else
  {
  Range::pair_iterator r_it0 = this->pair_begin();
  Range::const_pair_iterator r_it1 = range2.const_pair_begin();
  
  // terminate the while loop when at least one "start" iterator is at the
  // end of the list
  while( r_it0 != this->end() && r_it1 != range2.end() )
  {
  // case a: pair wholly within subtracted pair
  if( r_it0->first >= r_it1->first && r_it0->second <= r_it1->second )
  {
  Range::PairNode* rtmp = r_it0.node();
  ++r_it0;
  this->delete_pair_node( rtmp );
  }
  // case b: pair overlaps upper part of subtracted pair
  else if( r_it0->first <= r_it1->second && r_it0->first >= r_it1->first )
  {
  r_it0->first = r_it1->second + 1;
  ++r_it1;
  }
  // case c: pair overlaps lower part of subtracted pair
  else if( r_it0->second >= r_it1->first && r_it0->second <= r_it1->second )
  {
  r_it0->second = r_it1->first - 1;
  ++r_it0;
  }
  // case d: pair completely surrounds subtracted pair
  else if( r_it0->first < r_it1->first && r_it0->second > r_it1->second )
  {
  Range::PairNode* new_node =
  alloc_pair( r_it0.node(), r_it0.node()->mPrev, r_it0->first, r_it1->first - 1 );
  new_node->mPrev->mNext = new_node->mNext->mPrev = new_node;
  r_it0.node()->first = r_it1->second + 1;
  ++r_it1;
  }
  else
  {
  while( r_it0->second < r_it1->first && r_it0 != this->end() )
  ++r_it0;
  if( r_it0 == this->end() ) break;
  while( r_it1->second < r_it0->first && r_it1 != range2.end() )
  ++r_it1;
  }
  }
  return *this;
  }
 }

References alloc_pair(), begin(), const_pair_begin(), delete_pair_node(), end(), erase(), moab::Range::PairNode::mNext, moab::Range::PairNode::mPrev, moab::Range::pair_iterator::node(), and pair_begin().

◆ operator=()

Range & moab::Range::operator= ( const Range & copy )

operator=

Definition at line 210 of file Range.cpp.

 {
  clear();
  const PairNode* copy_node = copy.mHead.mNext;
  PairNode* new_node = &mHead;
  for( ; copy_node != &( copy.mHead ); copy_node = copy_node->mNext )
  {
  PairNode* tmp_node = alloc_pair( new_node->mNext, new_node, copy_node->first, copy_node->second );
  new_node->mNext->mPrev = tmp_node;
  new_node->mNext = tmp_node;
  new_node = tmp_node;
  }
  return *this;
 }

References alloc_pair(), clear(), mHead, moab::Range::PairNode::mNext, and moab::Range::PairNode::mPrev.

◆ operator[]()

EntityHandle moab::Range::operator[] ( EntityID index ) const

inline

Definition at line 929 of file Range.hpp.

 {
  Range::const_iterator i = begin();
  i += indexp;
  return *i;
 }

References begin().

◆ pair_begin() [1/2]

pair_iterator moab::Range::pair_begin ( )

inline

Definition at line 739 of file Range.hpp.

  {
  return pair_iterator( mHead.mNext );
  }

References moab::Range::PairNode::mNext.

Referenced by moab::ReadUtil::assign_ids(), moab::NCHelperGCRM::create_local_edges(), moab::NCHelperMPAS::create_local_edges(), moab::NCHelperESMF::create_local_vertices(), moab::NCHelperGCRM::create_local_vertices(), moab::NCHelperMPAS::create_local_vertices(), moab::NCHelperESMF::create_mesh(), moab::NCHelperGCRM::create_mesh(), moab::NCHelperMPAS::create_mesh(), moab::NCHelperScrip::create_mesh(), moab::DataCoupler::DataCoupler(), moab::UcdNCWriteHelper::jik_to_kji_stride(), moab::UcdNCHelper::kji_to_jik_stride(), operator-=(), moab::NCHelperGCRM::read_ucd_variables_to_nonset(), moab::NCHelperHOMME::read_ucd_variables_to_nonset(), moab::NCHelperMPAS::read_ucd_variables_to_nonset(), moab::NCWriteGCRM::write_nonset_variables(), moab::NCWriteHOMME::write_nonset_variables(), and moab::NCWriteMPAS::write_nonset_variables().

◆ pair_begin() [2/2]

const_pair_iterator moab::Range::pair_begin ( ) const

inline

Definition at line 756 of file Range.hpp.

  {
  return const_pair_iterator( mHead.mNext );
  }

References moab::Range::PairNode::mNext.

◆ pair_end() [1/2]

pair_iterator moab::Range::pair_end ( )

inline

Definition at line 743 of file Range.hpp.

  {
  return pair_iterator( &mHead );
  }

Referenced by moab::ReadUtil::assign_ids(), moab::NCHelperGCRM::create_local_edges(), moab::NCHelperMPAS::create_local_edges(), moab::NCHelperESMF::create_local_vertices(), moab::NCHelperGCRM::create_local_vertices(), moab::NCHelperMPAS::create_local_vertices(), moab::NCHelperESMF::create_mesh(), moab::NCHelperGCRM::create_mesh(), moab::NCHelperMPAS::create_mesh(), moab::NCHelperScrip::create_mesh(), moab::DataCoupler::DataCoupler(), moab::UcdNCWriteHelper::jik_to_kji_stride(), moab::UcdNCHelper::kji_to_jik_stride(), moab::NCHelperGCRM::read_ucd_variables_to_nonset(), moab::NCHelperHOMME::read_ucd_variables_to_nonset(), moab::NCHelperMPAS::read_ucd_variables_to_nonset(), moab::NCWriteGCRM::write_nonset_variables(), moab::NCWriteHOMME::write_nonset_variables(), and moab::NCWriteMPAS::write_nonset_variables().

◆ pair_end() [2/2]

const_pair_iterator moab::Range::pair_end ( ) const

inline

Definition at line 760 of file Range.hpp.

  {
  return const_pair_iterator( &mHead );
  }

◆ pop_back()

EntityHandle moab::Range::pop_back ( )

remove last entity from range

Definition at line 494 of file Range.cpp.

 {
  EntityHandle retval = back();
  if( mHead.mPrev->first == mHead.mPrev->second ) // need to remove pair from range
  delete_pair_node( mHead.mPrev );
  else
  --( mHead.mPrev->second ); // otherwise just adjust end value of pair
  
  return retval;
 }

References back(), delete_pair_node(), mHead, and moab::Range::PairNode::mPrev.

Referenced by MetisPartitioner::write_aggregationtag_partition(), MetisPartitioner::write_partition(), and ZoltanPartitioner::write_partition().

◆ pop_front()

EntityHandle moab::Range::pop_front ( )

remove first entity from range

Definition at line 482 of file Range.cpp.

 {
  EntityHandle retval = front();
  if( mHead.mNext->first == mHead.mNext->second ) // need to remove pair from range
  delete_pair_node( mHead.mNext );
  else
  ++( mHead.mNext->first ); // otherwise just adjust start value of pair
  
  return retval;
 }

References delete_pair_node(), front(), mHead, and moab::Range::PairNode::mNext.

Referenced by moab::GeomTopoTool::insert_in_tree().

◆ print() [1/2]

void moab::Range::print ( const char * indent_prefix = NULL ) const

Definition at line 618 of file Range.cpp.

 {
  print( std::cout, indent_prefix );
 }

Referenced by moab::MeshGeneration::BrickInstance(), moab::ParallelComm::list_entities(), main(), moab::operator<<(), and moab::ParallelComm::pack_tag().

◆ print() [2/2]

void moab::Range::print	(	std::ostream &	s,
		const char *	indent_prefix = `NULL`
	)		const

Definition at line 612 of file Range.cpp.

 {
  stream << str_rep( indent_prefix );
 }

References str_rep().

◆ psize()

size_t moab::Range::psize ( ) const

inline

return the number of range pairs in the list

Definition at line 979 of file Range.hpp.

 {
  size_t i = 0;
  Range::const_pair_iterator pit;
  for( pit = const_pair_begin(), i = 0; pit != const_pair_end(); ++pit, i++ )
  ;
  
  return i;
 }

References const_pair_begin(), and const_pair_end().

Referenced by moab::RangeSetIterator::build_pair_vec(), moab::SpectralMeshTool::convert_to_coarse(), moab::convert_to_ranged_ids(), moab::NCHelperGCRM::create_local_edges(), moab::NCHelperMPAS::create_local_edges(), moab::NCHelperESMF::create_local_vertices(), moab::NCHelperGCRM::create_local_vertices(), moab::NCHelperMPAS::create_local_vertices(), moab::NCHelperESMF::create_mesh(), moab::NCHelperGCRM::create_mesh(), moab::NCHelperMPAS::create_mesh(), moab::NCHelperScrip::create_mesh(), moab::ParallelComm::gather_data(), moab::ReadHDF5::load_file_partial(), moab::merge_ranged_ids(), moab::PACK_RANGE(), moab::ReadDamsel::process_ent_info(), moab::RANGE_SIZE(), moab::ReadHDF5::read_elems(), moab::ScdNCHelper::read_scd_variables_to_nonset_allocate(), moab::NCHelperGCRM::read_ucd_variables_to_nonset(), moab::NCHelperHOMME::read_ucd_variables_to_nonset(), moab::NCHelperMPAS::read_ucd_variables_to_nonset(), moab::NCHelperGCRM::read_ucd_variables_to_nonset_allocate(), moab::NCHelperHOMME::read_ucd_variables_to_nonset_allocate(), moab::NCHelperMPAS::read_ucd_variables_to_nonset_allocate(), moab::NCWriteGCRM::write_nonset_variables(), moab::NCWriteHOMME::write_nonset_variables(), and moab::NCWriteMPAS::write_nonset_variables().

◆ rbegin()

Range::const_reverse_iterator moab::Range::rbegin ( ) const

inline

return the beginning const reverse iterator of this range

Definition at line 866 of file Range.hpp.

 {
  return const_reverse_iterator( mHead.mPrev, mHead.mPrev->second );
 }

References mHead, and moab::Range::PairNode::mPrev.

Referenced by moab::SpatialLocator::add_elems(), MetisPartitioner::assemble_taggedsets_graph(), moab::DualTool::atomic_pillow(), moab::ParallelComm::check_clean_iface(), moab::WriteHDF5Parallel::communicate_shared_set_ids(), SphereDecomp::compute_nodes(), moab::ParCommGraph::compute_partition(), moab::DualTool::construct_dual_cells(), moab::DualTool::construct_dual_edges(), moab::DualTool::construct_dual_faces(), moab::DualTool::construct_dual_vertices(), moab::ParallelComm::create_iface_pc_links(), moab::SpatialLocator::create_tree(), moab::DataCoupler::DataCoupler(), moab::Core::delete_entities(), moab::DualTool::delete_whole_dual(), DeformMeshRemap::find_other_sets(), moab::DualTool::foc_get_ents(), index(), moab::OrientedBoxTreeTool::join_trees(), moab::WriteGMV::local_write_mesh(), moab::SpatialLocator::locate_points(), moab::DualTool::next_loop_vertex(), moab::GeomTopoTool::other_entity(), moab::ParallelComm::pack_entities(), ZoltanPartitioner::partition_owned_cells(), moab::LloydSmoother::perform_smooth(), moab::ReadTemplate::read_elements(), DeformMeshRemap::read_file(), moab::Tqdcfr::read_nodes(), moab::ParallelComm::resolve_shared_ents(), moab::DualTool::rev_atomic_pillow(), moab::ParallelComm::set_pstatus_entities(), moab::SpatialLocator::SpatialLocator(), moab::MeshTopoUtil::split_entities_manifold(), tag_depth(), moab::ParallelMergeMesh::TagSharedElements(), moab::ParallelComm::unpack_sets(), moab::WriteCCMIO::write_external_faces(), and moab::WriteGmsh::write_file().

◆ rend()

Range::const_reverse_iterator moab::Range::rend ( ) const

inline

return the ending const reverse iterator for this range

Definition at line 878 of file Range.hpp.

 {
  return const_reverse_iterator( &mHead, mHead.second );
 }

References mHead.

Referenced by moab::ParallelComm::check_clean_iface(), moab::WriteHDF5Parallel::communicate_shared_set_ids(), moab::Core::delete_entities(), moab::DualTool::delete_whole_dual(), moab::OrientedBoxTreeTool::join_trees(), moab::DualTool::split_pair_nonmanifold(), tag_depth(), and moab::WriteGmsh::write_file().

◆ sanity_check()

void moab::Range::sanity_check ( ) const

check for internal consistency

Definition at line 554 of file Range.cpp.

 {
  if( empty() ) return;
  
  const PairNode* node = mHead.mNext;
  std::vector< const PairNode* > seen_before;
  bool stop_it = false;
  
  for( ; stop_it == false; node = node->mNext )
  {
  // have we seen this node before?
  assert( std::find( seen_before.begin(), seen_before.end(), node ) == seen_before.end() );
  seen_before.push_back( node );
  
  // is the connection correct?
  assert( node->mNext->mPrev == node );
  
  // are the values right?
  assert( node->first <= node->second );
  if( node != &mHead && node->mPrev != &mHead ) assert( node->mPrev->second < node->first );
  
  if( node == &mHead ) stop_it = true;
  }
 }

References empty(), mHead, moab::Range::PairNode::mNext, and moab::Range::PairNode::mPrev.

◆ size()

size_t moab::Range::size ( ) const

return the number of values this Ranges represents

returns the number of values this list represents

Examples: ComputeTriDual.cpp, GenLargeMesh.cpp, and LaplacianSmoother.cpp.

Definition at line 77 of file Range.cpp.

 {
  // go through each pair and add up the number of values
  // we have.
  size_t sz = 0;
  for( PairNode* iter = mHead.mNext; iter != &mHead; iter = iter->mNext )
  {
  sz += ( ( iter->second - iter->first ) + 1 );
  }
  return sz;
 }

References mHead, and moab::Range::PairNode::mNext.

◆ str_rep()

const std::string moab::Range::str_rep ( const char * indent_prefix = NULL ) const

for debugging

Definition at line 579 of file Range.cpp.

 {
  std::stringstream str_stream;
  std::string indent_prefix_str;
  if( NULL != indent_prefix )
  {
  indent_prefix_str += indent_prefix;
  }
  
  if( empty() )
  {
  str_stream << indent_prefix_str << "\tempty" << std::endl;
  return str_stream.str().c_str();
  }
  
  for( const_pair_iterator i = const_pair_begin(); i != const_pair_end(); ++i )
  {
  EntityType t1 = TYPE_FROM_HANDLE( i->first );
  EntityType t2 = TYPE_FROM_HANDLE( i->second );
  
  str_stream << indent_prefix_str << "\t" << CN::EntityTypeName( t1 ) << " " << ID_FROM_HANDLE( i->first );
  if( i->first != i->second )
  {
  str_stream << " - ";
  if( t1 != t2 ) str_stream << CN::EntityTypeName( t2 ) << " ";
  str_stream << ID_FROM_HANDLE( i->second );
  }
  str_stream << std::endl;
  }
  
  return str_stream.str();
 }

References const_pair_begin(), const_pair_end(), empty(), moab::CN::EntityTypeName(), moab::ID_FROM_HANDLE(), and moab::TYPE_FROM_HANDLE().

Referenced by print().

◆ subset_by_dimension()

Range moab::Range::subset_by_dimension ( int dim ) const

return a subset of this range, by dimension

return a subset of this range, by type

Definition at line 966 of file Range.cpp.

 {
  EntityHandle handle1 = CREATE_HANDLE( CN::TypeDimensionMap[d].first, 0 );
  iterator st = lower_bound( begin(), end(), handle1 );
  
  iterator en;
  if( d < 4 )
  { // dimension 4 is MBENTITYSET
  EntityHandle handle2 = CREATE_HANDLE( CN::TypeDimensionMap[d + 1].first, 0 );
  en = lower_bound( st, end(), handle2 );
  }
  else
  {
  en = end();
  }
  
  Range result;
  result.insert( st, en );
  return result;
 }

References begin(), moab::CREATE_HANDLE(), end(), moab::GeomUtil::first(), insert(), lower_bound(), and moab::CN::TypeDimensionMap.

Referenced by moab::ParCommGraph::compute_partition(), moab::SpectralMeshTool::convert_to_coarse(), DeformMeshRemap::find_other_sets(), moab::WriteNCDF::gather_mesh_information(), moab::ParallelComm::get_ghosted_entities(), get_max_volume(), main(), and DeformMeshRemap::read_file().

◆ subset_by_type()

Range moab::Range::subset_by_type ( EntityType t ) const

return a subset of this range, by type

Definition at line 957 of file Range.cpp.

 {
  Range result;
  std::pair< const_iterator, const_iterator > iters = equal_range( t );
  result.insert( iters.first, iters.second );
  return result;
 }

References equal_range(), insert(), and t.

Referenced by moab::ParallelComm::add_verts(), moab::HalfFacetRep::check_mixed_entity_type(), moab::ReadParallel::delete_nonlocal_entities(), moab::ParallelComm::exchange_owned_meshs(), iMOAB_DeregisterApplication(), moab::Coupler::locate_points(), moab::Tqdcfr::read_nodes(), moab::ParCommGraph::receive_mesh(), and moab::WriteVtk::write_elems().

◆ swap()

void moab::Range::swap ( Range & range )

swap the contents of this range with another one

swap the contents of this range with another one THIS FUNCTION MUST NOT BE INLINED, THAT WILL ELIMINATE RANGE_EMPTY AND THIS_EMPTY BY SUBSTITUTION AND THE FUNCTION WON'T WORK RIGHT!

Definition at line 937 of file Range.cpp.

 {
  // update next/prev nodes of head of both ranges
  bool range_empty = ( range.mHead.mNext == &( range.mHead ) );
  bool this_empty = ( mHead.mNext == &mHead );
  
  range.mHead.mNext->mPrev = ( range_empty ? &( range.mHead ) : &mHead );
  range.mHead.mPrev->mNext = ( range_empty ? &( range.mHead ) : &mHead );
  mHead.mNext->mPrev = ( this_empty ? &mHead : &( range.mHead ) );
  mHead.mPrev->mNext = ( this_empty ? &mHead : &( range.mHead ) );
  
  // switch data in head nodes of both ranges
  PairNode *range_next = range.mHead.mNext, *range_prev = range.mHead.mPrev;
  range.mHead.mNext = ( this_empty ? &( range.mHead ) : mHead.mNext );
  range.mHead.mPrev = ( this_empty ? &( range.mHead ) : mHead.mPrev );
  mHead.mNext = ( range_empty ? &mHead : range_next );
  mHead.mPrev = ( range_empty ? &mHead : range_prev );
 }

References mHead, moab::Range::PairNode::mNext, and moab::Range::PairNode::mPrev.

Referenced by moab::AdaptiveKDTree::best_subdivision_plane(), moab::AdaptiveKDTree::best_subdivision_snap_plane(), moab::AdaptiveKDTree::best_vertex_median_plane(), moab::AdaptiveKDTree::best_vertex_sample_plane(), moab::OrientedBoxTreeTool::build_tree(), moab::ReadParallel::delete_nonlocal_entities(), dot_nodes(), moab::MeshTopoUtil::equivalent_entities(), moab::ParallelComm::filter_pstatus(), moab::Skinner::find_skin(), moab::Core::get_entities_by_type_and_tag(), moab::ReadHDF5::get_subset_ids(), moab::Core::get_vertices(), moab::DualTool::next_loop_vertex(), moab::WriteHDF5Parallel::remove_remote_entities(), moab::WriteHDF5Parallel::remove_remote_sets(), moab::ParallelComm::resolve_shared_sets(), MetisPartitioner::write_aggregationtag_partition(), MetisPartitioner::write_partition(), and ZoltanPartitioner::write_partition().

◆ upper_bound() [1/4]

Range::const_iterator moab::Range::upper_bound	(	Range::const_iterator	first,
		Range::const_iterator	last,
		EntityHandle	val
	)

static

Definition at line 832 of file Range.cpp.

 {
  Range::const_iterator result = lower_bound( first, last, val );
  if( result != last && *result == val ) ++result;
  return result;
 }

References moab::GeomUtil::first(), and lower_bound().

Referenced by MetisPartitioner::assemble_taggedsets_graph(), moab::ParallelComm::check_my_shared_handles(), moab::OrientedBox::compute_from_vertices(), moab::Skinner::find_skin_vertices_3D(), moab::ReadHDF5::get_partition(), moab::ParallelComm::get_shared_entities(), moab::Core::get_vertices(), moab::ParallelComm::resolve_shared_ents(), and moab::ParallelMergeMesh::TagSharedElements().

◆ upper_bound() [2/4]

const_iterator moab::Range::upper_bound ( EntityHandle val ) const

inline

Definition at line 310 of file Range.hpp.

  {
  return upper_bound( begin(), end(), val );
  }

◆ upper_bound() [3/4]

Range::const_iterator moab::Range::upper_bound ( EntityType type ) const

Definition at line 852 of file Range.cpp.

 {
  // if (type+1) overflows, err will be true and we return end().
  int err;
  EntityHandle handle = CREATE_HANDLE( type + 1, 0, err );
  return err ? end() : lower_bound( begin(), end(), handle );
 }

References begin(), moab::CREATE_HANDLE(), end(), and lower_bound().

◆ upper_bound() [4/4]

Range::const_iterator moab::Range::upper_bound	(	EntityType	type,
		const_iterator	first
	)		const

Definition at line 859 of file Range.cpp.

 {
  // if (type+1) overflows, err will be true and we return end().
  int err;
  EntityHandle handle = CREATE_HANDLE( type + 1, 0, err );
  return err ? end() : lower_bound( first, end(), handle );
 }

References moab::CREATE_HANDLE(), end(), moab::GeomUtil::first(), and lower_bound().

Friends And Related Function Documentation

◆ intersect

Range intersect	(	const Range &	range1,
		const Range &	range2
	)

friend

intersect two ranges, placing the results in the return range

Definition at line 626 of file Range.cpp.

 {
  Range::const_pair_iterator r_it[2] = { range1.const_pair_begin(), range2.const_pair_begin() };
  EntityHandle low_it, high_it;
  
  Range lhs;
  Range::iterator hint = lhs.begin();
  
  // terminate the while loop when at least one "start" iterator is at the
  // end of the list
  while( r_it[0] != range1.end() && r_it[1] != range2.end() )
  {
  
  if( r_it[0]->second < r_it[1]->first )
  // 1st subrange completely below 2nd subrange
  ++r_it[0];
  else if( r_it[1]->second < r_it[0]->first )
  // 2nd subrange completely below 1st subrange
  ++r_it[1];
  
  else
  {
  // else ranges overlap; first find greater start and lesser end
  low_it = MAX( r_it[0]->first, r_it[1]->first );
  high_it = MIN( r_it[0]->second, r_it[1]->second );
  
  // insert into result
  hint = lhs.insert( hint, low_it, high_it );
  
  // now find bounds of this insertion and increment corresponding iterator
  if( high_it == r_it[0]->second ) ++r_it[0];
  if( high_it == r_it[1]->second ) ++r_it[1];
  }
  }
  
  return lhs;
 }

◆ subtract

Range subtract	(	const Range &	from,
		const Range &	range2
	)

friend

subtract range2 from this, placing the results in the return range

Definition at line 664 of file Range.cpp.

 {
  const bool braindead = false;
  
  if( braindead )
  {
  // brain-dead implementation right now
  Range res( range1 );
  for( Range::const_iterator rit = range2.begin(); rit != range2.end(); ++rit )
  res.erase( *rit );
  
  return res;
  }
  else
  {
  Range lhs( range1 );
  
  Range::pair_iterator r_it0 = lhs.pair_begin();
  Range::const_pair_iterator r_it1 = range2.const_pair_begin();
  
  // terminate the while loop when at least one "start" iterator is at the
  // end of the list
  while( r_it0 != lhs.end() && r_it1 != range2.end() )
  {
  // case a: pair wholly within subtracted pair
  if( r_it0->first >= r_it1->first && r_it0->second <= r_it1->second )
  {
  Range::PairNode* rtmp = r_it0.node();
  ++r_it0;
  lhs.delete_pair_node( rtmp );
  }
  // case b: pair overlaps upper part of subtracted pair
  else if( r_it0->first <= r_it1->second && r_it0->first >= r_it1->first )
  {
  r_it0->first = r_it1->second + 1;
  ++r_it1;
  }
  // case c: pair overlaps lower part of subtracted pair
  else if( r_it0->second >= r_it1->first && r_it0->second <= r_it1->second )
  {
  r_it0->second = r_it1->first - 1;
  ++r_it0;
  }
  // case d: pair completely surrounds subtracted pair
  else if( r_it0->first < r_it1->first && r_it0->second > r_it1->second )
  {
  Range::PairNode* new_node =
  alloc_pair( r_it0.node(), r_it0.node()->mPrev, r_it0->first, r_it1->first - 1 );
  new_node->mPrev->mNext = new_node->mNext->mPrev = new_node;
  r_it0.node()->first = r_it1->second + 1;
  ++r_it1;
  }
  else
  {
  while( r_it0->second < r_it1->first && r_it0 != lhs.end() )
  ++r_it0;
  if( r_it0 == lhs.end() ) break;
  while( r_it1->second < r_it0->first && r_it1 != range2.end() )
  ++r_it1;
  }
  }
  
  return lhs;
  }
 }

Member Data Documentation

◆ mHead

PairNode moab::Range::mHead

protected

the head of the list that contains pairs that represent the ranges this list is sorted and unique at all times

Definition at line 392 of file Range.hpp.

Referenced by back(), begin(), clear(), contains(), delete_pair_node(), empty(), end(), erase(), find(), front(), get_memory_use(), insert(), operator=(), pop_back(), pop_front(), Range(), rbegin(), rend(), sanity_check(), size(), and swap().

The documentation for this class was generated from the following files:

Classes

Public Types

Public Member Functions

Static Public Member Functions

Protected Member Functions

Protected Attributes

Friends

Detailed Description

Member Typedef Documentation

◆ iterator

◆ reverse_iterator

◆ value_type

Constructor & Destructor Documentation

◆ Range() [1/3]

◆ Range() [2/3]

◆ Range() [3/3]

◆ ~Range()

Member Function Documentation

◆ all_of_dimension()

◆ all_of_type()

◆ back()

◆ begin()

◆ clear()

◆ compactness()

◆ const_pair_begin()

◆ const_pair_end()

◆ contains()

◆ delete_pair_node()

◆ empty()

◆ end()

◆ equal_range()

◆ erase() [1/3]

◆ erase() [2/3]

◆ erase() [3/3]

◆ find()

◆ front()

◆ get_memory_use()

◆ index()

◆ insert() [1/7]

◆ insert() [2/7]

◆ insert() [3/7]

◆ insert() [4/7]

◆ insert() [5/7]

◆ insert() [6/7]

◆ insert() [7/7]

◆ insert_list() [1/2]

◆ insert_list() [2/2]

◆ lower_bound() [1/4]

◆ lower_bound() [2/4]

◆ lower_bound() [3/4]

◆ lower_bound() [4/4]

◆ merge() [1/2]

◆ merge() [2/2]

◆ num_of_dimension()

◆ num_of_type()

◆ operator-=()

◆ operator=()

◆ operator[]()

◆ pair_begin() [1/2]

◆ pair_begin() [2/2]

◆ pair_end() [1/2]

◆ pair_end() [2/2]

◆ pop_back()

◆ pop_front()

◆ print() [1/2]

◆ print() [2/2]

◆ psize()

◆ rbegin()

◆ rend()

◆ sanity_check()

◆ size()

◆ str_rep()

◆ subset_by_dimension()

◆ subset_by_type()

◆ swap()

◆ upper_bound() [1/4]

◆ upper_bound() [2/4]

◆ upper_bound() [3/4]

◆ upper_bound() [4/4]

Friends And Related Function Documentation