A deep iterator traverses every value contained in a dictionary, in depth-first order. More...
typedef struct _FLDeepIterator * FLDeepIterator A reference to a deep iterator.A deep iterator traverses every value contained in a dictionary, in depth-first order.
You can skip any nested collection by calling FLDeepIterator_SkipChildren.
◆ FLDeepIteratorA reference to a deep iterator.
◆ FLDeepIterator_Free() ◆ FLDeepIterator_GetDepth()Returns the current depth in the hierarchy, starting at 1 for the top-level children.
◆ FLDeepIterator_GetIndex()Returns the array index of the current value in its parent, or 0 if not in an array.
◆ FLDeepIterator_GetJSONPointer()Returns the current path in JSONPointer format (RFC 6901).
◆ FLDeepIterator_GetKey()Returns the key of the current value in its parent, or an empty slice if not in a dictionary.
◆ FLDeepIterator_GetParent()Returns the parent/container of the current value, or NULL at the end of iteration.
◆ FLDeepIterator_GetPath()Returns the path as an array of FLPathComponents.
◆ FLDeepIterator_GetPathString()Returns the current path in JavaScript format.
◆ FLDeepIterator_GetValue()Returns the current value being iterated over.
or NULL at the end of iteration.
◆ FLDeepIterator_New()Creates a FLDeepIterator to iterate over a dictionary.
Call FLDeepIterator_GetKey and FLDeepIterator_GetValue to get the first item, then FLDeepIterator_Next.
◆ FLDeepIterator_Next()Advances the iterator to the next value, or returns false if at the end.
◆ FLDeepIterator_SkipChildren()Tells the iterator to skip the children of the current value.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4