|
Ruby 4.1.0dev (2026-10-21 revision fa2fee5a1d8a80586a0a0ac38e184e0d6622673e)
|
The diagnostics, comments, or magic comments found while parsing, usable in a range-based for loop and with the standard algorithms. More...
#include <parser.hpp>
Data Structures | |
| class | iterator |
| Steps through the items one after another. More... | |
Public Member Functions | |
| next_range (const T *first, std::size_t size) noexcept | |
| Create a range of the given number of items starting at first. | |
| iterator | begin () const noexcept |
| An iterator at the first item. | |
| iterator | end () const noexcept |
| An iterator past the last item. | |
| std::size_t | size () const noexcept |
| The number of items. | |
| bool | empty () const noexcept |
| Whether there are no items. | |
The diagnostics, comments, or magic comments found while parsing, usable in a range-based for loop and with the standard algorithms.
Each element is a pointer to the C struct, which the C accessors read, and Next is the C function that returns the item after a given one. It refers to the parser rather than copying from it, so the parser must outlive it. It is used through diagnostic_range, comment_range, and magic_comment_range.
Definition at line 105 of file parser.hpp.
|
inlinenoexcept |
Create a range of the given number of items starting at first.
| first | The first item. |
| size | The number of items. |
Definition at line 182 of file parser.hpp.
|
inlinenoexcept |
An iterator at the first item.
Definition at line 189 of file parser.hpp.
|
inlinenoexcept |
Whether there are no items.
Definition at line 210 of file parser.hpp.
|
inlinenoexcept |
An iterator past the last item.
Definition at line 196 of file parser.hpp.
|
inlinenoexcept |