For full_name, verifies the certificate chain is valid, the digests match the signatures signatures created by the signer depending on the policy settings.
If key is given it is used to validate the signing certificate.
Writes data to the underlying IO and updates the digests
Raises an exception if a security policy that verifies data is active. Old format gems cannot be verified as signed.
Writes the lock file alongside the gem dependencies file
True if the requested gem has already been installed.
Return the Specification that listed the dependency
Installing a git gem only involves building the extensions and generating the executables.
This is a null install as this specification is already installed. options are ignored.
This is a null install as a locked specification is considered installed. options are ignored.
Installs this specification using the Gem::Installer options. The install method yields a Gem::Installer instance, which indicates the gem will be installed, or nil, which indicates the gem is already installed.
After installation spec is updated to point to the just-installed specification.
This is a null install as this gem was unpacked into a directory. options are ignored.
Make sure the trust directory exists. If it does exist, make sure it’s actually a directory. If not, then create it with the appropriate permissions.
Like Enumerable#zip, but chains operation to be lazy-evaluated. However, if a block is given to zip, values are enumerated immediately.
Return the length of the hash value in bytes.
Return the length of the hash value (the digest) in bytes.
Digest::SHA256.new.digest_length * 8 # => 256 Digest::SHA384.new.digest_length * 8 # => 384 Digest::SHA512.new.digest_length * 8 # => 512
For example, digests produced by Digest::SHA256 will always be 32 bytes (256 bits) in size.
Get the underlying pointer for ruby object val and return it as a Fiddle::Pointer object.
Generates a random prime number of bit length bits. If safe is set to true, generates a safe prime. If add is specified, generates a prime that fulfills condition p % add = rem.