Add a "to do" comment.
git-svn-id: https://svn.apache.org/repos/asf/felix/trunk@919153 13f79535-47bb-0310-9956-ffa450edef68
diff --git a/framework/src/main/java/org/apache/felix/framework/resolver/ResolverImpl.java b/framework/src/main/java/org/apache/felix/framework/resolver/ResolverImpl.java
index c8bab53..db865fe 100644
--- a/framework/src/main/java/org/apache/felix/framework/resolver/ResolverImpl.java
+++ b/framework/src/main/java/org/apache/felix/framework/resolver/ResolverImpl.java
@@ -1199,6 +1199,11 @@
Map<Requirement, Set<Capability>> candidateMap)
throws ResolveException
{
+// TODO: FELIX3 - I think permutation is not as efficient as it could be, since
+// we will end up generating permutations that are subsets of previous
+// permutations as we cycle through candidates. We should check if an
+// existing candidate map already has removed the conflicting candidate.
+
// Try to remove the previously selected candidate associated
// with the requirement blamed for adding the constraint. This
// blamed requirement may be null if the bundle itself is