#include <BinaryAdjacency.hpp>
|
| | BinaryAdjacency (BaseContainer &&baseContainer, util::UnaryFunction< N, std::vector< uint8_t > > auto toBinary, util::UnaryFunction< std::vector< uint8_t >, N > auto fromBinary) |
| |
| std::vector< uint8_t > | get () const noexcept |
| |
| void | load (const std::vector< uint8_t > &data) |
| |
| | AdjacencyContainerDecorator (const BaseContainer &delegate) |
| |
| | AdjacencyContainerDecorator (BaseContainer &&delegate) |
| |
| void | addAdjacency (const N &from, const N &to) |
| |
| void | addAdjacency (N &&from, N &&to) |
| |
| void | addAdjacencies (util::forward_range_of< std::pair< N, N > > auto &&pairs) |
| |
| bool | addNode (const N &node) |
| |
| bool | addNode (N &&node) |
| |
| bool | addNodes (util::forward_range_of< N > auto &&nodes) |
| |
| void | removeNode (const N &node) |
| |
| void | removeNodes (util::forward_range_of< N > auto &&nodes) |
| |
| void | removeAdjacency (const N &from, const N &to) |
| |
| void | removeAdjacencies (util::forward_range_of< std::pair< N, N > > auto &&pairs) |
| |
| bool | contains (const N &node) const noexcept |
| |
| bool | hasAdjacency (const N &from, const N &to) const noexcept |
| |
| auto | adjacency (const N &node) const noexcept |
| |
| auto | nodes () const noexcept |
| |
| auto | getAdjacencyPairs () const noexcept |
| |
| void | clear () noexcept |
| |
◆ BinaryAdjacency()
template<typename BaseContainer >
| fishnet::graph::BinaryAdjacency< BaseContainer >::BinaryAdjacency |
( |
BaseContainer && |
baseContainer, |
|
|
util::UnaryFunction< N, std::vector< uint8_t > > auto |
toBinary, |
|
|
util::UnaryFunction< std::vector< uint8_t >, N > auto |
fromBinary |
|
) |
| |
|
inline |
◆ get()
template<typename BaseContainer >
◆ load()
template<typename BaseContainer >
The documentation for this class was generated from the following file: