A range adaptor for a pair of iterators.
Declared in <llvm/ADT/iterator_range.h>
template<typename IteratorT>
class iterator_range;
This just wraps two iterators into a range-compatible interface. Nothing fancy at all.
| Name | Description |
|---|---|
iterator_range [constructor] | Constructors |
begin | Return an iterator to the first element. |
empty | Return true if the range contains no elements. |
end | Return an iterator past the last element. |
| Name | Description |
|---|---|
iterator_range</* implementation-defined */> | Deduction guide for constructing an iterator_range from a container. |
| Name | Description |
|---|---|
breadth_first | Return a range that visits G in breadth-first order. |
children | Return a range over the children of node G. |
children_edges | Return a range over the outgoing child edges of node G. |
const_mi_bundle_ops | Return a range over all operands in the const bundle containing MI. |
def_chain | Return a range walking defining accesses from MA up to UpTo. |
depth_first | Return a range that visits G in depth-first order. |
depth_first_ext | Return a range that visits G in depth-first order using visited set S. |
getDbgRecordRange | Return the range of DbgRecords attached to DebugMarker. |
inverse_children | Return a range over the inverse-order children of node G. |
inverse_depth_first | Return a range that visits the inverse of G in depth-first order. |
inverse_depth_first_ext | Return a range that visits the inverse of G in depth-first order using visited set S. |
inverse_nodes | Return a range over all nodes of G in inverse graph order. |
isGuaranteedToTransferExecutionToSuccessor | Same as previous, but with range expressed via iterator_range. |
make_early_inc_range | Make a range that does early increment to allow mutation of the underlying range without disrupting iteration. |
make_fallible_range | Build an iterator range whose increments report failure through Err. |
make_filter_range | Convenience function that takes a range of elements and a predicate, and return a new filter_iterator range. |
make_pointee_range | Return a range that iterates over the pointees of Range. |
make_pointee_range | Return a range that iterates over the pointees of Range. |
make_pointer_range | Return a range whose iterators expose addresses of elements in Range. |
make_range | Construct an iterator_range from a pair of iterators. |
make_range | Convenience function for iterating over sub-ranges. |
mi_bundle_ops | Return a range over all operands in the bundle containing MI. |
nodes | Return a range over all nodes of graph G. |
optimized_def_chain | Return a range walking the optimized clobbering-access chain from MA. |
phys_regs_and_masks | Returns an iterator range over all physical register and mask operands for MI and bundled instructions. This also skips any debug operands. |
split | Iterate over partitions of a string split on character Separator. |
split | Iterate over partitions of a string split on Separator. |
upward_defs | Return a range walking upward defs from Pair with phi translation. |
cl::getRegisteredSubcommands | Use this to get all registered SubCommands from the provided parser. |
directive::FindName | Find the first spelling in a range that applies to a language version. |
orc::getConstructors | Create an iterator range over the entries of the llvm.global_ctors array. |
orc::getDestructors | Create an iterator range over the entries of the llvm.global_dtors array. |
orc::getStaticInitGVs | Create an iterator range over the GlobalValues that contribute to static initialization. |