|
Cutelee
6.2.0
|
A list of Nodes with some convenience API for rendering them. More...
#include <cutelee/node.h>

Public Member Functions | |
| NodeList () | |
| NodeList (const NodeList &list) | |
| NodeList (const QList< Cutelee::Node *> &list) | |
| ~NodeList () | |
| void | append (Cutelee::Node *node) |
| void | append (const QList< Cutelee::Node *> &nodeList) |
| bool | containsNonText () const |
| template<typename T > | |
| QList< T > | findChildren () |
| NodeList & | operator= (const NodeList &list) |
| void | render (OutputStream *stream, Context *c) const |
Public Member Functions inherited from QList< Cutelee::Node *> | |
| QList (InputIterator first, InputIterator last) | |
| QList (QList< T > &&other) | |
| QList (const QList< T > &other) | |
| QList (qsizetype size) | |
| QList (qsizetype size, parameter_type value) | |
| QList (std::initializer_list< T > args) | |
| void | append (QList< T > &&value) |
| void | append (const QList< T > &value) |
| void | append (parameter_type value) |
| void | append (rvalue_ref value) |
| const_reference | at (qsizetype i) const const |
| reference | back () |
| const_reference | back () const const |
| const_iterator | begin () const const |
| iterator | begin () |
| qsizetype | capacity () const const |
| const_iterator | cbegin () const const |
| const_iterator | cend () const const |
| void | clear () |
| const_iterator | constBegin () const const |
| const_pointer | constData () const const |
| const_iterator | constEnd () const const |
| const T & | constFirst () const const |
| const T & | constLast () const const |
| bool | contains (const AT &value) const const |
| qsizetype | count (const AT &value) const const |
| qsizetype | count () const const |
| const_reverse_iterator | crbegin () const const |
| const_reverse_iterator | crend () const const |
| pointer | data () |
| const_pointer | data () const const |
| iterator | emplace (const_iterator before, Args &&... args) |
| iterator | emplace (qsizetype i, Args &&... args) |
| reference | emplace_back (Args &&... args) |
| reference | emplaceBack (Args &&... args) |
| bool | empty () const const |
| iterator | end () |
| const_iterator | end () const const |
| bool | endsWith (parameter_type value) const const |
| iterator | erase (const_iterator begin, const_iterator end) |
| iterator | erase (const_iterator pos) |
| qsizetype | erase (QList< T > &list, const AT &t) |
| qsizetype | erase_if (QList< T > &list, Predicate pred) |
| QList< T > & | fill (parameter_type value, qsizetype size) |
| QList< T > | first (qsizetype n) const const |
| T & | first () |
| const T & | first () const const |
| reference | front () |
| const_reference | front () const const |
| qsizetype | indexOf (const AT &value, qsizetype from) const const |
| iterator | insert (const_iterator before, parameter_type value) |
| iterator | insert (const_iterator before, qsizetype count, parameter_type value) |
| iterator | insert (const_iterator before, rvalue_ref value) |
| iterator | insert (qsizetype i, parameter_type value) |
| iterator | insert (qsizetype i, qsizetype count, parameter_type value) |
| iterator | insert (qsizetype i, rvalue_ref value) |
| bool | isEmpty () const const |
| T & | last () |
| QList< T > | last (qsizetype n) const const |
| const T & | last () const const |
| qsizetype | lastIndexOf (const AT &value, qsizetype from) const const |
| qsizetype | length () const const |
| QList< T > | mid (qsizetype pos, qsizetype length) const const |
| void | move (qsizetype from, qsizetype to) |
| bool | operator!= (const QList< T > &other) const const |
| QList< T > | operator+ (QList< T > &&other) && |
| QList< T > | operator+ (const QList< T > &other) && |
| QList< T > | operator+ (QList< T > &&other) const &const |
| QList< T > | operator+ (const QList< T > &other) const &const |
| QList< T > & | operator+= (QList< T > &&other) |
| QList< T > & | operator+= (parameter_type value) |
| QList< T > & | operator+= (const QList< T > &other) |
| QList< T > & | operator+= (rvalue_ref value) |
| bool | operator< (const QList< T > &other) const const |
| QList< T > & | operator<< (parameter_type value) |
| QList< T > & | operator<< (QList< T > &&other) |
| QList< T > & | operator<< (rvalue_ref value) |
| QDataStream & | operator<< (QDataStream &out, const QList< T > &list) |
| QList< T > & | operator<< (const QList< T > &other) |
| bool | operator<= (const QList< T > &other) const const |
| QList< T > & | operator= (QList< T > &&other) |
| QList< T > & | operator= (const QList< T > &other) |
| QList< T > & | operator= (std::initializer_list< T > args) |
| bool | operator== (const QList< T > &other) const const |
| bool | operator> (const QList< T > &other) const const |
| bool | operator>= (const QList< T > &other) const const |
| QDataStream & | operator>> (QDataStream &in, QList< T > &list) |
| const_reference | operator[] (qsizetype i) const const |
| reference | operator[] (qsizetype i) |
| void | pop_back () |
| void | pop_front () |
| void | prepend (rvalue_ref value) |
| void | prepend (parameter_type value) |
| void | push_back (rvalue_ref value) |
| void | push_back (parameter_type value) |
| void | push_front (rvalue_ref value) |
| void | push_front (parameter_type value) |
| size_t | qHash (const QList< T > &key, size_t seed) |
| reverse_iterator | rbegin () |
| const_reverse_iterator | rbegin () const const |
| void | remove (qsizetype i, qsizetype n) |
| qsizetype | removeAll (const AT &t) |
| void | removeAt (qsizetype i) |
| void | removeFirst () |
| qsizetype | removeIf (Predicate pred) |
| void | removeLast () |
| bool | removeOne (const AT &t) |
| const_reverse_iterator | rend () const const |
| reverse_iterator | rend () |
| void | replace (qsizetype i, rvalue_ref value) |
| void | replace (qsizetype i, parameter_type value) |
| void | reserve (qsizetype size) |
| void | resize (qsizetype size) |
| void | resize (qsizetype size, parameter_type c) |
| void | shrink_to_fit () |
| qsizetype | size () const const |
| QList< T > | sliced (qsizetype pos, qsizetype n) const const |
| QList< T > | sliced (qsizetype pos) const const |
| void | squeeze () |
| bool | startsWith (parameter_type value) const const |
| void | swap (QList< T > &other) |
| void | swapItemsAt (qsizetype i, qsizetype j) |
| T | takeAt (qsizetype i) |
| value_type | takeFirst () |
| value_type | takeLast () |
| QList< T > | toList () const const |
| QList< T > | toVector () const const |
| T | value (qsizetype i, parameter_type defaultValue) const const |
| T | value (qsizetype i) const const |
Additional Inherited Members | |
Static Public Member Functions inherited from QList< Cutelee::Node *> | |
| QList< T > | fromList (const QList< T > &list) |
| QList< T > | fromVector (const QList< T > &list) |
Public Attributes inherited from QList< Cutelee::Node *> | |
| typedef | const_pointer |
| typedef | const_reference |
| typedef | const_reverse_iterator |
| typedef | ConstIterator |
| typedef | difference_type |
| typedef | Iterator |
| typedef | parameter_type |
| typedef | pointer |
| typedef | reference |
| typedef | reverse_iterator |
| typedef | rvalue_ref |
| typedef | size_type |
| typedef | value_type |
Typically, tags which have an end tag will create and later render a list of child nodes.
This class contains API such as append and render to make creating such list easily.
The findChildren method behaves similarly to the QObject::findChildren method, returning a list of nodes of a particular type from the Node objects contained in the list (and their children).
| NodeList::NodeList | ( | const NodeList & | list | ) |
| NodeList::NodeList | ( | const QList< Cutelee::Node *> & | list | ) |
| void NodeList::append | ( | Cutelee::Node * | node | ) |
Appends node to the end of this NodeList.
Definition at line 149 of file node.cpp.
References QList::append().
| void NodeList::append | ( | const QList< Cutelee::Node *> & | nodeList | ) |
Appends nodeList to the end of this NodeList.
Definition at line 160 of file node.cpp.
References QList::append().
| bool NodeList::containsNonText | ( | ) | const |
|
inline |
| void NodeList::render | ( | OutputStream * | stream, |
| Context * | c | ||
| ) | const |
Renders the list of Nodes in the Context c.
Definition at line 177 of file node.cpp.
References QList< Cutelee::Node *>::at(), and QList< Cutelee::Node *>::size().
Referenced by FilterNode::render(), WithNode::render(), WithLocaleNode::render(), SpacelessNode::render(), AutoescapeNode::render(), IfChangedNode::render(), RangeNode::render(), ForNode::render(), BlockNode::render(), and IfEqualNode::render().
1.8.14