Invoked by IO#write to write length bytes to io from from a specified buffer (see IO::Buffer).
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.
Invoked by Kernel#sleep and Mutex#sleep and is expected to provide an implementation of sleeping in a non-blocking way. Implementation might register the current fiber in some list of “which fiber wait until what moment”, call Fiber.yield to pass control, and then in close resume the fibers whose wait period has elapsed.
Returns a new lazy enumerator with the concatenated results of running block once for every element in the lazy enumerator.
["foo", "bar"].lazy.flat_map {|i| i.each_char.lazy}.force #=> ["f", "o", "o", "b", "a", "r"]
A value x returned by block is decomposed if either of the following conditions is true:
x responds to both each and force, which means that x is a lazy enumerator.
x is an array or responds to to_ary.
Otherwise, x is contained as-is in the return value.
[{a:1}, {b:2}].lazy.flat_map {|i| i}.force
#=> [{:a=>1}, {:b=>2}]
Like Enumerable#filter_map, but chains operation to be lazy-evaluated.
(1..).lazy.filter_map { |i| i * 2 if i.even? }.first(5) #=> [4, 8, 12, 16, 20]
Like Enumerable#drop_while, but chains operation to be lazy-evaluated.
Like Enumerable#slice_after, but chains operation to be lazy-evaluated.
Like Enumerable#map, but chains operation to be lazy-evaluated.
(1..Float::INFINITY).lazy.map {|i| i**2 } #=> #<Enumerator::Lazy: #<Enumerator::Lazy: 1..Infinity>:map> (1..Float::INFINITY).lazy.map {|i| i**2 }.first(3) #=> [1, 4, 9]
Like Enumerable#map, but chains operation to be lazy-evaluated.
(1..Float::INFINITY).lazy.map {|i| i**2 } #=> #<Enumerator::Lazy: #<Enumerator::Lazy: 1..Infinity>:map> (1..Float::INFINITY).lazy.map {|i| i**2 }.first(3) #=> [1, 4, 9]
Like Enumerable#reject, but chains operation to be lazy-evaluated.
Like Enumerable#grep, but chains operation to be lazy-evaluated.
Like Enumerable#grep_v, but chains operation to be lazy-evaluated.
Like Enumerable#zip, but chains operation to be lazy-evaluated. However, if a block is given to zip, values are enumerated immediately.
Like Enumerable#take, but chains operation to be lazy-evaluated.
Like Enumerable#uniq, but chains operation to be lazy-evaluated.
Returns the Fiddle::Pointer of this handle.
Disable a call to dlclose() when this handle is garbage collected.
Enable a call to dlclose() when this handle is garbage collected.
Returns true if dlclose() will be called when this handle is garbage collected.
See man(3) dlclose() for more info.
accessor to Fiddle::CStructEntity
accessor to Fiddle::CUnionEntity
Calculates the offsets and sizes for the given types in the struct.
Calculate the necessary offset and for each union member with the given types
Get the underlying pointer for ruby object val and return it as a Fiddle::Pointer object.