Dispatch enter and leave events for GlobalVariableOrWriteNode nodes and continue walking the tree.
Dispatch enter and leave events for LocalVariableAndWriteNode nodes and continue walking the tree.
Dispatch enter and leave events for LocalVariableOperatorWriteNode nodes and continue walking the tree.
Dispatch enter and leave events for LocalVariableOrWriteNode nodes and continue walking the tree.
Copy a ClassVariableOperatorWriteNode node
Copy a ConstantPathOperatorWriteNode node
Copy a GlobalVariableOperatorWriteNode node
Copy a LocalVariableOperatorWriteNode node
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#select, but chains operation to be lazy-evaluated.
If a block is given, returns a lazy enumerator that will iterate over the given block for each element with an index, which starts from offset, and returns a lazy enumerator that yields the same values (without the index).
If a block is not given, returns a new lazy enumerator that includes the index, starting from offset.
offset
the starting index to use
Return the block length of the digest in bytes.
Return the block length of the digest in bytes.
Digest::SHA256.new.block_length * 8 # => 512 Digest::SHA384.new.block_length * 8 # => 1024 Digest::SHA512.new.block_length * 8 # => 1024
Returns the Fiddle::Pointer of this handle.