Expands code to the next lowest indentation
For example:
1 def dog 2 print "dog" 3 end
If a block starts on line 2 then it has captured all it’s “neighbors” (code at the same indentation or higher). To continue expanding, this block must capture lines one and three which are at a different indentation level.
This method allows fully expanded blocks to decrease their indentation level (so they can expand to capture more code up and down). It does this conservatively as there’s no undo (currently).
Smushes all heredoc lines into one line
source = <<~'EOM' foo = <<~HEREDOC lol hehehe HEREDOC EOM lines = CleanDocument.new(source: source).join_heredoc!.lines expect(lines[0].to_s).to eq(source) expect(lines[1].to_s).to eq("")
Used to hide lines
The search alorithm will group lines into blocks then if those blocks are determined to represent valid code they will be hidden
Opposite of ‘empty?` (note: different than `visible?`)
Returns an array of all the CodeLines that exist after the currently scanned block
do nothing
Checks the password v component for RFC2396 compliance and against the URI::Parser Regexp for :USERINFO.
Can not have a registry or opaque component defined, with a user component defined.
Returns the password component after URI decoding.
Checks the path v component for RFC2396 compliance and against the URI::Parser Regexp for :ABS_PATH and :REL_PATH.
Can not have a opaque component defined, with a path component defined.
Returns an Array of the path split on ‘/’.
Private setter for dn val.
Private setter for attributes val.
Private setter for to v.
Constructs the default Hash of Regexp’s.
Calls the given block once for each key, value pair in the database.
Returns self.
Invoked by IO#wait, IO#wait_readable, IO#wait_writable to ask whether the specified descriptor is ready for specified events within the specified timeout.
events is a bit mask of IO::READABLE, IO::WRITABLE, and IO::PRIORITY.
Suggested implementation should register which Fiber is waiting for which resources and immediately calling Fiber.yield to pass control to other fibers. Then, in the close method, the scheduler might dispatch all the I/O resources to fibers waiting for it.
Expected to return the subset of events that are ready immediately.
Invoked by IO#read or IO#Buffer.read to read length bytes from io into a specified buffer (see IO::Buffer) at the given offset.
The length argument is the “minimum length to be read”. If the IO buffer size is 8KiB, but the length is 1024 (1KiB), up to 8KiB might be read, but at least 1KiB will be. Generally, the only case where less data than length will be read is if there is an error reading the data.
Specifying a length of 0 is valid and means try reading at least once and return any available data.
Suggested implementation should try to read from io in a non-blocking manner and call io_wait if the io is not ready (which will yield control to other fibers).
See IO::Buffer for an interface available to return data.
Expected to return number of bytes read, or, in case of an error, -errno (negated number corresponding to system’s error code).
The method should be considered experimental.
Invoked by IO#write or IO::Buffer#write to write length bytes to io from from a specified buffer (see IO::Buffer) at the given offset.
The length argument is the “minimum length to be written”. If the IO buffer size is 8KiB, but the length specified is 1024 (1KiB), at most 8KiB will be written, but at least 1KiB will be. Generally, the only case where less data than length will be written is if there is an error writing the data.
Specifying a length of 0 is valid and means try writing at least once, as much data as possible.
Suggested implementation should try to write to io in a non-blocking manner and call io_wait if the io is not ready (which will yield control to other fibers).
See IO::Buffer for an interface available to get data from buffer efficiently.
Expected to return number of bytes written, or, in case of an error, -errno (negated number corresponding to system’s error code).
The method should be considered experimental.