EM::RelationTree Class Reference

A Relation tree where a parent-child relationship means a top-bottom relationship for the horizons. More...

Classes
class	Node

Public Member Functions
	RelationTree (bool is2d, bool read=true)
	~RelationTree ()
void	addRelation (const MultiID &id1, const MultiID &id2, bool write=true)
int	findRelation (const MultiID &, const MultiID &) const
const RelationTree::Node *	getNode (const MultiID &) const
void	getParents (int, TypeSet< int > &) const
bool	getSorted (const TypeSet< MultiID > &unsortedids, TypeSet< MultiID > &sortedids) const
bool	read ()
void	removeNode (const MultiID &, bool write=true)
bool	write () const

Static Public Member Functions
static bool	clear (bool is2d, bool dowrite=true)
static bool	getSorted (bool is2d, BufferStringSet &)
static bool	getSorted (bool is2d, TypeSet< MultiID > &)
static bool	sortHorizons (bool is2d, const TypeSet< MultiID > &unsortedids, TypeSet< MultiID > &sortedids)
static bool	update (bool id2d, const TypeSet< MultiID > &sortedids)

Protected Member Functions
int	findNode (const MultiID &) const
bool	read (bool removeoutdated)

Static Protected Member Functions
static const char *	sKeyHorizonRelations ()

Protected Attributes
bool	is2d_
ObjectSet< RelationTree::Node >	nodes_

Detailed Description

A Relation tree where a parent-child relationship means a top-bottom relationship for the horizons.

<>

Constructor & Destructor Documentation

RelationTree()

EM::RelationTree::RelationTree	(	bool	is2d,
		bool	read = true
	)

~RelationTree()

EM::RelationTree::~RelationTree

(

)

Member Function Documentation

addRelation()

void EM::RelationTree::addRelation	(	const MultiID &	id1,
		const MultiID &	id2,
		bool	write = true
	)

clear()

static bool EM::RelationTree::clear ( bool  is2d, bool  dowrite = true  )

static

findNode()

int EM::RelationTree::findNode ( const MultiID &  ) const

protected

findRelation()

int EM::RelationTree::findRelation	(	const MultiID &	,
		const MultiID &
	)		const

getNode()

const RelationTree::Node* EM::RelationTree::getNode

(

const MultiID &

)

const

getParents()

void EM::RelationTree::getParents	(	int	,
		TypeSet< int > &
	)		const

getSorted() [1/3]

static bool EM::RelationTree::getSorted ( bool  is2d, BufferStringSet &    )

static

getSorted() [2/3]

static bool EM::RelationTree::getSorted ( bool  is2d, TypeSet< MultiID > &    )

static

getSorted() [3/3]

bool EM::RelationTree::getSorted	(	const TypeSet< MultiID > &	unsortedids,
		TypeSet< MultiID > &	sortedids
	)		const

read() [1/2]

bool EM::RelationTree::read ( )

inline

read() [2/2]

bool EM::RelationTree::read ( bool  removeoutdated )

protected

removeNode()

void EM::RelationTree::removeNode	(	const MultiID &	,
		bool	write = true
	)

sKeyHorizonRelations()

static const char* EM::RelationTree::sKeyHorizonRelations ( )

staticprotected

sortHorizons()

static bool EM::RelationTree::sortHorizons ( bool  is2d, const TypeSet< MultiID > &  unsortedids, TypeSet< MultiID > &  sortedids  )

static

Much faster if you only need RelationTree for sorting and unsortedids is a small subset of all horizons in the survey.

update()

static bool EM::RelationTree::update ( bool  id2d, const TypeSet< MultiID > &  sortedids  )

static

write()

bool EM::RelationTree::write

(

)

const

Member Data Documentation

is2d_

bool EM::RelationTree::is2d_

protected

nodes_

ObjectSet<RelationTree::Node> EM::RelationTree::nodes_

protected