IFGraph_Compare Class Reference

this class evaluates effect of two compared sub-parts :
cumulation (union), common part (intersection-overlapping)
part specific to first sub-part or to the second one
Results are kept in a Graph, several question can be set
Basic Iteration gives Cumulation (union)

#include <IFGraph_Compare.hxx>

Inheritance diagram for IFGraph_Compare:

Public Member Functions
void *	operator new (size_t, void *anAddress)
void *	operator new (size_t size)
void	operator delete (void *anAddress)
	IFGraph_Compare (const Interface_Graph &agraph)
	creates empty Compare, ready to work
void	GetFromEntity (const Handle< Standard_Transient > &ent, const Standard_Boolean first)
	adds an entity and its shared ones to the list : first True means adds to the first sub-list, else to the 2nd
void	GetFromIter (const Interface_EntityIterator &iter, const Standard_Boolean first)
	adds a list of entities (as an iterator) as such, that is, their shared entities are not considered (use AllShared to have them) first True means adds to the first sub-list, else to the 2nd
void	Merge ()
	merges the second list into the first one, hence the second list is empty
void	RemoveSecond ()
	Removes the contents of second list
void	KeepCommon ()
	Keeps only Common part, sets it as First list and clears second list
void	ResetData ()
	Allows to restart on a new data set
virtual void	Evaluate ()
	Recomputes result of comparing to sub-parts
Interface_EntityIterator	Common () const
	returns entities common to the both parts
Interface_EntityIterator	FirstOnly () const
	returns entities which are exclusively in the first list
Interface_EntityIterator	SecondOnly () const
	returns entities which are exclusively in the second part

---

Constructor & Destructor Documentation

IFGraph_Compare::IFGraph_Compare

(

const Interface_Graph &

agraph

)

---

Member Function Documentation

Interface_EntityIterator IFGraph_Compare::Common

(

)

const

virtual void IFGraph_Compare::Evaluate

(

)

[virtual]

Reimplemented from Interface_GraphContent.

Interface_EntityIterator IFGraph_Compare::FirstOnly

(

)

const

void IFGraph_Compare::GetFromEntity	(	const Handle< Standard_Transient > &	ent,
		const Standard_Boolean	first
	)

void IFGraph_Compare::GetFromIter	(	const Interface_EntityIterator &	iter,
		const Standard_Boolean	first
	)

void IFGraph_Compare::KeepCommon

(

)

void IFGraph_Compare::Merge

(

)

void IFGraph_Compare::operator delete

(

void *

anAddress

)

[inline]

Reimplemented from Interface_GraphContent.

void* IFGraph_Compare::operator new

(

size_t

size

)

[inline]

Reimplemented from Interface_GraphContent.

void* IFGraph_Compare::operator new	(	size_t	,
		void *	anAddress
	)		[inline]

Reimplemented from Interface_GraphContent.

void IFGraph_Compare::RemoveSecond

(

)

void IFGraph_Compare::ResetData

(

)

Interface_EntityIterator IFGraph_Compare::SecondOnly

(

)

const

---

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

• IFGraph_Compare.hxx