Results for: "pstore"

This is a null install as this gem was unpacked into a directory. options are ignored.

Executes a SpecFetcher setup block. Yields an instance then creates the gems and specifications defined in the instance.

Reloads passwords from the database

Reload groups from the database

Reload passwords from the database

Returns all the FormData as an Array

This FormData’s body

No documentation available

Removes all whitespaces but in the tags i4, i8, int, boolean.… and all comments

No documentation available
No documentation available
No documentation available
No documentation available
No documentation available

Returns a Kernel#caller style string representing this frame.

No documentation available
No documentation available
No documentation available
No documentation available

@return [Array<Vertex>] the vertices of {#graph} where ‘self` is an

{#ancestor?}

Sets up the resolution process @return [void]

In case we’re building docs in a background process, this method waits for that process to exit (or if it’s already been reaped, or never happened, swallows the Errno::ECHILD error).

Similar to Kernel#to_enum, except it returns a lazy enumerator. This makes it easy to define Enumerable methods that will naturally remain lazy if called from a lazy enumerator.

For example, continuing from the example in Kernel#to_enum:

# See Kernel#to_enum for the definition of repeat
r = 1..Float::INFINITY
r.repeat(2).first(5) # => [1, 1, 2, 2, 3]
r.repeat(2).class # => Enumerator
r.repeat(2).map{|n| n ** 2}.first(5) # => endless loop!
# works naturally on lazy enumerator:
r.lazy.repeat(2).class # => Enumerator::Lazy
r.lazy.repeat(2).map{|n| n ** 2}.first(5) # => [1, 1, 4, 4, 9]

Similar to Kernel#to_enum, except it returns a lazy enumerator. This makes it easy to define Enumerable methods that will naturally remain lazy if called from a lazy enumerator.

For example, continuing from the example in Kernel#to_enum:

# See Kernel#to_enum for the definition of repeat
r = 1..Float::INFINITY
r.repeat(2).first(5) # => [1, 1, 2, 2, 3]
r.repeat(2).class # => Enumerator
r.repeat(2).map{|n| n ** 2}.first(5) # => endless loop!
# works naturally on lazy enumerator:
r.lazy.repeat(2).class # => Enumerator::Lazy
r.lazy.repeat(2).map{|n| n ** 2}.first(5) # => [1, 1, 4, 4, 9]

Get the underlying pointer for ruby object val and return it as a Fiddle::Pointer object.

Search took: 5ms  ·  Total Results: 3306