@return [Array<Vertex>] the vertices of {#graph} where ‘self` is a
{#descendent?}
@return [Array<Vertex>] the vertices of {#graph} where ‘self` is an
{#ancestor?}
@return [Object] the requirement that led to ‘requirement` being added
to the list of requirements.
Returns a new lazy enumerator with the concatenated results of running block once for every element in lazy.
["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:
a) <i>x</i> responds to both each and force, which means that <i>x</i> is a lazy enumerator. b) <i>x</i> 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}]
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.