Set the supplemental group access list to the given Array of group IDs.
Process.groups #=> [0, 1, 2, 3, 4, 6, 10, 11, 20, 26, 27] Process.groups = [27, 6, 10, 11] #=> [27, 6, 10, 11] Process.groups #=> [27, 6, 10, 11]
Returns the maximum number of gids allowed in the supplemental group access list.
Process.maxgroups #=> 32
Sets the maximum number of gids allowed in the supplemental group access list.
Returns a list of signal names mapped to the corresponding underlying signal numbers.
Signal.list #=> {"EXIT"=>0, "HUP"=>1, "INT"=>2, "QUIT"=>3, "ILL"=>4, "TRAP"=>5, "IOT"=>6, "ABRT"=>6, "FPE"=>8, "KILL"=>9, "BUS"=>7, "SEGV"=>11, "SYS"=>31, "PIPE"=>13, "ALRM"=>14, "TERM"=>15, "URG"=>23, "STOP"=>19, "TSTP"=>20, "CONT"=>18, "CHLD"=>17, "CLD"=>17, "TTIN"=>21, "TTOU"=>22, "IO"=>29, "XCPU"=>24, "XFSZ"=>25, "VTALRM"=>26, "PROF"=>27, "WINCH"=>28, "USR1"=>10, "USR2"=>12, "PWR"=>30, "POLL"=>29}
Returns the generator of the group.
See the OpenSSL documentation for EC_GROUP_get0_generator()
Returns the cofactor of the group.
See the OpenSSL documentation for EC_GROUP_get_cofactor()
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 [Array<Object>] the list of requirements that led to
`requirement` being required.
Nonsymmetric reduction from Hessenberg to real Schur form.
Search through all unresolved deps and sub-dependencies and return specs that contain the file matching path.
Returns a Ruby lighter-weight code representation of this specification, used for indexing only.
See to_ruby.
Default options for the gem install command.
@return [Array<Vertex>] the vertices of {#graph} where ‘self` is a
{#descendent?}
@return [Array<Array<Object>>] The different requirement
trees that led to every requirement for the current spec.