(trivial optimization)
authorDan Winship <danw@gnome.org>
Thu, 14 Feb 2008 15:35:25 +0000 (10:35 -0500)
committerDan Winship <danw@gnome.org>
Thu, 14 Feb 2008 15:35:25 +0000 (10:35 -0500)
razor.c

diff --git a/razor.c b/razor.c
index 034cf31..347cf78 100644 (file)
--- a/razor.c
+++ b/razor.c
@@ -1460,8 +1460,8 @@ razor_set_satisfy(struct razor_set *set, struct array *unsatisfied,
                r = requires + *u;
 
                while (p < pend &&
-                      strcmp(&pool[r->name], &upool[p->name]) > 0 &&
-                      p->type != RAZOR_PROPERTY_PROVIDES)
+                      p->type != RAZOR_PROPERTY_PROVIDES &&
+                      strcmp(&pool[r->name], &upool[p->name]) > 0)
                        p++;
                /* If there is more than one version of a provides,
                 * seek to the end for the highest version. */