gum::NodeGraphPart Class Reference

Class for node sets in graph. More...

#include <nodeGraphPart.h>

Inheritance diagram for gum::NodeGraphPart:

Collaboration diagram for gum::NodeGraphPart:

Public Attributes
Signaler1< NodeId >	onNodeAdded
Signaler1< NodeId >	onNodeDeleted

Public Member Functions
Constructors / Destructors
	NodeGraphPart (Size holes_size=HashTableConst::default_size, bool holes_resize_policy=true)
	default constructor More...
	NodeGraphPart (const NodeGraphPart &s)
	copy constructor More...
virtual	~NodeGraphPart ()
	destructor More...
Operators
NodeGraphPart &	operator= (const NodeGraphPart &p)
	copy operator More...
bool	operator== (const NodeGraphPart &p) const
	check whether two NodeGraphParts contain the same nodes More...
bool	operator!= (const NodeGraphPart &p) const
	check whether two NodeGraphParts contain different nodes More...
Accessors/Modifiers
void	populateNodes (const NodeGraphPart &s)
	populateNodes clears *this and fills it with the same nodes as "s" More...
template<typename T >
void	populateNodesFromProperty (const NodeProperty< T > &h)
	populateNodesFromProperty clears *this and fills it with the keys of "h" More...
NodeId	nextNodeId () const
	returns a new node id, not yet used by any node More...
virtual NodeId	addNode ()
	insert a new node and return its id More...
std::vector< NodeId >	addNodes (Size n)
	insert n nodes More...
virtual void	addNodeWithId (const NodeId id)
	try to insert a node with the given id More...
virtual void	eraseNode (const NodeId id)
	erase the node with the given id More...
bool	existsNode (const NodeId id) const
	returns true iff the NodeGraphPart contains the given nodeId More...
bool	exists (const NodeId id) const
	alias for existsNode More...
bool	emptyNodes () const
	indicates whether there exists nodes in the NodeGraphPart More...
bool	empty () const
	alias for emptyNodes More...
virtual void	clearNodes ()
	remove all the nodes from the NodeGraphPart More...
virtual void	clear ()
	alias for clearNodes More...
Size	sizeNodes () const
	returns the number of nodes in the NodeGraphPart More...
Size	size () const
	alias for sizeNodes More...
NodeId	bound () const
	returns a number n such that all node ids are strictly lower than n More...
NodeSet	asNodeSet () const
	returns a copy of the set of nodes represented by the NodeGraphPart More...
const NodeGraphPart &	nodes () const
	return *this as a NodeGraphPart More...
node_iterator_safe	beginSafe () const
	a begin iterator to parse the set of nodes contained in the NodeGraphPart More...
const node_iterator_safe &	endSafe () const noexcept
	the end iterator to parse the set of nodes contained in the NodeGraphPart More...
node_iterator	begin () const noexcept
	a begin iterator to parse the set of nodes contained in the NodeGraphPart More...
const node_iterator &	end () const noexcept
	the end iterator to parse the set of nodes contained in the NodeGraphPart More...
virtual std::string	toString () const
	a function to display the set of nodes More...
template<typename VAL >
NodeProperty< VAL >	nodesProperty (VAL(*f)(const NodeId &), Size size=0) const
	a method to create a HashTable with key:NodeId and value:VAL More...
template<typename VAL >
NodeProperty< VAL >	nodesProperty (const VAL &a, Size size=0) const
	a method to create a hashMap with key:NodeId and value:VAL More...
template<typename VAL >
List< VAL >	listMapNodes (VAL(*f)(const NodeId &)) const
	a method to create a list of VAL from a set of nodes (using for every nodee, say x, the VAL f(x)) More...

Public Types
typedef NodeGraphPartIterator	NodeIterator
typedef NodeGraphPartIterator	NodeConstIterator
typedef NodeGraphPartIteratorSafe	NodeIteratorSafe
typedef NodeGraphPartIteratorSafe	NodeConstIteratorSafe
using	node_iterator = NodeGraphPartIterator
	types for STL compliance More...
using	node_const_iterator = NodeGraphPartIterator
	types for STL compliance More...
using	node_iterator_safe = NodeGraphPartIteratorSafe
	types for STL compliance More...
using	node_const_iterator_safe = NodeGraphPartIteratorSafe
	types for STL compliance More...

Friends
class	NodeGraphPartIterator
class	NodeGraphPartIteratorSafe
class	gum_tests::NodeGraphPartTestSuite
	to enable testunits to use check More...

Detailed Description

Class for node sets in graph.

NodeGraphPart represents the set of nodes of all the graphs. It is built to be as light as possible and it implements its own NodeId factory. The set of NodeId is 0 ... ( bound-1) minus the NodeIds in holes.

Author

Pierre-Henri WUILLEMIN() & Christophe GONZALES()

Usage example:

// create an empty node list
NodeGraphPart nodes1;

// add 2 elements
NodeId id_a=nodes1.addNode( );
NodeId id_b=nodes1.addNode( );

// checks if there exists a node with ID = 6
if ( !nodes1.exists( 6 ) ) std::cerr << "no node with ID 6" << std::endl;

// check if the set of nodes is empty
if ( !nodes1.empty() || ( nodes1.size() != 0 ) )
  std::cerr << "nodes1 is not empty" << std::endl;

// copy a set of nodes
NodeGraphPart nodes2 = nodes1, nodes3;
nodes3 = nodes1;

// remove elements from list3
nodes3.eraseNode( id_a );
nodes3.eraseNode( id_b );

// remove all the elements from the list
nodes1.clear();

for ( NodeGraphPart::iterator it=nodes2.beginNodes();
      it!=nodes2.endNodes();++it ) {
  std::cerr<<*it<<"  ";
}

std::cerr<<"list : "<<nodes2.listMapNodes(getDouble)<<std::endl;

std::cerr<<"hashmap : "<<nodes2.hashMapNodes(getDouble)<<std::endl;

Definition at line 253 of file nodeGraphPart.h.

Member Typedef Documentation

node_const_iterator

using gum::NodeGraphPart::node_const_iterator = NodeGraphPartIterator

types for STL compliance

Definition at line 258 of file nodeGraphPart.h.

node_const_iterator_safe

using gum::NodeGraphPart::node_const_iterator_safe = NodeGraphPartIteratorSafe

types for STL compliance

Definition at line 260 of file nodeGraphPart.h.

node_iterator

using gum::NodeGraphPart::node_iterator = NodeGraphPartIterator

types for STL compliance

Definition at line 257 of file nodeGraphPart.h.

node_iterator_safe

using gum::NodeGraphPart::node_iterator_safe = NodeGraphPartIteratorSafe

types for STL compliance

Definition at line 259 of file nodeGraphPart.h.

NodeConstIterator

typedef NodeGraphPartIterator gum::NodeGraphPart::NodeConstIterator

Definition at line 267 of file nodeGraphPart.h.

NodeConstIteratorSafe

typedef NodeGraphPartIteratorSafe gum::NodeGraphPart::NodeConstIteratorSafe

Definition at line 269 of file nodeGraphPart.h.

NodeIterator

typedef NodeGraphPartIterator gum::NodeGraphPart::NodeIterator

Definition at line 266 of file nodeGraphPart.h.

NodeIteratorSafe

typedef NodeGraphPartIteratorSafe gum::NodeGraphPart::NodeIteratorSafe

Definition at line 268 of file nodeGraphPart.h.

Constructor & Destructor Documentation

NodeGraphPart() [1/2]

gum::NodeGraphPart::NodeGraphPart ( Size  holes_size = HashTableConst::default_size, bool  holes_resize_policy = true  )

explicit

default constructor

A NodeGrphPart does not store all its nodes. To be lighter in terms of memory consumption, it store its maximal NodeId and the set of NodeIds between 0 and this maximum that do not actually belong to the set of its nodes (the so-called set of holes). In practice, it turns out that the set of holes is most often very small.

Parameters

holes_size	the size of the hash table used to store all holes
holes_resize_policy	the resizing policy of this hash table

Definition at line 37 of file nodeGraphPart.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                                        :
      _holes_size_(holes_size), _holes_resize_policy_(holes_resize_policy),
      _endIteratorSafe_(*this), _boundVal_(0) {
    _holes_ = nullptr;
    GUM_CONSTRUCTOR(NodeGraphPart);
    _updateEndIteratorSafe_();
  }

Here is the call graph for this function:

NodeGraphPart() [2/2]

gum::NodeGraphPart::NodeGraphPart

(

const NodeGraphPart &

s

)

copy constructor

Parameters

s	the NodeGraphPart to be copied

Definition at line 45 of file nodeGraphPart.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                     :
      _holes_size_(s._holes_size_), _holes_resize_policy_(s._holes_resize_policy_),
      _endIteratorSafe_(*this), _boundVal_(s._boundVal_) {
    _holes_ = nullptr;

    if (s._holes_) _holes_ = new NodeSet(*s._holes_);

    _updateEndIteratorSafe_();

    GUM_CONS_CPY(NodeGraphPart);
  }

Here is the call graph for this function:

~NodeGraphPart()

gum::NodeGraphPart::~NodeGraphPart ( )

virtual

destructor

Definition at line 57 of file nodeGraphPart.cpp.

References gum::Set< Key, Alloc >::emplace().

                                {
    if (_holes_) delete _holes_;

    GUM_DESTRUCTOR(NodeGraphPart);
  }

Here is the call graph for this function:

Member Function Documentation

_addHole_()

void gum::NodeGraphPart::_addHole_ ( NodeId  id )

private

to add a hole.

Warning

id is assumed not to be already a hole

Definition at line 76 of file nodeGraphPart.cpp.

References gum::Set< Key, Alloc >::emplace().

                                           {
    // we assume that the node exists
    if (node + 1 == _boundVal_) {
      // we remove the max : no new hole and maybe a bunch of holes to remove
      --_boundVal_;

      if (_holes_) {
        while (_holes_->contains(_boundVal_ - 1)) {
          // a bunch of holes to remove. We do not use inHoles for optimisation
          // :
          // not to repeat the test if ( _holes_) each time
          _holes_->erase(--_boundVal_);
        }

        if (_holes_->empty()) {
          delete _holes_;
          _holes_ = nullptr;
        }
      }

      _updateEndIteratorSafe_();
    } else {
      if (!_holes_) _holes_ = new NodeSet(_holes_size_, _holes_resize_policy_);

      _holes_->insert(node);
    }
  }

Here is the call graph for this function:

_clearNodes_()

void gum::NodeGraphPart::_clearNodes_ ( )

private

code for clearing nodes (called twice)

Definition at line 154 of file nodeGraphPart.cpp.

References gum::Set< Key, Alloc >::emplace().

                                   {
    NodeId bound = _boundVal_;
    _boundVal_   = 0;

    if (onNodeDeleted.hasListener()) {
      for (NodeId n = 0; n < bound; ++n) {
        if (!_inHoles_(n)) GUM_EMIT1(onNodeDeleted, n);
      }
    }

    _updateEndIteratorSafe_();

    delete (_holes_);
    _holes_ = nullptr;
  }

Here is the call graph for this function:

_eraseHole_()

INLINE void gum::NodeGraphPart::_eraseHole_ ( NodeId  id )

private

to delete hole.

Warning

the hole is assumed to be existing.

Definition at line 224 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                  {
    _holes_->erase(id);

    if (_holes_->empty()) {
      delete _holes_;
      _holes_ = nullptr;
    }
  }

Here is the call graph for this function:

_inHoles_()

INLINE bool gum::NodeGraphPart::_inHoles_ ( NodeId  id ) const

private

Returns

true if id is part of holes

Definition at line 356 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

{ return _holes_ && _holes_->contains(id); }

Here is the call graph for this function:

_sizeHoles_()

INLINE Size gum::NodeGraphPart::_sizeHoles_ ( ) const

private

Returns

the size of holes

Definition at line 359 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

{ return _holes_ ? _holes_->size() : (Size)0; }

Here is the call graph for this function:

_updateEndIteratorSafe_()

INLINE void gum::NodeGraphPart::_updateEndIteratorSafe_ ( )

private

updating endIterator (always at max+1)

Definition at line 308 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

{ _endIteratorSafe_.setPos_(_boundVal_); }

Here is the call graph for this function:

addNode()

INLINE NodeId gum::NodeGraphPart::addNode ( )

virtual

insert a new node and return its id

Returns

the id chosen by the internal idFactory

Reimplemented in gum::CliqueGraph.

Definition at line 238 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                       {
    NodeId newNode;

    // fill the first hole if holes exist
    if (_holes_ && (!_holes_->empty())) {
      newNode = *(_holes_->begin());
      _eraseHole_(newNode);
    } else {
      newNode = _boundVal_;
      ++_boundVal_;
      _updateEndIteratorSafe_();
    }

    GUM_EMIT1(onNodeAdded, newNode);

    return newNode;
  }

Here is the call graph for this function:

addNodes()

INLINE std::vector< NodeId > gum::NodeGraphPart::addNodes

(

Size

n

)

insert n nodes

Parameters

n	the number of nodes to add

Returns

the vector of chosen ids

Definition at line 256 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                           {
    std::vector< NodeId > v;
    v.reserve(N);
    for (Idx i = 0; i < N; i++)
      v.push_back(this->addNode());
    return v;
  }

Here is the call graph for this function:

addNodeWithId()

void gum::NodeGraphPart::addNodeWithId ( const NodeId  id )

virtual

try to insert a node with the given id

Warning

This method should be carefully used. Please prefer populateNodes or populateNodesFromProperty when possible

Exceptions

DuplicateElement

exception if the id already exists

Definition at line 131 of file nodeGraphPart.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                   {
    if (id >= _boundVal_) {
      if (id > _boundVal_) {   // we have to add holes
        if (!_holes_) _holes_ = new NodeSet(_holes_size_, _holes_resize_policy_);

        for (NodeId i = _boundVal_; i < id; ++i)
          _holes_->insert(i);
      }

      _boundVal_ = id + 1;

      _updateEndIteratorSafe_();
    } else {
      if (_inHoles_(id)) {   // we fill a hole
        _eraseHole_(id);
      } else {
        GUM_ERROR(DuplicateElement, "Id " << id << " is already used")
      }
    }

    GUM_EMIT1(onNodeAdded, id);
  }

Here is the call graph for this function:

asNodeSet()

INLINE NodeSet gum::NodeGraphPart::asNodeSet

(

)

const

returns a copy of the set of nodes represented by the NodeGraphPart

Warning

this function is o(n) where n is the number of nodes. In space and in time. Usually, when you need to parse the nodes of a NodeGraphPart, prefer using

for(const auto n : nodes()) 

rather than

for(const auto n : asNodeSet()) 

as this is faster and consumes much less memory.

Definition at line 340 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                {
    NodeSet son(sizeNodes());

    if (!empty()) {
      for (NodeId n = 0; n < _boundVal_; ++n) {
        if (!_inHoles_(n)) son.insert(n);
      }
    }

    return son;
  }

Here is the call graph for this function:

begin()

INLINE NodeGraphPartIterator gum::NodeGraphPart::begin ( ) const

noexcept

a begin iterator to parse the set of nodes contained in the NodeGraphPart

Definition at line 314 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                   {
    NodeGraphPartIterator it(*this);
    it.validate_();   // stop the iterator at the first not-in-holes
    return it;
  }

Here is the call graph for this function:

beginSafe()

INLINE NodeGraphPartIteratorSafe gum::NodeGraphPart::beginSafe

(

)

const

a begin iterator to parse the set of nodes contained in the NodeGraphPart

Definition at line 302 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                  {
    NodeGraphPartIteratorSafe it(*this);
    it.validate_();   // stop the iterator at the first not-in-holes
    return it;
  }

Here is the call graph for this function:

bound()

INLINE NodeId gum::NodeGraphPart::bound

(

)

const

returns a number n such that all node ids are strictly lower than n

Definition at line 291 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

{ return _boundVal_; }

Here is the call graph for this function:

clear()

INLINE void gum::NodeGraphPart::clear ( )

virtual

alias for clearNodes

Reimplemented in gum::MixedGraph, gum::DiGraph, gum::UndiGraph, and gum::CliqueGraph.

Definition at line 300 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

{ _clearNodes_(); }

Here is the call graph for this function:

clearNodes()

INLINE void gum::NodeGraphPart::clearNodes ( )

virtual

remove all the nodes from the NodeGraphPart

Definition at line 293 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

{ _clearNodes_(); }

Here is the call graph for this function:

empty()

INLINE bool gum::NodeGraphPart::empty

(

)

const

alias for emptyNodes

Definition at line 289 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

{ return emptyNodes(); }

Here is the call graph for this function:

emptyNodes()

INLINE bool gum::NodeGraphPart::emptyNodes

(

)

const

indicates whether there exists nodes in the NodeGraphPart

Definition at line 287 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

{ return (sizeNodes() == 0); }

Here is the call graph for this function:

end()

INLINE const NodeGraphPartIterator & gum::NodeGraphPart::end ( ) const

noexcept

the end iterator to parse the set of nodes contained in the NodeGraphPart

Definition at line 320 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                        {
    return _endIteratorSafe_;
  }

Here is the call graph for this function:

endSafe()

INLINE const NodeGraphPartIteratorSafe & gum::NodeGraphPart::endSafe ( ) const

noexcept

the end iterator to parse the set of nodes contained in the NodeGraphPart

Definition at line 310 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                                {
    return _endIteratorSafe_;
  }

Here is the call graph for this function:

eraseNode()

INLINE void gum::NodeGraphPart::eraseNode ( const NodeId  id )

virtual

erase the node with the given id

If the NodeGraphPart does not contain the nodeId, then nothing is done. In particular, no exception is raised. However, the signal onNodeDeleted is fired only if a node is effectively removed.

Reimplemented in gum::MixedGraph, gum::DiGraph, gum::UndiGraph, and gum::CliqueGraph.

Definition at line 279 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                        {
    if (!existsNode(node)) return;

    _addHole_(node);

    GUM_EMIT1(onNodeDeleted, node);
  }

Here is the call graph for this function:

exists()

INLINE bool gum::NodeGraphPart::exists

(

const NodeId

id

)

const

alias for existsNode

Definition at line 277 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

{ return existsNode(node); }

Here is the call graph for this function:

existsNode()

INLINE bool gum::NodeGraphPart::existsNode

(

const NodeId

id

)

const

returns true iff the NodeGraphPart contains the given nodeId

Definition at line 271 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                               {
    if (node >= _boundVal_) return false;

    return (!_inHoles_(node));
  }

Here is the call graph for this function:

listMapNodes()

template<typename VAL >

List< VAL > gum::NodeGraphPart::listMapNodes

(

VAL(*)(const NodeId &)

f

)

const

a method to create a list of VAL from a set of nodes (using for every nodee, say x, the VAL f(x))

Parameters

f	a function assigning a VAL to any node

nextNodeId()

INLINE NodeId gum::NodeGraphPart::nextNodeId

(

)

const

returns a new node id, not yet used by any node

Warning

a code like

id=nextNodeId();addNode(id); 

is basically not thread safe !!

Returns

a node id not yet used by any node within the NodeGraphPart

Definition at line 211 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                {
    NodeId next = 0;

    // return the first hole if holes exist
    if (_holes_ && (!_holes_->empty()))
      next = *(_holes_->begin());
    else   // in other case
      next = _boundVal_;

    return next;
  }

Here is the call graph for this function:

nodes()

INLINE const NodeGraphPart & gum::NodeGraphPart::nodes

(

)

const

return *this as a NodeGraphPart

Definition at line 352 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                         {
    return *(static_cast< const NodeGraphPart* >(this));
  }

Here is the call graph for this function:

nodesProperty() [1/2]

template<typename VAL >

NodeProperty< VAL > gum::NodeGraphPart::nodesProperty	(	VAL(*)(const NodeId &)	f,
		Size	size = 0
	)		const

a method to create a HashTable with key:NodeId and value:VAL

VAL are computed from the nodes using for all node x, VAL f(x). This method is a wrapper of the same method in HashTable.

See also

HashTable::map.

Parameters

f	a function assigning a VAL to any node
size	an optional parameter enabling to fine-tune the returned Property. Roughly speaking, it is a good practice to have a size equal to half the number of nodes. If you do not specify this parameter, the method will assign it for you.

nodesProperty() [2/2]

template<typename VAL >

NodeProperty< VAL > gum::NodeGraphPart::nodesProperty	(	const VAL &	a,
		Size	size = 0
	)		const

a method to create a hashMap with key:NodeId and value:VAL

for all nodes, the value stored is a. This method is a wrapper of the same method in HashTable.

See also

HashTable::map.

Parameters

a	the default value assigned to each edge in the returned Property
size	an optional parameter enabling to fine-tune the returned Property. Roughly speaking, it is a good practice to have a size equal to half the number of nodes. If you do not specify this parameter, the method will assign it for you.

operator!=()

INLINE bool gum::NodeGraphPart::operator!=

(

const NodeGraphPart &

p

)

const

check whether two NodeGraphParts contain different nodes

Parameters

p	the NodeGraphPart to be compared with "this"

Definition at line 338 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

{ return !operator==(p); }

Here is the call graph for this function:

operator=()

INLINE NodeGraphPart & gum::NodeGraphPart::operator=

(

const NodeGraphPart &

p

)

copy operator

Parameters

p	the NodeGraphPart to be copied

Definition at line 204 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                       {
    // avoid self assignment
    if (this != &p) { populateNodes(p); }

    return *this;
  }

Here is the call graph for this function:

operator==()

INLINE bool gum::NodeGraphPart::operator==

(

const NodeGraphPart &

p

)

const

check whether two NodeGraphParts contain the same nodes

Parameters

p	the NodeGraphPart to be compared with "this"

Definition at line 324 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                    {
    if (_boundVal_ != p._boundVal_) return false;

    if (_holes_)
      if (p._holes_)
        return (*_holes_ == *p._holes_);
      else
        return false;
    else if (p._holes_)
      return false;

    return true;
  }

Here is the call graph for this function:

populateNodes()

void gum::NodeGraphPart::populateNodes

(

const NodeGraphPart &

s

)

populateNodes clears *this and fills it with the same nodes as "s"

populateNodes should basically be the preferred way to insert nodes with IDs not selected by the internal idFactory.

Parameters

s	the NodeGraphPart to be copied

Definition at line 63 of file nodeGraphPart.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                          {
    clear();   // "virtual" flush of the nodes set
    _holes_size_          = s._holes_size_;
    _holes_resize_policy_ = s._holes_resize_policy_;

    if (s._holes_) _holes_ = new NodeSet(*s._holes_);

    _boundVal_ = s._boundVal_;

    _updateEndIteratorSafe_();
  }

Here is the call graph for this function:

populateNodesFromProperty()

template<typename T >

void gum::NodeGraphPart::populateNodesFromProperty

(

const NodeProperty< T > &

h

)

populateNodesFromProperty clears *this and fills it with the keys of "h"

populateNodes should basically be the preferred way to insert nodes with IDs not selected by the internal idFactory.

size()

INLINE Size gum::NodeGraphPart::size

(

)

const

alias for sizeNodes

Definition at line 269 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

{ return sizeNodes(); }

Here is the call graph for this function:

sizeNodes()

INLINE Size gum::NodeGraphPart::sizeNodes

(

)

const

returns the number of nodes in the NodeGraphPart

Definition at line 265 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                             {
    return (_holes_) ? (_boundVal_ - _holes_->size()) : _boundVal_;
  }

Here is the call graph for this function:

toString()

std::string gum::NodeGraphPart::toString ( ) const

virtual

a function to display the set of nodes

Reimplemented in gum::MixedGraph, gum::CliqueGraph, gum::DiGraph, and gum::UndiGraph.

Definition at line 104 of file nodeGraphPart.cpp.

References gum::Set< Key, Alloc >::emplace().

                                          {
    std::stringstream s;
    bool              first = true;
    s << "{";

    for (NodeId id = 0; id < _boundVal_; ++id) {
      if (_inHoles_(id)) continue;

      if (first) {
        first = false;
      } else {
        s << ",";
      }

      s << id;
    }

    s << "}";

    return s.str();
  }

Here is the call graph for this function:

Friends And Related Function Documentation

gum_tests::NodeGraphPartTestSuite

friend class gum_tests::NodeGraphPartTestSuite

friend

to enable testunits to use check

Definition at line 467 of file nodeGraphPart.h.

NodeGraphPartIterator

friend class NodeGraphPartIterator

friend

Definition at line 462 of file nodeGraphPart.h.

NodeGraphPartIteratorSafe

friend class NodeGraphPartIteratorSafe

friend

Definition at line 463 of file nodeGraphPart.h.

Member Data Documentation

_boundVal_

NodeId gum::NodeGraphPart::_boundVal_

private

the id below which NodeIds may belong to the NodeGraphPart

Definition at line 511 of file nodeGraphPart.h.

_endIteratorSafe_

NodeGraphPartIteratorSafe gum::NodeGraphPart::_endIteratorSafe_

private

the end iterator (used to speed-up parsings of the NodeGraphPart)

Definition at line 508 of file nodeGraphPart.h.

_holes_

NodeSet* gum::NodeGraphPart::_holes_

private

the set of nodes not contained in the NodeGraphPart in the interval 1.

. max

Warning

holes may be nullptr.

Definition at line 499 of file nodeGraphPart.h.

_holes_resize_policy_

bool gum::NodeGraphPart::_holes_resize_policy_

private

value for holes configuration

Definition at line 505 of file nodeGraphPart.h.

_holes_size_

Size gum::NodeGraphPart::_holes_size_

private

value for holes configuration

Definition at line 502 of file nodeGraphPart.h.

onNodeAdded

Signaler1< NodeId > gum::NodeGraphPart::onNodeAdded

Definition at line 271 of file nodeGraphPart.h.

onNodeDeleted

Signaler1< NodeId > gum::NodeGraphPart::onNodeDeleted

Definition at line 272 of file nodeGraphPart.h.

---

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

• agrum/tools/graphs/parts/nodeGraphPart.h
• agrum/tools/graphs/parts/nodeGraphPart.cpp
• agrum/tools/graphs/parts/nodeGraphPart_inl.h