Results for: "pstore"

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

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.

Expands lazy enumerator to an array. See Enumerable#to_a.

Expands lazy enumerator to an array. See Enumerable#to_a.

Rewinds the enumerator chain by calling the “rewind” method on each enumerable in reverse order. Each call is performed only if the enumerable responds to the method.

Returns the number that defines the common difference between two adjacent elements in this arithmetic sequence.

Returns the first number in this arithmetic sequence, or an array of the first n elements.

Returns the last number in this arithmetic sequence, or an array of the last n elements.

Returns the hash value of a given string. This is equivalent to Digest::Class.new(*parameters).digest(string), where extra parameters, if any, are passed through to the constructor and the string is passed to digest().

Returns the hex-encoded hash value of a given string. This is almost equivalent to Digest.hexencode(Digest::Class.new(*parameters).digest(string)).

Returns the base64 encoded hash value of a given string. The return value is properly padded with ‘=’ and contains no line feeds.

Reset the digest to its initial state and return self.

Returns the memory address for this closure

The integer memory location of this function

Returns the memory address for this handle.

Set the free function for this pointer to function in the given Fiddle::Function.

Get the free function for this pointer.

Returns a new instance of Fiddle::Function.

See Fiddle::Function.new

Search took: 4ms  ·  Total Results: 3621