The logical inverse of ‘capture_last_end_same_indent`
When there is an invalid block with an ‘end` missing a keyword right after another `end`, it is unclear where which end is missing the keyword.
Take this example:
class Dog # 1
puts "woof" # 2
end # 3
end # 4
the problem line will be identified as:
> end # 4
This happens because lines 1, 2, and 3 are technically valid code and are expanded first, deemed valid, and hidden. We need to un-hide the matching keyword on line 1. Also work backwards and if there’s a mis-matched end, show it too
Like Enumerable#chunk_while, but chains operation to be lazy-evaluated.
Enumerate values.
Enumerate subkeys.
subkey is String which contains name of subkey. wtime is last write time as FILETIME (64-bit integer). (see Registry.wtime2time)
See Zlib::GzipReader documentation for a description.
See Zlib::GzipReader documentation for a description.
Iterates over the buffer, yielding each byte starting from offset.
If count is given, only count bytes will be yielded.
IO::Buffer.for("Hello World").each_byte(2, 2) do |offset, byte| puts "#{offset}: #{byte}" end # 2: 108 # 3: 108
Validates typecode v, returns true or false.
Main name of the switch.
Iterates over each option, passing the option to the block.
def child_nodes: () -> Array[nil | Node]
def child_nodes: () -> Array[nil | Node]
def child_nodes: () -> Array[nil | Node]
def child_nodes: () -> Array[nil | Node]
def child_nodes: () -> Array[nil | Node]
def child_nodes: () -> Array[nil | Node]
def child_nodes: () -> Array[nil | Node]