From 2bb1d74c90fad20027e830a2c530c7b6d5ffeea9 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Sebastian=20K=C3=BCrten?= Date: Thu, 9 Feb 2017 19:32:10 +0100 Subject: [PATCH] Fix a few Javadoc typos --- src/main/java/org/jsuffixarrays/Algorithm.java | 2 +- src/main/java/org/jsuffixarrays/DeepShallow.java | 10 +++++----- 2 files changed, 6 insertions(+), 6 deletions(-) diff --git a/src/main/java/org/jsuffixarrays/Algorithm.java b/src/main/java/org/jsuffixarrays/Algorithm.java index 0acefa9..e64fdb4 100644 --- a/src/main/java/org/jsuffixarrays/Algorithm.java +++ b/src/main/java/org/jsuffixarrays/Algorithm.java @@ -93,7 +93,7 @@ public ISuffixArrayBuilder getInstance() } /** - * If it is possbile, create memory conserving instance of an algorithm, this + * If it is possible, create memory conserving instance of an algorithm, this * instance will overwrite input. *

* If not, create default instance diff --git a/src/main/java/org/jsuffixarrays/DeepShallow.java b/src/main/java/org/jsuffixarrays/DeepShallow.java index 15a143c..4969a9b 100644 --- a/src/main/java/org/jsuffixarrays/DeepShallow.java +++ b/src/main/java/org/jsuffixarrays/DeepShallow.java @@ -453,7 +453,7 @@ private void shallowInssortLcp(int a, int n, int text_depth) { /** * Function to compare two strings originating from the *b1 and *b2 The size of the unrolled loop must be at most - * equal to the costant CMP_OVERSHOOT defined in common.h When the function is called cmpLeft must contain the + * equal to the constant CMP_OVERSHOOT defined in common.h When the function is called cmpLeft must contain the * maximum number of comparisons the algorithm can do before returning 0 (equal strings) At exit cmpLeft has been * decreased by the # of comparisons done */ @@ -884,7 +884,7 @@ private void updateAnchors(int a, int n) { * with anchor_pos and anchor_rank respectively) but it is not necessarily an anchor (=does not necessarily starts * at position multiple of anchorDist) since this function is called by pseudo_anchor_sort(). The routine works by * scanning the suffixes before and after the anchor in order to find (and mark) those which are suffixes of a[0] - * ... a[n-1]. After that, the ordering of a[0] ... a[n-1] is derived with a sigle scan of the marked + * ... a[n-1]. After that, the ordering of a[0] ... a[n-1] is derived with a single scan of the marked * suffixes.******************************************************************* */ private void generalAnchorSort(int a, int n, int anchor_pos, int anchor_rank, int offset) { @@ -1162,8 +1162,8 @@ else if (r3 == 1) /** * Function to compare two strings originating from the *b1 and *b2 The size of the unrolled loop must be at most - * equal to the costant CMP_OVERSHOOT defined in common.h the function return the result of the comparison (+ or -) - * and writes in cmpDone the number of successfull comparisons done + * equal to the constant CMP_OVERSHOOT defined in common.h the function return the result of the comparison (+ or -) + * and writes in cmpDone the number of successful comparisons done */ private int cmpUnrolledLcp(int b1, int b2) { @@ -1458,7 +1458,7 @@ private void insertSuffix(Node h, int suf, int n, int mmchar) { /** * this function returns the lcp between suf1 and suf2 (that is returns n such that suf1[n]!=suf2[n] but * suf1[i]==suf2[i] for i=0..n-1 However, it is possible that suf1 is a prefix of suf2 (not vice-versa because of - * the initial sorting of suffixes in order of descreasing length) in this case the function returns + * the initial sorting of suffixes in order of decreasing length) in this case the function returns * n=length(suf1)-1. So in this case suf1[n]==suf2[n] (and suf1[n+1] does not exists). */ private int compareSuffixes(int suf1, int suf2, int depth) {