Is there a path from ‘other` to `self` following edges in the dependency graph? @return true iff there is a path following edges within this {#graph}
@return [RequirementState] the current state the resolution is
operating upon
Re-composes a prime factorization and returns the product.
pd
Array of pairs of integers. The each internal pair consists of a prime number – a prime factor – and a natural number – an exponent.
For [[p_1, e_1], [p_2, e_2], ...., [p_n, e_n]]
, it returns:
p_1**e_1 * p_2**e_2 * .... * p_n**e_n. Prime.int_from_prime_division([[2,2], [3,1]]) #=> 12
Clear recorded tracing information.
Quietly ensure the Gem directory dir
contains all the proper subdirectories for handling default gems. If we can’t create a directory due to a permission problem, then we will silently continue.
If mode
is given, missing directories are created with this mode.
World-writable directories will never be created.
Returns a Hash
containing the following keys:
Number of started SSL/TLS handshakes in server mode
Number of established SSL/TLS sessions in server mode
Number of start renegotiations in server mode
Number of sessions that were removed due to cache overflow
Number of successfully reused connections
Number of sessions proposed by clients that were not found in the cache
Number of sessions in the internal session cache
Number of sessions retrieved from the external cache in server mode
Number of started SSL/TLS handshakes in client mode
Number of established SSL/TLS sessions in client mode
Number of start renegotiations in client mode
Number of sessions proposed by clients that were found in the cache but had expired due to timeouts
Perform hostname verification following RFC 6125.
This method MUST be called after calling connect
to ensure that the hostname of a remote peer has been verified.
Checks if ‘key’ is PRIV key for this cert
See the OpenSSL
documentation for ECDSA_verify()
Takes the first digit of the reply code to determine the status type