Modified generic resolver algorithm to verify constraint violations for
bundle dependencies and to create appropriate wires upon find a
consistent class space.
The general resolver algorithm is this:
1. Determine all possible candidates to resolve a given target module,
including the candidates to resolve all transitive dependencies.
2. Pick a set of candidates and determine if all of their class spaces
consistent by calculating the packages for each module and
determining if there are any conflicts.
3. If a consistent class space is found, create all of the resulting
wires for the transitive set of resolved modules.
Note that this is an incomplete implementation and more work is needed
both in terms of features and performance. (FELIX-28)
git-svn-id: https://svn.apache.org/repos/asf/incubator/felix/trunk@502003 13f79535-47bb-0310-9956-ffa450edef68
1 file changed