misc: fix typos (apache#1325)

Author: jbampton

.github/linters/codespell.txt

@@ -120,15 +120,12 @@ entend
 equest
 euclidian
 everytime
-explicity
 faild
 failue
 fallow
 finis
 floatation
 fo
-folling
-followng
 formated
 formen
 formes
@@ -179,7 +176,6 @@ innaccuracy
 instace
 instaed
 intance
-intead
 interger
 interruted
 isnt
@@ -289,8 +285,6 @@ raison
 ream
 reasearch
 recipies
-recursivelly
-redundent
 refering
 refrenced
 relativly
@@ -308,42 +302,34 @@ rougly
 rute
 sate
 sav
-scenerios
 scrip
 seach
 selv
-sensititive
 sentances
 seperate
 seperated
 seperator
 ser
 serialzation
-sesssion
 shold
 shouldnt
 sideral
 sie
 sightly
 similiarty
 simle
-simplifed
 singe
 singl
 siz
 sizin
 slippy
 som
 somme
-specifiy
 splitted
 statics
 sting
 straightaway
 stye
-subseqence
-sucess
-suppresed
 supress
 synchonise
 syncronize
@@ -370,11 +356,8 @@ tread
 trough
 trye
 trys
-tthe
 udo
-udpate
 ue
-unexpexted
 unser
 unter
 useable
@@ -387,7 +370,6 @@ vell
 vender
 vie
 vise
-vists
 vor
 wast
 wee

src/Lucene.Net.Analysis.Phonetic/Language/Bm/Rule.cs

@@ -825,15 +825,15 @@ public virtual bool PatternAndContextMatches(ICharSequence input, int i)
 
             // evaluate the pattern, left context and right context
             // fail early if any of the evaluations is not successful
-            if (!input.Subsequence(i, ipl - i).Equals(this.pattern)) // LUCENENET: Corrected 2nd Subseqence parameter
+            if (!input.Subsequence(i, ipl - i).Equals(this.pattern)) // LUCENENET: Corrected 2nd Subsequence parameter
             {
                 return false;
             }
-            else if (!this.rContext.IsMatch(input.Subsequence(ipl, input.Length - ipl))) // LUCENENET: Corrected 2nd Subseqence parameter
+            else if (!this.rContext.IsMatch(input.Subsequence(ipl, input.Length - ipl))) // LUCENENET: Corrected 2nd Subsequence parameter
             {
                 return false;
             }
-            return this.lContext.IsMatch(input.Subsequence(0, i - 0)); // LUCENENET: Corrected 2nd Subseqence parameter
+            return this.lContext.IsMatch(input.Subsequence(0, i - 0)); // LUCENENET: Corrected 2nd Subsequence parameter
         }
 
         /// <summary>

src/Lucene.Net.Benchmark/ByTask/Utils/Algorithm.cs

@@ -126,7 +126,7 @@ public Algorithm(PerfRunData runData)
                                             }
                                         case StreamTokenizer.TokenType_EndOfStream:
                                             {
-                                                throw RuntimeException.Create("Unexpexted EOF: - " + stok.ToString());
+                                                throw RuntimeException.Create("Unexpected EOF: - " + stok.ToString());
                                             }
                                         case '"':
                                         case '\'':
@@ -184,7 +184,7 @@ public Algorithm(PerfRunData runData)
                         {
 
                             case ':':
-                                if (!colonOk) throw new Exception("colon unexpexted: - " + stok.ToString());
+                                if (!colonOk) throw new Exception("colon unexpected: - " + stok.ToString());
                                 //colonOk = false; // LUCENENET: IDE0059: Remove unnecessary value assignment - this is assigned again below without being read
                                 // get repetitions number
                                 stok.NextToken();

src/Lucene.Net.Memory/MemoryIndex.cs

@@ -644,7 +644,7 @@ public void SetNextReader(AtomicReaderContext context)
 
         /// <summary>
         /// Returns a reasonable approximation of the main memory [bytes] consumed by
-        /// this instance. Useful for smart memory sensititive caches/pools. </summary>
+        /// this instance. Useful for smart memory sensitive caches/pools. </summary>
         /// <returns> the main memory consumption </returns>
         public virtual long GetMemorySize()
         {

src/Lucene.Net.Misc/Document/LazyDocument.cs

@@ -121,7 +121,7 @@ internal virtual Document GetDocument()
             }
         }
 
-        // :TODO: synchronize to prevent redundent copying? (sync per field name?)
+        // :TODO: synchronize to prevent redundant copying? (sync per field name?)
         private void FetchRealValues(string name, int fieldNum)
         {
             Document d = GetDocument();

src/Lucene.Net.QueryParser/Flexible/Standard/Parser/ParseException.cs

@@ -132,7 +132,7 @@ public override void GetObjectData(SerializationInfo info, StreamingContext cont
         /// <summary>
         /// This is the last token that has been consumed successfully.  If
         /// this object has been created due to a parse error, the token
-        /// followng this token will (therefore) be the first error token.
+        /// following this token will (therefore) be the first error token.
         /// </summary>
         public Token? CurrentToken { get; private set; }
 

src/Lucene.Net.Replicator/package.md

@@ -132,7 +132,7 @@ public class AspNetCoreReplicationResponse : IReplicationResponse
     }
 
     // Return a stream where the ReplicatorService can write to for the response.
-    // Depending on the action either the file or the sesssion token will be written to this stream.
+    // Depending on the action either the file or the session token will be written to this stream.
     public Stream Body => response.Body;
 
     // Called when the ReplicatorService is done writing data to the response.

src/Lucene.Net.Suggest/Suggest/Jaspell/JaspellTernarySearchTrie.cs

@@ -803,7 +803,7 @@ public virtual IList<string> MatchAlmost(string key, int numReturnValues)
         }
 
         /// <summary>
-        /// Recursivelly vists the nodes in order to find the ones that almost match a
+        /// Recursively visits the nodes in order to find the ones that almost match a
         /// given key.
         /// </summary>
         /// <param name="currentNode">
@@ -942,7 +942,7 @@ public virtual void Put(string key, object value)
         }
 
         /// <summary>
-        /// Recursivelly visists each node to calculate the number of nodes.
+        /// Recursively visits each node to calculate the number of nodes.
         /// </summary>
         /// <param name="currentNode">
         ///          The current node. </param>

src/Lucene.Net.TestFramework/Store/BaseDirectoryWrapper.cs

@@ -36,15 +36,15 @@ public class BaseDirectoryWrapper : FilterDirectory
         private const int True = 1;
         private const int False = 0;
 
-        // LUCENENET specific - using Interlocked intead of a volatile field for IsOpen.
+        // LUCENENET specific - using Interlocked instead of a volatile field for IsOpen.
         private int isOpen = True; // LUCENENET: Changed from bool to int so we can use Interlocked.
 
         /// <summary>
         /// Atomically sets the value to the given updated value
         /// if the current value <c>==</c> the expected value.
         /// <para/>
         /// Expert: Use this in the <see cref="Directory.Dispose(bool)"/> call to skip
-        /// duplicate calls by using the folling if block to guard the
+        /// duplicate calls by using the following if block to guard the
         /// dispose logic.
         /// <code>
         /// protected override void Dispose(bool disposing)

src/Lucene.Net.TestFramework/Support/Util/LuceneTestCase.Serialization.cs

@@ -27,7 +27,7 @@ public abstract partial class LuceneTestCase
 #pragma warning disable SYSLIB0011 // Type or member is obsolete (BinaryFormatter)
         /// <summary>
         /// Serializes <paramref name="source"/> using <see cref="BinaryFormatter"/>
-        /// and returns a <see cref="MemoryStream"/> with the result of the serialzation.
+        /// and returns a <see cref="MemoryStream"/> with the result of the serialization.
         /// This method is not meant to scale, it is only for quick serialization verification
         /// in tests.
         /// </summary>