|
Dynalib Utils
|
#include <chrono>#include "../String.h"#include "../DynaList.h"#include "../DynaHashMap.h"#include "../IntWrapper.h"#include "../TimeUtils.h"

Go to the source code of this file.
Classes | |
| union | Graph::NodeValue |
| class | Graph::Node |
Namespaces | |
| Graph | |
Macros | |
| #define | MAKE_LOCAL_REF_NODE Node(NodeType::UNTYPED, false) |
| #define | NODE_GET_INIT Node _presult = Node(NodeType::UNTYPED, false) |
| #define | NODE_GET_STR(N, K, V) if (Node::present(N, K, _presult)) { V = _presult(); } |
| #define | NODE_GET_SEQ(N, K, V) if (Node::present(N, K, _presult)) { V = _presult(); } |
| #define | NODE_GET_PROPER(N, K, V) if (Node::present(N, K, _presult)) { V = _presult(); } |
| #define | NODE_GET_INT(N, K, V) if (Node::present(N, K, _presult)) { V = _presult.asInt(); } |
| #define | NODE_GET_FLOAT(N, K, V) if (Node::present(N, K, _presult)) { V = _presult.asFloat(); } |
| #define | NODE_GET_BOOL(N, K, V) if (Node::present(N, K, _presult)) { V = _presult.asBool(); } |
| #define | NODE_GET_TIME(N, K, V) if (Node::present(N, K, _presult)) { V = _presult.asTime(); } |
| #define | NODE_GET_TS(N, K, V) if (Node::present(N, K, _presult)) { V = _presult.asTimestamp(); } |
| #define | NODE_GET_DATE(N, K, V) if (Node::present(N, K, _presult)) { V = _presult.asDate(); } |
| #define | NODE_GET_LIST(N, K, V) if (Node::present(N, K, _presult)) { V = _presult.asList(); } |
| #define | NODE_GET_MAP(N, K, V) if (Node::present(N, K, _presult)) { V = _presult.asMap(); } |
Functions | |
| Graph::MAKE_LISTTYPE_DEF (Node, Node) | |
| Graph::MAKE_MAPTYPE_DEF (String, Node, Node) | |
| #define MAKE_LOCAL_REF_NODE Node(NodeType::UNTYPED, false) |
| #define NODE_GET_BOOL | ( | N, | |
| K, | |||
| V | |||
| ) | if (Node::present(N, K, _presult)) { V = _presult.asBool(); } |
| #define NODE_GET_DATE | ( | N, | |
| K, | |||
| V | |||
| ) | if (Node::present(N, K, _presult)) { V = _presult.asDate(); } |
| #define NODE_GET_FLOAT | ( | N, | |
| K, | |||
| V | |||
| ) | if (Node::present(N, K, _presult)) { V = _presult.asFloat(); } |
| #define NODE_GET_INIT Node _presult = Node(NodeType::UNTYPED, false) |
| #define NODE_GET_INT | ( | N, | |
| K, | |||
| V | |||
| ) | if (Node::present(N, K, _presult)) { V = _presult.asInt(); } |
| #define NODE_GET_LIST | ( | N, | |
| K, | |||
| V | |||
| ) | if (Node::present(N, K, _presult)) { V = _presult.asList(); } |
| #define NODE_GET_MAP | ( | N, | |
| K, | |||
| V | |||
| ) | if (Node::present(N, K, _presult)) { V = _presult.asMap(); } |
| #define NODE_GET_PROPER | ( | N, | |
| K, | |||
| V | |||
| ) | if (Node::present(N, K, _presult)) { V = _presult(); } |
| #define NODE_GET_SEQ | ( | N, | |
| K, | |||
| V | |||
| ) | if (Node::present(N, K, _presult)) { V = _presult(); } |
| #define NODE_GET_STR | ( | N, | |
| K, | |||
| V | |||
| ) | if (Node::present(N, K, _presult)) { V = _presult(); } |
| #define NODE_GET_TIME | ( | N, | |
| K, | |||
| V | |||
| ) | if (Node::present(N, K, _presult)) { V = _presult.asTime(); } |
| #define NODE_GET_TS | ( | N, | |
| K, | |||
| V | |||
| ) | if (Node::present(N, K, _presult)) { V = _presult.asTimestamp(); } |
1.8.13