Skip to main content

ClikaRT::graph::NodeMap

class

Header: ClikaRT/graph/node.h
Template: template <``class T``>

One T per node (a weight, a score, a depth), iterating in the order the entries were added. Keyed by Node views, which compare by name, so an entry still finds its node after the graph is edited.

Types​

using value_type​

using value_type = std::pair<Node, T>

Declared in ClikaRT/graph/node.h, line 374

using const_iterator​

using const_iterator = typename std::vector<value_type>::const_iterator

Declared in ClikaRT/graph/node.h, line 375

Member functions​

operator[]()​

T& operator[](const Node& node)

The entry for node, added as a value-initialized T when absent.

Declared in ClikaRT/graph/node.h, line 378

set()​

void set(const Node& node, T value)

Set the entry for node, adding it when absent; serves a T with no default constructor (NodeMap<Node>).

Declared in ClikaRT/graph/node.h, line 384

find()​

const_iterator find(const Node& node) const

The entry for node, or end() when absent.

Declared in ClikaRT/graph/node.h, line 393

contains()​

bool contains(const Node& node) const

Declared in ClikaRT/graph/node.h, line 398

size()​

std::size_t size() const noexcept

Declared in ClikaRT/graph/node.h, line 399

empty()​

bool empty() const noexcept

Declared in ClikaRT/graph/node.h, line 400

begin()​

const_iterator begin() const noexcept

Declared in ClikaRT/graph/node.h, line 401

end()​

const_iterator end() const noexcept

Declared in ClikaRT/graph/node.h, line 402

clear()​

void clear() noexcept

Declared in ClikaRT/graph/node.h, line 403