diff options
author | Sergey Prigogin | 2009-04-12 05:48:15 +0000 |
---|---|---|
committer | Sergey Prigogin | 2009-04-12 05:48:15 +0000 |
commit | 824d47c599e6bb48a6d1bb9587560515160f473b (patch) | |
tree | b297ca963f07a3aa2f4590430a090bd29d666918 /core/org.eclipse.cdt.core/parser/org/eclipse/cdt/internal/core/dom/parser/cpp/semantics/FunctionCost.java | |
parent | 3550a299d4abd387ffc2ec9e0def8c9738c92560 (diff) | |
download | org.eclipse.cdt-824d47c599e6bb48a6d1bb9587560515160f473b.tar.gz org.eclipse.cdt-824d47c599e6bb48a6d1bb9587560515160f473b.tar.xz org.eclipse.cdt-824d47c599e6bb48a6d1bb9587560515160f473b.zip |
Cosmetics.
Diffstat (limited to 'core/org.eclipse.cdt.core/parser/org/eclipse/cdt/internal/core/dom/parser/cpp/semantics/FunctionCost.java')
-rw-r--r-- | core/org.eclipse.cdt.core/parser/org/eclipse/cdt/internal/core/dom/parser/cpp/semantics/FunctionCost.java | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/core/org.eclipse.cdt.core/parser/org/eclipse/cdt/internal/core/dom/parser/cpp/semantics/FunctionCost.java b/core/org.eclipse.cdt.core/parser/org/eclipse/cdt/internal/core/dom/parser/cpp/semantics/FunctionCost.java index 85ef69e1c57..3543424cbc0 100644 --- a/core/org.eclipse.cdt.core/parser/org/eclipse/cdt/internal/core/dom/parser/cpp/semantics/FunctionCost.java +++ b/core/org.eclipse.cdt.core/parser/org/eclipse/cdt/internal/core/dom/parser/cpp/semantics/FunctionCost.java @@ -87,9 +87,9 @@ class FunctionCost { // In order for this function to be better than the previous best, it must // have at least one parameter match that is better that the corresponding // match for the other function, and none that are worse. - int idx= getLength()-1; - int idxOther= other.getLength()-1; - for (; idx>=0 && idxOther>=0; idx--,idxOther--) { + int idx= getLength() - 1; + int idxOther= other.getLength() - 1; + for (; idx >= 0 && idxOther >= 0; idx--, idxOther--) { Cost cost= getCost(idx); if (cost.getRank() == Rank.NO_MATCH) { haveWorse = true; @@ -140,9 +140,9 @@ class FunctionCost { return false; boolean haveWorse= false; - int idx= getLength()-1; - int idxOther= other.getLength()-1; - for (; idx>=0 && idxOther>=0; idx--,idxOther--) { + int idx= getLength() - 1; + int idxOther= other.getLength() - 1; + for (; idx >= 0 && idxOther >= 0; idx--, idxOther--) { Cost cost= getCost(idx); if (cost.getRank() == Rank.NO_MATCH) return true; |