Repository: ant-ivy Updated Branches: refs/heads/master 24b5e00be -> 6e906cc8e
s/iff/if and only if/ Project: http://git-wip-us.apache.org/repos/asf/ant-ivy/repo Commit: http://git-wip-us.apache.org/repos/asf/ant-ivy/commit/6e906cc8 Tree: http://git-wip-us.apache.org/repos/asf/ant-ivy/tree/6e906cc8 Diff: http://git-wip-us.apache.org/repos/asf/ant-ivy/diff/6e906cc8 Branch: refs/heads/master Commit: 6e906cc8eacc847e1322724d842adee170baedc4 Parents: 24b5e00 Author: Jan Matèrne <[email protected]> Authored: Mon May 29 14:24:59 2017 +0200 Committer: Jan Matèrne <[email protected]> Committed: Mon May 29 14:24:59 2017 +0200 ---------------------------------------------------------------------- .../org/apache/ivy/core/sort/ModuleInSort.java | 18 +++++++++--------- 1 file changed, 9 insertions(+), 9 deletions(-) ---------------------------------------------------------------------- http://git-wip-us.apache.org/repos/asf/ant-ivy/blob/6e906cc8/src/java/org/apache/ivy/core/sort/ModuleInSort.java ---------------------------------------------------------------------- diff --git a/src/java/org/apache/ivy/core/sort/ModuleInSort.java b/src/java/org/apache/ivy/core/sort/ModuleInSort.java index 686504e..e6757d7 100644 --- a/src/java/org/apache/ivy/core/sort/ModuleInSort.java +++ b/src/java/org/apache/ivy/core/sort/ModuleInSort.java @@ -36,15 +36,15 @@ import org.apache.ivy.util.Message; * The added fields are: * </p> * <ul> - * <li><code>isSorted</code> : is true iff this module has already been added to the sorted - * list.</li> - * <li><code>loopElements</code> : When the module is the root of a loop (=the first element of a - * loop met during the sort), <code>loopElements</code> contains all ModuleInSort of the loop - * (excluding the root itself.</li> - * <li><code>isLoopIntermediateElement</code> : When a loop is detected, all modules included in the - * loop (except the root) have <code>isLoopIntermediateElement</code> set to true.</li> - * <li><code>caller</code> : During the sort, we traverse recursively the graph. When doing that, - * caller point to the parent element.</li> + * <li><code>isSorted</code> : is <i>true</i> if and only if this module has already been added to + * the sorted list.</li> + * <li><code>loopElements</code> : When the module is the root of a loop (=the first element of a + * loop met during the sort), <code>loopElements</code> contains all ModuleInSort of the loop + * (excluding the root itself.</li> + * <li><code>isLoopIntermediateElement</code> : When a loop is detected, all modules included in + * the loop (except the root) have <code>isLoopIntermediateElement</code> set to true.</li> + * <li><code>caller</code> : During the sort, we traverse recursively the graph. When doing that, + * caller point to the parent element.</li> * </ul> */ class ModuleInSort {
