// ----------------------------------------------------------------------- // // // Licensed to the Apache Software Foundation (ASF) under one or more // contributor license agreements. See the NOTICE file distributed with // this work for additional information regarding copyright ownership. // The ASF licenses this file to You under the Apache License, Version 2.0 // (the "License"); you may not use this file except in compliance with // the License. You may obtain a copy of the License at // // http://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. // // // ----------------------------------------------------------------------- namespace Lucene.Net.Analysis.TokenAttributes { using System; using System.Diagnostics.CodeAnalysis; using Lucene.Net.Util; /// /// The determines the position of /// this token relative to the previous in a /// . This is used in phrase searching. /// /// /// /// Set the to Zero to put multiple terms /// in the same position. An example of this would be if a word has multiple /// stems. A Search for phrases that includes either stem will match. In /// this case, all but the first stem's should be /// set to zero. /// /// /// The increment of the first instance should be one. /// Repeating a token with an increment of zero can also be used /// to boost the scores of matches of that token /// /// /// Set the to values greater than one to in /// inhibit exact phrase matches. For example, if one does not want phrases to match /// across remove stop words, then one could build a stop word filter that removes stop /// words. It can also set the to the number of stop /// words remove before each non-stop word. Exact phrase queries will then only match /// when the terms occurs with no intervening stop words. /// /// /// [SuppressMessage("Microsoft.Naming", "CA1711:IdentifiersShouldNotHaveIncorrectSuffix", Justification = "The class was called Attribute in Java. It would be fun to call it Annotation. However, " + "its probably best to try to honor the correlating names when possible.")] public class PositionIncrementAttribute : AttributeBase, IPositionIncrementAttribute { private int positionIncrement = 1; /// /// Initializes a new instance of the class. /// public PositionIncrementAttribute() { } /// /// Initializes a new instance of the class. /// /// The position increment. public PositionIncrementAttribute(int positionIncrement) { this.PositionIncrement = positionIncrement; } /// /// Gets or sets the position increment. The default value is one. /// /// The position increment. The default value is one. /// Throws when the value being set is less than zero. public int PositionIncrement { get { return this.positionIncrement; } set { if (value < 0) throw new ArgumentOutOfRangeException( "value", "The position increment 'value' must be greater than 0."); this.positionIncrement = value; } } /// /// Clears the instance. /// public override void Clear() { this.positionIncrement = 1; } /// /// Copies this instance to the specified target. /// /// The attribute base. public override void CopyTo(AttributeBase attributeBase) { IPositionIncrementAttribute attribute = (IPositionIncrementAttribute)attributeBase; attribute.PositionIncrement = this.PositionIncrement; } /// /// Determines whether the specified is equal to this instance. /// /// The to compare with this instance. /// /// true if the specified is equal to this instance; otherwise, false. /// public override bool Equals(object obj) { if (obj == this) return true; PositionIncrementAttribute attribute = obj as PositionIncrementAttribute; return attribute != null && attribute.PositionIncrement == this.PositionIncrement; } /// /// Returns a hash code for this instance. /// /// /// A hash code for this instance, suitable for use in hashing algorithms and data structures like a hash table. /// public override int GetHashCode() { return this.PositionIncrement; } } }