|
libqasm
library for handling cQASM files
|
Namespace for the semantic tree node classes.
Classes | |
| class | Annotated |
| Represents a node that carries annotation data. More... | |
| class | AnnotationData |
| Represents an annotation. More... | |
| class | Block |
| A block of statements. More... | |
| class | BreakStatement |
| A break statement. More... | |
| class | Bundle |
| A bundle of instructions, to be executed in parallel. More... | |
| class | BundleExt |
| A bundle of instructions, to be executed in parallel. More... | |
| class | ContinueStatement |
| A continue statement. More... | |
| class | Dumper |
| Visitor class that debug-dumps a tree to a stream. More... | |
| class | ErrorModel |
| Error model information. More... | |
| class | ForeachLoop |
| A foreach loop. More... | |
| class | ForLoop |
| A C-style for loop. More... | |
| class | GotoInstruction |
| A version 1.2+ goto instruction. More... | |
| class | IfElse |
| An if-else chain. More... | |
| class | IfElseBranch |
| A single condition + block for use in an if-else chain. More... | |
| class | Instruction |
| A regular instruction. More... | |
| class | InstructionBase |
| An instruction (a.k.a. More... | |
| class | Mapping |
| A mapping. More... | |
| class | Node |
| Main class for all nodes. More... | |
| class | Program |
| A complete program. More... | |
| class | RecursiveVisitor |
| Visitor base class defaulting to DFS pre-order traversal. More... | |
| class | RepeatUntilLoop |
| A repeat-until loop. More... | |
| class | SetInstruction |
| A version 1.2+ assignment instruction. More... | |
| class | Statement |
| A statement. More... | |
| class | Structured |
| Any version 1.2+ structured control-flow statement. More... | |
| class | Subcircuit |
| A subcircuit. More... | |
| class | Variable |
| A variable. More... | |
| class | Version |
| The file version identifier. More... | |
| class | Visitor |
| Base class for the visitor pattern for the tree. More... | |
| class | VisitorBase |
| Internal class for implementing the visitor pattern. More... | |
| class | WhileLoop |
| A while loop. More... | |
Typedefs | |
| using | Base = cqasm::tree::Base |
| template<class T > | |
| using | Maybe = cqasm::tree::Maybe< T > |
| template<class T > | |
| using | One = cqasm::tree::One< T > |
| template<class T > | |
| using | Any = cqasm::tree::Any< T > |
| template<class T > | |
| using | Many = cqasm::tree::Many< T > |
| template<class T > | |
| using | OptLink = cqasm::tree::OptLink< T > |
| template<class T > | |
| using | Link = cqasm::tree::Link< T > |
Functions | |
| std::ostream & | operator<< (std::ostream &os, const Node &object) |
| Stream << overload for tree nodes (writes debug dump). More... | |
| using cqasm::v1::semantic::Base = typedef cqasm::tree::Base |
Definition at line 151 of file cqasm-v1-semantic-gen.hpp.
| using cqasm::v1::semantic::Maybe = typedef cqasm::tree::Maybe<T> |
Definition at line 152 of file cqasm-v1-semantic-gen.hpp.
| using cqasm::v1::semantic::One = typedef cqasm::tree::One<T> |
Definition at line 153 of file cqasm-v1-semantic-gen.hpp.
| using cqasm::v1::semantic::Any = typedef cqasm::tree::Any<T> |
Definition at line 154 of file cqasm-v1-semantic-gen.hpp.
| using cqasm::v1::semantic::Many = typedef cqasm::tree::Many<T> |
Definition at line 155 of file cqasm-v1-semantic-gen.hpp.
| using cqasm::v1::semantic::OptLink = typedef cqasm::tree::OptLink<T> |
Definition at line 156 of file cqasm-v1-semantic-gen.hpp.
| using cqasm::v1::semantic::Link = typedef cqasm::tree::Link<T> |
Definition at line 157 of file cqasm-v1-semantic-gen.hpp.
|
strong |
Enumeration of all node types.
Definition at line 195 of file cqasm-v1-semantic-gen.hpp.
| std::ostream & cqasm::v1::semantic::operator<< | ( | std::ostream & | os, |
| const Node & | object | ||
| ) |
Stream << overload for tree nodes (writes debug dump).
Definition at line 5748 of file cqasm-v1-semantic-gen.cpp.
1.8.13