#include <node_enum.h>
|
| bool | empty () const |
| |
| void | insert (const char *x, int y) |
| |
| bool | exists (ustring x) const |
| |
| bool | exists (int y) const |
| |
| int | operator[] (const char *x) const |
| |
| int | operator[] (ustring x) const |
| |
| ustring | operator[] (int y) const |
| |
| unordered_map< ustring, int, ustringHash >::const_iterator | begin () const |
| |
| unordered_map< ustring, int, ustringHash >::const_iterator | end () const |
| |
Definition at line 28 of file node_enum.h.
◆ begin()
| unordered_map<ustring, int, ustringHash>::const_iterator NodeEnum::begin |
( |
void |
| ) |
const |
|
inline |
◆ empty()
| bool NodeEnum::empty |
( |
| ) |
const |
|
inline |
◆ end()
| unordered_map<ustring, int, ustringHash>::const_iterator NodeEnum::end |
( |
void |
| ) |
const |
|
inline |
◆ exists() [1/2]
| bool NodeEnum::exists |
( |
int |
y | ) |
const |
|
inline |
◆ exists() [2/2]
| bool NodeEnum::exists |
( |
ustring |
x | ) |
const |
|
inline |
◆ insert()
| void NodeEnum::insert |
( |
const char * |
x, |
|
|
int |
y |
|
) |
| |
|
inline |
◆ operator[]() [1/3]
| int NodeEnum::operator[] |
( |
const char * |
x | ) |
const |
|
inline |
◆ operator[]() [2/3]
| ustring NodeEnum::operator[] |
( |
int |
y | ) |
const |
|
inline |
◆ operator[]() [3/3]
| int NodeEnum::operator[] |
( |
ustring |
x | ) |
const |
|
inline |
The documentation for this struct was generated from the following file: