Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion .build/psake/private/Test-ModuleVersion.ps1
Original file line number Diff line number Diff line change
Expand Up @@ -24,7 +24,7 @@
should be accepted.
.PARAMETER lessThanVersion
The upper bound of the version that will be accepted. This comparison should
be exlusive. Meaning an input version that is less than only, not equal to
be exclusive. Meaning an input version that is less than only, not equal to
this version, will be accepted.
.INPUTS
A $currentVersion of type [System.Version] or a convertable string.
Expand Down
27 changes: 0 additions & 27 deletions .github/linters/codespell.txt
Original file line number Diff line number Diff line change
Expand Up @@ -35,44 +35,31 @@ analyer
andd
ane
anothers
appraently
appropropriate
apprpriate
aquire
aquired
arbitarily
arent
arguents
assemblie
atempt
ative
atleast
atmost
attibute
attibutes
attirbute
autor
availble
avarage
avove
bale
becaus
begining
bellow
betweeen
betwen
beween
bloc
blockin
boostrap
brunch
bu
bufferin
calender
callibrate
cant
capela
captial
categorie
celle
celles
Expand Down Expand Up @@ -107,7 +94,6 @@ corelate
corespondent
correcty
corse
couldnt
countr
covert
cunt
Expand All @@ -133,35 +119,22 @@ doen
doens't
doesnt
dum
duplcate
ect
ede
elemnts
eles
elipses
elminate
embeded
empress
endcodes
ende
ened
entend
enviornment
equest
esnure
essentually
euclidian
everytime
exaclty
excepetion
exeception
execeptions
exlusive
exmaple
explicitely
explicity
explict
explictly
faild
failue
fallow
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -54,7 +54,7 @@
<!-- The hyphenation patterns, space separated. A pattern is made of 'equivalent'
characters as described before, between any two word characters a digit
in the range 0 to 9 may be specified. The absence of a digit is equivalent
to zero. The '.' character is reserved to indicate begining or ending
to zero. The '.' character is reserved to indicate beginning or ending
of words. -->
<!ELEMENT patterns (#PCDATA)>

Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -56,7 +56,7 @@ namespace Lucene.Net.Analysis.Core
/// <list type="bullet">
/// <item><description><c>wordset</c> - This is the default format, which supports one word per
/// line (including any intra-word whitespace) and allows whole line comments
/// begining with the "#" character. Blank lines are ignored. See
/// beginning with the "#" character. Blank lines are ignored. See
/// <see cref="WordlistLoader.GetLines"/> for details.
/// </description></item>
/// <item><description><c>snowball</c> - This format allows for multiple words specified on each
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -145,7 +145,7 @@ public override void Reset()
/// token is incremented.
/// </summary>
// LUCENENET NOTE: Intentionally made this a setter method instead of a property
// because it is obsolete and there is no way to add the attibute to the setter but not
// because it is obsolete and there is no way to add the attribute to the setter but not
// the getter of a property. Since it is obsolete, this method will eventually be removed
// anyway.
[Obsolete("enablePositionIncrements=false is not supported anymore as of Lucene 4.4")]
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -95,7 +95,7 @@ public interface IEntityResolver2 : IEntityResolver
/// other reasons adopt a "no DTDs" policy.
/// Non - validation motives include forcing documents to include DTDs so
/// that attributes are handled consistently.
/// For example, an XPath processor needs to know which attibutes have
/// For example, an XPath processor needs to know which attributes have
/// type "ID" before it can process a widely used type of reference.
/// <para/>
/// <strong> Warning:</strong> Returning an external subset modifies
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -121,7 +121,7 @@ public override void Write(Directory dir, SegmentInfo si, FieldInfos fis, IOCont
}
catch (Exception t) when (t.IsThrowable())
{
//Esnure we throw original exeception
//Ensure we throw original exception
}
}
else
Expand Down
2 changes: 1 addition & 1 deletion src/Lucene.Net.Facet/DrillSidewaysScorer.cs
Original file line number Diff line number Diff line change
Expand Up @@ -227,7 +227,7 @@ private void DoQueryFirstScoring(ICollector collector, DocIdSetIterator[] disis,

// TODO: for the "non-costly Bits" we really should
// have passed them down as acceptDocs, but
// unfortunately we cannot distinguish today betwen
// unfortunately we cannot distinguish today between
// "bits() is so costly that you should apply it last"
// from "bits() is so cheap that you should apply it
// everywhere down low"
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -90,7 +90,7 @@ public interface INameInt32CacheLru

}

// LUCENENET specific - defined interface so we can share public and internal members betwen cache
// LUCENENET specific - defined interface so we can share public and internal members between cache
// instances.
internal interface IInternalNameInt32CacheLru : INameInt32CacheLru
{
Expand Down
2 changes: 1 addition & 1 deletion src/Lucene.Net.Highlighter/Highlight/GradientFormatter.cs
Original file line number Diff line number Diff line change
Expand Up @@ -38,7 +38,7 @@ public class GradientFormatter : IFormatter
/// <summary> Sets the color range for the IDF scores</summary>
/// <param name="maxScore">
/// The score (and above) displayed as maxColor (See <see cref="QueryScorer.MaxTermWeight"/>
/// which can be used to callibrate scoring scale)
/// which can be used to calibrate scoring scale)
/// </param>
/// <param name="minForegroundColor">
/// The hex color used for representing IDF scores of zero eg
Expand Down
2 changes: 1 addition & 1 deletion src/Lucene.Net.Highlighter/Highlight/SimpleFragmenter.cs
Original file line number Diff line number Diff line change
Expand Up @@ -37,7 +37,7 @@ public SimpleFragmenter() : this(DEFAULT_FRAGMENT_SIZE) { }
public SimpleFragmenter(int fragmentSize)
{
// LUCENENET NOTE: Must not set the property directly
// in case the user decides to override it and produce an excepetion.
// in case the user decides to override it and produce an exception.
// Therefore, an auto-implemented property is unacceptable.
this.fragmentSize = fragmentSize;
}
Expand Down
2 changes: 1 addition & 1 deletion src/Lucene.Net.Replicator/Revision.cs
Original file line number Diff line number Diff line change
Expand Up @@ -28,7 +28,7 @@ namespace Lucene.Net.Replicator
/// revision will contain files from a single source. However, some applications
/// may require to treat a collection of indexes as a single entity so that the
/// files from all sources are replicated together, to guarantee consistency
/// beween them. For example, an application which indexes facets will need to
/// between them. For example, an application which indexes facets will need to
/// replicate both the search and taxonomy indexes together, to guarantee that
/// they match at the client side.
/// </summary>
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -542,7 +542,7 @@ public virtual IList<LookupResult> DoLookup(string key,
}

// Carefully fill last tokens with _ tokens;
// ShingleFilter appraently won't emit "only hole"
// ShingleFilter apparently won't emit "only hole"
// tokens:
int endPosInc = posIncAtt.PositionIncrement;

Expand Down
6 changes: 3 additions & 3 deletions src/Lucene.Net.TestFramework/Search/ShardSearchingTestBase.cs
Original file line number Diff line number Diff line change
Expand Up @@ -457,7 +457,7 @@ public override TopDocs Search(Query query, int numHits, CancellationToken cance
if (nodeID == MyNodeID)
{
// My node; run using local shard searcher we
// already aquired:
// already acquired:
shardHits[nodeID] = LocalSearch(query, numHits, cancellationToken);
}
else
Expand Down Expand Up @@ -521,7 +521,7 @@ public override TopDocs SearchAfter(ScoreDoc after, Query query, int numHits, Ca
if (nodeID == MyNodeID)
{
// My node; run using local shard searcher we
// already aquired:
// already acquired:
shardHits[nodeID] = LocalSearchAfter(shardAfter, query, numHits, cancellationToken);
}
else
Expand Down Expand Up @@ -549,7 +549,7 @@ public override TopFieldDocs Search(Query query, int numHits, Sort sort, Cancell
if (nodeID == MyNodeID)
{
// My node; run using local shard searcher we
// already aquired:
// already acquired:
shardHits[nodeID] = LocalSearch(query, numHits, sort, cancellationToken);
}
else
Expand Down
4 changes: 2 additions & 2 deletions src/Lucene.Net.TestFramework/Support/ApiScanTestBase.cs
Original file line number Diff line number Diff line change
Expand Up @@ -56,7 +56,7 @@ public abstract class ApiScanTestBase : LuceneTestCase
private static readonly Regex MethodParameterName = new Regex("^[a-z](?:[a-zA-Z0-9_]*[a-zA-Z0-9])?$", RegexOptions.Compiled);

/// <summary>
/// Interfaces must begin with "I" followed by another captial letter. Note this includes a
/// Interfaces must begin with "I" followed by another capital letter. Note this includes a
/// fix for generic interface names, that end with `{number}.
/// </summary>
private static readonly Regex InterfaceName = new Regex("^I[A-Z][a-zA-Z0-9_]*(?:`\\d+)?$", RegexOptions.Compiled);
Expand Down Expand Up @@ -201,7 +201,7 @@ public virtual void TestClassNames(Type typeFromTargetAssembly)

Assert.IsFalse(names.Any(), names.Count() + " invalid class names detected. " +
"Class names must be Pascal case, but may not follow the interface naming " +
"convention of captial 'I' followed by another capital letter.");
"convention of capital 'I' followed by another capital letter.");
}

//[Test, LuceneNetSpecific]
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -60,7 +60,7 @@ private static LuceneTestFrameworkInitializer Initialize(Test setUpFixture, Test

// Allow the factories to be instantiated first. We do this to allow a
// dependency injection step, which can only be done once. No random context
// is availble here because we need to load the SystemProperties setup here before
// is available here because we need to load the SystemProperties setup here before
// we can read them.
initializer.DoInitialize();

Expand Down
2 changes: 1 addition & 1 deletion src/Lucene.Net/Document/FieldType.cs
Original file line number Diff line number Diff line change
Expand Up @@ -320,7 +320,7 @@ public override sealed string ToString()
if (indexOptions != IndexOptions.DOCS_AND_FREQS_AND_POSITIONS)
{
result.Append(",indexOptions=");
// LUCENENET: duplcate what would happen if you print a null indexOptions in Java
// LUCENENET: duplicate what would happen if you print a null indexOptions in Java
result.Append(indexOptions != IndexOptions.NONE ? indexOptions.ToString() : string.Empty);
}
if (numericType != NumericType.NONE)
Expand Down
2 changes: 1 addition & 1 deletion src/Lucene.Net/Index/IndexWriter.cs
Original file line number Diff line number Diff line change
Expand Up @@ -2615,7 +2615,7 @@ private bool UpdatePendingMerges(MergeTrigger trigger, int maxNumSegments)
MergePolicy.MergeSpecification spec;
if (maxNumSegments != UNBOUNDED_MAX_MERGE_SEGMENTS)
{
if (Debugging.AssertsEnabled) Debugging.Assert(trigger == MergeTrigger.EXPLICIT || trigger == MergeTrigger.MERGE_FINISHED, "Expected EXPLICT or MERGE_FINISHED as trigger even with maxNumSegments set but was: {0}", trigger);
if (Debugging.AssertsEnabled) Debugging.Assert(trigger == MergeTrigger.EXPLICIT || trigger == MergeTrigger.MERGE_FINISHED, "Expected EXPLICIT or MERGE_FINISHED as trigger even with maxNumSegments set but was: {0}", trigger);
spec = mergePolicy.FindForcedMerges(segmentInfos, maxNumSegments, segmentsToMerge);
newMergesFound = spec != null;
if (newMergesFound)
Expand Down
2 changes: 1 addition & 1 deletion src/Lucene.Net/Search/Spans/SpanOrQuery.cs
Original file line number Diff line number Diff line change
Expand Up @@ -169,7 +169,7 @@ public override bool Equals(object o)

public override int GetHashCode()
{
//If this doesn't work, hash all elemnts together instead. This version was used to reduce time complexity
//If this doesn't work, hash all elements together instead. This version was used to reduce time complexity
int h = clauses.GetHashCode();
h ^= (h << 10) | (h >>> 23);
h ^= J2N.BitConversion.SingleToRawInt32Bits(Boost);
Expand Down
2 changes: 1 addition & 1 deletion src/Lucene.Net/Store/FSDirectory.cs
Original file line number Diff line number Diff line change
Expand Up @@ -498,7 +498,7 @@ public int ReadChunkSize
/// Writes output with <see cref="FileStream.Write(byte[], int, int)"/>
/// </summary>
// LUCENENET specific: Since FileStream does its own buffering, this class was refactored
// to do all checksum operations as well as writing to the FileStream. By doing this we elminate
// to do all checksum operations as well as writing to the FileStream. By doing this we eliminate
// the extra set of buffers that were only creating unnecessary memory allocations and copy operations.
protected class FSIndexOutput : BufferedIndexOutput
{
Expand Down
2 changes: 1 addition & 1 deletion src/Lucene.Net/Store/LockStressTest.cs
Original file line number Diff line number Diff line change
Expand Up @@ -70,7 +70,7 @@ public static void Main(string[] args)
// " verifierPort = port that LockVerifyServer is listening on\n" +
// " lockFactoryClassName = primary LockFactory class that we will use\n" +
// " lockDirName = path to the lock directory (only set for Simple/NativeFSLockFactory\n" +
// " sleepTimeMS = milliseconds to pause betweeen each lock obtain/release\n" +
// " sleepTimeMS = milliseconds to pause between each lock obtain/release\n" +
// " count = number of locking tries\n" +
// "\n" +
// "You should run multiple instances of this process, each with its own\n" +
Expand Down
2 changes: 1 addition & 1 deletion src/Lucene.Net/Store/SimpleFSLockFactory.cs
Original file line number Diff line number Diff line change
Expand Up @@ -149,7 +149,7 @@ public override bool Obtain()
catch (Exception e) // LUCENENET: Some of the exceptions that can happen are not IOException, so we catch everything
{
// On Windows, on concurrent createNewFile, the 2nd process gets "access denied".
// In that case, the lock was not aquired successfully, so return false.
// In that case, the lock was not acquired successfully, so return false.
// We record the failure reason here; the obtain with timeout (usually the
// one calling us) will use this as "root cause" if it fails to get the lock.
FailureReason = e;
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -43,7 +43,7 @@ namespace Lucene
/// may throw <see cref="TypeLoadException"/> if a static initializer fails, but usually returns <c>null</c> if
/// the type is not resolved. So, for compatibility the logic should be adjusted to treat <c>null</c> like a
/// <see cref="ClassNotFoundException"/> in Java. If the method is expected to throw <see cref="ClassNotFoundException"/>
/// when the type cannot be resolved, then we must explictly throw it when <see cref="Type.GetType(string)"/> returns <c>null</c>.
/// when the type cannot be resolved, then we must explicitly throw it when <see cref="Type.GetType(string)"/> returns <c>null</c>.
/// </summary>
// LUCENENET: It is no longer good practice to use binary serialization.
// See: https://github.com/dotnet/corefx/issues/23584#issuecomment-325724568
Expand Down
8 changes: 4 additions & 4 deletions src/Lucene.Net/Support/Threading/ReentrantLock.cs
Original file line number Diff line number Diff line change
Expand Up @@ -24,19 +24,19 @@ namespace Lucene.Net.Support.Threading

/// <summary>
/// A lock that uses an unfair locking strategy, similar to how it works in Java. This lock is unfair
/// in that it will aquire the lock even if there are any threads waiting on <see cref="Lock()"/>.
/// in that it will acquire the lock even if there are any threads waiting on <see cref="Lock()"/>.
/// <para/>
/// This implementation also does not use FIFO order when waiting on <see cref="Lock()"/>. Each queued thread will continue
/// to acquire the lock continually, but yield between each iteration. So, any waiting thread could be next to
/// aquire the lock. This differs from how it works in Java, but the overhead of fixing this behavior with a queue
/// acquire the lock. This differs from how it works in Java, but the overhead of fixing this behavior with a queue
/// is probably not worth the cost.
/// </summary>
internal class ReentrantLock
{
private readonly object _lock = new object();

/// <summary>
/// Tries to aquire the lock. If the lock is not available, the thread will block
/// Tries to acquire the lock. If the lock is not available, the thread will block
/// until it can obtain the lock.
/// <para/>
/// FIFO order is not respected on waiting locks. Also, threads that are waiting
Expand Down Expand Up @@ -79,7 +79,7 @@ public void Unlock()
}

/// <summary>
/// Tries to aquire the lock and immediately returns a boolean value indicating
/// Tries to acquire the lock and immediately returns a boolean value indicating
/// whether the lock was obtained.
/// <para/>
/// Threads that call <see cref="Lock()"/> and <see cref="TryLock()"/> are
Expand Down
Loading
Loading