Results for: "slice"

@param [Set<Vertex>] vertices the set to add the predecessors to @return [Set<Vertex>] the vertices of {#graph} where ‘self` is a

{#descendent?}

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

{#ancestor?}

@param [Set<Vertex>] vertices the set to add the successors to @return [Set<Vertex>] the vertices of {#graph} where ‘self` is an

{#ancestor?}

Indicates progress roughly once every second @return [void]

Build an array of PossibilitySets, with each element representing a group of dependency versions that all have the same sub-dependency version constraints and are contiguous. @param [Array] possibilities an array of possibilities @return [Array<PossibilitySet>] an array of possibility sets

Removes a possibility from ‘self` @return [PossibilityState] a state with a single possibility,

the possibility that was removed from `self`

Processes the topmost available {RequirementState} on the stack @return [void]

@param [Object] possibility a single possibility @param [Array] requirements an array of requirements @return [Boolean] whether the possibility satisfies all of the

given requirements

Generates a filtered version of the existing vertex’s ‘PossibilitySet` using the current state’s ‘requirement` @param [Object] vertex existing vertex @return [PossibilitySet] filtered possibility set

Checks a proposed requirement with any existing locked requirement before generating an array of possibilities for it. @param [Object] requirement the proposed requirement @param [Object] activated @return [Array] possibilities

This method verifies that there are no (obvious) ambiguities with the provided col_sep and strip parsing options. For example, if col_sep and strip were both equal to \t, then there would be no clear way to parse the input.