Iterator for a ValueTree.
More...
#include <juce_ValueTree.h>
Iterator for a ValueTree.
You shouldn't ever need to use this class directly - it's used internally by ValueTree::begin() and ValueTree::end() to allow range-based-for loops on a ValueTree.
◆ difference_type
◆ iterator_category
◆ pointer
◆ reference
◆ value_type
◆ Iterator()
juce::ValueTree::Iterator::Iterator |
( |
const ValueTree & |
, |
|
|
bool |
isEnd |
|
) |
| |
◆ operator!=()
bool juce::ValueTree::Iterator::operator!= |
( |
const Iterator & |
| ) |
const |
◆ operator*()
ValueTree juce::ValueTree::Iterator::operator* |
( |
| ) |
const |
◆ operator++()
Iterator& juce::ValueTree::Iterator::operator++ |
( |
| ) |
|
◆ operator==()
bool juce::ValueTree::Iterator::operator== |
( |
const Iterator & |
| ) |
const |
◆ internal
void* juce::ValueTree::Iterator::internal |
|
private |
The documentation for this struct was generated from the following file: