Sound Byte Libs 0.5.1-121-g3358a44
C++ firmware library for audio applications on 32-bit ARM Cortex-M processors
Loading...
Searching...
No Matches
sbl::dsp::diagram::Graph Class Reference

Detailed Description

Definition at line 68 of file graph.hpp.

#include <graph.hpp>

Public Member Functions

uint8_t add_group (const char *name, uint8_t parent=NO_GROUP)
 Open a group (a component); returns its id. Nodes added with it belong to it.
 
uint8_t add_node (Kind kind, const char *name, uint8_t group, float value=0.0f, float value2=0.0f)
 
void add_edge (uint8_t from, uint8_t to, Wave wave)
 
uint8_t node_count () const
 
uint8_t edge_count () const
 
uint8_t group_count () const
 
const Node & node (uint8_t i) const
 
const Edge & edge (uint8_t i) const
 
const Group & group (uint8_t i) const
 
uint8_t count (Kind kind) const
 How many nodes of a kind the graph holds — the structural tests' question.
 
bool overflowed () const
 True if a describe() lost something: a node, edge or group was refused.
 
void clear ()
 

Static Public Attributes

static constexpr uint8_t MAX_NODES = 64
 a 32-mode bank and the string around it
 
static constexpr uint8_t MAX_EDGES = 128
 
static constexpr uint8_t MAX_GROUPS = 16
 

Member Function Documentation

◆ add_group()

uint8_t sbl::dsp::diagram::Graph::add_group ( const char *  name,
uint8_t  parent = NO_GROUP 
)
inline

◆ add_node()

◆ add_edge()

◆ node_count()

uint8_t sbl::dsp::diagram::Graph::node_count ( ) const
inline

◆ edge_count()

uint8_t sbl::dsp::diagram::Graph::edge_count ( ) const
inline

Definition at line 94 of file graph.hpp.

Referenced by sbl::dsp::diagram::render_mermaid().

◆ group_count()

uint8_t sbl::dsp::diagram::Graph::group_count ( ) const
inline

◆ node()

const Node & sbl::dsp::diagram::Graph::node ( uint8_t  i) const
inline

◆ edge()

const Edge & sbl::dsp::diagram::Graph::edge ( uint8_t  i) const
inline

Definition at line 97 of file graph.hpp.

Referenced by sbl::dsp::diagram::render_mermaid().

◆ group()

const Group & sbl::dsp::diagram::Graph::group ( uint8_t  i) const
inline

◆ count()

uint8_t sbl::dsp::diagram::Graph::count ( Kind  kind) const
inline

How many nodes of a kind the graph holds — the structural tests' question.

Definition at line 101 of file graph.hpp.

◆ overflowed()

bool sbl::dsp::diagram::Graph::overflowed ( ) const
inline

True if a describe() lost something: a node, edge or group was refused.

Definition at line 110 of file graph.hpp.

◆ clear()

void sbl::dsp::diagram::Graph::clear ( )
inline

Definition at line 112 of file graph.hpp.

Member Data Documentation

◆ MAX_NODES

constexpr uint8_t sbl::dsp::diagram::Graph::MAX_NODES = 64
staticconstexpr

a 32-mode bank and the string around it

Definition at line 70 of file graph.hpp.

Referenced by add_node().

◆ MAX_EDGES

constexpr uint8_t sbl::dsp::diagram::Graph::MAX_EDGES = 128
staticconstexpr

Definition at line 71 of file graph.hpp.

Referenced by add_edge(), and sbl::dsp::diagram::render_mermaid().

◆ MAX_GROUPS

constexpr uint8_t sbl::dsp::diagram::Graph::MAX_GROUPS = 16
staticconstexpr

Definition at line 72 of file graph.hpp.

Referenced by add_group().


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