Fix typos

General spelling clean up

Author: jbampton

.github/linters/codespell.txt

@@ -33,16 +33,13 @@ andd
 ane
 anothers
 appropropriate
-apprpriate
 aquire
 arent
-arguents
 assemblie
 ative
 atleast
 atmost
 autor
-avarage
 avove
 bale
 becaus
@@ -72,7 +69,6 @@ comparision
 compatability
 compatibity
 compatiblity
-completly
 concret
 confguration
 conjuction
@@ -95,12 +91,10 @@ cunt
 curren
 customizeable
 dalmation
-dcoumentation
 decalaration
 degrates
 deine
 deines
-delimter
 dependant
 despatch
 despatches
@@ -141,12 +135,10 @@ formes
 fount
 fpr
 fro
-fuctionality
 fulfilment
 gage
 gaurd
 gaus
-genereic
 ges
 gird
 glamourous
@@ -183,22 +175,19 @@ infact
 informations
 ingenuous
 inital
-initilize
 innaccuracy
 instace
 instaed
 intance
 intead
 interger
 interruted
-intialized
 isnt
 isse
 isses
 ist
 ists
 iterms
-itsself
 kake
 ket
 lama
@@ -218,7 +207,6 @@ maxosx
 maxumum
 ment
 meny
-metods
 meu
 meus
 millenium
@@ -236,7 +224,6 @@ nce
 nd
 ned
 nessesary
-niether
 nin
 noe
 noen

src/Lucene.Net.Benchmark/ByTask/Tasks/TaskSequence.cs

@@ -310,7 +310,7 @@ private int DoSerialTasksWithRate()
                     {
                         break;
                     }
-                    nextStartTime += delayStep; // this aims at avarage rate.
+                    nextStartTime += delayStep; // this aims at average rate.
                     try
                     {
                         int inc = task.RunAndMaybeStats(letChildReport);

src/Lucene.Net.Benchmark/Quality/Trec/QueryDriver.cs

@@ -108,7 +108,7 @@ public static void Main(string[] args)
             qrun.MaxResults = maxResults;
             QualityStats[] stats = qrun.Execute(judge, submitLog, logger);
 
-            // print an avarage sum of the results
+            // print an average sum of the results
             QualityStats avg = QualityStats.Average(stats);
             avg.Log("SUMMARY", 2, logger, "  ");
         }

src/Lucene.Net.Benchmark/Quality/package.md

@@ -67,7 +67,7 @@ Here is a sample code used to run the TREC 2006 queries 701-850 on the .Gov2 col
         SubmissionReport submitLog = null;
         QualityStats stats[] = qrun.execute(maxResults, judge, submitLog, logger);
 
-        // print an avarage sum of the results
+        // print an average sum of the results
         QualityStats avg = QualityStats.average(stats);
         avg.log("SUMMARY",2,logger, "  ");
 

src/Lucene.Net.Facet/Taxonomy/CategoryPath.cs

@@ -133,7 +133,7 @@ public virtual int FullPathLength
                 {
                     charsNeeded += Components[i].Length;
                 }
-                charsNeeded += Length - 1; // num delimter chars
+                charsNeeded += Length - 1; // num delimiter chars
                 return charsNeeded;
             }
         }

src/Lucene.Net.Facet/Taxonomy/Directory/DirectoryTaxonomyReader.cs

@@ -77,7 +77,7 @@ public Int32Class(int value)
         private readonly ReaderWriterLockSlim ordinalCacheLock = new ReaderWriterLockSlim(LockRecursionPolicy.NoRecursion);
         private readonly ReaderWriterLockSlim categoryCacheLock = new ReaderWriterLockSlim(LockRecursionPolicy.NoRecursion);
 
-        private /*volatile*/ TaxonomyIndexArrays taxoArrays; // LUCENENET specific: LazyInitalizer negates the need for volatile
+        private /*volatile*/ TaxonomyIndexArrays taxoArrays; // LUCENENET specific: LazyInitializer negates the need for volatile
         private bool isDisposed = false;
 
         /// <summary>

src/Lucene.Net.Facet/Taxonomy/Directory/TaxonomyIndexArrays.cs

@@ -43,7 +43,7 @@ internal class TaxonomyIndexArrays : ParallelTaxonomyArrays
     {
         private readonly int[] parents;
 
-        // the following two arrays are lazily intialized. note that we only keep a
+        // the following two arrays are lazily initialized. note that we only keep a
         // single boolean member as volatile, instead of declaring the arrays
         // volatile. the code guarantees that only after the boolean is set to true,
         // the arrays are returned.

src/Lucene.Net.TestFramework/Index/BasePostingsFormatTestCase.cs

@@ -799,7 +799,7 @@ private void VerifyEnum(ThreadState threadState,
 
             Assert.IsNotNull(docsEnum, "null DocsEnum");
             int initialDocID = docsEnum.DocID;
-            Assert.AreEqual(-1, initialDocID, "inital docID should be -1" + docsEnum);
+            Assert.AreEqual(-1, initialDocID, "initial docID should be -1" + docsEnum);
 
             if (Verbose)
             {

src/Lucene.Net.TestFramework/Support/Util/LuceneRandomSeedInitializer.cs

@@ -39,7 +39,7 @@ internal class LuceneRandomSeedInitializer
 
         /// <summary>
         /// Tries to get the random seed from either a <see cref="RandomSeedAttribute"/> or the "tests:seed" system property.
-        /// If niether of these exist, a random seed will be generated and this method returns <c>false</c>;
+        /// If neither of these exist, a random seed will be generated and this method returns <c>false</c>;
         /// </summary>
         /// <param name="test">The test fixture.</param>
         /// <param name="seed">The random seed for a new <see cref="Random"/> instance.
@@ -113,7 +113,7 @@ public RandomizedContext InitializeTestFixture(Test fixture, Assembly testAssemb
 
             random = new J2N.Randomizer(initialSeed + seedOffset);
 
-            int goodFastHashSeed = (int)initialSeed * 31; // LUCENENET: Multiplying 31 to remove the possility of a collision with the test framework while still using a deterministic number.
+            int goodFastHashSeed = (int)initialSeed * 31; // LUCENENET: Multiplying 31 to remove the possibility of a collision with the test framework while still using a deterministic number.
             if (StringHelper.goodFastHashSeed != goodFastHashSeed)
                 StringHelper.goodFastHashSeed = goodFastHashSeed;
 

src/Lucene.Net/Codecs/Lucene3x/TermInfosReaderIndex.cs

@@ -70,7 +70,7 @@ public TermInfosReaderIndex(SegmentTermEnum indexEnum, int indexDivisor, long ti
             this.totalIndexInterval = totalIndexInterval;
             indexSize = 1 + ((int)indexEnum.size - 1) / indexDivisor;
             skipInterval = indexEnum.skipInterval;
-            // this is only an inital size, it will be GCed once the build is complete
+            // this is only an initial size, it will be GCed once the build is complete
             long initialSize = (long)(tiiFileLength * 1.5) / indexDivisor;
             PagedBytes dataPagedBytes = new PagedBytes(EstimatePageBits(initialSize));
             PagedBytesDataOutput dataOutput = dataPagedBytes.GetDataOutput();