Results for: "match"

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

Creates and pushes the initial state for the resolution, based upon the {#requested} dependencies @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

@param [Object] requirement @return [ResolutionState] the state whose ‘requirement` is the given

`requirement`.

Add the current {#possibility} to the dependency graph of the current {#state} @return [void]

(see Gem::Resolver::Molinillo::SpecificationProvider#requirement_satisfied_by?)

Ruby expects the dylib to follow a file name convention for loading

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.

Raises a VersionConflict error, or any underlying error, if there is no current state @return [void]

Pushes a new {DependencyState} that encapsulates both existing and new requirements @param [Array] new_requirements @param [Boolean] requires_sort @param [Object] new_activated @return [void]

@return [Boolean] where the requirement of the state we’re unwinding

to directly caused the conflict. Note: in this case, it is
impossible for the state we're unwinding to to be a parent of
any of the other conflicting requirements (or we would have
circularity)

Filter’s a state’s possibilities to remove any that would not satisfy the requirements in the conflict we’ve just rewound from @param [UnwindDetails] unwind_details details of the conflict just unwound from @return [void]

Attempts to update the existing vertex’s ‘PossibilitySet` with a filtered version @return [void]

Pushes a new {DependencyState}. If the {#specification_provider} says to {SpecificationProvider#allow_missing?} that particular requirement, and there are no possibilities for that requirement, then ‘state` is not pushed, and the vertex in {#activated} is removed, and we continue resolving the remaining requirements. @param [DependencyState] state @return [void]

Ensures any raised {NoSuchDependencyError} has its {NoSuchDependencyError#required_by} set. @yield

Returns the regexp.

m = /a.*b/.match("abc")
m.regexp #=> /a.*b/

Returns a list of names of captures as an array of strings. This is the same as mtch.regexp.names.

/(?<foo>.)(?<bar>.)(?<baz>.)/.match("hoge").names
#=> ["foo", "bar", "baz"]

m = /(?<x>.)(?<y>.)?/.match("a") #=> #<MatchData "a" x:"a" y:nil>
m.names                          #=> ["x", "y"]

Returns the number of elements in the match array.

m = /(.)(.)(\d+)(\d)/.match("THX1138.")
m.length   #=> 5
m.size     #=> 5

Returns the number of elements in the match array.

m = /(.)(.)(\d+)(\d)/.match("THX1138.")
m.length   #=> 5
m.size     #=> 5