From 58d94501900849959346beb5988454122c623470 Mon Sep 17 00:00:00 2001 From: Simon Brandhof Date: Tue, 21 Feb 2012 21:31:00 +0100 Subject: Fix some typos --- .../main/java/org/sonar/duplications/detector/suffixtree/Search.java | 2 +- .../java/org/sonar/duplications/detector/suffixtree/SuffixTree.java | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) (limited to 'sonar-duplications/src/main/java') diff --git a/sonar-duplications/src/main/java/org/sonar/duplications/detector/suffixtree/Search.java b/sonar-duplications/src/main/java/org/sonar/duplications/detector/suffixtree/Search.java index 650f9864dd5..c2174c37bd9 100644 --- a/sonar-duplications/src/main/java/org/sonar/duplications/detector/suffixtree/Search.java +++ b/sonar-duplications/src/main/java/org/sonar/duplications/detector/suffixtree/Search.java @@ -148,7 +148,7 @@ public final class Search { abstract void startOfGroup(int size, int length); /** - * Invoked as many times as leafs in the subtree, where current node is root. + * Invoked as many times as leaves in the subtree, where current node is root. * * @param start start position in generalised text * @param end end position in generalised text diff --git a/sonar-duplications/src/main/java/org/sonar/duplications/detector/suffixtree/SuffixTree.java b/sonar-duplications/src/main/java/org/sonar/duplications/detector/suffixtree/SuffixTree.java index 6920d3c89d6..70c76aae86d 100644 --- a/sonar-duplications/src/main/java/org/sonar/duplications/detector/suffixtree/SuffixTree.java +++ b/sonar-duplications/src/main/java/org/sonar/duplications/detector/suffixtree/SuffixTree.java @@ -33,7 +33,7 @@ import com.google.common.base.Objects; * Since such a tree does not exist for all strings, S is padded with a terminal symbol not seen in the string (usually denoted $). * This ensures that no suffix is a prefix of another, and that there will be n leaf nodes, one for each of the n suffixes of S. * Since all internal non-root nodes are branching, there can be at most n − 1 such nodes, and n + (n − 1) + 1 = 2n nodes in total. - * All internal nodes and leafs have incoming edge, so number of edges equal to number of leafs plus number of inner nodes, + * All internal nodes and leaves have incoming edge, so number of edges equal to number of leaves plus number of inner nodes, * thus at most 2n - 1. * Construction takes O(n) time. *

-- cgit v1.2.3