You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@lucenenet.apache.org by cc...@apache.org on 2013/04/03 19:40:30 UTC
[47/51] [partial] Mass convert mixed tabs to spaces
http://git-wip-us.apache.org/repos/asf/lucenenet/blob/62f018ab/src/contrib/Regex/RegexQuery.cs
----------------------------------------------------------------------
diff --git a/src/contrib/Regex/RegexQuery.cs b/src/contrib/Regex/RegexQuery.cs
index 1516414..1dc452b 100644
--- a/src/contrib/Regex/RegexQuery.cs
+++ b/src/contrib/Regex/RegexQuery.cs
@@ -1,4 +1,4 @@
-/*
+/*
* 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.
@@ -23,34 +23,34 @@ using Lucene.Net.Util;
namespace Contrib.Regex
{
- /// <summary>
- /// Regular expression based query.
- /// </summary>
- /// <remarks>http://www.java2s.com/Open-Source/Java-Document/Net/lucene-connector/org/apache/lucene/search/regex/RegexQuery.java.htm</remarks>
- public class RegexQuery : MultiTermQuery, IRegexQueryCapable, IEquatable<RegexQuery>
- {
- private IRegexCapabilities _regexImpl = new CSharpRegexCapabilities();
- public Term Term { get; private set; }
+ /// <summary>
+ /// Regular expression based query.
+ /// </summary>
+ /// <remarks>http://www.java2s.com/Open-Source/Java-Document/Net/lucene-connector/org/apache/lucene/search/regex/RegexQuery.java.htm</remarks>
+ public class RegexQuery : MultiTermQuery, IRegexQueryCapable, IEquatable<RegexQuery>
+ {
+ private IRegexCapabilities _regexImpl = new CSharpRegexCapabilities();
+ public Term Term { get; private set; }
- public RegexQuery(Term term)
- {
+ public RegexQuery(Term term)
+ {
Term = term;
- }
+ }
- /// <summary>Construct the enumeration to be used, expanding the pattern term. </summary>
- protected override FilteredTermEnum GetEnum(IndexReader reader)
- {
- return new RegexTermEnum(reader, Term, _regexImpl);
- }
+ /// <summary>Construct the enumeration to be used, expanding the pattern term. </summary>
+ protected override FilteredTermEnum GetEnum(IndexReader reader)
+ {
+ return new RegexTermEnum(reader, Term, _regexImpl);
+ }
- public IRegexCapabilities RegexImplementation
- {
- set { _regexImpl = value; }
- get { return _regexImpl; }
- }
+ public IRegexCapabilities RegexImplementation
+ {
+ set { _regexImpl = value; }
+ get { return _regexImpl; }
+ }
- public override String ToString(String field)
+ public override String ToString(String field)
{
StringBuilder buffer = new StringBuilder();
if (!Term.Field.Equals(field))
@@ -63,33 +63,33 @@ namespace Contrib.Regex
return buffer.ToString();
}
- /// <summary>
- /// Indicates whether the current object is equal to another object of the same type.
- /// </summary>
- /// <returns>
- /// true if the current object is equal to the <paramref name="other"/> parameter; otherwise, false.
- /// </returns>
- /// <param name="other">An object to compare with this object</param>
- public bool Equals(RegexQuery other)
- {
- if (other == null) return false;
- if (this == other) return true;
+ /// <summary>
+ /// Indicates whether the current object is equal to another object of the same type.
+ /// </summary>
+ /// <returns>
+ /// true if the current object is equal to the <paramref name="other"/> parameter; otherwise, false.
+ /// </returns>
+ /// <param name="other">An object to compare with this object</param>
+ public bool Equals(RegexQuery other)
+ {
+ if (other == null) return false;
+ if (this == other) return true;
- if (!base.Equals(other)) return false;
- return _regexImpl.Equals(other._regexImpl);
- }
+ if (!base.Equals(other)) return false;
+ return _regexImpl.Equals(other._regexImpl);
+ }
- public override bool Equals(object obj)
- {
- if ((obj == null) || (obj as RegexQuery == null)) return false;
- if (this == obj) return true;
+ public override bool Equals(object obj)
+ {
+ if ((obj == null) || (obj as RegexQuery == null)) return false;
+ if (this == obj) return true;
- return Equals((RegexQuery) obj);
- }
+ return Equals((RegexQuery) obj);
+ }
- public override int GetHashCode()
- {
- return 29 * base.GetHashCode() + _regexImpl.GetHashCode();
- }
- }
+ public override int GetHashCode()
+ {
+ return 29 * base.GetHashCode() + _regexImpl.GetHashCode();
+ }
+ }
}
http://git-wip-us.apache.org/repos/asf/lucenenet/blob/62f018ab/src/contrib/Regex/RegexTermEnum.cs
----------------------------------------------------------------------
diff --git a/src/contrib/Regex/RegexTermEnum.cs b/src/contrib/Regex/RegexTermEnum.cs
index 3cf480e..50c0480 100644
--- a/src/contrib/Regex/RegexTermEnum.cs
+++ b/src/contrib/Regex/RegexTermEnum.cs
@@ -1,4 +1,4 @@
-/*
+/*
* 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.
@@ -20,65 +20,65 @@ using Lucene.Net.Search;
namespace Contrib.Regex
{
- /// <summary>
- /// Subclass of FilteredTermEnum for enumerating all terms that match the
- /// specified regular expression term using the specified regular expression
- /// implementation.
- /// <para>Term enumerations are always ordered by Term.compareTo(). Each term in
- /// the enumeration is greater than all that precede it.</para>
- /// </summary>
- /// <remarks>http://www.java2s.com/Open-Source/Java-Document/Net/lucene-connector/org/apache/lucene/search/regex/RegexTermEnum.java.htm</remarks>
- public class RegexTermEnum : FilteredTermEnum
- {
- private string _sField = "";
- private string _sPre = "";
- private bool _bEndEnum;
- private readonly IRegexCapabilities _regexImpl;
+ /// <summary>
+ /// Subclass of FilteredTermEnum for enumerating all terms that match the
+ /// specified regular expression term using the specified regular expression
+ /// implementation.
+ /// <para>Term enumerations are always ordered by Term.compareTo(). Each term in
+ /// the enumeration is greater than all that precede it.</para>
+ /// </summary>
+ /// <remarks>http://www.java2s.com/Open-Source/Java-Document/Net/lucene-connector/org/apache/lucene/search/regex/RegexTermEnum.java.htm</remarks>
+ public class RegexTermEnum : FilteredTermEnum
+ {
+ private string _sField = "";
+ private string _sPre = "";
+ private bool _bEndEnum;
+ private readonly IRegexCapabilities _regexImpl;
- public RegexTermEnum(IndexReader reader, Term term, IRegexCapabilities regexImpl)
- {
- _sField = term.Field;
- string sText = term.Text;
-
- _regexImpl = regexImpl;
+ public RegexTermEnum(IndexReader reader, Term term, IRegexCapabilities regexImpl)
+ {
+ _sField = term.Field;
+ string sText = term.Text;
+
+ _regexImpl = regexImpl;
- _regexImpl.Compile(sText);
+ _regexImpl.Compile(sText);
- _sPre = _regexImpl.Prefix() ?? "";
+ _sPre = _regexImpl.Prefix() ?? "";
- SetEnum(reader.Terms(new Term(term.Field, _sPre)));
- }
+ SetEnum(reader.Terms(new Term(term.Field, _sPre)));
+ }
- /// <summary>Equality compare on the term </summary>
- protected override bool TermCompare(Term term)
- {
- if (_sField == term.Field)
- {
- string sSearchText = term.Text;
- if (sSearchText.StartsWith(_sPre)) return _regexImpl.Match(sSearchText);
- } //eif
+ /// <summary>Equality compare on the term </summary>
+ protected override bool TermCompare(Term term)
+ {
+ if (_sField == term.Field)
+ {
+ string sSearchText = term.Text;
+ if (sSearchText.StartsWith(_sPre)) return _regexImpl.Match(sSearchText);
+ } //eif
- _bEndEnum = true;
- return false;
- }
+ _bEndEnum = true;
+ return false;
+ }
- /// <summary>Equality measure on the term </summary>
- public override float Difference()
- {
- // TODO: adjust difference based on distance of searchTerm.text() and term().text()
- return 1.0F;
- }
+ /// <summary>Equality measure on the term </summary>
+ public override float Difference()
+ {
+ // TODO: adjust difference based on distance of searchTerm.text() and term().text()
+ return 1.0F;
+ }
- /// <summary>Indicates the end of the enumeration has been reached </summary>
- public override bool EndEnum()
- {
- return _bEndEnum;
- }
+ /// <summary>Indicates the end of the enumeration has been reached </summary>
+ public override bool EndEnum()
+ {
+ return _bEndEnum;
+ }
- //public override void Close()
- //{
- // base.Close();
- // _sField = null;
- //}
- }
+ //public override void Close()
+ //{
+ // base.Close();
+ // _sField = null;
+ //}
+ }
}
http://git-wip-us.apache.org/repos/asf/lucenenet/blob/62f018ab/src/contrib/Regex/SpanRegexQuery.cs
----------------------------------------------------------------------
diff --git a/src/contrib/Regex/SpanRegexQuery.cs b/src/contrib/Regex/SpanRegexQuery.cs
index 45f04b8..8bde844 100644
--- a/src/contrib/Regex/SpanRegexQuery.cs
+++ b/src/contrib/Regex/SpanRegexQuery.cs
@@ -1,4 +1,4 @@
-/*
+/*
* 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.
@@ -25,131 +25,131 @@ using Lucene.Net.Util;
namespace Contrib.Regex
{
- /// <summary>
- /// A SpanQuery version of <see cref="RegexQuery"/> allowing regular expression queries to be nested
- /// within other SpanQuery subclasses.
- /// </summary>
- /// <remarks>http://www.java2s.com/Open-Source/Java-Document/Net/lucene-connector/org/apache/lucene/search/regex/SpanRegexQuery.java.htm</remarks>
- public class SpanRegexQuery : SpanQuery, IRegexQueryCapable, IEquatable<SpanRegexQuery>
- {
- private IRegexCapabilities _regexImpl = new CSharpRegexCapabilities();
- private readonly Term _term;
-
- public SpanRegexQuery(Term term)
- {
- _term = term;
- }
-
- public Term Term
- {
- get { return _term; }
- }
-
- public override string ToString(string field)
- {
- StringBuilder sb = new StringBuilder();
- sb.Append("SpanRegexQuery(");
- sb.Append(_term);
- sb.Append(')');
- sb.Append(ToStringUtils.Boost(Boost));
- return sb.ToString();
- }
-
- public override Query Rewrite(IndexReader reader)
- {
- RegexQuery orig = new RegexQuery(_term);
- orig.RegexImplementation = _regexImpl;
-
- // RegexQuery (via MultiTermQuery).Rewrite always returns a BooleanQuery
- orig.RewriteMethod = MultiTermQuery.SCORING_BOOLEAN_QUERY_REWRITE; //@@
- BooleanQuery bq = (BooleanQuery) orig.Rewrite(reader);
-
- BooleanClause[] clauses = bq.GetClauses();
- SpanQuery[] sqs = new SpanQuery[clauses.Length];
- for (int i = 0; i < clauses.Length; i++)
- {
- BooleanClause clause = clauses[i];
-
- // Clauses from RegexQuery.Rewrite are always TermQuery's
- TermQuery tq = (TermQuery) clause.Query;
-
- sqs[i] = new SpanTermQuery(tq.Term);
- sqs[i].Boost = tq.Boost;
- } //efor
-
- SpanOrQuery query = new SpanOrQuery(sqs);
- query.Boost = orig.Boost;
-
- return query;
- }
-
- /// <summary>Expert: Returns the matches for this query in an index. Used internally
- /// to search for spans.
- /// </summary>
- public override Lucene.Net.Search.Spans.Spans GetSpans(IndexReader reader)
- {
- throw new InvalidOperationException("Query should have been rewritten");
- }
-
- /// <summary>Returns the name of the field matched by this query.</summary>
- public override string Field
- {
+ /// <summary>
+ /// A SpanQuery version of <see cref="RegexQuery"/> allowing regular expression queries to be nested
+ /// within other SpanQuery subclasses.
+ /// </summary>
+ /// <remarks>http://www.java2s.com/Open-Source/Java-Document/Net/lucene-connector/org/apache/lucene/search/regex/SpanRegexQuery.java.htm</remarks>
+ public class SpanRegexQuery : SpanQuery, IRegexQueryCapable, IEquatable<SpanRegexQuery>
+ {
+ private IRegexCapabilities _regexImpl = new CSharpRegexCapabilities();
+ private readonly Term _term;
+
+ public SpanRegexQuery(Term term)
+ {
+ _term = term;
+ }
+
+ public Term Term
+ {
+ get { return _term; }
+ }
+
+ public override string ToString(string field)
+ {
+ StringBuilder sb = new StringBuilder();
+ sb.Append("SpanRegexQuery(");
+ sb.Append(_term);
+ sb.Append(')');
+ sb.Append(ToStringUtils.Boost(Boost));
+ return sb.ToString();
+ }
+
+ public override Query Rewrite(IndexReader reader)
+ {
+ RegexQuery orig = new RegexQuery(_term);
+ orig.RegexImplementation = _regexImpl;
+
+ // RegexQuery (via MultiTermQuery).Rewrite always returns a BooleanQuery
+ orig.RewriteMethod = MultiTermQuery.SCORING_BOOLEAN_QUERY_REWRITE; //@@
+ BooleanQuery bq = (BooleanQuery) orig.Rewrite(reader);
+
+ BooleanClause[] clauses = bq.GetClauses();
+ SpanQuery[] sqs = new SpanQuery[clauses.Length];
+ for (int i = 0; i < clauses.Length; i++)
+ {
+ BooleanClause clause = clauses[i];
+
+ // Clauses from RegexQuery.Rewrite are always TermQuery's
+ TermQuery tq = (TermQuery) clause.Query;
+
+ sqs[i] = new SpanTermQuery(tq.Term);
+ sqs[i].Boost = tq.Boost;
+ } //efor
+
+ SpanOrQuery query = new SpanOrQuery(sqs);
+ query.Boost = orig.Boost;
+
+ return query;
+ }
+
+ /// <summary>Expert: Returns the matches for this query in an index. Used internally
+ /// to search for spans.
+ /// </summary>
+ public override Lucene.Net.Search.Spans.Spans GetSpans(IndexReader reader)
+ {
+ throw new InvalidOperationException("Query should have been rewritten");
+ }
+
+ /// <summary>Returns the name of the field matched by this query.</summary>
+ public override string Field
+ {
get
{
return _term.Field;
}
- }
+ }
public ICollection<Term> GetTerms()
{
ICollection<Term> terms = new List<Term>(){_term};
- return terms;
+ return terms;
}
- public IRegexCapabilities RegexImplementation
- {
- set { _regexImpl = value; }
- get { return _regexImpl; }
- }
-
- /// <summary>
- /// Indicates whether the current object is equal to another object of the same type.
- /// </summary>
- /// <returns>
- /// true if the current object is equal to the <paramref name="other"/> parameter; otherwise, false.
- /// </returns>
- /// <param name="other">An object to compare with this object.
- /// </param>
- public bool Equals(SpanRegexQuery other)
- {
- if (other == null) return false;
- if (ReferenceEquals(this, other)) return true;
-
- if (!_regexImpl.Equals(other._regexImpl)) return false;
- if (!_term.Equals(other._term)) return false;
-
- return true;
- }
-
- /// <summary>
- /// True if this object equals the specified object.
- /// </summary>
- /// <param name="obj">object</param>
- /// <returns>true on equality</returns>
- public override bool Equals(object obj)
- {
- if (obj as SpanRegexQuery == null) return false;
-
- return Equals((SpanRegexQuery) obj);
- }
-
- /// <summary>
- /// Get hash code for this object.
- /// </summary>
- /// <returns>hash code</returns>
- public override int GetHashCode()
- {
- return 29 * _regexImpl.GetHashCode() + _term.GetHashCode();
- }
- }
+ public IRegexCapabilities RegexImplementation
+ {
+ set { _regexImpl = value; }
+ get { return _regexImpl; }
+ }
+
+ /// <summary>
+ /// Indicates whether the current object is equal to another object of the same type.
+ /// </summary>
+ /// <returns>
+ /// true if the current object is equal to the <paramref name="other"/> parameter; otherwise, false.
+ /// </returns>
+ /// <param name="other">An object to compare with this object.
+ /// </param>
+ public bool Equals(SpanRegexQuery other)
+ {
+ if (other == null) return false;
+ if (ReferenceEquals(this, other)) return true;
+
+ if (!_regexImpl.Equals(other._regexImpl)) return false;
+ if (!_term.Equals(other._term)) return false;
+
+ return true;
+ }
+
+ /// <summary>
+ /// True if this object equals the specified object.
+ /// </summary>
+ /// <param name="obj">object</param>
+ /// <returns>true on equality</returns>
+ public override bool Equals(object obj)
+ {
+ if (obj as SpanRegexQuery == null) return false;
+
+ return Equals((SpanRegexQuery) obj);
+ }
+
+ /// <summary>
+ /// Get hash code for this object.
+ /// </summary>
+ /// <returns>hash code</returns>
+ public override int GetHashCode()
+ {
+ return 29 * _regexImpl.GetHashCode() + _term.GetHashCode();
+ }
+ }
}
http://git-wip-us.apache.org/repos/asf/lucenenet/blob/62f018ab/src/contrib/SimpleFacetedSearch/Extensions.cs
----------------------------------------------------------------------
diff --git a/src/contrib/SimpleFacetedSearch/Extensions.cs b/src/contrib/SimpleFacetedSearch/Extensions.cs
index 1eb56ff..31bfd63 100644
--- a/src/contrib/SimpleFacetedSearch/Extensions.cs
+++ b/src/contrib/SimpleFacetedSearch/Extensions.cs
@@ -1,4 +1,4 @@
-/*
+/*
* 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.
http://git-wip-us.apache.org/repos/asf/lucenenet/blob/62f018ab/src/contrib/SimpleFacetedSearch/FacetName.cs
----------------------------------------------------------------------
diff --git a/src/contrib/SimpleFacetedSearch/FacetName.cs b/src/contrib/SimpleFacetedSearch/FacetName.cs
index 0d4038a..ea3f74a 100644
--- a/src/contrib/SimpleFacetedSearch/FacetName.cs
+++ b/src/contrib/SimpleFacetedSearch/FacetName.cs
@@ -1,4 +1,4 @@
-/*
+/*
* 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.
http://git-wip-us.apache.org/repos/asf/lucenenet/blob/62f018ab/src/contrib/SimpleFacetedSearch/FieldValuesBitSets.cs
----------------------------------------------------------------------
diff --git a/src/contrib/SimpleFacetedSearch/FieldValuesBitSets.cs b/src/contrib/SimpleFacetedSearch/FieldValuesBitSets.cs
index b32ce44..3c719f6 100644
--- a/src/contrib/SimpleFacetedSearch/FieldValuesBitSets.cs
+++ b/src/contrib/SimpleFacetedSearch/FieldValuesBitSets.cs
@@ -1,4 +1,4 @@
-/*
+/*
* 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.
http://git-wip-us.apache.org/repos/asf/lucenenet/blob/62f018ab/src/contrib/SimpleFacetedSearch/Hits.cs
----------------------------------------------------------------------
diff --git a/src/contrib/SimpleFacetedSearch/Hits.cs b/src/contrib/SimpleFacetedSearch/Hits.cs
index bc4490b..f5c3eb3 100644
--- a/src/contrib/SimpleFacetedSearch/Hits.cs
+++ b/src/contrib/SimpleFacetedSearch/Hits.cs
@@ -1,4 +1,4 @@
-/*
+/*
* 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.
http://git-wip-us.apache.org/repos/asf/lucenenet/blob/62f018ab/src/contrib/SimpleFacetedSearch/HitsPerFacet.cs
----------------------------------------------------------------------
diff --git a/src/contrib/SimpleFacetedSearch/HitsPerFacet.cs b/src/contrib/SimpleFacetedSearch/HitsPerFacet.cs
index 5678183..6c7c756 100644
--- a/src/contrib/SimpleFacetedSearch/HitsPerFacet.cs
+++ b/src/contrib/SimpleFacetedSearch/HitsPerFacet.cs
@@ -1,4 +1,4 @@
-/*
+/*
* 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.
http://git-wip-us.apache.org/repos/asf/lucenenet/blob/62f018ab/src/contrib/SimpleFacetedSearch/Properties/AssemblyInfo.cs
----------------------------------------------------------------------
diff --git a/src/contrib/SimpleFacetedSearch/Properties/AssemblyInfo.cs b/src/contrib/SimpleFacetedSearch/Properties/AssemblyInfo.cs
index ca1395b..54f888c 100644
--- a/src/contrib/SimpleFacetedSearch/Properties/AssemblyInfo.cs
+++ b/src/contrib/SimpleFacetedSearch/Properties/AssemblyInfo.cs
@@ -1,4 +1,4 @@
-/*
+/*
*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
http://git-wip-us.apache.org/repos/asf/lucenenet/blob/62f018ab/src/contrib/SimpleFacetedSearch/SimpleFacetedSearch.cs
----------------------------------------------------------------------
diff --git a/src/contrib/SimpleFacetedSearch/SimpleFacetedSearch.cs b/src/contrib/SimpleFacetedSearch/SimpleFacetedSearch.cs
index cab3a65..6a558f7 100644
--- a/src/contrib/SimpleFacetedSearch/SimpleFacetedSearch.cs
+++ b/src/contrib/SimpleFacetedSearch/SimpleFacetedSearch.cs
@@ -1,4 +1,4 @@
-/*
+/*
* 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.
http://git-wip-us.apache.org/repos/asf/lucenenet/blob/62f018ab/src/contrib/Snowball/Lucene.Net/Analysis/Snowball/SnowballFilter.cs
----------------------------------------------------------------------
diff --git a/src/contrib/Snowball/Lucene.Net/Analysis/Snowball/SnowballFilter.cs b/src/contrib/Snowball/Lucene.Net/Analysis/Snowball/SnowballFilter.cs
index aa273b5..e662c26 100644
--- a/src/contrib/Snowball/Lucene.Net/Analysis/Snowball/SnowballFilter.cs
+++ b/src/contrib/Snowball/Lucene.Net/Analysis/Snowball/SnowballFilter.cs
@@ -25,53 +25,53 @@ using SF.Snowball.Ext;
namespace Lucene.Net.Analysis.Snowball
{
-
- /// <summary>A filter that stems words using a Snowball-generated stemmer.
- ///
- /// Available stemmers are listed in <see cref="SF.Snowball.Ext"/>. The name of a
- /// stemmer is the part of the class name before "Stemmer", e.g., the stemmer in
- /// <see cref="EnglishStemmer"/> is named "English".
- /// </summary>
-
- public sealed class SnowballFilter : TokenFilter
- {
- private static readonly System.Object[] EMPTY_ARGS = new System.Object[0];
-
- private SnowballProgram stemmer;
- private ITermAttribute termAtt;
- //private System.Reflection.MethodInfo stemMethod;
+
+ /// <summary>A filter that stems words using a Snowball-generated stemmer.
+ ///
+ /// Available stemmers are listed in <see cref="SF.Snowball.Ext"/>. The name of a
+ /// stemmer is the part of the class name before "Stemmer", e.g., the stemmer in
+ /// <see cref="EnglishStemmer"/> is named "English".
+ /// </summary>
+
+ public sealed class SnowballFilter : TokenFilter
+ {
+ private static readonly System.Object[] EMPTY_ARGS = new System.Object[0];
+
+ private SnowballProgram stemmer;
+ private ITermAttribute termAtt;
+ //private System.Reflection.MethodInfo stemMethod;
- public SnowballFilter(TokenStream input, SnowballProgram stemmer)
+ public SnowballFilter(TokenStream input, SnowballProgram stemmer)
: base(input)
- {
- this.stemmer = stemmer;
+ {
+ this.stemmer = stemmer;
termAtt = AddAttribute<ITermAttribute>();
- }
+ }
- /// <summary>Construct the named stemming filter.
- ///
- /// </summary>
+ /// <summary>Construct the named stemming filter.
+ ///
+ /// </summary>
/// <param name="input">the input tokens to stem
- /// </param>
- /// <param name="name">the name of a stemmer
- /// </param>
- public SnowballFilter(TokenStream input, System.String name) : base(input)
- {
- try
- {
- System.Type stemClass = System.Type.GetType("SF.Snowball.Ext." + name + "Stemmer");
- stemmer = (SnowballProgram) System.Activator.CreateInstance(stemClass);
- }
- catch (System.Exception e)
- {
- throw new System.SystemException(e.ToString());
- }
- termAtt = AddAttribute<ITermAttribute>();
- }
-
- /// <summary>Returns the next input Token, after being stemmed </summary>
+ /// </param>
+ /// <param name="name">the name of a stemmer
+ /// </param>
+ public SnowballFilter(TokenStream input, System.String name) : base(input)
+ {
+ try
+ {
+ System.Type stemClass = System.Type.GetType("SF.Snowball.Ext." + name + "Stemmer");
+ stemmer = (SnowballProgram) System.Activator.CreateInstance(stemClass);
+ }
+ catch (System.Exception e)
+ {
+ throw new System.SystemException(e.ToString());
+ }
+ termAtt = AddAttribute<ITermAttribute>();
+ }
+
+ /// <summary>Returns the next input Token, after being stemmed </summary>
public sealed override bool IncrementToken()
- {
+ {
if (input.IncrementToken())
{
String originalTerm = termAtt.Term;
@@ -87,6 +87,6 @@ namespace Lucene.Net.Analysis.Snowball
{
return false;
}
- }
- }
+ }
+ }
}
\ No newline at end of file
http://git-wip-us.apache.org/repos/asf/lucenenet/blob/62f018ab/src/contrib/Snowball/SF/Snowball/Among.cs
----------------------------------------------------------------------
diff --git a/src/contrib/Snowball/SF/Snowball/Among.cs b/src/contrib/Snowball/SF/Snowball/Among.cs
index 62b4d75..57753c8 100644
--- a/src/contrib/Snowball/SF/Snowball/Among.cs
+++ b/src/contrib/Snowball/SF/Snowball/Among.cs
@@ -17,40 +17,40 @@
using System;
namespace SF.Snowball
{
-
- public class Among
- {
- public Among(System.String s, int substring_i, int result, System.String methodname, SnowballProgram methodobject)
- {
- this.s_size = s.Length;
- this.s = s;
- this.substring_i = substring_i;
- this.result = result;
- this.methodobject = methodobject;
- if (methodname.Length == 0)
- {
- this.method = null;
- }
- else
- {
- try
- {
- this.method = methodobject.GetType().GetMethod(methodname, System.Reflection.BindingFlags.Instance | System.Reflection.BindingFlags.NonPublic | System.Reflection.BindingFlags.Public | System.Reflection.BindingFlags.DeclaredOnly, null, new System.Type[0], null);
- }
- catch (System.MethodAccessException)
- {
- // FIXME - debug message
- this.method = null;
- }
- }
- }
-
- public int s_size; /* search string */
- public System.String s; /* search string */
- public int substring_i; /* index to longest matching substring */
- public int result; /* result of the lookup */
- public System.Reflection.MethodInfo method; /* method to use if substring matches */
- public SnowballProgram methodobject; /* object to invoke method on */
- }
-
+
+ public class Among
+ {
+ public Among(System.String s, int substring_i, int result, System.String methodname, SnowballProgram methodobject)
+ {
+ this.s_size = s.Length;
+ this.s = s;
+ this.substring_i = substring_i;
+ this.result = result;
+ this.methodobject = methodobject;
+ if (methodname.Length == 0)
+ {
+ this.method = null;
+ }
+ else
+ {
+ try
+ {
+ this.method = methodobject.GetType().GetMethod(methodname, System.Reflection.BindingFlags.Instance | System.Reflection.BindingFlags.NonPublic | System.Reflection.BindingFlags.Public | System.Reflection.BindingFlags.DeclaredOnly, null, new System.Type[0], null);
+ }
+ catch (System.MethodAccessException)
+ {
+ // FIXME - debug message
+ this.method = null;
+ }
+ }
+ }
+
+ public int s_size; /* search string */
+ public System.String s; /* search string */
+ public int substring_i; /* index to longest matching substring */
+ public int result; /* result of the lookup */
+ public System.Reflection.MethodInfo method; /* method to use if substring matches */
+ public SnowballProgram methodobject; /* object to invoke method on */
+ }
+
}
\ No newline at end of file
http://git-wip-us.apache.org/repos/asf/lucenenet/blob/62f018ab/src/contrib/Snowball/SF/Snowball/Ext/DanishStemmer.cs
----------------------------------------------------------------------
diff --git a/src/contrib/Snowball/SF/Snowball/Ext/DanishStemmer.cs b/src/contrib/Snowball/SF/Snowball/Ext/DanishStemmer.cs
index 5a1ea5d..b109bff 100644
--- a/src/contrib/Snowball/SF/Snowball/Ext/DanishStemmer.cs
+++ b/src/contrib/Snowball/SF/Snowball/Ext/DanishStemmer.cs
@@ -23,434 +23,434 @@ namespace SF.Snowball.Ext
{
#pragma warning disable 162,164
- /// <summary> Generated class implementing code defined by a snowball script.</summary>
- public class DanishStemmer : SnowballProgram
- {
- public DanishStemmer()
- {
- InitBlock();
- }
- private void InitBlock()
- {
+ /// <summary> Generated class implementing code defined by a snowball script.</summary>
+ public class DanishStemmer : SnowballProgram
+ {
+ public DanishStemmer()
+ {
+ InitBlock();
+ }
+ private void InitBlock()
+ {
a_0 = new Among[] { new Among("hed", -1, 1, "", this), new Among("ethed", 0, 1, "", this), new Among("ered", -1, 1, "", this), new Among("e", -1, 1, "", this), new Among("erede", 3, 1, "", this), new Among("ende", 3, 1, "", this), new Among("erende", 5, 1, "", this), new Among("ene", 3, 1, "", this), new Among("erne", 3, 1, "", this), new Among("ere", 3, 1, "", this), new Among("en", -1, 1, "", this), new Among("heden", 10, 1, "", this), new Among("eren", 10, 1, "", this), new Among("er", -1, 1, "", this), new Among("heder", 13, 1, "", this), new Among("erer", 13, 1, "", this), new Among("s", -1, 2, "", this), new Among("heds", 16, 1, "", this), new Among("es", 16, 1, "", this), new Among("endes", 18, 1, "", this), new Among("erendes", 19, 1, "", this), new Among("enes", 18, 1, "", this), new Among("ernes", 18, 1, "", this), new Among("eres", 18, 1, "", this), new Among("ens", 16, 1, "", this), new Among("hedens", 24, 1, "", this), new Among("erens", 24, 1, "", this), ne
w Among("ers", 16, 1, "", this), new Among("ets", 16, 1, "", this), new Among("erets", 28, 1, "", this), new Among("et", -1, 1, "", this), new Among("eret", 30, 1, "", this) };
- a_1 = new Among[]{new Among("gd", - 1, - 1, "", this), new Among("dt", - 1, - 1, "", this), new Among("gt", - 1, - 1, "", this), new Among("kt", - 1, - 1, "", this)};
- a_2 = new Among[]{new Among("ig", - 1, 1, "", this), new Among("lig", 0, 1, "", this), new Among("elig", 1, 1, "", this), new Among("els", - 1, 1, "", this), new Among("l\u00F8st", - 1, 2, "", this)};
- }
-
- private Among[] a_0;
-
- private Among[] a_1;
- private Among[] a_2;
- private static readonly char[] g_v = new char[]{(char) (17), (char) (65), (char) (16), (char) (1), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (48), (char) (0), (char) (128)};
- private static readonly char[] g_s_ending = new char[]{(char) (239), (char) (254), (char) (42), (char) (3), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (16)};
-
- private int I_p1;
- private System.Text.StringBuilder S_ch = new System.Text.StringBuilder();
-
- protected internal virtual void copy_from(DanishStemmer other)
- {
- I_p1 = other.I_p1;
- S_ch = other.S_ch;
- base.copy_from(other);
- }
-
- private bool r_mark_regions()
- {
- int v_1;
- // (, line 29
- I_p1 = limit;
- // goto, line 33
- while (true)
- {
- v_1 = cursor;
- do
- {
- if (!(in_grouping(g_v, 97, 248)))
- {
- goto lab1_brk;
- }
- cursor = v_1;
- goto golab0_brk;
- }
- while (false);
+ a_1 = new Among[]{new Among("gd", - 1, - 1, "", this), new Among("dt", - 1, - 1, "", this), new Among("gt", - 1, - 1, "", this), new Among("kt", - 1, - 1, "", this)};
+ a_2 = new Among[]{new Among("ig", - 1, 1, "", this), new Among("lig", 0, 1, "", this), new Among("elig", 1, 1, "", this), new Among("els", - 1, 1, "", this), new Among("l\u00F8st", - 1, 2, "", this)};
+ }
+
+ private Among[] a_0;
+
+ private Among[] a_1;
+ private Among[] a_2;
+ private static readonly char[] g_v = new char[]{(char) (17), (char) (65), (char) (16), (char) (1), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (48), (char) (0), (char) (128)};
+ private static readonly char[] g_s_ending = new char[]{(char) (239), (char) (254), (char) (42), (char) (3), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (0), (char) (16)};
+
+ private int I_p1;
+ private System.Text.StringBuilder S_ch = new System.Text.StringBuilder();
+
+ protected internal virtual void copy_from(DanishStemmer other)
+ {
+ I_p1 = other.I_p1;
+ S_ch = other.S_ch;
+ base.copy_from(other);
+ }
+
+ private bool r_mark_regions()
+ {
+ int v_1;
+ // (, line 29
+ I_p1 = limit;
+ // goto, line 33
+ while (true)
+ {
+ v_1 = cursor;
+ do
+ {
+ if (!(in_grouping(g_v, 97, 248)))
+ {
+ goto lab1_brk;
+ }
+ cursor = v_1;
+ goto golab0_brk;
+ }
+ while (false);
lab1_brk: ;
- cursor = v_1;
- if (cursor >= limit)
- {
- return false;
- }
- cursor++;
- }
+ cursor = v_1;
+ if (cursor >= limit)
+ {
+ return false;
+ }
+ cursor++;
+ }
golab0_brk: ;
- // gopast, line 33
- while (true)
- {
- do
- {
- if (!(out_grouping(g_v, 97, 248)))
- {
- goto lab3_brk;
- }
- goto golab2_brk;
- }
- while (false);
+ // gopast, line 33
+ while (true)
+ {
+ do
+ {
+ if (!(out_grouping(g_v, 97, 248)))
+ {
+ goto lab3_brk;
+ }
+ goto golab2_brk;
+ }
+ while (false);
lab3_brk: ;
- if (cursor >= limit)
- {
- return false;
- }
- cursor++;
- }
+ if (cursor >= limit)
+ {
+ return false;
+ }
+ cursor++;
+ }
golab2_brk: ;
- // setmark p1, line 33
- I_p1 = cursor;
- // try, line 34
- do
- {
- // (, line 34
- if (!(I_p1 < 3))
- {
- goto lab4_brk;
- }
- I_p1 = 3;
- }
- while (false);
+ // setmark p1, line 33
+ I_p1 = cursor;
+ // try, line 34
+ do
+ {
+ // (, line 34
+ if (!(I_p1 < 3))
+ {
+ goto lab4_brk;
+ }
+ I_p1 = 3;
+ }
+ while (false);
lab4_brk: ;
-
- return true;
- }
-
- private bool r_main_suffix()
- {
- int among_var;
- int v_1;
- int v_2;
- // (, line 39
- // setlimit, line 40
- v_1 = limit - cursor;
- // tomark, line 40
- if (cursor < I_p1)
- {
- return false;
- }
- cursor = I_p1;
- v_2 = limit_backward;
- limit_backward = cursor;
- cursor = limit - v_1;
- // (, line 40
- // [, line 40
- ket = cursor;
- // substring, line 40
- among_var = find_among_b(a_0, 32);
- if (among_var == 0)
- {
- limit_backward = v_2;
- return false;
- }
- // ], line 40
- bra = cursor;
- limit_backward = v_2;
- switch (among_var)
- {
-
- case 0:
- return false;
-
- case 1:
- // (, line 47
- // delete, line 47
- slice_del();
- break;
-
- case 2:
- // (, line 49
- if (!(in_grouping_b(g_s_ending, 97, 229)))
- {
- return false;
- }
- // delete, line 49
- slice_del();
- break;
- }
- return true;
- }
-
- private bool r_consonant_pair()
- {
- int v_1;
- int v_2;
- int v_3;
- // (, line 53
- // test, line 54
- v_1 = limit - cursor;
- // (, line 54
- // setlimit, line 55
- v_2 = limit - cursor;
- // tomark, line 55
- if (cursor < I_p1)
- {
- return false;
- }
- cursor = I_p1;
- v_3 = limit_backward;
- limit_backward = cursor;
- cursor = limit - v_2;
- // (, line 55
- // [, line 55
- ket = cursor;
- // substring, line 55
- if (find_among_b(a_1, 4) == 0)
- {
- limit_backward = v_3;
- return false;
- }
- // ], line 55
- bra = cursor;
- limit_backward = v_3;
- cursor = limit - v_1;
- // next, line 61
- if (cursor <= limit_backward)
- {
- return false;
- }
- cursor--;
- // ], line 61
- bra = cursor;
- // delete, line 61
- slice_del();
- return true;
- }
-
- private bool r_other_suffix()
- {
- int among_var;
- int v_1;
- int v_2;
- int v_3;
- int v_4;
- // (, line 64
- // do, line 65
- v_1 = limit - cursor;
- do
- {
- // (, line 65
- // [, line 65
- ket = cursor;
- // literal, line 65
- if (!(eq_s_b(2, "st")))
- {
- goto lab0_brk;
- }
- // ], line 65
- bra = cursor;
- // literal, line 65
- if (!(eq_s_b(2, "ig")))
- {
- goto lab0_brk;
- }
- // delete, line 65
- slice_del();
- }
- while (false);
+
+ return true;
+ }
+
+ private bool r_main_suffix()
+ {
+ int among_var;
+ int v_1;
+ int v_2;
+ // (, line 39
+ // setlimit, line 40
+ v_1 = limit - cursor;
+ // tomark, line 40
+ if (cursor < I_p1)
+ {
+ return false;
+ }
+ cursor = I_p1;
+ v_2 = limit_backward;
+ limit_backward = cursor;
+ cursor = limit - v_1;
+ // (, line 40
+ // [, line 40
+ ket = cursor;
+ // substring, line 40
+ among_var = find_among_b(a_0, 32);
+ if (among_var == 0)
+ {
+ limit_backward = v_2;
+ return false;
+ }
+ // ], line 40
+ bra = cursor;
+ limit_backward = v_2;
+ switch (among_var)
+ {
+
+ case 0:
+ return false;
+
+ case 1:
+ // (, line 47
+ // delete, line 47
+ slice_del();
+ break;
+
+ case 2:
+ // (, line 49
+ if (!(in_grouping_b(g_s_ending, 97, 229)))
+ {
+ return false;
+ }
+ // delete, line 49
+ slice_del();
+ break;
+ }
+ return true;
+ }
+
+ private bool r_consonant_pair()
+ {
+ int v_1;
+ int v_2;
+ int v_3;
+ // (, line 53
+ // test, line 54
+ v_1 = limit - cursor;
+ // (, line 54
+ // setlimit, line 55
+ v_2 = limit - cursor;
+ // tomark, line 55
+ if (cursor < I_p1)
+ {
+ return false;
+ }
+ cursor = I_p1;
+ v_3 = limit_backward;
+ limit_backward = cursor;
+ cursor = limit - v_2;
+ // (, line 55
+ // [, line 55
+ ket = cursor;
+ // substring, line 55
+ if (find_among_b(a_1, 4) == 0)
+ {
+ limit_backward = v_3;
+ return false;
+ }
+ // ], line 55
+ bra = cursor;
+ limit_backward = v_3;
+ cursor = limit - v_1;
+ // next, line 61
+ if (cursor <= limit_backward)
+ {
+ return false;
+ }
+ cursor--;
+ // ], line 61
+ bra = cursor;
+ // delete, line 61
+ slice_del();
+ return true;
+ }
+
+ private bool r_other_suffix()
+ {
+ int among_var;
+ int v_1;
+ int v_2;
+ int v_3;
+ int v_4;
+ // (, line 64
+ // do, line 65
+ v_1 = limit - cursor;
+ do
+ {
+ // (, line 65
+ // [, line 65
+ ket = cursor;
+ // literal, line 65
+ if (!(eq_s_b(2, "st")))
+ {
+ goto lab0_brk;
+ }
+ // ], line 65
+ bra = cursor;
+ // literal, line 65
+ if (!(eq_s_b(2, "ig")))
+ {
+ goto lab0_brk;
+ }
+ // delete, line 65
+ slice_del();
+ }
+ while (false);
lab0_brk: ;
- cursor = limit - v_1;
- // setlimit, line 66
- v_2 = limit - cursor;
- // tomark, line 66
- if (cursor < I_p1)
- {
- return false;
- }
- cursor = I_p1;
- v_3 = limit_backward;
- limit_backward = cursor;
- cursor = limit - v_2;
- // (, line 66
- // [, line 66
- ket = cursor;
- // substring, line 66
- among_var = find_among_b(a_2, 5);
- if (among_var == 0)
- {
- limit_backward = v_3;
- return false;
- }
- // ], line 66
- bra = cursor;
- limit_backward = v_3;
- switch (among_var)
- {
-
- case 0:
- return false;
-
- case 1:
- // (, line 69
- // delete, line 69
- slice_del();
- // do, line 69
- v_4 = limit - cursor;
- do
- {
- // call consonant_pair, line 69
- if (!r_consonant_pair())
- {
- goto lab1_brk;
- }
- }
- while (false);
+ cursor = limit - v_1;
+ // setlimit, line 66
+ v_2 = limit - cursor;
+ // tomark, line 66
+ if (cursor < I_p1)
+ {
+ return false;
+ }
+ cursor = I_p1;
+ v_3 = limit_backward;
+ limit_backward = cursor;
+ cursor = limit - v_2;
+ // (, line 66
+ // [, line 66
+ ket = cursor;
+ // substring, line 66
+ among_var = find_among_b(a_2, 5);
+ if (among_var == 0)
+ {
+ limit_backward = v_3;
+ return false;
+ }
+ // ], line 66
+ bra = cursor;
+ limit_backward = v_3;
+ switch (among_var)
+ {
+
+ case 0:
+ return false;
+
+ case 1:
+ // (, line 69
+ // delete, line 69
+ slice_del();
+ // do, line 69
+ v_4 = limit - cursor;
+ do
+ {
+ // call consonant_pair, line 69
+ if (!r_consonant_pair())
+ {
+ goto lab1_brk;
+ }
+ }
+ while (false);
lab1_brk: ;
- cursor = limit - v_4;
- break;
-
- case 2:
- // (, line 71
- // <-, line 71
- slice_from("l\u00F8s");
- break;
- }
- return true;
- }
-
- private bool r_undouble()
- {
- int v_1;
- int v_2;
- // (, line 74
- // setlimit, line 75
- v_1 = limit - cursor;
- // tomark, line 75
- if (cursor < I_p1)
- {
- return false;
- }
- cursor = I_p1;
- v_2 = limit_backward;
- limit_backward = cursor;
- cursor = limit - v_1;
- // (, line 75
- // [, line 75
- ket = cursor;
- if (!(out_grouping_b(g_v, 97, 248)))
- {
- limit_backward = v_2;
- return false;
- }
- // ], line 75
- bra = cursor;
- // -> ch, line 75
- S_ch = slice_to(S_ch);
- limit_backward = v_2;
- // name ch, line 76
- if (!(eq_v_b(S_ch)))
- {
- return false;
- }
- // delete, line 77
- slice_del();
- return true;
- }
-
- public override bool Stem()
- {
- int v_1;
- int v_2;
- int v_3;
- int v_4;
- int v_5;
- // (, line 81
- // do, line 83
- v_1 = cursor;
- do
- {
- // call mark_regions, line 83
- if (!r_mark_regions())
- {
- goto lab0_brk;
- }
- }
- while (false);
+ cursor = limit - v_4;
+ break;
+
+ case 2:
+ // (, line 71
+ // <-, line 71
+ slice_from("l\u00F8s");
+ break;
+ }
+ return true;
+ }
+
+ private bool r_undouble()
+ {
+ int v_1;
+ int v_2;
+ // (, line 74
+ // setlimit, line 75
+ v_1 = limit - cursor;
+ // tomark, line 75
+ if (cursor < I_p1)
+ {
+ return false;
+ }
+ cursor = I_p1;
+ v_2 = limit_backward;
+ limit_backward = cursor;
+ cursor = limit - v_1;
+ // (, line 75
+ // [, line 75
+ ket = cursor;
+ if (!(out_grouping_b(g_v, 97, 248)))
+ {
+ limit_backward = v_2;
+ return false;
+ }
+ // ], line 75
+ bra = cursor;
+ // -> ch, line 75
+ S_ch = slice_to(S_ch);
+ limit_backward = v_2;
+ // name ch, line 76
+ if (!(eq_v_b(S_ch)))
+ {
+ return false;
+ }
+ // delete, line 77
+ slice_del();
+ return true;
+ }
+
+ public override bool Stem()
+ {
+ int v_1;
+ int v_2;
+ int v_3;
+ int v_4;
+ int v_5;
+ // (, line 81
+ // do, line 83
+ v_1 = cursor;
+ do
+ {
+ // call mark_regions, line 83
+ if (!r_mark_regions())
+ {
+ goto lab0_brk;
+ }
+ }
+ while (false);
lab0_brk: ;
- cursor = v_1;
- // backwards, line 84
- limit_backward = cursor; cursor = limit;
- // (, line 84
- // do, line 85
- v_2 = limit - cursor;
- do
- {
- // call main_suffix, line 85
- if (!r_main_suffix())
- {
- goto lab1_brk;
- }
- }
- while (false);
+ cursor = v_1;
+ // backwards, line 84
+ limit_backward = cursor; cursor = limit;
+ // (, line 84
+ // do, line 85
+ v_2 = limit - cursor;
+ do
+ {
+ // call main_suffix, line 85
+ if (!r_main_suffix())
+ {
+ goto lab1_brk;
+ }
+ }
+ while (false);
lab1_brk: ;
-
- cursor = limit - v_2;
- // do, line 86
- v_3 = limit - cursor;
- do
- {
- // call consonant_pair, line 86
- if (!r_consonant_pair())
- {
- goto lab2_brk;
- }
- }
- while (false);
+
+ cursor = limit - v_2;
+ // do, line 86
+ v_3 = limit - cursor;
+ do
+ {
+ // call consonant_pair, line 86
+ if (!r_consonant_pair())
+ {
+ goto lab2_brk;
+ }
+ }
+ while (false);
lab2_brk: ;
- cursor = limit - v_3;
- // do, line 87
- v_4 = limit - cursor;
- do
- {
- // call other_suffix, line 87
- if (!r_other_suffix())
- {
- goto lab3_brk;
- }
- }
- while (false);
+ cursor = limit - v_3;
+ // do, line 87
+ v_4 = limit - cursor;
+ do
+ {
+ // call other_suffix, line 87
+ if (!r_other_suffix())
+ {
+ goto lab3_brk;
+ }
+ }
+ while (false);
lab3_brk: ;
- cursor = limit - v_4;
- // do, line 88
- v_5 = limit - cursor;
- do
- {
- // call undouble, line 88
- if (!r_undouble())
- {
- goto lab4_brk;
- }
- }
- while (false);
+ cursor = limit - v_4;
+ // do, line 88
+ v_5 = limit - cursor;
+ do
+ {
+ // call undouble, line 88
+ if (!r_undouble())
+ {
+ goto lab4_brk;
+ }
+ }
+ while (false);
lab4_brk: ;
- cursor = limit - v_5;
- cursor = limit_backward; return true;
- }
- }
+ cursor = limit - v_5;
+ cursor = limit_backward; return true;
+ }
+ }
}