Apache
/
lucene
mirror of https://github.com/apache/lucene.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

LUCENE-9925: add checksums to snowball-generated files (#80)

This commit is contained in:
Dawid Weiss 2021-04-13 08:59:31 +02:00 committed by GitHub
parent b23e261786
commit 0b1d8ccba6
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
46 changed files with 28733 additions and 30037 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

31
gradle/generation/snowball.gradle
View File

@ -17,6 +17,8 @@
import org.apache.tools.ant.taskdefs.condition.Os
def resources = scriptResources(buildscript)
apply plugin: "de.undercouch.download"
configure(project(":lucene:analysis:common")) {
@ -34,8 +36,8 @@ configure(project(":lucene:analysis:common")) {
snowballWebsiteDir = file("${snowballWorkDir}/website-${snowballWebsiteCommit}")
snowballDataDir = file("${snowballWorkDir}/data-${snowballDataCommit}")
snowballPatchFile = rootProject.file("gradle/generation/snowball.patch")
snowballScript = rootProject.file("gradle/generation/snowball.sh")
snowballPatchFile = file("${resources}/snowball.patch")
snowballScript = file("${resources}/snowball.sh")
}
def unpackFromZip = { zipFile, targetDir ->
@ -91,14 +93,31 @@ configure(project(":lucene:analysis:common")) {
// runs shell script to regenerate stemmers, base stemming subclasses, test data, and stopwords.
task snowball() {
description "Regenerates snowball stemmers."
description "Regenerate snowball stemmers."
group "generation"
inputs.files fileTree(
dir: "src/java/org/tartarus/snowball",
include: [
"Among.java",
"SnowballStemmer.java",
"SnowballProgram.java",
"ext/*Stemmer.java"
])
inputs.files fileTree(
dir: "src/resources/org/apache/lucene/analysis/snowball",
include: "*_stop.txt")
inputs.files fileTree(
dir: "src/test/org/apache/lucene/analysis/snowball",
include: "*.zip")
// Don't even bother adding dependencies on Windows.
if (Os.isFamily(Os.FAMILY_WINDOWS)) {
doFirst {
// Just emit a big fat error message but don't fail the build.
logger.error("Snowball generation does not work on Windows (patch and bash must be available).")
// Just emit a big fat error message. Fail the build so that checksums are not regenerated.
throw GradleException("Snowball generation does not work on Windows (patch and bash must be available).")
}
} else {
dependsOn downloadSnowballStemmers
@ -114,5 +133,5 @@ configure(project(":lucene:analysis:common")) {
}
}
regenerate.dependsOn mustRunInOrder([snowball, "spotlessApply"])
regenerate.dependsOn wrapWithPersistentChecksums(snowball, [ andThenTasks: "spotlessApply", ignoreWithSource: [downloadSnowballStemmers, downloadSnowballWebsite, downloadSnowballData] ])
}

0
gradle/generation/snowball.patch → gradle/generation/snowball/snowball.patch
View File

12
gradle/generation/snowball.sh → gradle/generation/snowball/snowball.sh Executable file → Normal file
View File

@ -30,16 +30,6 @@ test $# -eq 4
trap 'echo "*** BUILD FAILED ***" $BASH_SOURCE:$LINENO: error: "$BASH_COMMAND" returned $?' ERR
set -eEuo pipefail
# reformats file indentation to kill the crazy space/tabs mix.
# prevents early blindness !
function reformat_java() {
# convert tabs to 8 spaces, then reduce indent from 4 space to 2 space
target=$1
tmpfile=$(mktemp)
cat ${target} | perl -p -e 's/\t/ /g' | perl -p -e 's/ / /g' > ${tmpfile}
mv ${tmpfile} ${target}
}
# generate stuff with existing makefile, just 'make' will try to do crazy stuff with e.g. python
# and likely fail. so only ask for our specific target.
(cd ${SRCDIR} && chmod a+x libstemmer/mkalgorithms.pl && make dist_libstemmer_java)
@ -50,7 +40,6 @@ for file in "SnowballStemmer.java" "Among.java" "SnowballProgram.java"; do
cat ${SRCDIR}/COPYING >> ${DESTDIR}/${file}
echo "*/" >> ${DESTDIR}/${file}
cat ${SRCDIR}/java/org/tartarus/snowball/${file} >> ${DESTDIR}/${file}
reformat_java ${DESTDIR}/${file}
done
rm ${DESTDIR}/ext/*Stemmer.java
@ -67,7 +56,6 @@ for file in ${SRCDIR}/java/org/tartarus/snowball/ext/*.java; do
fi
echo ${newclazz} | sed -e 's/Stemmer//' >> ${TESTDSTDIR}/languages.txt
cat $file | sed "s/${oldclazz}/${newclazz}/g" > ${DESTDIR}/ext/${newclazz}.java
reformat_java ${DESTDIR}/ext/${newclazz}.java
done
# regenerate test data

3
gradle/validation/spotless.gradle
View File

@ -50,8 +50,7 @@ configure(project(":lucene").subprojects) { prj ->
case ":lucene:analysis:common":
targetExclude "**/HTMLStripCharFilter.java",
"**/UAX29URLEmailTokenizerImpl.java",
"**/tartarus/**"
"**/UAX29URLEmailTokenizerImpl.java"
break
case ":lucene:test-framework":

2
lucene/analysis/common/src/generated/checksums/generateTlds.json
View File

@ -1,4 +1,4 @@
{
"lucene/analysis/common/src/java/org/apache/lucene/analysis/email/ASCIITLD.jflex": "41ecfd19595aaf19fe2ddffd7dadb26202e98fae",
"lucene/analysis/common/src/java/org/apache/lucene/analysis/email/ASCIITLD.jflex": "521338e15fbd3fbdd2c1f8fd9c9fc365d4bcce9d",
"lucene/analysis/common/src/test/org/apache/lucene/analysis/email/TLDs.txt": "1c5a201efff431be1c62150aa6bd3dac0f3a21e2"
}

2
lucene/analysis/common/src/generated/checksums/generateUAX29URLEmailTokenizer.json
View File

@ -1,6 +1,6 @@
{
"gradle/generation/jflex/skeleton.disable.buffer.expansion.txt": "68263ff0a014904c6e89b040d868d8f399408908",
"lucene/analysis/common/src/java/org/apache/lucene/analysis/email/ASCIITLD.jflex": "41ecfd19595aaf19fe2ddffd7dadb26202e98fae",
"lucene/analysis/common/src/java/org/apache/lucene/analysis/email/ASCIITLD.jflex": "521338e15fbd3fbdd2c1f8fd9c9fc365d4bcce9d",
"lucene/analysis/common/src/java/org/apache/lucene/analysis/email/UAX29URLEmailTokenizerImpl.java": "e437900d9570ca007f9c02c9ea286222b644c329",
"lucene/analysis/common/src/java/org/apache/lucene/analysis/email/UAX29URLEmailTokenizerImpl.jflex": "56a751d27e481fb55388f91ebf34f5a0cb8cb1b2"
}

72
lucene/analysis/common/src/generated/checksums/snowball.json Normal file
View File

@ -0,0 +1,72 @@
{
"lucene/analysis/common/src/java/org/tartarus/snowball/Among.java": "5371973cc30637273366f042e1cff920e0dd14f6",
"lucene/analysis/common/src/java/org/tartarus/snowball/SnowballProgram.java": "4e1caa344c7ac864c467ff0e615c1343e911b06b",
"lucene/analysis/common/src/java/org/tartarus/snowball/SnowballStemmer.java": "85bfc728393d7804f86f0def0467a12fd4b82fd3",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/ArabicStemmer.java": "2d43c4606bbaf96d9ac5f8be8ccf28e32164b9f0",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/ArmenianStemmer.java": "0be0949fe1f021ef41e3f9a27280b295ab1e998c",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/BasqueStemmer.java": "79e0f8ef0e20aea2353ce582734c1e4f7c5b2525",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/CatalanStemmer.java": "6566c359074101543ed6dade5c663c0a17041c7c",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/DanishStemmer.java": "0dab70fd5d51c31c6e3903cf8576f9f498308eaf",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/DutchStemmer.java": "cc2f1f6ee58a86b940f77aa0fbabb9de12d7db6e",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/EnglishStemmer.java": "1670c34df4e2b828a7c3502538b884b8e9c8d288",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/EstonianStemmer.java": "8660e2e4e6c378e9734067faaec49da1048b8f11",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/FinnishStemmer.java": "1942477b1bbce53bcc40bc6a7304eeda48711644",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/FrenchStemmer.java": "dd6a1fdfab9ea51e243ec8c9b35b1ad5d6e545cf",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/German2Stemmer.java": "092be62a6d68e4ec939fc56b13fa4e2856aca4e4",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/GermanStemmer.java": "c44cb632b67b2c256b3bddc23edc3cabc36623b4",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/GreekStemmer.java": "95e2e5e2af36b98b5dbbc47f372134661005e462",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/HindiStemmer.java": "b32b64686f3f080850a47563d9c7031c6442febc",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/HungarianStemmer.java": "e45f89173aff28c0becf701970b4b566f92ef78b",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/IndonesianStemmer.java": "5c38af8170ef725834b7d3c21a384958982d5624",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/IrishStemmer.java": "b3aa9f634837724aa4768f928e077e222182e78f",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/ItalianStemmer.java": "b0645057fdabc0bfcfdfdbf5941d0c96533f2999",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/KpStemmer.java": "6d2cf90785d8d040fc85c1a7cc8326265763fd35",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/LithuanianStemmer.java": "d77f3d03b88e2ed84b0205e4d8509f5cbed281fe",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/LovinsStemmer.java": "afd063fc5269d5badf5a1bf050591ce5135434f0",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/NepaliStemmer.java": "2d0da317ec9b8f5342f9c5c7d9ab9b66a1e1d0f5",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/NorwegianStemmer.java": "b9eb10192b45b0e761493f468ff0fbc1e7692d1e",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/PorterStemmer.java": "71cc1e0c2907a3d270ffaf36ef779d7c7eec5049",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/PortugueseStemmer.java": "7b5e01a928c4b1f995bb75699ccf2c8cc3b6cbc2",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/RomanianStemmer.java": "548bab292d8736b898d36271985bf661adb30287",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/RussianStemmer.java": "adfe596a96fef236c52e496f4837d4cd201e2ba5",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/SerbianStemmer.java": "63ea4640ee9a3c392f8c92215b7f88248629fddc",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/SpanishStemmer.java": "8bd1a6545a72ac35d444b08cc79f3ec284064c4e",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/SwedishStemmer.java": "3f833fc609b1c89bcba59d39979aeebd545e60bf",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/TamilStemmer.java": "401bde8628e30ef58e2b6abeb33b8f15f01aff71",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/TurkishStemmer.java": "35723339314291774044d6f01d00a158584c0154",
"lucene/analysis/common/src/java/org/tartarus/snowball/ext/YiddishStemmer.java": "bbe4112b65d1d754cf84cf20c7424c3af5a0d6c8",
"lucene/analysis/common/src/resources/org/apache/lucene/analysis/snowball/danish_stop.txt": "f3627b9037da730534aa008b9edf32582c16866e",
"lucene/analysis/common/src/resources/org/apache/lucene/analysis/snowball/dutch_stop.txt": "3f84f1c2ae282bd1350fa246baaded095bebdecc",
"lucene/analysis/common/src/resources/org/apache/lucene/analysis/snowball/english_stop.txt": "5822d03de10b6403512774492508f586ea55a7c7",
"lucene/analysis/common/src/resources/org/apache/lucene/analysis/snowball/finnish_stop.txt": "f161b9b0e757fa4793272bb5d11fd0c0546f9129",
"lucene/analysis/common/src/resources/org/apache/lucene/analysis/snowball/french_stop.txt": "315826e66bd1f9ae294f5a1fc7738887706fc9e1",
"lucene/analysis/common/src/resources/org/apache/lucene/analysis/snowball/german_stop.txt": "301fa879d91631bc30169c12f4045f294aefd7ec",
"lucene/analysis/common/src/resources/org/apache/lucene/analysis/snowball/hungarian_stop.txt": "81837d5b861a876314b32fdaa2a4cee7c09fbbf8",
"lucene/analysis/common/src/resources/org/apache/lucene/analysis/snowball/indonesian_stop.txt": "b5e23c7a1b9893ed472bdbf27f952b9ace53d2d6",
"lucene/analysis/common/src/resources/org/apache/lucene/analysis/snowball/italian_stop.txt": "4df230f3d0f3898d9812b8d08c7b08bfc55477c3",
"lucene/analysis/common/src/resources/org/apache/lucene/analysis/snowball/norwegian_stop.txt": "b612f3c7df6d3f6fca1aff5d8d9e5c353df423cd",
"lucene/analysis/common/src/resources/org/apache/lucene/analysis/snowball/portuguese_stop.txt": "e7579ef190edfc939348353dca480d9cedae1d83",
"lucene/analysis/common/src/resources/org/apache/lucene/analysis/snowball/russian_stop.txt": "cbe87679fbabae13c8ea16be8a11fd78151f8bf7",
"lucene/analysis/common/src/resources/org/apache/lucene/analysis/snowball/spanish_stop.txt": "852c0b6520a1d2ac9d2ec189c296c2707b5060aa",
"lucene/analysis/common/src/resources/org/apache/lucene/analysis/snowball/swedish_stop.txt": "727b5244a67cab224865750451ae4e37139ee234",
"lucene/analysis/common/src/test/org/apache/lucene/analysis/snowball/danish.zip": "7b95a90a988efd38a37c9f088d4e5b24e8e680c2",
"lucene/analysis/common/src/test/org/apache/lucene/analysis/snowball/dutch.zip": "a49dbb48a736476322f1d6a35e919615d720cffb",
"lucene/analysis/common/src/test/org/apache/lucene/analysis/snowball/english.zip": "b679920d98fa209a97a0aac541090c6698045a10",
"lucene/analysis/common/src/test/org/apache/lucene/analysis/snowball/finnish.zip": "af5d28a55484999de4ce9311d6e274ff3836f7e7",
"lucene/analysis/common/src/test/org/apache/lucene/analysis/snowball/german.zip": "f193576f4e0070d860e7d6dbf71636e08d3cf94a",
"lucene/analysis/common/src/test/org/apache/lucene/analysis/snowball/german2.zip": "04334e3d91cda6d99ea64c55bfa39c6733d73795",
"lucene/analysis/common/src/test/org/apache/lucene/analysis/snowball/hungarian.zip": "f384349d496bbe3815595a589d6d3650a99b27db",
"lucene/analysis/common/src/test/org/apache/lucene/analysis/snowball/irish.zip": "d7cbb9f662cce8b6713eaf4ad1c049ec0b456336",
"lucene/analysis/common/src/test/org/apache/lucene/analysis/snowball/italian.zip": "b15d0f8a265e972fcca5ce03e98d8b2d8bf0390b",
"lucene/analysis/common/src/test/org/apache/lucene/analysis/snowball/kp.zip": "c2fab3651184017b9d6695fb1fe9520ca64a8ec2",
"lucene/analysis/common/src/test/org/apache/lucene/analysis/snowball/lovins.zip": "f688b976ab9bce24317569a10b12f020f81e5a24",
"lucene/analysis/common/src/test/org/apache/lucene/analysis/snowball/nepali.zip": "8f5f2cf7c82feaadbab327888d86bd427ba8295e",
"lucene/analysis/common/src/test/org/apache/lucene/analysis/snowball/norwegian.zip": "8c195ff5a6519c276e1beccb398264e8b16a82d5",
"lucene/analysis/common/src/test/org/apache/lucene/analysis/snowball/porter.zip": "3934b2050b646704a542893e34458e3bab045fa9",
"lucene/analysis/common/src/test/org/apache/lucene/analysis/snowball/portuguese.zip": "2a79e01a46a0ad4aff06af1b5b9bb431ebe4b835",
"lucene/analysis/common/src/test/org/apache/lucene/analysis/snowball/romanian.zip": "c4d3fe38d1ecec1eac5cec56d69cae724ae98550",
"lucene/analysis/common/src/test/org/apache/lucene/analysis/snowball/russian.zip": "d7c5ec3032f16fef0c875a285798a5fbbce446d0",
"lucene/analysis/common/src/test/org/apache/lucene/analysis/snowball/spanish.zip": "a5f815b75a44d2a9fdf709eb54f849c4e3abe7a8",
"lucene/analysis/common/src/test/org/apache/lucene/analysis/snowball/swedish.zip": "378eab85d54f95115c8c04266716f8479340ad7f",
"lucene/analysis/common/src/test/org/apache/lucene/analysis/snowball/turkish.zip": "a10af981f306bdbe39a2b00a6601773a319c4257"
}

2
lucene/analysis/common/src/java/org/apache/lucene/analysis/email/ASCIITLD.jflex
View File

@ -15,7 +15,7 @@
* limitations under the License.
*/
// Generated from IANA TLD Database <https://data.iana.org/TLD/tlds-alpha-by-domain.txt>
// file version from 2021 Apr 10, Sat 07:07:01 Coordinated Universal Time
// file version from 2021 Apr 12, Mon 07:07:01 Coordinated Universal Time
// generated by org.apache.lucene.analysis.standard.GenerateJflexTLDMacros
// LUCENE-8278: None of the TLDs in {ASCIITLD} is a 1-character-shorter prefix of another TLD

27
lucene/analysis/common/src/java/org/tartarus/snowball/Among.java
View File

@ -36,9 +36,7 @@ import java.lang.invoke.MethodHandles;
import java.lang.invoke.MethodType;
import java.util.Locale;
/**
* Internal class used by Snowball stemmers
*/
/** Internal class used by Snowball stemmers */
public class Among {
public Among(String s, int substring_i, int result) {
this.s = s.toCharArray();
@ -47,21 +45,27 @@ public class Among {
this.method = null;
}
public Among (String s, int substring_i, int result, String methodname,
MethodHandles.Lookup methodobject) {
public Among(
String s, int substring_i, int result, String methodname, MethodHandles.Lookup methodobject) {
this.s = s.toCharArray();
this.substring_i = substring_i;
this.result = result;
final Class<? extends SnowballProgram> clazz = methodobject.lookupClass().asSubclass(SnowballProgram.class);
final Class<? extends SnowballProgram> clazz =
methodobject.lookupClass().asSubclass(SnowballProgram.class);
if (methodname.length() > 0) {
try {
this.method = methodobject.findVirtual(clazz, methodname, MethodType.methodType(boolean.class))
this.method =
methodobject
.findVirtual(clazz, methodname, MethodType.methodType(boolean.class))
.asType(MethodType.methodType(boolean.class, SnowballProgram.class));
} catch (NoSuchMethodException | IllegalAccessException e) {
throw new RuntimeException(String.format(Locale.ENGLISH,
throw new RuntimeException(
String.format(
Locale.ENGLISH,
"Snowball program '%s' is broken, cannot access method: boolean %s()",
clazz.getSimpleName(), methodname
), e);
clazz.getSimpleName(),
methodname),
e);
}
} else {
this.method = null;
@ -74,4 +78,5 @@ public class Among {
// Make sure this is not accessible outside package for Java security reasons!
final MethodHandle method; /* method to use if substring matches */
};
}
;

115
lucene/analysis/common/src/java/org/tartarus/snowball/SnowballProgram.java
View File

@ -31,26 +31,21 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package org.tartarus.snowball;
import java.lang.reflect.UndeclaredThrowableException;
import java.io.Serializable;
/**
* Base class for a snowball stemmer
*/
import java.io.Serializable;
import java.lang.reflect.UndeclaredThrowableException;
/** Base class for a snowball stemmer */
public class SnowballProgram implements Serializable {
protected SnowballProgram()
{
protected SnowballProgram() {
current = new char[8];
setCurrent("");
}
static final long serialVersionUID = 2016072500L;
/**
* Set the current string.
*/
public void setCurrent(String value)
{
/** Set the current string. */
public void setCurrent(String value) {
current = value.toCharArray();
cursor = 0;
limit = value.length();
@ -59,16 +54,14 @@ public class SnowballProgram implements Serializable {
ket = limit;
}
/**
* Get the current string.
*/
public String getCurrent()
{
/** Get the current string. */
public String getCurrent() {
return new String(current, 0, limit);
}
/**
* Set the current string.
*
* @param text character array containing input
* @param length valid length of text.
*/
@ -83,16 +76,15 @@ public class SnowballProgram implements Serializable {
/**
* Get the current buffer containing the stem.
* <p>
* NOTE: this may be a reference to a different character array than the
* one originally provided with setCurrent, in the exceptional case that
* stemming produced a longer intermediate or result string.
* </p>
* <p>
* It is necessary to use {@link #getCurrentBufferLength()} to determine
* the valid length of the returned buffer. For example, many words are
* stemmed simply by subtracting from the length to remove suffixes.
* </p>
*
* <p>NOTE: this may be a reference to a different character array than the one originally
* provided with setCurrent, in the exceptional case that stemming produced a longer intermediate
* or result string.
*
* <p>It is necessary to use {@link #getCurrentBufferLength()} to determine the valid length of
* the returned buffer. For example, many words are stemmed simply by subtracting from the length
* to remove suffixes.
*
* @see #getCurrentBufferLength()
*/
public char[] getCurrentBuffer() {
@ -100,8 +92,8 @@ public class SnowballProgram implements Serializable {
}
/**
* Get the valid length of the character array in
* {@link #getCurrentBuffer()}.
* Get the valid length of the character array in {@link #getCurrentBuffer()}.
*
* @return valid length of the array.
*/
public int getCurrentBufferLength() {
@ -126,8 +118,7 @@ public class SnowballProgram implements Serializable {
ket = other.ket;
}
protected void copy_from(SnowballProgram other)
{
protected void copy_from(SnowballProgram other) {
current = other.current;
cursor = other.cursor;
limit = other.limit;
@ -136,8 +127,7 @@ public class SnowballProgram implements Serializable {
ket = other.ket;
}
protected boolean in_grouping(char [] s, int min, int max)
{
protected boolean in_grouping(char[] s, int min, int max) {
if (cursor >= limit) return false;
char ch = current[cursor];
if (ch > max || ch < min) return false;
@ -147,8 +137,7 @@ public class SnowballProgram implements Serializable {
return true;
}
protected boolean in_grouping_b(char [] s, int min, int max)
{
protected boolean in_grouping_b(char[] s, int min, int max) {
if (cursor <= limit_backward) return false;
char ch = current[cursor - 1];
if (ch > max || ch < min) return false;
@ -158,8 +147,7 @@ public class SnowballProgram implements Serializable {
return true;
}
protected boolean out_grouping(char [] s, int min, int max)
{
protected boolean out_grouping(char[] s, int min, int max) {
if (cursor >= limit) return false;
char ch = current[cursor];
if (ch > max || ch < min) {
@ -174,8 +162,7 @@ public class SnowballProgram implements Serializable {
return false;
}
protected boolean out_grouping_b(char [] s, int min, int max)
{
protected boolean out_grouping_b(char[] s, int min, int max) {
if (cursor <= limit_backward) return false;
char ch = current[cursor - 1];
if (ch > max || ch < min) {
@ -190,8 +177,7 @@ public class SnowballProgram implements Serializable {
return false;
}
protected boolean eq_s(CharSequence s)
{
protected boolean eq_s(CharSequence s) {
if (limit - cursor < s.length()) return false;
int i;
for (i = 0; i != s.length(); i++) {
@ -201,8 +187,7 @@ public class SnowballProgram implements Serializable {
return true;
}
protected boolean eq_s_b(CharSequence s)
{
protected boolean eq_s_b(CharSequence s) {
if (cursor - limit_backward < s.length()) return false;
int i;
for (i = 0; i != s.length(); i++) {
@ -212,8 +197,7 @@ public class SnowballProgram implements Serializable {
return true;
}
protected int find_among(Among v[])
{
protected int find_among(Among v[]) {
int i = 0;
int j = v.length;
@ -281,8 +265,7 @@ public class SnowballProgram implements Serializable {
}
// find_among_b is for backwards processing. Same comments apply
protected int find_among_b(Among v[])
{
protected int find_among_b(Among v[]) {
int i = 0;
int j = v.length;
@ -358,8 +341,7 @@ public class SnowballProgram implements Serializable {
/* to replace chars between c_bra and c_ket in current by the
* chars in s.
*/
protected int replace_s(int c_bra, int c_ket, CharSequence s)
{
protected int replace_s(int c_bra, int c_ket, CharSequence s) {
final int adjustment = s.length() - (c_ket - c_bra);
final int newLength = limit + adjustment;
// resize if necessary
@ -371,14 +353,12 @@ public class SnowballProgram implements Serializable {
// if the substring being replaced is longer or shorter than the
// replacement, need to shift things around
if (adjustment != 0 && c_ket < limit) {
System.arraycopy(current, c_ket, current, c_bra + s.length(),
limit - c_ket);
System.arraycopy(current, c_ket, current, c_bra + s.length(), limit - c_ket);
}
// insert the replacement text
// Note, faster is s.getChars(0, s.length(), current, c_bra);
// but would have to duplicate this method for both String and StringBuilder
for (int i = 0; i < s.length(); i++)
current[c_bra + i] = s.charAt(i);
for (int i = 0; i < s.length(); i++) current[c_bra + i] = s.charAt(i);
limit += adjustment;
if (cursor >= c_ket) cursor += adjustment;
@ -386,45 +366,37 @@ public class SnowballProgram implements Serializable {
return adjustment;
}
protected void slice_check()
{
if (bra < 0 ||
bra > ket ||
ket > limit)
{
throw new IllegalArgumentException("faulty slice operation: bra=" + bra + ",ket=" + ket + ",limit=" + limit);
protected void slice_check() {
if (bra < 0 || bra > ket || ket > limit) {
throw new IllegalArgumentException(
"faulty slice operation: bra=" + bra + ",ket=" + ket + ",limit=" + limit);
}
}
protected void slice_from(CharSequence s)
{
protected void slice_from(CharSequence s) {
slice_check();
replace_s(bra, ket, s);
}
protected void slice_del()
{
protected void slice_del() {
slice_from("");
}
protected void insert(int c_bra, int c_ket, CharSequence s)
{
protected void insert(int c_bra, int c_ket, CharSequence s) {
int adjustment = replace_s(c_bra, c_ket, s);
if (c_bra <= bra) bra += adjustment;
if (c_bra <= ket) ket += adjustment;
}
/* Copy the slice into the supplied StringBuilder */
protected void slice_to(StringBuilder s)
{
protected void slice_to(StringBuilder s) {
slice_check();
int len = ket - bra;
s.setLength(0);
s.append(current, bra, len);
}
protected void assign_to(StringBuilder s)
{
protected void assign_to(StringBuilder s) {
s.setLength(0);
s.append(current, 0, limit);
}
@ -451,4 +423,5 @@ extern void debug(struct SN_env * z, int number, int line_count)
}
*/
};
}
;

7
lucene/analysis/common/src/java/org/tartarus/snowball/SnowballStemmer.java
View File

@ -32,11 +32,10 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
package org.tartarus.snowball;
/**
* Parent class of all snowball stemmers, which must implement <code>stem</code>
*/
/** Parent class of all snowball stemmers, which must implement <code>stem</code> */
public abstract class SnowballStemmer extends SnowballProgram {
public abstract boolean stem();
static final long serialVersionUID = 2016072500L;
};
}
;

484
lucene/analysis/common/src/java/org/tartarus/snowball/ext/ArabicStemmer.java
View File

File diff suppressed because it is too large Load Diff

87
lucene/analysis/common/src/java/org/tartarus/snowball/ext/ArmenianStemmer.java
View File

@ -6,17 +6,17 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class ArmenianStemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
private static final Among a_0[] = {
new Among("\u0580\u0578\u0580\u0564", -1, 1),
new Among("\u0565\u0580\u0578\u0580\u0564", 0, 1),
new Among("\u0561\u056C\u056B", -1, 1),
@ -42,7 +42,7 @@ private final static Among a_0[] = {
new Among("\u0562\u0561\u0580", -1, 1)
};
private final static Among a_1[] = {
private static final Among a_1[] = {
new Among("\u0561", -1, 1),
new Among("\u0561\u0581\u0561", 0, 1),
new Among("\u0565\u0581\u0561", 0, 1),
@ -116,7 +116,7 @@ private final static Among a_1[] = {
new Among("\u057E\u0565\u0581\u056B\u0576\u0584", 69, 1)
};
private final static Among a_2[] = {
private static final Among a_2[] = {
new Among("\u0578\u0580\u0564", -1, 1),
new Among("\u0578\u0582\u0575\u0569", -1, 1),
new Among("\u0578\u0582\u0570\u056B", -1, 1),
@ -159,7 +159,7 @@ private final static Among a_2[] = {
new Among("\u0561\u0580\u0584", 27, 1)
};
private final static Among a_3[] = {
private static final Among a_3[] = {
new Among("\u057D\u0561", -1, 1),
new Among("\u057E\u0561", -1, 1),
new Among("\u0561\u0574\u0562", -1, 1),
@ -224,69 +224,65 @@ private static final char g_v[] = {209, 4, 128, 0, 18 };
private int I_p2;
private int I_pV;
private boolean r_mark_regions() {
I_pV = limit;
I_p2 = limit;
int v_1 = cursor;
lab0: {
golab1: while(true)
lab0:
{
lab2: {
if (!(in_grouping(g_v, 1377, 1413)))
golab1:
while (true) {
lab2:
{
if (!(in_grouping(g_v, 1377, 1413))) {
break lab2;
}
break golab1;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
}
I_pV = cursor;
golab3: while(true)
{
lab4: {
if (!(out_grouping(g_v, 1377, 1413)))
golab3:
while (true) {
lab4:
{
if (!(out_grouping(g_v, 1377, 1413))) {
break lab4;
}
break golab3;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
}
golab5: while(true)
{
lab6: {
if (!(in_grouping(g_v, 1377, 1413)))
golab5:
while (true) {
lab6:
{
if (!(in_grouping(g_v, 1377, 1413))) {
break lab6;
}
break golab5;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
}
golab7: while(true)
{
lab8: {
if (!(out_grouping(g_v, 1377, 1413)))
golab7:
while (true) {
lab8:
{
if (!(out_grouping(g_v, 1377, 1413))) {
break lab8;
}
break golab7;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -298,8 +294,7 @@ private boolean r_mark_regions() {
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
if (!(I_p2 <= cursor)) {
return false;
}
return true;
@ -307,8 +302,7 @@ private boolean r_R2() {
private boolean r_adjective() {
ket = cursor;
if (find_among_b(a_0) == 0)
{
if (find_among_b(a_0) == 0) {
return false;
}
bra = cursor;
@ -318,8 +312,7 @@ private boolean r_adjective() {
private boolean r_verb() {
ket = cursor;
if (find_among_b(a_1) == 0)
{
if (find_among_b(a_1) == 0) {
return false;
}
bra = cursor;
@ -329,8 +322,7 @@ private boolean r_verb() {
private boolean r_noun() {
ket = cursor;
if (find_among_b(a_2) == 0)
{
if (find_among_b(a_2) == 0) {
return false;
}
bra = cursor;
@ -340,13 +332,11 @@ private boolean r_noun() {
private boolean r_ending() {
ket = cursor;
if (find_among_b(a_3) == 0)
{
if (find_among_b(a_3) == 0) {
return false;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_del();
@ -358,8 +348,7 @@ public boolean stem() {
r_mark_regions();
limit_backward = cursor;
cursor = limit;
if (cursor < I_pV)
{
if (cursor < I_pV) {
return false;
}
int v_3 = limit_backward;
@ -390,8 +379,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return ArmenianStemmer.class.getName().hashCode();
}
}

189
lucene/analysis/common/src/java/org/tartarus/snowball/ext/BasqueStemmer.java
View File

@ -6,17 +6,17 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class BasqueStemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
private static final Among a_0[] = {
new Among("idea", -1, 1),
new Among("bidea", 0, 1),
new Among("kidea", 0, 1),
@ -128,7 +128,7 @@ private final static Among a_0[] = {
new Among("kaitz", -1, 1)
};
private final static Among a_1[] = {
private static final Among a_1[] = {
new Among("ada", -1, 1),
new Among("kada", 0, 1),
new Among("anda", -1, 1),
@ -426,7 +426,7 @@ private final static Among a_1[] = {
new Among("koitz", 293, 1)
};
private final static Among a_2[] = {
private static final Among a_2[] = {
new Among("zlea", -1, 2),
new Among("keria", -1, 1),
new Among("la", -1, 1),
@ -454,38 +454,39 @@ private int I_p2;
private int I_p1;
private int I_pV;
private boolean r_mark_regions() {
I_pV = limit;
I_p1 = limit;
I_p2 = limit;
int v_1 = cursor;
lab0: {
lab1: {
int v_2 = cursor;
lab2: {
if (!(in_grouping(g_v, 97, 117)))
lab0:
{
lab1:
{
int v_2 = cursor;
lab2:
{
if (!(in_grouping(g_v, 97, 117))) {
break lab2;
}
lab3: {
int v_3 = cursor;
lab4: {
if (!(out_grouping(g_v, 97, 117)))
lab3:
{
int v_3 = cursor;
lab4:
{
if (!(out_grouping(g_v, 97, 117))) {
break lab4;
}
golab5: while(true)
{
lab6: {
if (!(in_grouping(g_v, 97, 117)))
golab5:
while (true) {
lab6:
{
if (!(in_grouping(g_v, 97, 117))) {
break lab6;
}
break golab5;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab4;
}
cursor++;
@ -493,21 +494,19 @@ private boolean r_mark_regions() {
break lab3;
}
cursor = v_3;
if (!(in_grouping(g_v, 97, 117)))
{
if (!(in_grouping(g_v, 97, 117))) {
break lab2;
}
golab7: while(true)
{
lab8: {
if (!(out_grouping(g_v, 97, 117)))
golab7:
while (true) {
lab8:
{
if (!(out_grouping(g_v, 97, 117))) {
break lab8;
}
break golab7;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab2;
}
cursor++;
@ -516,28 +515,27 @@ private boolean r_mark_regions() {
break lab1;
}
cursor = v_2;
if (!(out_grouping(g_v, 97, 117)))
{
if (!(out_grouping(g_v, 97, 117))) {
break lab0;
}
lab9: {
int v_6 = cursor;
lab10: {
if (!(out_grouping(g_v, 97, 117)))
lab9:
{
int v_6 = cursor;
lab10:
{
if (!(out_grouping(g_v, 97, 117))) {
break lab10;
}
golab11: while(true)
{
lab12: {
if (!(in_grouping(g_v, 97, 117)))
golab11:
while (true) {
lab12:
{
if (!(in_grouping(g_v, 97, 117))) {
break lab12;
}
break golab11;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab10;
}
cursor++;
@ -545,12 +543,10 @@ private boolean r_mark_regions() {
break lab9;
}
cursor = v_6;
if (!(in_grouping(g_v, 97, 117)))
{
if (!(in_grouping(g_v, 97, 117))) {
break lab0;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -560,64 +556,61 @@ private boolean r_mark_regions() {
}
cursor = v_1;
int v_8 = cursor;
lab13: {
golab14: while(true)
lab13:
{
lab15: {
if (!(in_grouping(g_v, 97, 117)))
golab14:
while (true) {
lab15:
{
if (!(in_grouping(g_v, 97, 117))) {
break lab15;
}
break golab14;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab13;
}
cursor++;
}
golab16: while(true)
{
lab17: {
if (!(out_grouping(g_v, 97, 117)))
golab16:
while (true) {
lab17:
{
if (!(out_grouping(g_v, 97, 117))) {
break lab17;
}
break golab16;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab13;
}
cursor++;
}
I_p1 = cursor;
golab18: while(true)
{
lab19: {
if (!(in_grouping(g_v, 97, 117)))
golab18:
while (true) {
lab19:
{
if (!(in_grouping(g_v, 97, 117))) {
break lab19;
}
break golab18;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab13;
}
cursor++;
}
golab20: while(true)
{
lab21: {
if (!(out_grouping(g_v, 97, 117)))
golab20:
while (true) {
lab21:
{
if (!(out_grouping(g_v, 97, 117))) {
break lab21;
}
break golab20;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab13;
}
cursor++;
@ -629,24 +622,21 @@ private boolean r_mark_regions() {
}
private boolean r_RV() {
if (!(I_pV <= cursor))
{
if (!(I_pV <= cursor)) {
return false;
}
return true;
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
if (!(I_p2 <= cursor)) {
return false;
}
return true;
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
if (!(I_p1 <= cursor)) {
return false;
}
return true;
@ -656,22 +646,19 @@ private boolean r_aditzak() {
int among_var;
ket = cursor;
among_var = find_among_b(a_0);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
switch (among_var) {
case 1:
if (!r_RV())
{
if (!r_RV()) {
return false;
}
slice_del();
break;
case 2:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_del();
@ -693,22 +680,19 @@ private boolean r_izenak() {
int among_var;
ket = cursor;
among_var = find_among_b(a_1);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
switch (among_var) {
case 1:
if (!r_RV())
{
if (!r_RV()) {
return false;
}
slice_del();
break;
case 2:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_del();
@ -717,8 +701,7 @@ private boolean r_izenak() {
slice_from("jok");
break;
case 4:
if (!r_R1())
{
if (!r_R1()) {
return false;
}
slice_del();
@ -749,15 +732,13 @@ private boolean r_adjetiboak() {
int among_var;
ket = cursor;
among_var = find_among_b(a_2);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
switch (among_var) {
case 1:
if (!r_RV())
{
if (!r_RV()) {
return false;
}
slice_del();
@ -774,12 +755,11 @@ public boolean stem() {
r_mark_regions();
limit_backward = cursor;
cursor = limit;
while(true)
{
while (true) {
int v_2 = limit - cursor;
lab0: {
if (!r_aditzak())
lab0:
{
if (!r_aditzak()) {
break lab0;
}
continue;
@ -787,12 +767,11 @@ public boolean stem() {
cursor = limit - v_2;
break;
}
while(true)
{
while (true) {
int v_3 = limit - cursor;
lab1: {
if (!r_izenak())
lab1:
{
if (!r_izenak()) {
break lab1;
}
continue;
@ -816,8 +795,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return BasqueStemmer.class.getName().hashCode();
}
}

147
lucene/analysis/common/src/java/org/tartarus/snowball/ext/CatalanStemmer.java
View File

@ -6,17 +6,17 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class CatalanStemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
private static final Among a_0[] = {
new Among("", -1, 7),
new Among("\u00B7", 0, 6),
new Among("\u00E0", 0, 1),
@ -32,7 +32,7 @@ private final static Among a_0[] = {
new Among("\u00FC", 0, 5)
};
private final static Among a_1[] = {
private static final Among a_1[] = {
new Among("la", -1, 1),
new Among("-la", 0, 1),
new Among("sela", 0, 1),
@ -74,7 +74,7 @@ private final static Among a_1[] = {
new Among("'t", -1, 1)
};
private final static Among a_2[] = {
private static final Among a_2[] = {
new Among("ica", -1, 4),
new Among("l\u00F3gica", 0, 3),
new Among("enca", -1, 1),
@ -277,7 +277,7 @@ private final static Among a_2[] = {
new Among("aci\u00F3", 198, 1)
};
private final static Among a_3[] = {
private static final Among a_3[] = {
new Among("aba", -1, 1),
new Among("esca", -1, 1),
new Among("isca", -1, 1),
@ -563,7 +563,7 @@ private final static Among a_3[] = {
new Among("i\u00F3", -1, 1)
};
private final static Among a_4[] = {
private static final Among a_4[] = {
new Among("a", -1, 1),
new Among("e", -1, 1),
new Among("i", -1, 1),
@ -588,74 +588,72 @@ private final static Among a_4[] = {
new Among("\u00F3", -1, 1)
};
private static final char g_v[] = {17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128, 129, 81, 6, 10 };
private static final char g_v[] = {
17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128, 129, 81, 6, 10
};
private int I_p2;
private int I_p1;
private boolean r_mark_regions() {
I_p1 = limit;
I_p2 = limit;
int v_1 = cursor;
lab0: {
golab1: while(true)
lab0:
{
lab2: {
if (!(in_grouping(g_v, 97, 252)))
golab1:
while (true) {
lab2:
{
if (!(in_grouping(g_v, 97, 252))) {
break lab2;
}
break golab1;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
}
golab3: while(true)
{
lab4: {
if (!(out_grouping(g_v, 97, 252)))
golab3:
while (true) {
lab4:
{
if (!(out_grouping(g_v, 97, 252))) {
break lab4;
}
break golab3;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
}
I_p1 = cursor;
golab5: while(true)
{
lab6: {
if (!(in_grouping(g_v, 97, 252)))
golab5:
while (true) {
lab6:
{
if (!(in_grouping(g_v, 97, 252))) {
break lab6;
}
break golab5;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
}
golab7: while(true)
{
lab8: {
if (!(out_grouping(g_v, 97, 252)))
golab7:
while (true) {
lab8:
{
if (!(out_grouping(g_v, 97, 252))) {
break lab8;
}
break golab7;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -668,14 +666,13 @@ private boolean r_mark_regions() {
private boolean r_cleaning() {
int among_var;
while(true)
{
while (true) {
int v_1 = cursor;
lab0: {
lab0:
{
bra = cursor;
among_var = find_among(a_0);
if (among_var == 0)
{
if (among_var == 0) {
break lab0;
}
ket = cursor;
@ -699,8 +696,7 @@ private boolean r_cleaning() {
slice_from(".");
break;
case 7:
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -715,16 +711,14 @@ private boolean r_cleaning() {
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
if (!(I_p1 <= cursor)) {
return false;
}
return true;
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
if (!(I_p2 <= cursor)) {
return false;
}
return true;
@ -732,13 +726,11 @@ private boolean r_R2() {
private boolean r_attached_pronoun() {
ket = cursor;
if (find_among_b(a_1) == 0)
{
if (find_among_b(a_1) == 0) {
return false;
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
return false;
}
slice_del();
@ -749,43 +741,37 @@ private boolean r_standard_suffix() {
int among_var;
ket = cursor;
among_var = find_among_b(a_2);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
switch (among_var) {
case 1:
if (!r_R1())
{
if (!r_R1()) {
return false;
}
slice_del();
break;
case 2:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_del();
break;
case 3:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_from("log");
break;
case 4:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_from("ic");
break;
case 5:
if (!r_R1())
{
if (!r_R1()) {
return false;
}
slice_from("c");
@ -798,22 +784,19 @@ private boolean r_verb_suffix() {
int among_var;
ket = cursor;
among_var = find_among_b(a_3);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
switch (among_var) {
case 1:
if (!r_R1())
{
if (!r_R1()) {
return false;
}
slice_del();
break;
case 2:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_del();
@ -826,22 +809,19 @@ private boolean r_residual_suffix() {
int among_var;
ket = cursor;
among_var = find_among_b(a_4);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
switch (among_var) {
case 1:
if (!r_R1())
{
if (!r_R1()) {
return false;
}
slice_del();
break;
case 2:
if (!r_R1())
{
if (!r_R1()) {
return false;
}
slice_from("ic");
@ -859,19 +839,20 @@ public boolean stem() {
r_attached_pronoun();
cursor = limit - v_2;
int v_3 = limit - cursor;
lab0: {
lab1: {
int v_4 = limit - cursor;
lab2: {
if (!r_standard_suffix())
lab0:
{
lab1:
{
int v_4 = limit - cursor;
lab2:
{
if (!r_standard_suffix()) {
break lab2;
}
break lab1;
}
cursor = limit - v_4;
if (!r_verb_suffix())
{
if (!r_verb_suffix()) {
break lab0;
}
}
@ -896,8 +877,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return CatalanStemmer.class.getName().hashCode();
}
}

94
lucene/analysis/common/src/java/org/tartarus/snowball/ext/DanishStemmer.java
View File

@ -6,17 +6,17 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class DanishStemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
private static final Among a_0[] = {
new Among("hed", -1, 1),
new Among("ethed", 0, 1),
new Among("ered", -1, 1),
@ -51,14 +51,14 @@ private final static Among a_0[] = {
new Among("eret", 30, 1)
};
private final static Among a_1[] = {
private static final Among a_1[] = {
new Among("gd", -1, -1),
new Among("dt", -1, -1),
new Among("gt", -1, -1),
new Among("kt", -1, -1)
};
private final static Among a_2[] = {
private static final Among a_2[] = {
new Among("ig", -1, 1),
new Among("lig", 0, 1),
new Among("elig", 1, 1),
@ -70,63 +70,61 @@ private static final char g_c[] = {119, 223, 119, 1 };
private static final char g_v[] = {17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 48, 0, 128};
private static final char g_s_ending[] = {239, 254, 42, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16 };
private static final char g_s_ending[] = {
239, 254, 42, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16
};
private int I_x;
private int I_p1;
private java.lang.StringBuilder S_ch = new java.lang.StringBuilder();
private boolean r_mark_regions() {
I_p1 = limit;
int v_1 = cursor;
{
int c = cursor + 3;
if (0 > c || c > limit)
{
if (0 > c || c > limit) {
return false;
}
cursor = c;
}
I_x = cursor;
cursor = v_1;
golab0: while(true)
{
golab0:
while (true) {
int v_2 = cursor;
lab1: {
if (!(in_grouping(g_v, 97, 248)))
lab1:
{
if (!(in_grouping(g_v, 97, 248))) {
break lab1;
}
cursor = v_2;
break golab0;
}
cursor = v_2;
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
}
golab2: while(true)
{
lab3: {
if (!(out_grouping(g_v, 97, 248)))
golab2:
while (true) {
lab3:
{
if (!(out_grouping(g_v, 97, 248))) {
break lab3;
}
break golab2;
}
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
}
I_p1 = cursor;
lab4: {
if (!(I_p1 < I_x))
lab4:
{
if (!(I_p1 < I_x)) {
break lab4;
}
I_p1 = I_x;
@ -136,16 +134,14 @@ private boolean r_mark_regions() {
private boolean r_main_suffix() {
int among_var;
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_p1;
ket = cursor;
among_var = find_among_b(a_0);
if (among_var == 0)
{
if (among_var == 0) {
limit_backward = v_2;
return false;
}
@ -156,8 +152,7 @@ private boolean r_main_suffix() {
slice_del();
break;
case 2:
if (!(in_grouping_b(g_s_ending, 97, 229)))
{
if (!(in_grouping_b(g_s_ending, 97, 229))) {
return false;
}
slice_del();
@ -168,23 +163,20 @@ private boolean r_main_suffix() {
private boolean r_consonant_pair() {
int v_1 = limit - cursor;
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_3 = limit_backward;
limit_backward = I_p1;
ket = cursor;
if (find_among_b(a_1) == 0)
{
if (find_among_b(a_1) == 0) {
limit_backward = v_3;
return false;
}
bra = cursor;
limit_backward = v_3;
cursor = limit - v_1;
if (cursor <= limit_backward)
{
if (cursor <= limit_backward) {
return false;
}
cursor--;
@ -196,30 +188,27 @@ private boolean r_consonant_pair() {
private boolean r_other_suffix() {
int among_var;
int v_1 = limit - cursor;
lab0: {
ket = cursor;
if (!(eq_s_b("st")))
lab0:
{
ket = cursor;
if (!(eq_s_b("st"))) {
break lab0;
}
bra = cursor;
if (!(eq_s_b("ig")))
{
if (!(eq_s_b("ig"))) {
break lab0;
}
slice_del();
}
cursor = limit - v_1;
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_3 = limit_backward;
limit_backward = I_p1;
ket = cursor;
among_var = find_among_b(a_2);
if (among_var == 0)
{
if (among_var == 0) {
limit_backward = v_3;
return false;
}
@ -240,23 +229,20 @@ private boolean r_other_suffix() {
}
private boolean r_undouble() {
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_p1;
ket = cursor;
if (!(in_grouping_b(g_c, 98, 122)))
{
if (!(in_grouping_b(g_c, 98, 122))) {
limit_backward = v_2;
return false;
}
bra = cursor;
slice_to(S_ch);
limit_backward = v_2;
if (!(eq_s_b(S_ch)))
{
if (!(eq_s_b(S_ch))) {
return false;
}
slice_del();
@ -295,8 +281,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return DanishStemmer.class.getName().hashCode();
}
}

284
lucene/analysis/common/src/java/org/tartarus/snowball/ext/DutchStemmer.java
View File

@ -6,17 +6,17 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class DutchStemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
private static final Among a_0[] = {
new Among("", -1, 6),
new Among("\u00E1", 0, 1),
new Among("\u00E4", 0, 1),
@ -30,19 +30,15 @@ private final static Among a_0[] = {
new Among("\u00FC", 0, 5)
};
private final static Among a_1[] = {
new Among("", -1, 3),
new Among("I", 0, 2),
new Among("Y", 0, 1)
private static final Among a_1[] = {
new Among("", -1, 3), new Among("I", 0, 2), new Among("Y", 0, 1)
};
private final static Among a_2[] = {
new Among("dd", -1, -1),
new Among("kk", -1, -1),
new Among("tt", -1, -1)
private static final Among a_2[] = {
new Among("dd", -1, -1), new Among("kk", -1, -1), new Among("tt", -1, -1)
};
private final static Among a_3[] = {
private static final Among a_3[] = {
new Among("ene", -1, 2),
new Among("se", -1, 3),
new Among("en", -1, 2),
@ -50,7 +46,7 @@ private final static Among a_3[] = {
new Among("s", -1, 3)
};
private final static Among a_4[] = {
private static final Among a_4[] = {
new Among("end", -1, 1),
new Among("ig", -1, 2),
new Among("ing", -1, 1),
@ -59,7 +55,7 @@ private final static Among a_4[] = {
new Among("bar", -1, 5)
};
private final static Among a_5[] = {
private static final Among a_5[] = {
new Among("aa", -1, -1),
new Among("ee", -1, -1),
new Among("oo", -1, -1),
@ -68,7 +64,9 @@ private final static Among a_5[] = {
private static final char g_v[] = {17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128};
private static final char g_v_I[] = {1, 0, 0, 17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128 };
private static final char g_v_I[] = {
1, 0, 0, 17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128
};
private static final char g_v_j[] = {17, 67, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128};
@ -76,18 +74,16 @@ private int I_p2;
private int I_p1;
private boolean B_e_found;
private boolean r_prelude() {
int among_var;
int v_1 = cursor;
while(true)
{
while (true) {
int v_2 = cursor;
lab0: {
lab0:
{
bra = cursor;
among_var = find_among(a_0);
if (among_var == 0)
{
if (among_var == 0) {
break lab0;
}
ket = cursor;
@ -108,8 +104,7 @@ private boolean r_prelude() {
slice_from("u");
break;
case 6:
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -122,47 +117,46 @@ private boolean r_prelude() {
}
cursor = v_1;
int v_3 = cursor;
lab1: {
bra = cursor;
if (!(eq_s("y")))
lab1:
{
bra = cursor;
if (!(eq_s("y"))) {
cursor = v_3;
break lab1;
}
ket = cursor;
slice_from("Y");
}
while(true)
{
while (true) {
int v_4 = cursor;
lab2: {
golab3: while(true)
lab2:
{
golab3:
while (true) {
int v_5 = cursor;
lab4: {
if (!(in_grouping(g_v, 97, 232)))
lab4:
{
if (!(in_grouping(g_v, 97, 232))) {
break lab4;
}
bra = cursor;
lab5: {
int v_6 = cursor;
lab6: {
if (!(eq_s("i")))
lab5:
{
int v_6 = cursor;
lab6:
{
if (!(eq_s("i"))) {
break lab6;
}
ket = cursor;
if (!(in_grouping(g_v, 97, 232)))
{
if (!(in_grouping(g_v, 97, 232))) {
break lab6;
}
slice_from("I");
break lab5;
}
cursor = v_6;
if (!(eq_s("y")))
{
if (!(eq_s("y"))) {
break lab4;
}
ket = cursor;
@ -172,8 +166,7 @@ private boolean r_prelude() {
break golab3;
}
cursor = v_5;
if (cursor >= limit)
{
if (cursor >= limit) {
break lab2;
}
cursor++;
@ -189,70 +182,66 @@ private boolean r_prelude() {
private boolean r_mark_regions() {
I_p1 = limit;
I_p2 = limit;
golab0: while(true)
{
lab1: {
if (!(in_grouping(g_v, 97, 232)))
golab0:
while (true) {
lab1:
{
if (!(in_grouping(g_v, 97, 232))) {
break lab1;
}
break golab0;
}
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
}
golab2: while(true)
{
lab3: {
if (!(out_grouping(g_v, 97, 232)))
golab2:
while (true) {
lab3:
{
if (!(out_grouping(g_v, 97, 232))) {
break lab3;
}
break golab2;
}
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
}
I_p1 = cursor;
lab4: {
if (!(I_p1 < 3))
lab4:
{
if (!(I_p1 < 3)) {
break lab4;
}
I_p1 = 3;
}
golab5: while(true)
{
lab6: {
if (!(in_grouping(g_v, 97, 232)))
golab5:
while (true) {
lab6:
{
if (!(in_grouping(g_v, 97, 232))) {
break lab6;
}
break golab5;
}
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
}
golab7: while(true)
{
lab8: {
if (!(out_grouping(g_v, 97, 232)))
golab7:
while (true) {
lab8:
{
if (!(out_grouping(g_v, 97, 232))) {
break lab8;
}
break golab7;
}
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
@ -263,14 +252,13 @@ private boolean r_mark_regions() {
private boolean r_postlude() {
int among_var;
while(true)
{
while (true) {
int v_1 = cursor;
lab0: {
lab0:
{
bra = cursor;
among_var = find_among(a_1);
if (among_var == 0)
{
if (among_var == 0) {
break lab0;
}
ket = cursor;
@ -282,8 +270,7 @@ private boolean r_postlude() {
slice_from("i");
break;
case 3:
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -298,16 +285,14 @@ private boolean r_postlude() {
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
if (!(I_p1 <= cursor)) {
return false;
}
return true;
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
if (!(I_p2 <= cursor)) {
return false;
}
return true;
@ -315,14 +300,12 @@ private boolean r_R2() {
private boolean r_undouble() {
int v_1 = limit - cursor;
if (find_among_b(a_2) == 0)
{
if (find_among_b(a_2) == 0) {
return false;
}
cursor = limit - v_1;
ket = cursor;
if (cursor <= limit_backward)
{
if (cursor <= limit_backward) {
return false;
}
cursor--;
@ -334,46 +317,40 @@ private boolean r_undouble() {
private boolean r_e_ending() {
B_e_found = false;
ket = cursor;
if (!(eq_s_b("e")))
{
if (!(eq_s_b("e"))) {
return false;
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
return false;
}
int v_1 = limit - cursor;
if (!(out_grouping_b(g_v, 97, 232)))
{
if (!(out_grouping_b(g_v, 97, 232))) {
return false;
}
cursor = limit - v_1;
slice_del();
B_e_found = true;
if (!r_undouble())
{
if (!r_undouble()) {
return false;
}
return true;
}
private boolean r_en_ending() {
if (!r_R1())
{
if (!r_R1()) {
return false;
}
int v_1 = limit - cursor;
if (!(out_grouping_b(g_v, 97, 232)))
{
if (!(out_grouping_b(g_v, 97, 232))) {
return false;
}
cursor = limit - v_1;
{
int v_2 = limit - cursor;
lab0: {
if (!(eq_s_b("gem")))
lab0:
{
if (!(eq_s_b("gem"))) {
break lab0;
}
return false;
@ -381,8 +358,7 @@ private boolean r_en_ending() {
cursor = limit - v_2;
}
slice_del();
if (!r_undouble())
{
if (!r_undouble()) {
return false;
}
return true;
@ -391,35 +367,31 @@ private boolean r_en_ending() {
private boolean r_standard_suffix() {
int among_var;
int v_1 = limit - cursor;
lab0: {
lab0:
{
ket = cursor;
among_var = find_among_b(a_3);
if (among_var == 0)
{
if (among_var == 0) {
break lab0;
}
bra = cursor;
switch (among_var) {
case 1:
if (!r_R1())
{
if (!r_R1()) {
break lab0;
}
slice_from("heid");
break;
case 2:
if (!r_en_ending())
{
if (!r_en_ending()) {
break lab0;
}
break;
case 3:
if (!r_R1())
{
if (!r_R1()) {
break lab0;
}
if (!(out_grouping_b(g_v_j, 97, 232)))
{
if (!(out_grouping_b(g_v_j, 97, 232))) {
break lab0;
}
slice_del();
@ -431,22 +403,21 @@ private boolean r_standard_suffix() {
r_e_ending();
cursor = limit - v_2;
int v_3 = limit - cursor;
lab1: {
ket = cursor;
if (!(eq_s_b("heid")))
lab1:
{
ket = cursor;
if (!(eq_s_b("heid"))) {
break lab1;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
break lab1;
}
{
int v_4 = limit - cursor;
lab2: {
if (!(eq_s_b("c")))
lab2:
{
if (!(eq_s_b("c"))) {
break lab2;
}
break lab1;
@ -455,51 +426,48 @@ private boolean r_standard_suffix() {
}
slice_del();
ket = cursor;
if (!(eq_s_b("en")))
{
if (!(eq_s_b("en"))) {
break lab1;
}
bra = cursor;
if (!r_en_ending())
{
if (!r_en_ending()) {
break lab1;
}
}
cursor = limit - v_3;
int v_5 = limit - cursor;
lab3: {
lab3:
{
ket = cursor;
among_var = find_among_b(a_4);
if (among_var == 0)
{
if (among_var == 0) {
break lab3;
}
bra = cursor;
switch (among_var) {
case 1:
if (!r_R2())
{
if (!r_R2()) {
break lab3;
}
slice_del();
lab4: {
int v_6 = limit - cursor;
lab5: {
ket = cursor;
if (!(eq_s_b("ig")))
lab4:
{
int v_6 = limit - cursor;
lab5:
{
ket = cursor;
if (!(eq_s_b("ig"))) {
break lab5;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
break lab5;
}
{
int v_7 = limit - cursor;
lab6: {
if (!(eq_s_b("e")))
lab6:
{
if (!(eq_s_b("e"))) {
break lab6;
}
break lab5;
@ -510,22 +478,20 @@ private boolean r_standard_suffix() {
break lab4;
}
cursor = limit - v_6;
if (!r_undouble())
{
if (!r_undouble()) {
break lab3;
}
}
break;
case 2:
if (!r_R2())
{
if (!r_R2()) {
break lab3;
}
{
int v_8 = limit - cursor;
lab7: {
if (!(eq_s_b("e")))
lab7:
{
if (!(eq_s_b("e"))) {
break lab7;
}
break lab3;
@ -535,30 +501,25 @@ private boolean r_standard_suffix() {
slice_del();
break;
case 3:
if (!r_R2())
{
if (!r_R2()) {
break lab3;
}
slice_del();
if (!r_e_ending())
{
if (!r_e_ending()) {
break lab3;
}
break;
case 4:
if (!r_R2())
{
if (!r_R2()) {
break lab3;
}
slice_del();
break;
case 5:
if (!r_R2())
{
if (!r_R2()) {
break lab3;
}
if (!(B_e_found))
{
if (!(B_e_found)) {
break lab3;
}
slice_del();
@ -567,24 +528,21 @@ private boolean r_standard_suffix() {
}
cursor = limit - v_5;
int v_9 = limit - cursor;
lab8: {
if (!(out_grouping_b(g_v_I, 73, 232)))
lab8:
{
if (!(out_grouping_b(g_v_I, 73, 232))) {
break lab8;
}
int v_10 = limit - cursor;
if (find_among_b(a_5) == 0)
{
if (find_among_b(a_5) == 0) {
break lab8;
}
if (!(out_grouping_b(g_v, 97, 232)))
{
if (!(out_grouping_b(g_v, 97, 232))) {
break lab8;
}
cursor = limit - v_10;
ket = cursor;
if (cursor <= limit_backward)
{
if (cursor <= limit_backward) {
break lab8;
}
cursor--;
@ -622,8 +580,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return DutchStemmer.class.getName().hashCode();
}
}

364
lucene/analysis/common/src/java/org/tartarus/snowball/ext/EnglishStemmer.java
View File

@ -6,29 +6,25 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class EnglishStemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
new Among("arsen", -1, -1),
new Among("commun", -1, -1),
new Among("gener", -1, -1)
private static final Among a_0[] = {
new Among("arsen", -1, -1), new Among("commun", -1, -1), new Among("gener", -1, -1)
};
private final static Among a_1[] = {
new Among("'", -1, 1),
new Among("'s'", 0, 1),
new Among("'s", -1, 1)
private static final Among a_1[] = {
new Among("'", -1, 1), new Among("'s'", 0, 1), new Among("'s", -1, 1)
};
private final static Among a_2[] = {
private static final Among a_2[] = {
new Among("ied", -1, 2),
new Among("s", -1, 3),
new Among("ies", 1, 2),
@ -37,7 +33,7 @@ private final static Among a_2[] = {
new Among("us", 1, -1)
};
private final static Among a_3[] = {
private static final Among a_3[] = {
new Among("", -1, 3),
new Among("bb", 0, 2),
new Among("dd", 0, 2),
@ -53,7 +49,7 @@ private final static Among a_3[] = {
new Among("iz", 0, 1)
};
private final static Among a_4[] = {
private static final Among a_4[] = {
new Among("ed", -1, 2),
new Among("eed", 0, 1),
new Among("ing", -1, 2),
@ -62,7 +58,7 @@ private final static Among a_4[] = {
new Among("ingly", -1, 2)
};
private final static Among a_5[] = {
private static final Among a_5[] = {
new Among("anci", -1, 3),
new Among("enci", -1, 2),
new Among("ogi", -1, 13),
@ -89,7 +85,7 @@ private final static Among a_5[] = {
new Among("ousness", -1, 10)
};
private final static Among a_6[] = {
private static final Among a_6[] = {
new Among("icate", -1, 4),
new Among("ative", -1, 6),
new Among("alize", -1, 3),
@ -101,7 +97,7 @@ private final static Among a_6[] = {
new Among("ness", -1, 5)
};
private final static Among a_7[] = {
private static final Among a_7[] = {
new Among("ic", -1, 1),
new Among("ance", -1, 1),
new Among("ence", -1, 1),
@ -122,12 +118,9 @@ private final static Among a_7[] = {
new Among("ement", 16, 1)
};
private final static Among a_8[] = {
new Among("e", -1, 1),
new Among("l", -1, 2)
};
private static final Among a_8[] = {new Among("e", -1, 1), new Among("l", -1, 2)};
private final static Among a_9[] = {
private static final Among a_9[] = {
new Among("succeed", -1, -1),
new Among("proceed", -1, -1),
new Among("exceed", -1, -1),
@ -138,7 +131,7 @@ private final static Among a_9[] = {
new Among("outing", -1, -1)
};
private final static Among a_10[] = {
private static final Among a_10[] = {
new Among("andes", -1, -1),
new Among("atlas", -1, -1),
new Among("bias", -1, -1),
@ -169,14 +162,13 @@ private boolean B_Y_found;
private int I_p2;
private int I_p1;
private boolean r_prelude() {
B_Y_found = false;
int v_1 = cursor;
lab0: {
bra = cursor;
if (!(eq_s("'")))
lab0:
{
bra = cursor;
if (!(eq_s("'"))) {
break lab0;
}
ket = cursor;
@ -184,10 +176,10 @@ private boolean r_prelude() {
}
cursor = v_1;
int v_2 = cursor;
lab1: {
bra = cursor;
if (!(eq_s("y")))
lab1:
{
bra = cursor;
if (!(eq_s("y"))) {
break lab1;
}
ket = cursor;
@ -196,22 +188,22 @@ private boolean r_prelude() {
}
cursor = v_2;
int v_3 = cursor;
lab2: {
while(true)
lab2:
{
while (true) {
int v_4 = cursor;
lab3: {
golab4: while(true)
lab3:
{
golab4:
while (true) {
int v_5 = cursor;
lab5: {
if (!(in_grouping(g_v, 97, 121)))
lab5:
{
if (!(in_grouping(g_v, 97, 121))) {
break lab5;
}
bra = cursor;
if (!(eq_s("y")))
{
if (!(eq_s("y"))) {
break lab5;
}
ket = cursor;
@ -219,8 +211,7 @@ private boolean r_prelude() {
break golab4;
}
cursor = v_5;
if (cursor >= limit)
{
if (cursor >= limit) {
break lab3;
}
cursor++;
@ -241,75 +232,73 @@ private boolean r_mark_regions() {
I_p1 = limit;
I_p2 = limit;
int v_1 = cursor;
lab0: {
lab1: {
int v_2 = cursor;
lab2: {
if (find_among(a_0) == 0)
lab0:
{
lab1:
{
int v_2 = cursor;
lab2:
{
if (find_among(a_0) == 0) {
break lab2;
}
break lab1;
}
cursor = v_2;
golab3: while(true)
{
lab4: {
if (!(in_grouping(g_v, 97, 121)))
golab3:
while (true) {
lab4:
{
if (!(in_grouping(g_v, 97, 121))) {
break lab4;
}
break golab3;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
}
golab5: while(true)
{
lab6: {
if (!(out_grouping(g_v, 97, 121)))
golab5:
while (true) {
lab6:
{
if (!(out_grouping(g_v, 97, 121))) {
break lab6;
}
break golab5;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
}
}
I_p1 = cursor;
golab7: while(true)
{
lab8: {
if (!(in_grouping(g_v, 97, 121)))
golab7:
while (true) {
lab8:
{
if (!(in_grouping(g_v, 97, 121))) {
break lab8;
}
break golab7;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
}
golab9: while(true)
{
lab10: {
if (!(out_grouping(g_v, 97, 121)))
golab9:
while (true) {
lab10:
{
if (!(out_grouping(g_v, 97, 121))) {
break lab10;
}
break golab9;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -321,34 +310,30 @@ private boolean r_mark_regions() {
}
private boolean r_shortv() {
lab0: {
lab0:
{
int v_1 = limit - cursor;
lab1: {
if (!(out_grouping_b(g_v_WXY, 89, 121)))
lab1:
{
if (!(out_grouping_b(g_v_WXY, 89, 121))) {
break lab1;
}
if (!(in_grouping_b(g_v, 97, 121)))
{
if (!(in_grouping_b(g_v, 97, 121))) {
break lab1;
}
if (!(out_grouping_b(g_v, 97, 121)))
{
if (!(out_grouping_b(g_v, 97, 121))) {
break lab1;
}
break lab0;
}
cursor = limit - v_1;
if (!(out_grouping_b(g_v, 97, 121)))
{
if (!(out_grouping_b(g_v, 97, 121))) {
return false;
}
if (!(in_grouping_b(g_v, 97, 121)))
{
if (!(in_grouping_b(g_v, 97, 121))) {
return false;
}
if (cursor > limit_backward)
{
if (cursor > limit_backward) {
return false;
}
}
@ -356,16 +341,14 @@ private boolean r_shortv() {
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
if (!(I_p1 <= cursor)) {
return false;
}
return true;
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
if (!(I_p2 <= cursor)) {
return false;
}
return true;
@ -374,10 +357,10 @@ private boolean r_R2() {
private boolean r_Step_1a() {
int among_var;
int v_1 = limit - cursor;
lab0: {
ket = cursor;
if (find_among_b(a_1) == 0)
lab0:
{
ket = cursor;
if (find_among_b(a_1) == 0) {
cursor = limit - v_1;
break lab0;
}
@ -386,8 +369,7 @@ private boolean r_Step_1a() {
}
ket = cursor;
among_var = find_among_b(a_2);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
@ -396,13 +378,14 @@ private boolean r_Step_1a() {
slice_from("ss");
break;
case 2:
lab1: {
lab1:
{
int v_2 = limit - cursor;
lab2: {
lab2:
{
{
int c = cursor - 2;
if (limit_backward > c || c > limit)
{
if (limit_backward > c || c > limit) {
break lab2;
}
cursor = c;
@ -415,22 +398,20 @@ private boolean r_Step_1a() {
}
break;
case 3:
if (cursor <= limit_backward)
{
if (cursor <= limit_backward) {
return false;
}
cursor--;
golab3: while(true)
{
lab4: {
if (!(in_grouping_b(g_v, 97, 121)))
golab3:
while (true) {
lab4:
{
if (!(in_grouping_b(g_v, 97, 121))) {
break lab4;
}
break golab3;
}
if (cursor <= limit_backward)
{
if (cursor <= limit_backward) {
return false;
}
cursor--;
@ -445,32 +426,29 @@ private boolean r_Step_1b() {
int among_var;
ket = cursor;
among_var = find_among_b(a_4);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
switch (among_var) {
case 1:
if (!r_R1())
{
if (!r_R1()) {
return false;
}
slice_from("ee");
break;
case 2:
int v_1 = limit - cursor;
golab0: while(true)
{
lab1: {
if (!(in_grouping_b(g_v, 97, 121)))
golab0:
while (true) {
lab1:
{
if (!(in_grouping_b(g_v, 97, 121))) {
break lab1;
}
break golab0;
}
if (cursor <= limit_backward)
{
if (cursor <= limit_backward) {
return false;
}
cursor--;
@ -479,8 +457,7 @@ private boolean r_Step_1b() {
slice_del();
int v_3 = limit - cursor;
among_var = find_among_b(a_3);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
cursor = limit - v_3;
@ -494,8 +471,7 @@ private boolean r_Step_1b() {
break;
case 2:
ket = cursor;
if (cursor <= limit_backward)
{
if (cursor <= limit_backward) {
return false;
}
cursor--;
@ -503,13 +479,11 @@ private boolean r_Step_1b() {
slice_del();
break;
case 3:
if (cursor != I_p1)
{
if (cursor != I_p1) {
return false;
}
int v_4 = limit - cursor;
if (!r_shortv())
{
if (!r_shortv()) {
return false;
}
cursor = limit - v_4;
@ -527,29 +501,28 @@ private boolean r_Step_1b() {
private boolean r_Step_1c() {
ket = cursor;
lab0: {
int v_1 = limit - cursor;
lab1: {
if (!(eq_s_b("y")))
lab0:
{
int v_1 = limit - cursor;
lab1:
{
if (!(eq_s_b("y"))) {
break lab1;
}
break lab0;
}
cursor = limit - v_1;
if (!(eq_s_b("Y")))
{
if (!(eq_s_b("Y"))) {
return false;
}
}
bra = cursor;
if (!(out_grouping_b(g_v, 97, 121)))
{
if (!(out_grouping_b(g_v, 97, 121))) {
return false;
}
lab2: {
if (cursor > limit_backward)
lab2:
{
if (cursor > limit_backward) {
break lab2;
}
return false;
@ -562,13 +535,11 @@ private boolean r_Step_2() {
int among_var;
ket = cursor;
among_var = find_among_b(a_5);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
return false;
}
switch (among_var) {
@ -609,8 +580,7 @@ private boolean r_Step_2() {
slice_from("ble");
break;
case 13:
if (!(eq_s_b("l")))
{
if (!(eq_s_b("l"))) {
return false;
}
slice_from("og");
@ -619,8 +589,7 @@ private boolean r_Step_2() {
slice_from("less");
break;
case 15:
if (!(in_grouping_b(g_valid_LI, 99, 116)))
{
if (!(in_grouping_b(g_valid_LI, 99, 116))) {
return false;
}
slice_del();
@ -633,13 +602,11 @@ private boolean r_Step_3() {
int among_var;
ket = cursor;
among_var = find_among_b(a_6);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
return false;
}
switch (among_var) {
@ -659,8 +626,7 @@ private boolean r_Step_3() {
slice_del();
break;
case 6:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_del();
@ -673,13 +639,11 @@ private boolean r_Step_4() {
int among_var;
ket = cursor;
among_var = find_among_b(a_7);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
return false;
}
switch (among_var) {
@ -687,18 +651,18 @@ private boolean r_Step_4() {
slice_del();
break;
case 2:
lab0: {
int v_1 = limit - cursor;
lab1: {
if (!(eq_s_b("s")))
lab0:
{
int v_1 = limit - cursor;
lab1:
{
if (!(eq_s_b("s"))) {
break lab1;
}
break lab0;
}
cursor = limit - v_1;
if (!(eq_s_b("t")))
{
if (!(eq_s_b("t"))) {
return false;
}
}
@ -712,32 +676,31 @@ private boolean r_Step_5() {
int among_var;
ket = cursor;
among_var = find_among_b(a_8);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
switch (among_var) {
case 1:
lab0: {
int v_1 = limit - cursor;
lab1: {
if (!r_R2())
lab0:
{
int v_1 = limit - cursor;
lab1:
{
if (!r_R2()) {
break lab1;
}
break lab0;
}
cursor = limit - v_1;
if (!r_R1())
{
if (!r_R1()) {
return false;
}
{
int v_2 = limit - cursor;
lab2: {
if (!r_shortv())
lab2:
{
if (!r_shortv()) {
break lab2;
}
return false;
@ -748,12 +711,10 @@ private boolean r_Step_5() {
slice_del();
break;
case 2:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
if (!(eq_s_b("l")))
{
if (!(eq_s_b("l"))) {
return false;
}
slice_del();
@ -764,13 +725,11 @@ private boolean r_Step_5() {
private boolean r_exception2() {
ket = cursor;
if (find_among_b(a_9) == 0)
{
if (find_among_b(a_9) == 0) {
return false;
}
bra = cursor;
if (cursor > limit_backward)
{
if (cursor > limit_backward) {
return false;
}
return true;
@ -780,13 +739,11 @@ private boolean r_exception1() {
int among_var;
bra = cursor;
among_var = find_among(a_10);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
ket = cursor;
if (cursor < limit)
{
if (cursor < limit) {
return false;
}
switch (among_var) {
@ -828,21 +785,20 @@ private boolean r_exception1() {
}
private boolean r_postlude() {
if (!(B_Y_found))
{
if (!(B_Y_found)) {
return false;
}
while(true)
{
while (true) {
int v_1 = cursor;
lab0: {
golab1: while(true)
lab0:
{
golab1:
while (true) {
int v_2 = cursor;
lab2: {
bra = cursor;
if (!(eq_s("Y")))
lab2:
{
bra = cursor;
if (!(eq_s("Y"))) {
break lab2;
}
ket = cursor;
@ -850,8 +806,7 @@ private boolean r_postlude() {
break golab1;
}
cursor = v_2;
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -867,24 +822,26 @@ private boolean r_postlude() {
@Override
public boolean stem() {
lab0: {
int v_1 = cursor;
lab1: {
if (!r_exception1())
lab0:
{
int v_1 = cursor;
lab1:
{
if (!r_exception1()) {
break lab1;
}
break lab0;
}
cursor = v_1;
lab2: {
lab2:
{
{
int v_2 = cursor;
lab3: {
lab3:
{
{
int c = cursor + 3;
if (0 > c || c > limit)
{
if (0 > c || c > limit) {
break lab3;
}
cursor = c;
@ -903,11 +860,12 @@ public boolean stem() {
int v_5 = limit - cursor;
r_Step_1a();
cursor = limit - v_5;
lab4: {
int v_6 = limit - cursor;
lab5: {
if (!r_exception2())
lab4:
{
int v_6 = limit - cursor;
lab5:
{
if (!r_exception2()) {
break lab5;
}
break lab4;
@ -949,8 +907,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return EnglishStemmer.class.getName().hashCode();
}
}

253
lucene/analysis/common/src/java/org/tartarus/snowball/ext/EstonianStemmer.java
View File

@ -6,22 +6,19 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class EstonianStemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
new Among("gi", -1, 1),
new Among("ki", -1, 2)
};
private static final Among a_0[] = {new Among("gi", -1, 1), new Among("ki", -1, 2)};
private final static Among a_1[] = {
private static final Among a_1[] = {
new Among("da", -1, 3),
new Among("mata", -1, 1),
new Among("b", -1, 3),
@ -45,7 +42,7 @@ private final static Among a_1[] = {
new Among("taks", -1, 1)
};
private final static Among a_2[] = {
private static final Among a_2[] = {
new Among("aa", -1, -1),
new Among("ee", -1, -1),
new Among("ii", -1, -1),
@ -57,11 +54,9 @@ private final static Among a_2[] = {
new Among("\u00FC\u00FC", -1, -1)
};
private final static Among a_3[] = {
new Among("i", -1, 1)
};
private static final Among a_3[] = {new Among("i", -1, 1)};
private final static Among a_4[] = {
private static final Among a_4[] = {
new Among("lane", -1, 1),
new Among("line", -1, 3),
new Among("mine", -1, 2),
@ -76,7 +71,7 @@ private final static Among a_4[] = {
new Among("mist", -1, 2)
};
private final static Among a_5[] = {
private static final Among a_5[] = {
new Among("ga", -1, 1),
new Among("ta", -1, 1),
new Among("le", -1, 1),
@ -89,7 +84,7 @@ private final static Among a_5[] = {
new Among("st", 7, 1)
};
private final static Among a_6[] = {
private static final Among a_6[] = {
new Among("d", -1, 4),
new Among("sid", 0, 2),
new Among("de", -1, 4),
@ -99,26 +94,22 @@ private final static Among a_6[] = {
new Among("te", -1, 3)
};
private final static Among a_7[] = {
new Among("kk", -1, -1),
new Among("pp", -1, -1),
new Among("tt", -1, -1)
private static final Among a_7[] = {
new Among("kk", -1, -1), new Among("pp", -1, -1), new Among("tt", -1, -1)
};
private final static Among a_8[] = {
private static final Among a_8[] = {
new Among("va", -1, -1),
new Among("du", -1, -1),
new Among("nu", -1, -1),
new Among("tu", -1, -1)
};
private final static Among a_9[] = {
new Among("ma", -1, 2),
new Among("mai", -1, 1),
new Among("m", -1, 1)
private static final Among a_9[] = {
new Among("ma", -1, 2), new Among("mai", -1, 1), new Among("m", -1, 1)
};
private final static Among a_10[] = {
private static final Among a_10[] = {
new Among("joob", -1, 1),
new Among("jood", -1, 1),
new Among("joodakse", 1, 1),
@ -411,49 +402,53 @@ private final static Among a_10[] = {
new Among("v\u00F5ivad", -1, 11)
};
private static final char g_V1[] = {17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 48, 8 };
private static final char g_V1[] = {
17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 48, 8
};
private static final char g_RV[] = {17, 65, 16};
private static final char g_KI[] = {117, 66, 6, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128, 0, 0, 0, 16 };
private static final char g_KI[] = {
117, 66, 6, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
128, 0, 0, 0, 16
};
private static final char g_GI[] = {21, 123, 243, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 48, 8 };
private static final char g_GI[] = {
21, 123, 243, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 48, 8
};
private int I_p1;
private boolean B_is_verb;
private boolean r_mark_regions() {
I_p1 = limit;
golab0: while(true)
{
golab0:
while (true) {
int v_1 = cursor;
lab1: {
if (!(in_grouping(g_V1, 97, 252)))
lab1:
{
if (!(in_grouping(g_V1, 97, 252))) {
break lab1;
}
cursor = v_1;
break golab0;
}
cursor = v_1;
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
}
golab2: while(true)
{
lab3: {
if (!(out_grouping(g_V1, 97, 252)))
golab2:
while (true) {
lab3:
{
if (!(out_grouping(g_V1, 97, 252))) {
break lab3;
}
break golab2;
}
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
@ -464,16 +459,14 @@ private boolean r_mark_regions() {
private boolean r_emphasis() {
int among_var;
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_p1;
ket = cursor;
among_var = find_among_b(a_0);
if (among_var == 0)
{
if (among_var == 0) {
limit_backward = v_2;
return false;
}
@ -482,8 +475,7 @@ private boolean r_emphasis() {
int v_3 = limit - cursor;
{
int c = cursor - 4;
if (limit_backward > c || c > limit)
{
if (limit_backward > c || c > limit) {
return false;
}
cursor = c;
@ -492,16 +484,15 @@ private boolean r_emphasis() {
switch (among_var) {
case 1:
int v_4 = limit - cursor;
if (!(in_grouping_b(g_GI, 97, 252)))
{
if (!(in_grouping_b(g_GI, 97, 252))) {
return false;
}
cursor = limit - v_4;
{
int v_5 = limit - cursor;
lab0: {
if (!r_LONGV())
lab0:
{
if (!r_LONGV()) {
break lab0;
}
return false;
@ -511,8 +502,7 @@ private boolean r_emphasis() {
slice_del();
break;
case 2:
if (!(in_grouping_b(g_KI, 98, 382)))
{
if (!(in_grouping_b(g_KI, 98, 382))) {
return false;
}
slice_del();
@ -523,16 +513,14 @@ private boolean r_emphasis() {
private boolean r_verb() {
int among_var;
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_p1;
ket = cursor;
among_var = find_among_b(a_1);
if (among_var == 0)
{
if (among_var == 0) {
limit_backward = v_2;
return false;
}
@ -546,8 +534,7 @@ private boolean r_verb() {
slice_from("a");
break;
case 3:
if (!(in_grouping_b(g_V1, 97, 252)))
{
if (!(in_grouping_b(g_V1, 97, 252))) {
return false;
}
slice_del();
@ -558,30 +545,26 @@ private boolean r_verb() {
}
private boolean r_LONGV() {
if (find_among_b(a_2) == 0)
{
if (find_among_b(a_2) == 0) {
return false;
}
return true;
}
private boolean r_i_plural() {
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_p1;
ket = cursor;
if (find_among_b(a_3) == 0)
{
if (find_among_b(a_3) == 0) {
limit_backward = v_2;
return false;
}
bra = cursor;
limit_backward = v_2;
if (!(in_grouping_b(g_RV, 97, 117)))
{
if (!(in_grouping_b(g_RV, 97, 117))) {
return false;
}
slice_del();
@ -590,16 +573,14 @@ private boolean r_i_plural() {
private boolean r_special_noun_endings() {
int among_var;
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_p1;
ket = cursor;
among_var = find_among_b(a_4);
if (among_var == 0)
{
if (among_var == 0) {
limit_backward = v_2;
return false;
}
@ -620,32 +601,30 @@ private boolean r_special_noun_endings() {
}
private boolean r_case_ending() {
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_p1;
ket = cursor;
if (find_among_b(a_5) == 0)
{
if (find_among_b(a_5) == 0) {
limit_backward = v_2;
return false;
}
bra = cursor;
limit_backward = v_2;
lab0: {
int v_3 = limit - cursor;
lab1: {
if (!(in_grouping_b(g_RV, 97, 117)))
lab0:
{
int v_3 = limit - cursor;
lab1:
{
if (!(in_grouping_b(g_RV, 97, 117))) {
break lab1;
}
break lab0;
}
cursor = limit - v_3;
if (!r_LONGV())
{
if (!r_LONGV()) {
return false;
}
}
@ -655,16 +634,14 @@ private boolean r_case_ending() {
private boolean r_plural_three_first_cases() {
int among_var;
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_p1;
ket = cursor;
among_var = find_among_b(a_6);
if (among_var == 0)
{
if (among_var == 0) {
limit_backward = v_2;
return false;
}
@ -677,9 +654,9 @@ private boolean r_plural_three_first_cases() {
case 2:
{
int v_3 = limit - cursor;
lab0: {
if (!r_LONGV())
lab0:
{
if (!r_LONGV()) {
break lab0;
}
return false;
@ -689,42 +666,44 @@ private boolean r_plural_three_first_cases() {
slice_del();
break;
case 3:
lab1: {
lab1:
{
int v_4 = limit - cursor;
lab2: {
lab2:
{
int v_5 = limit - cursor;
{
int c = cursor - 4;
if (limit_backward > c || c > limit)
{
if (limit_backward > c || c > limit) {
break lab2;
}
cursor = c;
}
cursor = limit - v_5;
lab3: {
int v_6 = limit - cursor;
lab4: {
if (!(eq_s_b("mis")))
lab3:
{
int v_6 = limit - cursor;
lab4:
{
if (!(eq_s_b("mis"))) {
break lab4;
}
slice_from("e");
break lab3;
}
cursor = limit - v_6;
lab5: {
if (!(eq_s_b("las")))
lab5:
{
if (!(eq_s_b("las"))) {
break lab5;
}
slice_from("e");
break lab3;
}
cursor = limit - v_6;
lab6: {
if (!(eq_s_b("lis")))
lab6:
{
if (!(eq_s_b("lis"))) {
break lab6;
}
slice_from("e");
@ -733,9 +712,9 @@ private boolean r_plural_three_first_cases() {
cursor = limit - v_6;
{
int v_7 = limit - cursor;
lab7: {
if (!(eq_s_b("t")))
lab7:
{
if (!(eq_s_b("t"))) {
break lab7;
}
break lab2;
@ -749,9 +728,9 @@ private boolean r_plural_three_first_cases() {
cursor = limit - v_4;
{
int v_8 = limit - cursor;
lab8: {
if (!(eq_s_b("t")))
lab8:
{
if (!(eq_s_b("t"))) {
break lab8;
}
return false;
@ -762,18 +741,18 @@ private boolean r_plural_three_first_cases() {
}
break;
case 4:
lab9: {
int v_9 = limit - cursor;
lab10: {
if (!(in_grouping_b(g_RV, 97, 117)))
lab9:
{
int v_9 = limit - cursor;
lab10:
{
if (!(in_grouping_b(g_RV, 97, 117))) {
break lab10;
}
break lab9;
}
cursor = limit - v_9;
if (!r_LONGV())
{
if (!r_LONGV()) {
return false;
}
}
@ -785,8 +764,7 @@ private boolean r_plural_three_first_cases() {
private boolean r_double() {
int v_1 = limit - cursor;
if (find_among_b(a_7) == 0)
{
if (find_among_b(a_7) == 0) {
return false;
}
cursor = limit - v_1;
@ -794,16 +772,14 @@ private boolean r_double() {
}
private boolean r_undouble() {
if (cursor <= limit_backward)
{
if (cursor <= limit_backward) {
return false;
}
cursor--;
ket = cursor;
{
int c = cursor - 1;
if (limit_backward > c || c > limit)
{
if (limit_backward > c || c > limit) {
return false;
}
cursor = c;
@ -814,15 +790,13 @@ private boolean r_undouble() {
}
private boolean r_nu() {
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_p1;
ket = cursor;
if (find_among_b(a_8) == 0)
{
if (find_among_b(a_8) == 0) {
limit_backward = v_2;
return false;
}
@ -833,18 +807,15 @@ private boolean r_nu() {
}
private boolean r_remove_double_kpt() {
if (!(in_grouping_b(g_V1, 97, 252)))
{
if (!(in_grouping_b(g_V1, 97, 252))) {
return false;
}
int v_1 = limit - cursor;
if (!r_double())
{
if (!r_double()) {
return false;
}
cursor = limit - v_1;
if (!r_undouble())
{
if (!r_undouble()) {
return false;
}
return true;
@ -852,16 +823,14 @@ private boolean r_remove_double_kpt() {
private boolean r_degrees() {
int among_var;
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_p1;
ket = cursor;
among_var = find_among_b(a_9);
if (among_var == 0)
{
if (among_var == 0) {
limit_backward = v_2;
return false;
}
@ -869,8 +838,7 @@ private boolean r_degrees() {
limit_backward = v_2;
switch (among_var) {
case 1:
if (!(in_grouping_b(g_RV, 97, 117)))
{
if (!(in_grouping_b(g_RV, 97, 117))) {
return false;
}
slice_del();
@ -908,13 +876,11 @@ private boolean r_verb_exceptions() {
int among_var;
bra = cursor;
among_var = find_among(a_10);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
ket = cursor;
if (cursor < limit)
{
if (cursor < limit) {
return false;
}
switch (among_var) {
@ -983,9 +949,9 @@ public boolean stem() {
cursor = v_1;
{
int v_2 = cursor;
lab0: {
if (!r_verb_exceptions())
lab0:
{
if (!r_verb_exceptions()) {
break lab0;
}
return false;
@ -1002,10 +968,11 @@ public boolean stem() {
r_verb();
cursor = limit - v_4;
int v_5 = limit - cursor;
lab1: {
lab2: {
if (!(B_is_verb))
lab1:
{
lab2:
{
if (!(B_is_verb)) {
break lab2;
}
cursor = limit - v_5;
@ -1029,8 +996,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return EstonianStemmer.class.getName().hashCode();
}
}

293
lucene/analysis/common/src/java/org/tartarus/snowball/ext/FinnishStemmer.java
View File

@ -6,17 +6,17 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class FinnishStemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
private static final Among a_0[] = {
new Among("pa", -1, 1),
new Among("sti", -1, 2),
new Among("kaan", -1, 1),
@ -29,7 +29,7 @@ private final static Among a_0[] = {
new Among("k\u00F6", -1, 1)
};
private final static Among a_1[] = {
private static final Among a_1[] = {
new Among("lla", -1, -1),
new Among("na", -1, -1),
new Among("ssa", -1, -1),
@ -38,7 +38,7 @@ private final static Among a_1[] = {
new Among("sta", 3, -1)
};
private final static Among a_2[] = {
private static final Among a_2[] = {
new Among("ll\u00E4", -1, -1),
new Among("n\u00E4", -1, -1),
new Among("ss\u00E4", -1, -1),
@ -47,12 +47,9 @@ private final static Among a_2[] = {
new Among("st\u00E4", 3, -1)
};
private final static Among a_3[] = {
new Among("lle", -1, -1),
new Among("ine", -1, -1)
};
private static final Among a_3[] = {new Among("lle", -1, -1), new Among("ine", -1, -1)};
private final static Among a_4[] = {
private static final Among a_4[] = {
new Among("nsa", -1, 3),
new Among("mme", -1, 3),
new Among("nne", -1, 3),
@ -64,7 +61,7 @@ private final static Among a_4[] = {
new Among("ns\u00E4", -1, 3)
};
private final static Among a_5[] = {
private static final Among a_5[] = {
new Among("aa", -1, -1),
new Among("ee", -1, -1),
new Among("ii", -1, -1),
@ -74,7 +71,7 @@ private final static Among a_5[] = {
new Among("\u00F6\u00F6", -1, -1)
};
private final static Among a_6[] = {
private static final Among a_6[] = {
new Among("a", -1, 8),
new Among("lla", 0, -1),
new Among("na", 0, -1),
@ -107,7 +104,7 @@ private final static Among a_6[] = {
new Among("tt\u00E4", 26, 2)
};
private final static Among a_7[] = {
private static final Among a_7[] = {
new Among("eja", -1, -1),
new Among("mma", -1, 1),
new Among("imma", 1, -1),
@ -124,15 +121,9 @@ private final static Among a_7[] = {
new Among("imp\u00E4", 12, -1)
};
private final static Among a_8[] = {
new Among("i", -1, -1),
new Among("j", -1, -1)
};
private static final Among a_8[] = {new Among("i", -1, -1), new Among("j", -1, -1)};
private final static Among a_9[] = {
new Among("mma", -1, 1),
new Among("imma", 0, -1)
};
private static final Among a_9[] = {new Among("mma", -1, 1), new Among("imma", 0, -1)};
private static final char g_AEI[] = {17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8};
@ -142,80 +133,77 @@ private static final char g_V1[] = {17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
private static final char g_V2[] = {17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 32};
private static final char g_particle_end[] = {17, 97, 24, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 32 };
private static final char g_particle_end[] = {
17, 97, 24, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 32
};
private boolean B_ending_removed;
private java.lang.StringBuilder S_x = new java.lang.StringBuilder();
private int I_p2;
private int I_p1;
private boolean r_mark_regions() {
I_p1 = limit;
I_p2 = limit;
golab0: while(true)
{
golab0:
while (true) {
int v_1 = cursor;
lab1: {
if (!(in_grouping(g_V1, 97, 246)))
lab1:
{
if (!(in_grouping(g_V1, 97, 246))) {
break lab1;
}
cursor = v_1;
break golab0;
}
cursor = v_1;
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
}
golab2: while(true)
{
lab3: {
if (!(out_grouping(g_V1, 97, 246)))
golab2:
while (true) {
lab3:
{
if (!(out_grouping(g_V1, 97, 246))) {
break lab3;
}
break golab2;
}
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
}
I_p1 = cursor;
golab4: while(true)
{
golab4:
while (true) {
int v_3 = cursor;
lab5: {
if (!(in_grouping(g_V1, 97, 246)))
lab5:
{
if (!(in_grouping(g_V1, 97, 246))) {
break lab5;
}
cursor = v_3;
break golab4;
}
cursor = v_3;
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
}
golab6: while(true)
{
lab7: {
if (!(out_grouping(g_V1, 97, 246)))
golab6:
while (true) {
lab7:
{
if (!(out_grouping(g_V1, 97, 246))) {
break lab7;
}
break golab6;
}
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
@ -225,8 +213,7 @@ private boolean r_mark_regions() {
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
if (!(I_p2 <= cursor)) {
return false;
}
return true;
@ -234,16 +221,14 @@ private boolean r_R2() {
private boolean r_particle_etc() {
int among_var;
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_p1;
ket = cursor;
among_var = find_among_b(a_0);
if (among_var == 0)
{
if (among_var == 0) {
limit_backward = v_2;
return false;
}
@ -251,14 +236,12 @@ private boolean r_particle_etc() {
limit_backward = v_2;
switch (among_var) {
case 1:
if (!(in_grouping_b(g_particle_end, 97, 246)))
{
if (!(in_grouping_b(g_particle_end, 97, 246))) {
return false;
}
break;
case 2:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
break;
@ -269,16 +252,14 @@ private boolean r_particle_etc() {
private boolean r_possessive() {
int among_var;
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_p1;
ket = cursor;
among_var = find_among_b(a_4);
if (among_var == 0)
{
if (among_var == 0) {
limit_backward = v_2;
return false;
}
@ -288,9 +269,9 @@ private boolean r_possessive() {
case 1:
{
int v_3 = limit - cursor;
lab0: {
if (!(eq_s_b("k")))
lab0:
{
if (!(eq_s_b("k"))) {
break lab0;
}
return false;
@ -302,8 +283,7 @@ private boolean r_possessive() {
case 2:
slice_del();
ket = cursor;
if (!(eq_s_b("kse")))
{
if (!(eq_s_b("kse"))) {
return false;
}
bra = cursor;
@ -313,22 +293,19 @@ private boolean r_possessive() {
slice_del();
break;
case 4:
if (find_among_b(a_1) == 0)
{
if (find_among_b(a_1) == 0) {
return false;
}
slice_del();
break;
case 5:
if (find_among_b(a_2) == 0)
{
if (find_among_b(a_2) == 0) {
return false;
}
slice_del();
break;
case 6:
if (find_among_b(a_3) == 0)
{
if (find_among_b(a_3) == 0) {
return false;
}
slice_del();
@ -338,20 +315,17 @@ private boolean r_possessive() {
}
public boolean r_LONG() {
if (find_among_b(a_5) == 0)
{
if (find_among_b(a_5) == 0) {
return false;
}
return true;
}
public boolean r_VI() {
if (!(eq_s_b("i")))
{
if (!(eq_s_b("i"))) {
return false;
}
if (!(in_grouping_b(g_V2, 97, 246)))
{
if (!(in_grouping_b(g_V2, 97, 246))) {
return false;
}
return true;
@ -359,16 +333,14 @@ public boolean r_VI() {
private boolean r_case_ending() {
int among_var;
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_p1;
ket = cursor;
among_var = find_among_b(a_6);
if (among_var == 0)
{
if (among_var == 0) {
limit_backward = v_2;
return false;
}
@ -376,64 +348,58 @@ private boolean r_case_ending() {
limit_backward = v_2;
switch (among_var) {
case 1:
if (!(eq_s_b("a")))
{
if (!(eq_s_b("a"))) {
return false;
}
break;
case 2:
if (!(eq_s_b("e")))
{
if (!(eq_s_b("e"))) {
return false;
}
break;
case 3:
if (!(eq_s_b("i")))
{
if (!(eq_s_b("i"))) {
return false;
}
break;
case 4:
if (!(eq_s_b("o")))
{
if (!(eq_s_b("o"))) {
return false;
}
break;
case 5:
if (!(eq_s_b("\u00E4")))
{
if (!(eq_s_b("\u00E4"))) {
return false;
}
break;
case 6:
if (!(eq_s_b("\u00F6")))
{
if (!(eq_s_b("\u00F6"))) {
return false;
}
break;
case 7:
int v_3 = limit - cursor;
lab0: {
int v_4 = limit - cursor;
lab1: {
int v_5 = limit - cursor;
lab2: {
if (!r_LONG())
lab0:
{
int v_4 = limit - cursor;
lab1:
{
int v_5 = limit - cursor;
lab2:
{
if (!r_LONG()) {
break lab2;
}
break lab1;
}
cursor = limit - v_5;
if (!(eq_s_b("ie")))
{
if (!(eq_s_b("ie"))) {
cursor = limit - v_3;
break lab0;
}
}
cursor = limit - v_4;
if (cursor <= limit_backward)
{
if (cursor <= limit_backward) {
cursor = limit - v_3;
break lab0;
}
@ -442,12 +408,10 @@ private boolean r_case_ending() {
}
break;
case 8:
if (!(in_grouping_b(g_V1, 97, 246)))
{
if (!(in_grouping_b(g_V1, 97, 246))) {
return false;
}
if (!(in_grouping_b(g_C, 98, 122)))
{
if (!(in_grouping_b(g_C, 98, 122))) {
return false;
}
break;
@ -459,16 +423,14 @@ private boolean r_case_ending() {
private boolean r_other_endings() {
int among_var;
if (cursor < I_p2)
{
if (cursor < I_p2) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_p2;
ket = cursor;
among_var = find_among_b(a_7);
if (among_var == 0)
{
if (among_var == 0) {
limit_backward = v_2;
return false;
}
@ -478,9 +440,9 @@ private boolean r_other_endings() {
case 1:
{
int v_3 = limit - cursor;
lab0: {
if (!(eq_s_b("po")))
lab0:
{
if (!(eq_s_b("po"))) {
break lab0;
}
return false;
@ -494,15 +456,13 @@ private boolean r_other_endings() {
}
private boolean r_i_plural() {
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_p1;
ket = cursor;
if (find_among_b(a_8) == 0)
{
if (find_among_b(a_8) == 0) {
limit_backward = v_2;
return false;
}
@ -514,38 +474,33 @@ private boolean r_i_plural() {
private boolean r_t_plural() {
int among_var;
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_p1;
ket = cursor;
if (!(eq_s_b("t")))
{
if (!(eq_s_b("t"))) {
limit_backward = v_2;
return false;
}
bra = cursor;
int v_3 = limit - cursor;
if (!(in_grouping_b(g_V1, 97, 246)))
{
if (!(in_grouping_b(g_V1, 97, 246))) {
limit_backward = v_2;
return false;
}
cursor = limit - v_3;
slice_del();
limit_backward = v_2;
if (cursor < I_p2)
{
if (cursor < I_p2) {
return false;
}
int v_5 = limit_backward;
limit_backward = I_p2;
ket = cursor;
among_var = find_among_b(a_9);
if (among_var == 0)
{
if (among_var == 0) {
limit_backward = v_5;
return false;
}
@ -555,9 +510,9 @@ private boolean r_t_plural() {
case 1:
{
int v_6 = limit - cursor;
lab0: {
if (!(eq_s_b("po")))
lab0:
{
if (!(eq_s_b("po"))) {
break lab0;
}
return false;
@ -571,23 +526,21 @@ private boolean r_t_plural() {
}
private boolean r_tidy() {
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_p1;
int v_3 = limit - cursor;
lab0: {
int v_4 = limit - cursor;
if (!r_LONG())
lab0:
{
int v_4 = limit - cursor;
if (!r_LONG()) {
break lab0;
}
cursor = limit - v_4;
ket = cursor;
if (cursor <= limit_backward)
{
if (cursor <= limit_backward) {
break lab0;
}
cursor--;
@ -596,40 +549,39 @@ private boolean r_tidy() {
}
cursor = limit - v_3;
int v_5 = limit - cursor;
lab1: {
ket = cursor;
if (!(in_grouping_b(g_AEI, 97, 228)))
lab1:
{
ket = cursor;
if (!(in_grouping_b(g_AEI, 97, 228))) {
break lab1;
}
bra = cursor;
if (!(in_grouping_b(g_C, 98, 122)))
{
if (!(in_grouping_b(g_C, 98, 122))) {
break lab1;
}
slice_del();
}
cursor = limit - v_5;
int v_6 = limit - cursor;
lab2: {
ket = cursor;
if (!(eq_s_b("j")))
lab2:
{
ket = cursor;
if (!(eq_s_b("j"))) {
break lab2;
}
bra = cursor;
lab3: {
int v_7 = limit - cursor;
lab4: {
if (!(eq_s_b("o")))
lab3:
{
int v_7 = limit - cursor;
lab4:
{
if (!(eq_s_b("o"))) {
break lab4;
}
break lab3;
}
cursor = limit - v_7;
if (!(eq_s_b("u")))
{
if (!(eq_s_b("u"))) {
break lab2;
}
}
@ -637,48 +589,44 @@ private boolean r_tidy() {
}
cursor = limit - v_6;
int v_8 = limit - cursor;
lab5: {
ket = cursor;
if (!(eq_s_b("o")))
lab5:
{
ket = cursor;
if (!(eq_s_b("o"))) {
break lab5;
}
bra = cursor;
if (!(eq_s_b("j")))
{
if (!(eq_s_b("j"))) {
break lab5;
}
slice_del();
}
cursor = limit - v_8;
limit_backward = v_2;
golab6: while(true)
{
golab6:
while (true) {
int v_9 = limit - cursor;
lab7: {
if (!(out_grouping_b(g_V1, 97, 246)))
lab7:
{
if (!(out_grouping_b(g_V1, 97, 246))) {
break lab7;
}
cursor = limit - v_9;
break golab6;
}
cursor = limit - v_9;
if (cursor <= limit_backward)
{
if (cursor <= limit_backward) {
return false;
}
cursor--;
}
ket = cursor;
if (!(in_grouping_b(g_C, 98, 122)))
{
if (!(in_grouping_b(g_C, 98, 122))) {
return false;
}
bra = cursor;
slice_to(S_x);
if (!(eq_s_b(S_x)))
{
if (!(eq_s_b(S_x))) {
return false;
}
slice_del();
@ -705,10 +653,11 @@ public boolean stem() {
int v_5 = limit - cursor;
r_other_endings();
cursor = limit - v_5;
lab0: {
lab1: {
if (!(B_ending_removed))
lab0:
{
lab1:
{
if (!(B_ending_removed)) {
break lab1;
}
int v_7 = limit - cursor;
@ -736,8 +685,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return FinnishStemmer.class.getName().hashCode();
}
}

519
lucene/analysis/common/src/java/org/tartarus/snowball/ext/FrenchStemmer.java
View File

File diff suppressed because it is too large Load Diff

245
lucene/analysis/common/src/java/org/tartarus/snowball/ext/German2Stemmer.java
View File

@ -6,17 +6,17 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class German2Stemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
private static final Among a_0[] = {
new Among("", -1, 6),
new Among("ae", 0, 2),
new Among("oe", 0, 3),
@ -25,7 +25,7 @@ private final static Among a_0[] = {
new Among("\u00DF", 0, 1)
};
private final static Among a_1[] = {
private static final Among a_1[] = {
new Among("", -1, 5),
new Among("U", 0, 2),
new Among("Y", 0, 1),
@ -34,7 +34,7 @@ private final static Among a_1[] = {
new Among("\u00FC", 0, 2)
};
private final static Among a_2[] = {
private static final Among a_2[] = {
new Among("e", -1, 2),
new Among("em", -1, 1),
new Among("en", -1, 2),
@ -44,19 +44,13 @@ private final static Among a_2[] = {
new Among("es", 5, 2)
};
private final static Among a_3[] = {
new Among("en", -1, 1),
new Among("er", -1, 1),
new Among("st", -1, 2),
new Among("est", 2, 1)
private static final Among a_3[] = {
new Among("en", -1, 1), new Among("er", -1, 1), new Among("st", -1, 2), new Among("est", 2, 1)
};
private final static Among a_4[] = {
new Among("ig", -1, 1),
new Among("lich", -1, 1)
};
private static final Among a_4[] = {new Among("ig", -1, 1), new Among("lich", -1, 1)};
private final static Among a_5[] = {
private static final Among a_5[] = {
new Among("end", -1, 1),
new Among("ig", -1, 2),
new Among("ung", -1, 1),
@ -67,7 +61,9 @@ private final static Among a_5[] = {
new Among("keit", -1, 4)
};
private static final char g_v[] = {17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 32, 8 };
private static final char g_v[] = {
17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 32, 8
};
private static final char g_s_ending[] = {117, 30, 5};
@ -77,46 +73,43 @@ private int I_x;
private int I_p2;
private int I_p1;
private boolean r_prelude() {
int among_var;
int v_1 = cursor;
while(true)
{
while (true) {
int v_2 = cursor;
lab0: {
golab1: while(true)
lab0:
{
golab1:
while (true) {
int v_3 = cursor;
lab2: {
if (!(in_grouping(g_v, 97, 252)))
lab2:
{
if (!(in_grouping(g_v, 97, 252))) {
break lab2;
}
bra = cursor;
lab3: {
int v_4 = cursor;
lab4: {
if (!(eq_s("u")))
lab3:
{
int v_4 = cursor;
lab4:
{
if (!(eq_s("u"))) {
break lab4;
}
ket = cursor;
if (!(in_grouping(g_v, 97, 252)))
{
if (!(in_grouping(g_v, 97, 252))) {
break lab4;
}
slice_from("U");
break lab3;
}
cursor = v_4;
if (!(eq_s("y")))
{
if (!(eq_s("y"))) {
break lab2;
}
ket = cursor;
if (!(in_grouping(g_v, 97, 252)))
{
if (!(in_grouping(g_v, 97, 252))) {
break lab2;
}
slice_from("Y");
@ -125,8 +118,7 @@ private boolean r_prelude() {
break golab1;
}
cursor = v_3;
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -137,14 +129,13 @@ private boolean r_prelude() {
break;
}
cursor = v_1;
while(true)
{
while (true) {
int v_5 = cursor;
lab5: {
lab5:
{
bra = cursor;
among_var = find_among(a_0);
if (among_var == 0)
{
if (among_var == 0) {
break lab5;
}
ket = cursor;
@ -164,16 +155,14 @@ private boolean r_prelude() {
case 5:
{
int c = cursor + 2;
if (0 > c || c > limit)
{
if (0 > c || c > limit) {
break lab5;
}
cursor = c;
}
break;
case 6:
if (cursor >= limit)
{
if (cursor >= limit) {
break lab5;
}
cursor++;
@ -193,78 +182,73 @@ private boolean r_mark_regions() {
int v_1 = cursor;
{
int c = cursor + 3;
if (0 > c || c > limit)
{
if (0 > c || c > limit) {
return false;
}
cursor = c;
}
I_x = cursor;
cursor = v_1;
golab0: while(true)
{
lab1: {
if (!(in_grouping(g_v, 97, 252)))
golab0:
while (true) {
lab1:
{
if (!(in_grouping(g_v, 97, 252))) {
break lab1;
}
break golab0;
}
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
}
golab2: while(true)
{
lab3: {
if (!(out_grouping(g_v, 97, 252)))
golab2:
while (true) {
lab3:
{
if (!(out_grouping(g_v, 97, 252))) {
break lab3;
}
break golab2;
}
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
}
I_p1 = cursor;
lab4: {
if (!(I_p1 < I_x))
lab4:
{
if (!(I_p1 < I_x)) {
break lab4;
}
I_p1 = I_x;
}
golab5: while(true)
{
lab6: {
if (!(in_grouping(g_v, 97, 252)))
golab5:
while (true) {
lab6:
{
if (!(in_grouping(g_v, 97, 252))) {
break lab6;
}
break golab5;
}
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
}
golab7: while(true)
{
lab8: {
if (!(out_grouping(g_v, 97, 252)))
golab7:
while (true) {
lab8:
{
if (!(out_grouping(g_v, 97, 252))) {
break lab8;
}
break golab7;
}
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
@ -275,14 +259,13 @@ private boolean r_mark_regions() {
private boolean r_postlude() {
int among_var;
while(true)
{
while (true) {
int v_1 = cursor;
lab0: {
lab0:
{
bra = cursor;
among_var = find_among(a_1);
if (among_var == 0)
{
if (among_var == 0) {
break lab0;
}
ket = cursor;
@ -300,8 +283,7 @@ private boolean r_postlude() {
slice_from("o");
break;
case 5:
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -316,16 +298,14 @@ private boolean r_postlude() {
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
if (!(I_p1 <= cursor)) {
return false;
}
return true;
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
if (!(I_p2 <= cursor)) {
return false;
}
return true;
@ -334,16 +314,15 @@ private boolean r_R2() {
private boolean r_standard_suffix() {
int among_var;
int v_1 = limit - cursor;
lab0: {
lab0:
{
ket = cursor;
among_var = find_among_b(a_2);
if (among_var == 0)
{
if (among_var == 0) {
break lab0;
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
break lab0;
}
switch (among_var) {
@ -353,16 +332,15 @@ private boolean r_standard_suffix() {
case 2:
slice_del();
int v_2 = limit - cursor;
lab1: {
ket = cursor;
if (!(eq_s_b("s")))
lab1:
{
ket = cursor;
if (!(eq_s_b("s"))) {
cursor = limit - v_2;
break lab1;
}
bra = cursor;
if (!(eq_s_b("nis")))
{
if (!(eq_s_b("nis"))) {
cursor = limit - v_2;
break lab1;
}
@ -370,8 +348,7 @@ private boolean r_standard_suffix() {
}
break;
case 3:
if (!(in_grouping_b(g_s_ending, 98, 116)))
{
if (!(in_grouping_b(g_s_ending, 98, 116))) {
break lab0;
}
slice_del();
@ -380,16 +357,15 @@ private boolean r_standard_suffix() {
}
cursor = limit - v_1;
int v_3 = limit - cursor;
lab2: {
lab2:
{
ket = cursor;
among_var = find_among_b(a_3);
if (among_var == 0)
{
if (among_var == 0) {
break lab2;
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
break lab2;
}
switch (among_var) {
@ -397,14 +373,12 @@ private boolean r_standard_suffix() {
slice_del();
break;
case 2:
if (!(in_grouping_b(g_st_ending, 98, 116)))
{
if (!(in_grouping_b(g_st_ending, 98, 116))) {
break lab2;
}
{
int c = cursor - 3;
if (limit_backward > c || c > limit)
{
if (limit_backward > c || c > limit) {
break lab2;
}
cursor = c;
@ -415,35 +389,34 @@ private boolean r_standard_suffix() {
}
cursor = limit - v_3;
int v_4 = limit - cursor;
lab3: {
lab3:
{
ket = cursor;
among_var = find_among_b(a_5);
if (among_var == 0)
{
if (among_var == 0) {
break lab3;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
break lab3;
}
switch (among_var) {
case 1:
slice_del();
int v_5 = limit - cursor;
lab4: {
ket = cursor;
if (!(eq_s_b("ig")))
lab4:
{
ket = cursor;
if (!(eq_s_b("ig"))) {
cursor = limit - v_5;
break lab4;
}
bra = cursor;
{
int v_6 = limit - cursor;
lab5: {
if (!(eq_s_b("e")))
lab5:
{
if (!(eq_s_b("e"))) {
break lab5;
}
cursor = limit - v_5;
@ -451,8 +424,7 @@ private boolean r_standard_suffix() {
}
cursor = limit - v_6;
}
if (!r_R2())
{
if (!r_R2()) {
cursor = limit - v_5;
break lab4;
}
@ -462,9 +434,9 @@ private boolean r_standard_suffix() {
case 2:
{
int v_7 = limit - cursor;
lab6: {
if (!(eq_s_b("e")))
lab6:
{
if (!(eq_s_b("e"))) {
break lab6;
}
break lab3;
@ -476,27 +448,27 @@ private boolean r_standard_suffix() {
case 3:
slice_del();
int v_8 = limit - cursor;
lab7: {
ket = cursor;
lab8: {
int v_9 = limit - cursor;
lab9: {
if (!(eq_s_b("er")))
lab7:
{
ket = cursor;
lab8:
{
int v_9 = limit - cursor;
lab9:
{
if (!(eq_s_b("er"))) {
break lab9;
}
break lab8;
}
cursor = limit - v_9;
if (!(eq_s_b("en")))
{
if (!(eq_s_b("en"))) {
cursor = limit - v_8;
break lab7;
}
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
cursor = limit - v_8;
break lab7;
}
@ -506,16 +478,15 @@ private boolean r_standard_suffix() {
case 4:
slice_del();
int v_10 = limit - cursor;
lab10: {
ket = cursor;
if (find_among_b(a_4) == 0)
lab10:
{
ket = cursor;
if (find_among_b(a_4) == 0) {
cursor = limit - v_10;
break lab10;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
cursor = limit - v_10;
break lab10;
}
@ -555,8 +526,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return German2Stemmer.class.getName().hashCode();
}
}

248
lucene/analysis/common/src/java/org/tartarus/snowball/ext/GermanStemmer.java
View File

@ -6,17 +6,17 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class GermanStemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
private static final Among a_0[] = {
new Among("", -1, 5),
new Among("U", 0, 2),
new Among("Y", 0, 1),
@ -25,7 +25,7 @@ private final static Among a_0[] = {
new Among("\u00FC", 0, 2)
};
private final static Among a_1[] = {
private static final Among a_1[] = {
new Among("e", -1, 2),
new Among("em", -1, 1),
new Among("en", -1, 2),
@ -35,19 +35,13 @@ private final static Among a_1[] = {
new Among("es", 5, 2)
};
private final static Among a_2[] = {
new Among("en", -1, 1),
new Among("er", -1, 1),
new Among("st", -1, 2),
new Among("est", 2, 1)
private static final Among a_2[] = {
new Among("en", -1, 1), new Among("er", -1, 1), new Among("st", -1, 2), new Among("est", 2, 1)
};
private final static Among a_3[] = {
new Among("ig", -1, 1),
new Among("lich", -1, 1)
};
private static final Among a_3[] = {new Among("ig", -1, 1), new Among("lich", -1, 1)};
private final static Among a_4[] = {
private static final Among a_4[] = {
new Among("end", -1, 1),
new Among("ig", -1, 2),
new Among("ung", -1, 1),
@ -58,7 +52,9 @@ private final static Among a_4[] = {
new Among("keit", -1, 4)
};
private static final char g_v[] = {17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 32, 8 };
private static final char g_v[] = {
17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 32, 8
};
private static final char g_s_ending[] = {117, 30, 5};
@ -68,19 +64,19 @@ private int I_x;
private int I_p2;
private int I_p1;
private boolean r_prelude() {
int v_1 = cursor;
while(true)
{
while (true) {
int v_2 = cursor;
lab0: {
lab1: {
int v_3 = cursor;
lab2: {
bra = cursor;
if (!(eq_s("\u00DF")))
lab0:
{
lab1:
{
int v_3 = cursor;
lab2:
{
bra = cursor;
if (!(eq_s("\u00DF"))) {
break lab2;
}
ket = cursor;
@ -88,8 +84,7 @@ private boolean r_prelude() {
break lab1;
}
cursor = v_3;
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -100,42 +95,40 @@ private boolean r_prelude() {
break;
}
cursor = v_1;
while(true)
{
while (true) {
int v_4 = cursor;
lab3: {
golab4: while(true)
lab3:
{
golab4:
while (true) {
int v_5 = cursor;
lab5: {
if (!(in_grouping(g_v, 97, 252)))
lab5:
{
if (!(in_grouping(g_v, 97, 252))) {
break lab5;
}
bra = cursor;
lab6: {
int v_6 = cursor;
lab7: {
if (!(eq_s("u")))
lab6:
{
int v_6 = cursor;
lab7:
{
if (!(eq_s("u"))) {
break lab7;
}
ket = cursor;
if (!(in_grouping(g_v, 97, 252)))
{
if (!(in_grouping(g_v, 97, 252))) {
break lab7;
}
slice_from("U");
break lab6;
}
cursor = v_6;
if (!(eq_s("y")))
{
if (!(eq_s("y"))) {
break lab5;
}
ket = cursor;
if (!(in_grouping(g_v, 97, 252)))
{
if (!(in_grouping(g_v, 97, 252))) {
break lab5;
}
slice_from("Y");
@ -144,8 +137,7 @@ private boolean r_prelude() {
break golab4;
}
cursor = v_5;
if (cursor >= limit)
{
if (cursor >= limit) {
break lab3;
}
cursor++;
@ -164,78 +156,73 @@ private boolean r_mark_regions() {
int v_1 = cursor;
{
int c = cursor + 3;
if (0 > c || c > limit)
{
if (0 > c || c > limit) {
return false;
}
cursor = c;
}
I_x = cursor;
cursor = v_1;
golab0: while(true)
{
lab1: {
if (!(in_grouping(g_v, 97, 252)))
golab0:
while (true) {
lab1:
{
if (!(in_grouping(g_v, 97, 252))) {
break lab1;
}
break golab0;
}
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
}
golab2: while(true)
{
lab3: {
if (!(out_grouping(g_v, 97, 252)))
golab2:
while (true) {
lab3:
{
if (!(out_grouping(g_v, 97, 252))) {
break lab3;
}
break golab2;
}
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
}
I_p1 = cursor;
lab4: {
if (!(I_p1 < I_x))
lab4:
{
if (!(I_p1 < I_x)) {
break lab4;
}
I_p1 = I_x;
}
golab5: while(true)
{
lab6: {
if (!(in_grouping(g_v, 97, 252)))
golab5:
while (true) {
lab6:
{
if (!(in_grouping(g_v, 97, 252))) {
break lab6;
}
break golab5;
}
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
}
golab7: while(true)
{
lab8: {
if (!(out_grouping(g_v, 97, 252)))
golab7:
while (true) {
lab8:
{
if (!(out_grouping(g_v, 97, 252))) {
break lab8;
}
break golab7;
}
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
@ -246,14 +233,13 @@ private boolean r_mark_regions() {
private boolean r_postlude() {
int among_var;
while(true)
{
while (true) {
int v_1 = cursor;
lab0: {
lab0:
{
bra = cursor;
among_var = find_among(a_0);
if (among_var == 0)
{
if (among_var == 0) {
break lab0;
}
ket = cursor;
@ -271,8 +257,7 @@ private boolean r_postlude() {
slice_from("o");
break;
case 5:
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -287,16 +272,14 @@ private boolean r_postlude() {
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
if (!(I_p1 <= cursor)) {
return false;
}
return true;
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
if (!(I_p2 <= cursor)) {
return false;
}
return true;
@ -305,16 +288,15 @@ private boolean r_R2() {
private boolean r_standard_suffix() {
int among_var;
int v_1 = limit - cursor;
lab0: {
lab0:
{
ket = cursor;
among_var = find_among_b(a_1);
if (among_var == 0)
{
if (among_var == 0) {
break lab0;
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
break lab0;
}
switch (among_var) {
@ -324,16 +306,15 @@ private boolean r_standard_suffix() {
case 2:
slice_del();
int v_2 = limit - cursor;
lab1: {
ket = cursor;
if (!(eq_s_b("s")))
lab1:
{
ket = cursor;
if (!(eq_s_b("s"))) {
cursor = limit - v_2;
break lab1;
}
bra = cursor;
if (!(eq_s_b("nis")))
{
if (!(eq_s_b("nis"))) {
cursor = limit - v_2;
break lab1;
}
@ -341,8 +322,7 @@ private boolean r_standard_suffix() {
}
break;
case 3:
if (!(in_grouping_b(g_s_ending, 98, 116)))
{
if (!(in_grouping_b(g_s_ending, 98, 116))) {
break lab0;
}
slice_del();
@ -351,16 +331,15 @@ private boolean r_standard_suffix() {
}
cursor = limit - v_1;
int v_3 = limit - cursor;
lab2: {
lab2:
{
ket = cursor;
among_var = find_among_b(a_2);
if (among_var == 0)
{
if (among_var == 0) {
break lab2;
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
break lab2;
}
switch (among_var) {
@ -368,14 +347,12 @@ private boolean r_standard_suffix() {
slice_del();
break;
case 2:
if (!(in_grouping_b(g_st_ending, 98, 116)))
{
if (!(in_grouping_b(g_st_ending, 98, 116))) {
break lab2;
}
{
int c = cursor - 3;
if (limit_backward > c || c > limit)
{
if (limit_backward > c || c > limit) {
break lab2;
}
cursor = c;
@ -386,35 +363,34 @@ private boolean r_standard_suffix() {
}
cursor = limit - v_3;
int v_4 = limit - cursor;
lab3: {
lab3:
{
ket = cursor;
among_var = find_among_b(a_4);
if (among_var == 0)
{
if (among_var == 0) {
break lab3;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
break lab3;
}
switch (among_var) {
case 1:
slice_del();
int v_5 = limit - cursor;
lab4: {
ket = cursor;
if (!(eq_s_b("ig")))
lab4:
{
ket = cursor;
if (!(eq_s_b("ig"))) {
cursor = limit - v_5;
break lab4;
}
bra = cursor;
{
int v_6 = limit - cursor;
lab5: {
if (!(eq_s_b("e")))
lab5:
{
if (!(eq_s_b("e"))) {
break lab5;
}
cursor = limit - v_5;
@ -422,8 +398,7 @@ private boolean r_standard_suffix() {
}
cursor = limit - v_6;
}
if (!r_R2())
{
if (!r_R2()) {
cursor = limit - v_5;
break lab4;
}
@ -433,9 +408,9 @@ private boolean r_standard_suffix() {
case 2:
{
int v_7 = limit - cursor;
lab6: {
if (!(eq_s_b("e")))
lab6:
{
if (!(eq_s_b("e"))) {
break lab6;
}
break lab3;
@ -447,27 +422,27 @@ private boolean r_standard_suffix() {
case 3:
slice_del();
int v_8 = limit - cursor;
lab7: {
ket = cursor;
lab8: {
int v_9 = limit - cursor;
lab9: {
if (!(eq_s_b("er")))
lab7:
{
ket = cursor;
lab8:
{
int v_9 = limit - cursor;
lab9:
{
if (!(eq_s_b("er"))) {
break lab9;
}
break lab8;
}
cursor = limit - v_9;
if (!(eq_s_b("en")))
{
if (!(eq_s_b("en"))) {
cursor = limit - v_8;
break lab7;
}
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
cursor = limit - v_8;
break lab7;
}
@ -477,16 +452,15 @@ private boolean r_standard_suffix() {
case 4:
slice_del();
int v_10 = limit - cursor;
lab10: {
ket = cursor;
if (find_among_b(a_3) == 0)
lab10:
{
ket = cursor;
if (find_among_b(a_3) == 0) {
cursor = limit - v_10;
break lab10;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
cursor = limit - v_10;
break lab10;
}
@ -526,8 +500,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return GermanStemmer.class.getName().hashCode();
}
}

694
lucene/analysis/common/src/java/org/tartarus/snowball/ext/GreekStemmer.java
View File

File diff suppressed because it is too large Load Diff

27
lucene/analysis/common/src/java/org/tartarus/snowball/ext/HindiStemmer.java
View File

@ -6,17 +6,17 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class HindiStemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
private static final Among a_0[] = {
new Among("\u0906\u0901", -1, -1),
new Among("\u093E\u0901", -1, -1),
new Among("\u0907\u092F\u093E\u0901", 1, -1),
@ -155,10 +155,8 @@ private static final char g_consonant[] = {255, 255, 255, 255, 159, 0, 0, 0, 248
private int I_p;
public boolean r_CONSONANT() {
if (!(in_grouping_b(g_consonant, 2325, 2399)))
{
if (!(in_grouping_b(g_consonant, 2325, 2399))) {
return false;
}
return true;
@ -167,8 +165,7 @@ public boolean r_CONSONANT() {
@Override
public boolean stem() {
int v_1 = cursor;
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
@ -176,15 +173,13 @@ public boolean stem() {
cursor = v_1;
limit_backward = cursor;
cursor = limit;
if (cursor < I_p)
{
if (cursor < I_p) {
return false;
}
int v_3 = limit_backward;
limit_backward = I_p;
ket = cursor;
if (find_among_b(a_0) == 0)
{
if (find_among_b(a_0) == 0) {
limit_backward = v_3;
return false;
}
@ -204,8 +199,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return HindiStemmer.class.getName().hashCode();
}
}

188
lucene/analysis/common/src/java/org/tartarus/snowball/ext/HungarianStemmer.java
View File

@ -6,17 +6,17 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class HungarianStemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
private static final Among a_0[] = {
new Among("cs", -1, -1),
new Among("dzs", -1, -1),
new Among("gy", -1, -1),
@ -27,12 +27,9 @@ private final static Among a_0[] = {
new Among("zs", -1, -1)
};
private final static Among a_1[] = {
new Among("\u00E1", -1, 1),
new Among("\u00E9", -1, 2)
};
private static final Among a_1[] = {new Among("\u00E1", -1, 1), new Among("\u00E9", -1, 2)};
private final static Among a_2[] = {
private static final Among a_2[] = {
new Among("bb", -1, -1),
new Among("cc", -1, -1),
new Among("dd", -1, -1),
@ -58,12 +55,9 @@ private final static Among a_2[] = {
new Among("zz", -1, -1)
};
private final static Among a_3[] = {
new Among("al", -1, 1),
new Among("el", -1, 1)
};
private static final Among a_3[] = {new Among("al", -1, 1), new Among("el", -1, 1)};
private final static Among a_4[] = {
private static final Among a_4[] = {
new Among("ba", -1, -1),
new Among("ra", -1, -1),
new Among("be", -1, -1),
@ -110,13 +104,11 @@ private final static Among a_4[] = {
new Among("v\u00E9", -1, -1)
};
private final static Among a_5[] = {
new Among("\u00E1n", -1, 2),
new Among("\u00E9n", -1, 1),
new Among("\u00E1nk\u00E9nt", -1, 2)
private static final Among a_5[] = {
new Among("\u00E1n", -1, 2), new Among("\u00E9n", -1, 1), new Among("\u00E1nk\u00E9nt", -1, 2)
};
private final static Among a_6[] = {
private static final Among a_6[] = {
new Among("stul", -1, 1),
new Among("astul", 0, 1),
new Among("\u00E1stul", 0, 2),
@ -125,12 +117,9 @@ private final static Among a_6[] = {
new Among("\u00E9st\u00FCl", 3, 3)
};
private final static Among a_7[] = {
new Among("\u00E1", -1, 1),
new Among("\u00E9", -1, 1)
};
private static final Among a_7[] = {new Among("\u00E1", -1, 1), new Among("\u00E9", -1, 1)};
private final static Among a_8[] = {
private static final Among a_8[] = {
new Among("k", -1, 3),
new Among("ak", 0, 3),
new Among("ek", 0, 3),
@ -140,7 +129,7 @@ private final static Among a_8[] = {
new Among("\u00F6k", 0, 3)
};
private final static Among a_9[] = {
private static final Among a_9[] = {
new Among("\u00E9i", -1, 1),
new Among("\u00E1\u00E9i", 0, 3),
new Among("\u00E9\u00E9i", 0, 2),
@ -155,7 +144,7 @@ private final static Among a_9[] = {
new Among("\u00E9\u00E9", 3, 2)
};
private final static Among a_10[] = {
private static final Among a_10[] = {
new Among("a", -1, 1),
new Among("ja", 0, 1),
new Among("d", -1, 1),
@ -189,7 +178,7 @@ private final static Among a_10[] = {
new Among("\u00E9", -1, 3)
};
private final static Among a_11[] = {
private static final Among a_11[] = {
new Among("id", -1, 1),
new Among("aid", 0, 1),
new Among("jaid", 1, 1),
@ -234,50 +223,52 @@ private final static Among a_11[] = {
new Among("\u00E9im", 35, 3)
};
private static final char g_v[] = {17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 17, 36, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1 };
private static final char g_v[] = {
17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 17, 36, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
1, 0, 0, 0, 1
};
private int I_p1;
private boolean r_mark_regions() {
I_p1 = limit;
lab0: {
int v_1 = cursor;
lab1: {
if (!(in_grouping(g_v, 97, 369)))
lab0:
{
int v_1 = cursor;
lab1:
{
if (!(in_grouping(g_v, 97, 369))) {
break lab1;
}
golab2: while(true)
{
golab2:
while (true) {
int v_2 = cursor;
lab3: {
if (!(out_grouping(g_v, 97, 369)))
lab3:
{
if (!(out_grouping(g_v, 97, 369))) {
break lab3;
}
cursor = v_2;
break golab2;
}
cursor = v_2;
if (cursor >= limit)
{
if (cursor >= limit) {
break lab1;
}
cursor++;
}
lab4: {
int v_3 = cursor;
lab5: {
if (find_among(a_0) == 0)
lab4:
{
int v_3 = cursor;
lab5:
{
if (find_among(a_0) == 0) {
break lab5;
}
break lab4;
}
cursor = v_3;
if (cursor >= limit)
{
if (cursor >= limit) {
break lab1;
}
cursor++;
@ -286,21 +277,19 @@ private boolean r_mark_regions() {
break lab0;
}
cursor = v_1;
if (!(out_grouping(g_v, 97, 369)))
{
if (!(out_grouping(g_v, 97, 369))) {
return false;
}
golab6: while(true)
{
lab7: {
if (!(in_grouping(g_v, 97, 369)))
golab6:
while (true) {
lab7:
{
if (!(in_grouping(g_v, 97, 369))) {
break lab7;
}
break golab6;
}
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
@ -311,8 +300,7 @@ private boolean r_mark_regions() {
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
if (!(I_p1 <= cursor)) {
return false;
}
return true;
@ -322,13 +310,11 @@ private boolean r_v_ending() {
int among_var;
ket = cursor;
among_var = find_among_b(a_1);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
return false;
}
switch (among_var) {
@ -344,8 +330,7 @@ private boolean r_v_ending() {
private boolean r_double() {
int v_1 = limit - cursor;
if (find_among_b(a_2) == 0)
{
if (find_among_b(a_2) == 0) {
return false;
}
cursor = limit - v_1;
@ -353,16 +338,14 @@ private boolean r_double() {
}
private boolean r_undouble() {
if (cursor <= limit_backward)
{
if (cursor <= limit_backward) {
return false;
}
cursor--;
ket = cursor;
{
int c = cursor - 1;
if (limit_backward > c || c > limit)
{
if (limit_backward > c || c > limit) {
return false;
}
cursor = c;
@ -374,22 +357,18 @@ private boolean r_undouble() {
private boolean r_instrum() {
ket = cursor;
if (find_among_b(a_3) == 0)
{
if (find_among_b(a_3) == 0) {
return false;
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
return false;
}
if (!r_double())
{
if (!r_double()) {
return false;
}
slice_del();
if (!r_undouble())
{
if (!r_undouble()) {
return false;
}
return true;
@ -397,18 +376,15 @@ private boolean r_instrum() {
private boolean r_case() {
ket = cursor;
if (find_among_b(a_4) == 0)
{
if (find_among_b(a_4) == 0) {
return false;
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
return false;
}
slice_del();
if (!r_v_ending())
{
if (!r_v_ending()) {
return false;
}
return true;
@ -418,13 +394,11 @@ private boolean r_case_special() {
int among_var;
ket = cursor;
among_var = find_among_b(a_5);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
return false;
}
switch (among_var) {
@ -442,13 +416,11 @@ private boolean r_case_other() {
int among_var;
ket = cursor;
among_var = find_among_b(a_6);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
return false;
}
switch (among_var) {
@ -467,22 +439,18 @@ private boolean r_case_other() {
private boolean r_factive() {
ket = cursor;
if (find_among_b(a_7) == 0)
{
if (find_among_b(a_7) == 0) {
return false;
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
return false;
}
if (!r_double())
{
if (!r_double()) {
return false;
}
slice_del();
if (!r_undouble())
{
if (!r_undouble()) {
return false;
}
return true;
@ -492,13 +460,11 @@ private boolean r_plural() {
int among_var;
ket = cursor;
among_var = find_among_b(a_8);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
return false;
}
switch (among_var) {
@ -519,13 +485,11 @@ private boolean r_owned() {
int among_var;
ket = cursor;
among_var = find_among_b(a_9);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
return false;
}
switch (among_var) {
@ -546,13 +510,11 @@ private boolean r_sing_owner() {
int among_var;
ket = cursor;
among_var = find_among_b(a_10);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
return false;
}
switch (among_var) {
@ -573,13 +535,11 @@ private boolean r_plur_owner() {
int among_var;
ket = cursor;
among_var = find_among_b(a_11);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
return false;
}
switch (among_var) {
@ -643,8 +603,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return HungarianStemmer.class.getName().hashCode();
}
}

151
lucene/analysis/common/src/java/org/tartarus/snowball/ext/IndonesianStemmer.java
View File

@ -6,35 +6,31 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class IndonesianStemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
new Among("kah", -1, 1),
new Among("lah", -1, 1),
new Among("pun", -1, 1)
private static final Among a_0[] = {
new Among("kah", -1, 1), new Among("lah", -1, 1), new Among("pun", -1, 1)
};
private final static Among a_1[] = {
new Among("nya", -1, 1),
new Among("ku", -1, 1),
new Among("mu", -1, 1)
private static final Among a_1[] = {
new Among("nya", -1, 1), new Among("ku", -1, 1), new Among("mu", -1, 1)
};
private final static Among a_2[] = {
private static final Among a_2[] = {
new Among("i", -1, 1, "r_SUFFIX_I_OK", methodObject),
new Among("an", -1, 1, "r_SUFFIX_AN_OK", methodObject),
new Among("kan", 1, 1, "r_SUFFIX_KAN_OK", methodObject)
};
private final static Among a_3[] = {
private static final Among a_3[] = {
new Among("di", -1, 1),
new Among("ke", -1, 2),
new Among("me", -1, 1),
@ -49,7 +45,7 @@ private final static Among a_3[] = {
new Among("ter", -1, 1)
};
private final static Among a_4[] = {
private static final Among a_4[] = {
new Among("be", -1, 3, "r_KER", methodObject),
new Among("belajar", 0, 4),
new Among("ber", 0, 3),
@ -63,11 +59,9 @@ private static final char g_vowel[] = {17, 65, 16 };
private int I_prefix;
private int I_measure;
private boolean r_remove_particle() {
ket = cursor;
if (find_among_b(a_0) == 0)
{
if (find_among_b(a_0) == 0) {
return false;
}
bra = cursor;
@ -78,8 +72,7 @@ private boolean r_remove_particle() {
private boolean r_remove_possessive_pronoun() {
ket = cursor;
if (find_among_b(a_1) == 0)
{
if (find_among_b(a_1) == 0) {
return false;
}
bra = cursor;
@ -89,35 +82,31 @@ private boolean r_remove_possessive_pronoun() {
}
public boolean r_SUFFIX_KAN_OK() {
if (!(I_prefix != 3))
{
if (!(I_prefix != 3)) {
return false;
}
if (!(I_prefix != 2))
{
if (!(I_prefix != 2)) {
return false;
}
return true;
}
public boolean r_SUFFIX_AN_OK() {
if (!(I_prefix != 1))
{
if (!(I_prefix != 1)) {
return false;
}
return true;
}
public boolean r_SUFFIX_I_OK() {
if (!(I_prefix <= 2))
{
if (!(I_prefix <= 2)) {
return false;
}
{
int v_1 = limit - cursor;
lab0: {
if (!(eq_s_b("s")))
lab0:
{
if (!(eq_s_b("s"))) {
break lab0;
}
return false;
@ -129,8 +118,7 @@ public boolean r_SUFFIX_I_OK() {
private boolean r_remove_suffix() {
ket = cursor;
if (find_among_b(a_2) == 0)
{
if (find_among_b(a_2) == 0) {
return false;
}
bra = cursor;
@ -140,20 +128,17 @@ private boolean r_remove_suffix() {
}
public boolean r_VOWEL() {
if (!(in_grouping(g_vowel, 97, 117)))
{
if (!(in_grouping(g_vowel, 97, 117))) {
return false;
}
return true;
}
public boolean r_KER() {
if (!(out_grouping(g_vowel, 97, 117)))
{
if (!(out_grouping(g_vowel, 97, 117))) {
return false;
}
if (!(eq_s("er")))
{
if (!(eq_s("er"))) {
return false;
}
return true;
@ -163,8 +148,7 @@ private boolean r_remove_first_order_prefix() {
int among_var;
bra = cursor;
among_var = find_among(a_3);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
ket = cursor;
@ -192,12 +176,13 @@ private boolean r_remove_first_order_prefix() {
case 5:
I_prefix = 1;
I_measure -= 1;
lab0: {
int v_1 = cursor;
lab1: {
int v_2 = cursor;
if (!(in_grouping(g_vowel, 97, 117)))
lab0:
{
int v_1 = cursor;
lab1:
{
int v_2 = cursor;
if (!(in_grouping(g_vowel, 97, 117))) {
break lab1;
}
cursor = v_2;
@ -211,12 +196,13 @@ private boolean r_remove_first_order_prefix() {
case 6:
I_prefix = 3;
I_measure -= 1;
lab2: {
int v_3 = cursor;
lab3: {
int v_4 = cursor;
if (!(in_grouping(g_vowel, 97, 117)))
lab2:
{
int v_3 = cursor;
lab3:
{
int v_4 = cursor;
if (!(in_grouping(g_vowel, 97, 117))) {
break lab3;
}
cursor = v_4;
@ -235,8 +221,7 @@ private boolean r_remove_second_order_prefix() {
int among_var;
bra = cursor;
among_var = find_among(a_4);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
ket = cursor;
@ -268,22 +253,22 @@ private boolean r_remove_second_order_prefix() {
public boolean stem() {
I_measure = 0;
int v_1 = cursor;
lab0: {
while(true)
lab0:
{
while (true) {
int v_2 = cursor;
lab1: {
golab2: while(true)
lab1:
{
lab3: {
if (!(in_grouping(g_vowel, 97, 117)))
golab2:
while (true) {
lab3:
{
if (!(in_grouping(g_vowel, 97, 117))) {
break lab3;
}
break golab2;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab1;
}
cursor++;
@ -296,8 +281,7 @@ public boolean stem() {
}
}
cursor = v_1;
if (!(I_measure > 2))
{
if (!(I_measure > 2)) {
return false;
}
I_prefix = 0;
@ -306,47 +290,43 @@ public boolean stem() {
int v_4 = limit - cursor;
r_remove_particle();
cursor = limit - v_4;
if (!(I_measure > 2))
{
if (!(I_measure > 2)) {
return false;
}
int v_5 = limit - cursor;
r_remove_possessive_pronoun();
cursor = limit - v_5;
cursor = limit_backward;
if (!(I_measure > 2))
{
if (!(I_measure > 2)) {
return false;
}
lab4: {
int v_6 = cursor;
lab5: {
int v_7 = cursor;
if (!r_remove_first_order_prefix())
lab4:
{
int v_6 = cursor;
lab5:
{
int v_7 = cursor;
if (!r_remove_first_order_prefix()) {
break lab5;
}
int v_8 = cursor;
lab6: {
int v_9 = cursor;
if (!(I_measure > 2))
lab6:
{
int v_9 = cursor;
if (!(I_measure > 2)) {
break lab6;
}
limit_backward = cursor;
cursor = limit;
if (!r_remove_suffix())
{
if (!r_remove_suffix()) {
break lab6;
}
cursor = limit_backward;
cursor = v_9;
if (!(I_measure > 2))
{
if (!(I_measure > 2)) {
break lab6;
}
if (!r_remove_second_order_prefix())
{
if (!r_remove_second_order_prefix()) {
break lab6;
}
}
@ -359,15 +339,14 @@ public boolean stem() {
r_remove_second_order_prefix();
cursor = v_10;
int v_11 = cursor;
lab7: {
if (!(I_measure > 2))
lab7:
{
if (!(I_measure > 2)) {
break lab7;
}
limit_backward = cursor;
cursor = limit;
if (!r_remove_suffix())
{
if (!r_remove_suffix()) {
break lab7;
}
cursor = limit_backward;
@ -386,8 +365,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return IndonesianStemmer.class.getName().hashCode();
}
}

118
lucene/analysis/common/src/java/org/tartarus/snowball/ext/IrishStemmer.java
View File

@ -6,17 +6,17 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class IrishStemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
private static final Among a_0[] = {
new Among("b'", -1, 1),
new Among("bh", -1, 4),
new Among("bhf", 1, 2),
@ -43,7 +43,7 @@ private final static Among a_0[] = {
new Among("ts", -1, 3)
};
private final static Among a_1[] = {
private static final Among a_1[] = {
new Among("\u00EDochta", -1, 1),
new Among("a\u00EDochta", 0, 1),
new Among("ire", -1, 2),
@ -62,7 +62,7 @@ private final static Among a_1[] = {
new Among("air\u00ED", 14, 2)
};
private final static Among a_2[] = {
private static final Among a_2[] = {
new Among("\u00F3ideacha", -1, 6),
new Among("patacha", -1, 5),
new Among("achta", -1, 1),
@ -90,7 +90,7 @@ private final static Among a_2[] = {
new Among("grafa\u00EDochta\u00ED", -1, 4)
};
private final static Among a_3[] = {
private static final Among a_3[] = {
new Among("imid", -1, 1),
new Among("aimid", 0, 1),
new Among("\u00EDmid", -1, 1),
@ -105,30 +105,31 @@ private final static Among a_3[] = {
new Among("tar", -1, 2)
};
private static final char g_v[] = {17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 17, 4, 2 };
private static final char g_v[] = {
17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 17, 4, 2
};
private int I_p2;
private int I_p1;
private int I_pV;
private boolean r_mark_regions() {
I_pV = limit;
I_p1 = limit;
I_p2 = limit;
int v_1 = cursor;
lab0: {
golab1: while(true)
lab0:
{
lab2: {
if (!(in_grouping(g_v, 97, 250)))
golab1:
while (true) {
lab2:
{
if (!(in_grouping(g_v, 97, 250))) {
break lab2;
}
break golab1;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -137,64 +138,61 @@ private boolean r_mark_regions() {
}
cursor = v_1;
int v_3 = cursor;
lab3: {
golab4: while(true)
lab3:
{
lab5: {
if (!(in_grouping(g_v, 97, 250)))
golab4:
while (true) {
lab5:
{
if (!(in_grouping(g_v, 97, 250))) {
break lab5;
}
break golab4;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab3;
}
cursor++;
}
golab6: while(true)
{
lab7: {
if (!(out_grouping(g_v, 97, 250)))
golab6:
while (true) {
lab7:
{
if (!(out_grouping(g_v, 97, 250))) {
break lab7;
}
break golab6;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab3;
}
cursor++;
}
I_p1 = cursor;
golab8: while(true)
{
lab9: {
if (!(in_grouping(g_v, 97, 250)))
golab8:
while (true) {
lab9:
{
if (!(in_grouping(g_v, 97, 250))) {
break lab9;
}
break golab8;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab3;
}
cursor++;
}
golab10: while(true)
{
lab11: {
if (!(out_grouping(g_v, 97, 250)))
golab10:
while (true) {
lab11:
{
if (!(out_grouping(g_v, 97, 250))) {
break lab11;
}
break golab10;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab3;
}
cursor++;
@ -209,8 +207,7 @@ private boolean r_initial_morph() {
int among_var;
bra = cursor;
among_var = find_among(a_0);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
ket = cursor;
@ -250,24 +247,21 @@ private boolean r_initial_morph() {
}
private boolean r_RV() {
if (!(I_pV <= cursor))
{
if (!(I_pV <= cursor)) {
return false;
}
return true;
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
if (!(I_p1 <= cursor)) {
return false;
}
return true;
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
if (!(I_p2 <= cursor)) {
return false;
}
return true;
@ -277,22 +271,19 @@ private boolean r_noun_sfx() {
int among_var;
ket = cursor;
among_var = find_among_b(a_1);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
switch (among_var) {
case 1:
if (!r_R1())
{
if (!r_R1()) {
return false;
}
slice_del();
break;
case 2:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_del();
@ -305,15 +296,13 @@ private boolean r_deriv() {
int among_var;
ket = cursor;
among_var = find_among_b(a_2);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
switch (among_var) {
case 1:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_del();
@ -341,22 +330,19 @@ private boolean r_verb_sfx() {
int among_var;
ket = cursor;
among_var = find_among_b(a_3);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
switch (among_var) {
case 1:
if (!r_RV())
{
if (!r_RV()) {
return false;
}
slice_del();
break;
case 2:
if (!r_R1())
{
if (!r_R1()) {
return false;
}
slice_del();
@ -395,8 +381,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return IrishStemmer.class.getName().hashCode();
}
}

366
lucene/analysis/common/src/java/org/tartarus/snowball/ext/ItalianStemmer.java
View File

@ -6,17 +6,17 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class ItalianStemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
private static final Among a_0[] = {
new Among("", -1, 7),
new Among("qu", 0, 6),
new Among("\u00E1", 0, 1),
@ -26,13 +26,11 @@ private final static Among a_0[] = {
new Among("\u00FA", 0, 5)
};
private final static Among a_1[] = {
new Among("", -1, 3),
new Among("I", 0, 1),
new Among("U", 0, 2)
private static final Among a_1[] = {
new Among("", -1, 3), new Among("I", 0, 1), new Among("U", 0, 2)
};
private final static Among a_2[] = {
private static final Among a_2[] = {
new Among("la", -1, -1),
new Among("cela", 0, -1),
new Among("gliela", 0, -1),
@ -72,7 +70,7 @@ private final static Among a_2[] = {
new Among("velo", 31, -1)
};
private final static Among a_3[] = {
private static final Among a_3[] = {
new Among("ando", -1, 1),
new Among("endo", -1, 1),
new Among("ar", -1, 2),
@ -80,20 +78,18 @@ private final static Among a_3[] = {
new Among("ir", -1, 2)
};
private final static Among a_4[] = {
private static final Among a_4[] = {
new Among("ic", -1, -1),
new Among("abil", -1, -1),
new Among("os", -1, -1),
new Among("iv", -1, 1)
};
private final static Among a_5[] = {
new Among("ic", -1, 1),
new Among("abil", -1, 1),
new Among("iv", -1, 1)
private static final Among a_5[] = {
new Among("ic", -1, 1), new Among("abil", -1, 1), new Among("iv", -1, 1)
};
private final static Among a_6[] = {
private static final Among a_6[] = {
new Among("ica", -1, 1),
new Among("logia", -1, 3),
new Among("osa", -1, 1),
@ -147,7 +143,7 @@ private final static Among a_6[] = {
new Among("ist\u00EC", -1, 1)
};
private final static Among a_7[] = {
private static final Among a_7[] = {
new Among("isca", -1, 1),
new Among("enda", -1, 1),
new Among("ata", -1, 1),
@ -237,9 +233,13 @@ private final static Among a_7[] = {
new Among("ir\u00F2", -1, 1)
};
private static final char g_v[] = {17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128, 128, 8, 2, 1 };
private static final char g_v[] = {
17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128, 128, 8, 2, 1
};
private static final char g_AEIO[] = {17, 65, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128, 128, 8, 2 };
private static final char g_AEIO[] = {
17, 65, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128, 128, 8, 2
};
private static final char g_CG[] = {17};
@ -247,18 +247,16 @@ private int I_p2;
private int I_p1;
private int I_pV;
private boolean r_prelude() {
int among_var;
int v_1 = cursor;
while(true)
{
while (true) {
int v_2 = cursor;
lab0: {
lab0:
{
bra = cursor;
among_var = find_among(a_0);
if (among_var == 0)
{
if (among_var == 0) {
break lab0;
}
ket = cursor;
@ -282,8 +280,7 @@ private boolean r_prelude() {
slice_from("qU");
break;
case 7:
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -295,42 +292,40 @@ private boolean r_prelude() {
break;
}
cursor = v_1;
while(true)
{
while (true) {
int v_3 = cursor;
lab1: {
golab2: while(true)
lab1:
{
golab2:
while (true) {
int v_4 = cursor;
lab3: {
if (!(in_grouping(g_v, 97, 249)))
lab3:
{
if (!(in_grouping(g_v, 97, 249))) {
break lab3;
}
bra = cursor;
lab4: {
int v_5 = cursor;
lab5: {
if (!(eq_s("u")))
lab4:
{
int v_5 = cursor;
lab5:
{
if (!(eq_s("u"))) {
break lab5;
}
ket = cursor;
if (!(in_grouping(g_v, 97, 249)))
{
if (!(in_grouping(g_v, 97, 249))) {
break lab5;
}
slice_from("U");
break lab4;
}
cursor = v_5;
if (!(eq_s("i")))
{
if (!(eq_s("i"))) {
break lab3;
}
ket = cursor;
if (!(in_grouping(g_v, 97, 249)))
{
if (!(in_grouping(g_v, 97, 249))) {
break lab3;
}
slice_from("I");
@ -339,8 +334,7 @@ private boolean r_prelude() {
break golab2;
}
cursor = v_4;
if (cursor >= limit)
{
if (cursor >= limit) {
break lab1;
}
cursor++;
@ -358,32 +352,34 @@ private boolean r_mark_regions() {
I_p1 = limit;
I_p2 = limit;
int v_1 = cursor;
lab0: {
lab1: {
int v_2 = cursor;
lab2: {
if (!(in_grouping(g_v, 97, 249)))
lab0:
{
lab1:
{
int v_2 = cursor;
lab2:
{
if (!(in_grouping(g_v, 97, 249))) {
break lab2;
}
lab3: {
int v_3 = cursor;
lab4: {
if (!(out_grouping(g_v, 97, 249)))
lab3:
{
int v_3 = cursor;
lab4:
{
if (!(out_grouping(g_v, 97, 249))) {
break lab4;
}
golab5: while(true)
{
lab6: {
if (!(in_grouping(g_v, 97, 249)))
golab5:
while (true) {
lab6:
{
if (!(in_grouping(g_v, 97, 249))) {
break lab6;
}
break golab5;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab4;
}
cursor++;
@ -391,21 +387,19 @@ private boolean r_mark_regions() {
break lab3;
}
cursor = v_3;
if (!(in_grouping(g_v, 97, 249)))
{
if (!(in_grouping(g_v, 97, 249))) {
break lab2;
}
golab7: while(true)
{
lab8: {
if (!(out_grouping(g_v, 97, 249)))
golab7:
while (true) {
lab8:
{
if (!(out_grouping(g_v, 97, 249))) {
break lab8;
}
break golab7;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab2;
}
cursor++;
@ -414,28 +408,27 @@ private boolean r_mark_regions() {
break lab1;
}
cursor = v_2;
if (!(out_grouping(g_v, 97, 249)))
{
if (!(out_grouping(g_v, 97, 249))) {
break lab0;
}
lab9: {
int v_6 = cursor;
lab10: {
if (!(out_grouping(g_v, 97, 249)))
lab9:
{
int v_6 = cursor;
lab10:
{
if (!(out_grouping(g_v, 97, 249))) {
break lab10;
}
golab11: while(true)
{
lab12: {
if (!(in_grouping(g_v, 97, 249)))
golab11:
while (true) {
lab12:
{
if (!(in_grouping(g_v, 97, 249))) {
break lab12;
}
break golab11;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab10;
}
cursor++;
@ -443,12 +436,10 @@ private boolean r_mark_regions() {
break lab9;
}
cursor = v_6;
if (!(in_grouping(g_v, 97, 249)))
{
if (!(in_grouping(g_v, 97, 249))) {
break lab0;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -458,64 +449,61 @@ private boolean r_mark_regions() {
}
cursor = v_1;
int v_8 = cursor;
lab13: {
golab14: while(true)
lab13:
{
lab15: {
if (!(in_grouping(g_v, 97, 249)))
golab14:
while (true) {
lab15:
{
if (!(in_grouping(g_v, 97, 249))) {
break lab15;
}
break golab14;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab13;
}
cursor++;
}
golab16: while(true)
{
lab17: {
if (!(out_grouping(g_v, 97, 249)))
golab16:
while (true) {
lab17:
{
if (!(out_grouping(g_v, 97, 249))) {
break lab17;
}
break golab16;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab13;
}
cursor++;
}
I_p1 = cursor;
golab18: while(true)
{
lab19: {
if (!(in_grouping(g_v, 97, 249)))
golab18:
while (true) {
lab19:
{
if (!(in_grouping(g_v, 97, 249))) {
break lab19;
}
break golab18;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab13;
}
cursor++;
}
golab20: while(true)
{
lab21: {
if (!(out_grouping(g_v, 97, 249)))
golab20:
while (true) {
lab21:
{
if (!(out_grouping(g_v, 97, 249))) {
break lab21;
}
break golab20;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab13;
}
cursor++;
@ -528,14 +516,13 @@ private boolean r_mark_regions() {
private boolean r_postlude() {
int among_var;
while(true)
{
while (true) {
int v_1 = cursor;
lab0: {
lab0:
{
bra = cursor;
among_var = find_among(a_1);
if (among_var == 0)
{
if (among_var == 0) {
break lab0;
}
ket = cursor;
@ -547,8 +534,7 @@ private boolean r_postlude() {
slice_from("u");
break;
case 3:
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -563,24 +549,21 @@ private boolean r_postlude() {
}
private boolean r_RV() {
if (!(I_pV <= cursor))
{
if (!(I_pV <= cursor)) {
return false;
}
return true;
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
if (!(I_p1 <= cursor)) {
return false;
}
return true;
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
if (!(I_p2 <= cursor)) {
return false;
}
return true;
@ -589,18 +572,15 @@ private boolean r_R2() {
private boolean r_attached_pronoun() {
int among_var;
ket = cursor;
if (find_among_b(a_2) == 0)
{
if (find_among_b(a_2) == 0) {
return false;
}
bra = cursor;
among_var = find_among_b(a_3);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
if (!r_RV())
{
if (!r_RV()) {
return false;
}
switch (among_var) {
@ -618,36 +598,32 @@ private boolean r_standard_suffix() {
int among_var;
ket = cursor;
among_var = find_among_b(a_6);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
switch (among_var) {
case 1:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_del();
break;
case 2:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_del();
int v_1 = limit - cursor;
lab0: {
ket = cursor;
if (!(eq_s_b("ic")))
lab0:
{
ket = cursor;
if (!(eq_s_b("ic"))) {
cursor = limit - v_1;
break lab0;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
cursor = limit - v_1;
break lab0;
}
@ -655,51 +631,45 @@ private boolean r_standard_suffix() {
}
break;
case 3:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_from("log");
break;
case 4:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_from("u");
break;
case 5:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_from("ente");
break;
case 6:
if (!r_RV())
{
if (!r_RV()) {
return false;
}
slice_del();
break;
case 7:
if (!r_R1())
{
if (!r_R1()) {
return false;
}
slice_del();
int v_2 = limit - cursor;
lab1: {
lab1:
{
ket = cursor;
among_var = find_among_b(a_4);
if (among_var == 0)
{
if (among_var == 0) {
cursor = limit - v_2;
break lab1;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
cursor = limit - v_2;
break lab1;
}
@ -707,14 +677,12 @@ private boolean r_standard_suffix() {
switch (among_var) {
case 1:
ket = cursor;
if (!(eq_s_b("at")))
{
if (!(eq_s_b("at"))) {
cursor = limit - v_2;
break lab1;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
cursor = limit - v_2;
break lab1;
}
@ -724,22 +692,20 @@ private boolean r_standard_suffix() {
}
break;
case 8:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_del();
int v_3 = limit - cursor;
lab2: {
ket = cursor;
if (find_among_b(a_5) == 0)
lab2:
{
ket = cursor;
if (find_among_b(a_5) == 0) {
cursor = limit - v_3;
break lab2;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
cursor = limit - v_3;
break lab2;
}
@ -747,35 +713,31 @@ private boolean r_standard_suffix() {
}
break;
case 9:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_del();
int v_4 = limit - cursor;
lab3: {
ket = cursor;
if (!(eq_s_b("at")))
lab3:
{
ket = cursor;
if (!(eq_s_b("at"))) {
cursor = limit - v_4;
break lab3;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
cursor = limit - v_4;
break lab3;
}
slice_del();
ket = cursor;
if (!(eq_s_b("ic")))
{
if (!(eq_s_b("ic"))) {
cursor = limit - v_4;
break lab3;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
cursor = limit - v_4;
break lab3;
}
@ -787,15 +749,13 @@ private boolean r_standard_suffix() {
}
private boolean r_verb_suffix() {
if (cursor < I_pV)
{
if (cursor < I_pV) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_pV;
ket = cursor;
if (find_among_b(a_7) == 0)
{
if (find_among_b(a_7) == 0) {
limit_backward = v_2;
return false;
}
@ -807,50 +767,45 @@ private boolean r_verb_suffix() {
private boolean r_vowel_suffix() {
int v_1 = limit - cursor;
lab0: {
ket = cursor;
if (!(in_grouping_b(g_AEIO, 97, 242)))
lab0:
{
ket = cursor;
if (!(in_grouping_b(g_AEIO, 97, 242))) {
cursor = limit - v_1;
break lab0;
}
bra = cursor;
if (!r_RV())
{
if (!r_RV()) {
cursor = limit - v_1;
break lab0;
}
slice_del();
ket = cursor;
if (!(eq_s_b("i")))
{
if (!(eq_s_b("i"))) {
cursor = limit - v_1;
break lab0;
}
bra = cursor;
if (!r_RV())
{
if (!r_RV()) {
cursor = limit - v_1;
break lab0;
}
slice_del();
}
int v_2 = limit - cursor;
lab1: {
ket = cursor;
if (!(eq_s_b("h")))
lab1:
{
ket = cursor;
if (!(eq_s_b("h"))) {
cursor = limit - v_2;
break lab1;
}
bra = cursor;
if (!(in_grouping_b(g_CG, 99, 103)))
{
if (!(in_grouping_b(g_CG, 99, 103))) {
cursor = limit - v_2;
break lab1;
}
if (!r_RV())
{
if (!r_RV()) {
cursor = limit - v_2;
break lab1;
}
@ -871,19 +826,20 @@ public boolean stem() {
r_attached_pronoun();
cursor = limit - v_3;
int v_4 = limit - cursor;
lab0: {
lab1: {
int v_5 = limit - cursor;
lab2: {
if (!r_standard_suffix())
lab0:
{
lab1:
{
int v_5 = limit - cursor;
lab2:
{
if (!r_standard_suffix()) {
break lab2;
}
break lab1;
}
cursor = limit - v_5;
if (!r_verb_suffix())
{
if (!r_verb_suffix()) {
break lab0;
}
}
@ -908,8 +864,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return ItalianStemmer.class.getName().hashCode();
}
}

730
lucene/analysis/common/src/java/org/tartarus/snowball/ext/KpStemmer.java
View File

File diff suppressed because it is too large Load Diff

103
lucene/analysis/common/src/java/org/tartarus/snowball/ext/LithuanianStemmer.java
View File

@ -6,17 +6,17 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class LithuanianStemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
private static final Among a_0[] = {
new Among("a", -1, -1),
new Among("ia", 0, -1),
new Among("eria", 1, -1),
@ -223,7 +223,7 @@ private final static Among a_0[] = {
new Among("er\u0173", 201, -1)
};
private final static Among a_1[] = {
private static final Among a_1[] = {
new Among("ing", -1, -1),
new Among("aj", -1, -1),
new Among("iaj", 1, -1),
@ -288,7 +288,7 @@ private final static Among a_1[] = {
new Among("\u0117j\u0119", 60, -1)
};
private final static Among a_2[] = {
private static final Among a_2[] = {
new Among("ojime", -1, 7),
new Among("\u0117jime", -1, 3),
new Among("avime", -1, 6),
@ -302,45 +302,38 @@ private final static Among a_2[] = {
new Among("esiu", -1, 4)
};
private final static Among a_3[] = {
new Among("\u010D", -1, 1),
new Among("d\u017E", -1, 2)
};
private static final Among a_3[] = {new Among("\u010D", -1, 1), new Among("d\u017E", -1, 2)};
private final static Among a_4[] = {
new Among("gd", -1, 1)
};
private static final Among a_4[] = {new Among("gd", -1, 1)};
private static final char g_v[] = {17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 0, 64, 1, 0, 64, 0, 0, 0, 0, 0, 0, 0, 4, 4 };
private static final char g_v[] = {
17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 0, 64, 1, 0, 64, 0, 0, 0, 0,
0, 0, 0, 4, 4
};
private int I_p1;
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
if (!(I_p1 <= cursor)) {
return false;
}
return true;
}
private boolean r_step1() {
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_p1;
ket = cursor;
if (find_among_b(a_0) == 0)
{
if (find_among_b(a_0) == 0) {
limit_backward = v_2;
return false;
}
bra = cursor;
limit_backward = v_2;
if (!r_R1())
{
if (!r_R1()) {
return false;
}
slice_del();
@ -348,19 +341,17 @@ private boolean r_step1() {
}
private boolean r_step2() {
while(true)
{
while (true) {
int v_1 = limit - cursor;
lab0: {
if (cursor < I_p1)
lab0:
{
if (cursor < I_p1) {
break lab0;
}
int v_3 = limit_backward;
limit_backward = I_p1;
ket = cursor;
if (find_among_b(a_1) == 0)
{
if (find_among_b(a_1) == 0) {
limit_backward = v_3;
break lab0;
}
@ -379,8 +370,7 @@ private boolean r_fix_conflicts() {
int among_var;
ket = cursor;
among_var = find_among_b(a_2);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
@ -417,8 +407,7 @@ private boolean r_fix_chdz() {
int among_var;
ket = cursor;
among_var = find_among_b(a_3);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
@ -435,8 +424,7 @@ private boolean r_fix_chdz() {
private boolean r_fix_gd() {
ket = cursor;
if (find_among_b(a_4) == 0)
{
if (find_among_b(a_4) == 0) {
return false;
}
bra = cursor;
@ -448,57 +436,54 @@ private boolean r_fix_gd() {
public boolean stem() {
I_p1 = limit;
int v_1 = cursor;
lab0: {
int v_2 = cursor;
lab1: {
int v_3 = cursor;
if (!(eq_s("a")))
lab0:
{
int v_2 = cursor;
lab1:
{
int v_3 = cursor;
if (!(eq_s("a"))) {
cursor = v_2;
break lab1;
}
cursor = v_3;
if (!(limit > 6))
{
if (!(limit > 6)) {
cursor = v_2;
break lab1;
}
{
int c = cursor + 1;
if (0 > c || c > limit)
{
if (0 > c || c > limit) {
cursor = v_2;
break lab1;
}
cursor = c;
}
}
golab2: while(true)
{
lab3: {
if (!(in_grouping(g_v, 97, 371)))
golab2:
while (true) {
lab3:
{
if (!(in_grouping(g_v, 97, 371))) {
break lab3;
}
break golab2;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
}
golab4: while(true)
{
lab5: {
if (!(out_grouping(g_v, 97, 371)))
golab4:
while (true) {
lab5:
{
if (!(out_grouping(g_v, 97, 371))) {
break lab5;
}
break golab4;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -539,8 +524,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return LithuanianStemmer.class.getName().hashCode();
}
}

407
lucene/analysis/common/src/java/org/tartarus/snowball/ext/LovinsStemmer.java
View File

File diff suppressed because it is too large Load Diff

106
lucene/analysis/common/src/java/org/tartarus/snowball/ext/NepaliStemmer.java
View File

@ -6,17 +6,17 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class NepaliStemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
private static final Among a_0[] = {
new Among("\u0932\u093E\u0907", -1, 1),
new Among("\u0932\u093E\u0908", -1, 1),
new Among("\u0938\u0901\u0917", -1, 1),
@ -36,19 +36,15 @@ private final static Among a_0[] = {
new Among("\u0915\u094B", -1, 2)
};
private final static Among a_1[] = {
new Among("\u0901", -1, -1),
new Among("\u0902", -1, -1),
new Among("\u0948", -1, -1)
private static final Among a_1[] = {
new Among("\u0901", -1, -1), new Among("\u0902", -1, -1), new Among("\u0948", -1, -1)
};
private final static Among a_2[] = {
new Among("\u0901", -1, 1),
new Among("\u0902", -1, 1),
new Among("\u0948", -1, 2)
private static final Among a_2[] = {
new Among("\u0901", -1, 1), new Among("\u0902", -1, 1), new Among("\u0948", -1, 2)
};
private final static Among a_3[] = {
private static final Among a_3[] = {
new Among("\u0925\u093F\u090F", -1, 1),
new Among("\u091B", -1, 1),
new Among("\u0907\u091B", 1, 1),
@ -142,14 +138,11 @@ private final static Among a_3[] = {
new Among("\u0939\u094B\u0938\u094D", -1, 1)
};
private boolean r_remove_category_1() {
int among_var;
ket = cursor;
among_var = find_among_b(a_0);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
@ -158,21 +151,23 @@ private boolean r_remove_category_1() {
slice_del();
break;
case 2:
lab0: {
int v_1 = limit - cursor;
lab1: {
lab2: {
int v_2 = limit - cursor;
lab3: {
if (!(eq_s_b("\u090F")))
lab0:
{
int v_1 = limit - cursor;
lab1:
{
lab2:
{
int v_2 = limit - cursor;
lab3:
{
if (!(eq_s_b("\u090F"))) {
break lab3;
}
break lab2;
}
cursor = limit - v_2;
if (!(eq_s_b("\u0947")))
{
if (!(eq_s_b("\u0947"))) {
break lab1;
}
}
@ -188,8 +183,7 @@ private boolean r_remove_category_1() {
private boolean r_check_category_2() {
ket = cursor;
if (find_among_b(a_1) == 0)
{
if (find_among_b(a_1) == 0) {
return false;
}
bra = cursor;
@ -200,49 +194,47 @@ private boolean r_remove_category_2() {
int among_var;
ket = cursor;
among_var = find_among_b(a_2);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
switch (among_var) {
case 1:
lab0: {
int v_1 = limit - cursor;
lab1: {
if (!(eq_s_b("\u092F\u094C")))
lab0:
{
int v_1 = limit - cursor;
lab1:
{
if (!(eq_s_b("\u092F\u094C"))) {
break lab1;
}
break lab0;
}
cursor = limit - v_1;
lab2: {
if (!(eq_s_b("\u091B\u094C")))
lab2:
{
if (!(eq_s_b("\u091B\u094C"))) {
break lab2;
}
break lab0;
}
cursor = limit - v_1;
lab3: {
if (!(eq_s_b("\u0928\u094C")))
lab3:
{
if (!(eq_s_b("\u0928\u094C"))) {
break lab3;
}
break lab0;
}
cursor = limit - v_1;
if (!(eq_s_b("\u0925\u0947")))
{
if (!(eq_s_b("\u0925\u0947"))) {
return false;
}
}
slice_del();
break;
case 2:
if (!(eq_s_b("\u0924\u094D\u0930")))
{
if (!(eq_s_b("\u0924\u094D\u0930"))) {
return false;
}
slice_del();
@ -253,8 +245,7 @@ private boolean r_remove_category_2() {
private boolean r_remove_category_3() {
ket = cursor;
if (find_among_b(a_3) == 0)
{
if (find_among_b(a_3) == 0) {
return false;
}
bra = cursor;
@ -270,27 +261,26 @@ public boolean stem() {
r_remove_category_1();
cursor = limit - v_1;
int v_2 = limit - cursor;
lab0: {
while(true)
lab0:
{
while (true) {
int v_3 = limit - cursor;
lab1: {
int v_4 = limit - cursor;
lab2: {
int v_5 = limit - cursor;
if (!r_check_category_2())
lab1:
{
int v_4 = limit - cursor;
lab2:
{
int v_5 = limit - cursor;
if (!r_check_category_2()) {
break lab2;
}
cursor = limit - v_5;
if (!r_remove_category_2())
{
if (!r_remove_category_2()) {
break lab2;
}
}
cursor = limit - v_4;
if (!r_remove_category_3())
{
if (!r_remove_category_3()) {
break lab1;
}
continue;
@ -313,8 +303,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return NepaliStemmer.class.getName().hashCode();
}
}

87
lucene/analysis/common/src/java/org/tartarus/snowball/ext/NorwegianStemmer.java
View File

@ -6,17 +6,17 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class NorwegianStemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
private static final Among a_0[] = {
new Among("a", -1, 1),
new Among("e", -1, 1),
new Among("ede", 1, 1),
@ -48,12 +48,9 @@ private final static Among a_0[] = {
new Among("ast", -1, 1)
};
private final static Among a_1[] = {
new Among("dt", -1, -1),
new Among("vt", -1, -1)
};
private static final Among a_1[] = {new Among("dt", -1, -1), new Among("vt", -1, -1)};
private final static Among a_2[] = {
private static final Among a_2[] = {
new Among("leg", -1, 1),
new Among("eleg", 0, 1),
new Among("ig", -1, 1),
@ -74,57 +71,53 @@ private static final char g_s_ending[] = {119, 125, 149, 1 };
private int I_x;
private int I_p1;
private boolean r_mark_regions() {
I_p1 = limit;
int v_1 = cursor;
{
int c = cursor + 3;
if (0 > c || c > limit)
{
if (0 > c || c > limit) {
return false;
}
cursor = c;
}
I_x = cursor;
cursor = v_1;
golab0: while(true)
{
golab0:
while (true) {
int v_2 = cursor;
lab1: {
if (!(in_grouping(g_v, 97, 248)))
lab1:
{
if (!(in_grouping(g_v, 97, 248))) {
break lab1;
}
cursor = v_2;
break golab0;
}
cursor = v_2;
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
}
golab2: while(true)
{
lab3: {
if (!(out_grouping(g_v, 97, 248)))
golab2:
while (true) {
lab3:
{
if (!(out_grouping(g_v, 97, 248))) {
break lab3;
}
break golab2;
}
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
}
I_p1 = cursor;
lab4: {
if (!(I_p1 < I_x))
lab4:
{
if (!(I_p1 < I_x)) {
break lab4;
}
I_p1 = I_x;
@ -134,16 +127,14 @@ private boolean r_mark_regions() {
private boolean r_main_suffix() {
int among_var;
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_p1;
ket = cursor;
among_var = find_among_b(a_0);
if (among_var == 0)
{
if (among_var == 0) {
limit_backward = v_2;
return false;
}
@ -154,22 +145,21 @@ private boolean r_main_suffix() {
slice_del();
break;
case 2:
lab0: {
int v_3 = limit - cursor;
lab1: {
if (!(in_grouping_b(g_s_ending, 98, 122)))
lab0:
{
int v_3 = limit - cursor;
lab1:
{
if (!(in_grouping_b(g_s_ending, 98, 122))) {
break lab1;
}
break lab0;
}
cursor = limit - v_3;
if (!(eq_s_b("k")))
{
if (!(eq_s_b("k"))) {
return false;
}
if (!(out_grouping_b(g_v, 97, 248)))
{
if (!(out_grouping_b(g_v, 97, 248))) {
return false;
}
}
@ -184,23 +174,20 @@ private boolean r_main_suffix() {
private boolean r_consonant_pair() {
int v_1 = limit - cursor;
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_3 = limit_backward;
limit_backward = I_p1;
ket = cursor;
if (find_among_b(a_1) == 0)
{
if (find_among_b(a_1) == 0) {
limit_backward = v_3;
return false;
}
bra = cursor;
limit_backward = v_3;
cursor = limit - v_1;
if (cursor <= limit_backward)
{
if (cursor <= limit_backward) {
return false;
}
cursor--;
@ -210,15 +197,13 @@ private boolean r_consonant_pair() {
}
private boolean r_other_suffix() {
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_p1;
ket = cursor;
if (find_among_b(a_2) == 0)
{
if (find_among_b(a_2) == 0) {
limit_backward = v_2;
return false;
}
@ -257,8 +242,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return NorwegianStemmer.class.getName().hashCode();
}
}

253
lucene/analysis/common/src/java/org/tartarus/snowball/ext/PorterStemmer.java
View File

@ -6,24 +6,21 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class PorterStemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
new Among("s", -1, 3),
new Among("ies", 0, 2),
new Among("sses", 0, 1),
new Among("ss", 0, -1)
private static final Among a_0[] = {
new Among("s", -1, 3), new Among("ies", 0, 2), new Among("sses", 0, 1), new Among("ss", 0, -1)
};
private final static Among a_1[] = {
private static final Among a_1[] = {
new Among("", -1, 3),
new Among("bb", 0, 2),
new Among("dd", 0, 2),
@ -39,13 +36,11 @@ private final static Among a_1[] = {
new Among("iz", 0, 1)
};
private final static Among a_2[] = {
new Among("ed", -1, 2),
new Among("eed", 0, 1),
new Among("ing", -1, 2)
private static final Among a_2[] = {
new Among("ed", -1, 2), new Among("eed", 0, 1), new Among("ing", -1, 2)
};
private final static Among a_3[] = {
private static final Among a_3[] = {
new Among("anci", -1, 3),
new Among("enci", -1, 2),
new Among("abli", -1, 4),
@ -68,7 +63,7 @@ private final static Among a_3[] = {
new Among("ousness", -1, 11)
};
private final static Among a_4[] = {
private static final Among a_4[] = {
new Among("icate", -1, 2),
new Among("ative", -1, 3),
new Among("alize", -1, 1),
@ -78,7 +73,7 @@ private final static Among a_4[] = {
new Among("ness", -1, 3)
};
private final static Among a_5[] = {
private static final Among a_5[] = {
new Among("ic", -1, 1),
new Among("ance", -1, 1),
new Among("ence", -1, 1),
@ -108,34 +103,28 @@ private boolean B_Y_found;
private int I_p2;
private int I_p1;
private boolean r_shortv() {
if (!(out_grouping_b(g_v_WXY, 89, 121)))
{
if (!(out_grouping_b(g_v_WXY, 89, 121))) {
return false;
}
if (!(in_grouping_b(g_v, 97, 121)))
{
if (!(in_grouping_b(g_v, 97, 121))) {
return false;
}
if (!(out_grouping_b(g_v, 97, 121)))
{
if (!(out_grouping_b(g_v, 97, 121))) {
return false;
}
return true;
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
if (!(I_p1 <= cursor)) {
return false;
}
return true;
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
if (!(I_p2 <= cursor)) {
return false;
}
return true;
@ -145,8 +134,7 @@ private boolean r_Step_1a() {
int among_var;
ket = cursor;
among_var = find_among_b(a_0);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
@ -168,32 +156,29 @@ private boolean r_Step_1b() {
int among_var;
ket = cursor;
among_var = find_among_b(a_2);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
switch (among_var) {
case 1:
if (!r_R1())
{
if (!r_R1()) {
return false;
}
slice_from("ee");
break;
case 2:
int v_1 = limit - cursor;
golab0: while(true)
{
lab1: {
if (!(in_grouping_b(g_v, 97, 121)))
golab0:
while (true) {
lab1:
{
if (!(in_grouping_b(g_v, 97, 121))) {
break lab1;
}
break golab0;
}
if (cursor <= limit_backward)
{
if (cursor <= limit_backward) {
return false;
}
cursor--;
@ -202,8 +187,7 @@ private boolean r_Step_1b() {
slice_del();
int v_3 = limit - cursor;
among_var = find_among_b(a_1);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
cursor = limit - v_3;
@ -217,8 +201,7 @@ private boolean r_Step_1b() {
break;
case 2:
ket = cursor;
if (cursor <= limit_backward)
{
if (cursor <= limit_backward) {
return false;
}
cursor--;
@ -226,13 +209,11 @@ private boolean r_Step_1b() {
slice_del();
break;
case 3:
if (cursor != I_p1)
{
if (cursor != I_p1) {
return false;
}
int v_4 = limit - cursor;
if (!r_shortv())
{
if (!r_shortv()) {
return false;
}
cursor = limit - v_4;
@ -250,33 +231,32 @@ private boolean r_Step_1b() {
private boolean r_Step_1c() {
ket = cursor;
lab0: {
int v_1 = limit - cursor;
lab1: {
if (!(eq_s_b("y")))
lab0:
{
int v_1 = limit - cursor;
lab1:
{
if (!(eq_s_b("y"))) {
break lab1;
}
break lab0;
}
cursor = limit - v_1;
if (!(eq_s_b("Y")))
{
if (!(eq_s_b("Y"))) {
return false;
}
}
bra = cursor;
golab2: while(true)
{
lab3: {
if (!(in_grouping_b(g_v, 97, 121)))
golab2:
while (true) {
lab3:
{
if (!(in_grouping_b(g_v, 97, 121))) {
break lab3;
}
break golab2;
}
if (cursor <= limit_backward)
{
if (cursor <= limit_backward) {
return false;
}
cursor--;
@ -289,13 +269,11 @@ private boolean r_Step_2() {
int among_var;
ket = cursor;
among_var = find_among_b(a_3);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
return false;
}
switch (among_var) {
@ -346,13 +324,11 @@ private boolean r_Step_3() {
int among_var;
ket = cursor;
among_var = find_among_b(a_4);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
return false;
}
switch (among_var) {
@ -373,13 +349,11 @@ private boolean r_Step_4() {
int among_var;
ket = cursor;
among_var = find_among_b(a_5);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
return false;
}
switch (among_var) {
@ -387,18 +361,18 @@ private boolean r_Step_4() {
slice_del();
break;
case 2:
lab0: {
int v_1 = limit - cursor;
lab1: {
if (!(eq_s_b("s")))
lab0:
{
int v_1 = limit - cursor;
lab1:
{
if (!(eq_s_b("s"))) {
break lab1;
}
break lab0;
}
cursor = limit - v_1;
if (!(eq_s_b("t")))
{
if (!(eq_s_b("t"))) {
return false;
}
}
@ -410,30 +384,29 @@ private boolean r_Step_4() {
private boolean r_Step_5a() {
ket = cursor;
if (!(eq_s_b("e")))
{
if (!(eq_s_b("e"))) {
return false;
}
bra = cursor;
lab0: {
int v_1 = limit - cursor;
lab1: {
if (!r_R2())
lab0:
{
int v_1 = limit - cursor;
lab1:
{
if (!r_R2()) {
break lab1;
}
break lab0;
}
cursor = limit - v_1;
if (!r_R1())
{
if (!r_R1()) {
return false;
}
{
int v_2 = limit - cursor;
lab2: {
if (!r_shortv())
lab2:
{
if (!r_shortv()) {
break lab2;
}
return false;
@ -447,17 +420,14 @@ private boolean r_Step_5a() {
private boolean r_Step_5b() {
ket = cursor;
if (!(eq_s_b("l")))
{
if (!(eq_s_b("l"))) {
return false;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
return false;
}
if (!(eq_s_b("l")))
{
if (!(eq_s_b("l"))) {
return false;
}
slice_del();
@ -468,10 +438,10 @@ private boolean r_Step_5b() {
public boolean stem() {
B_Y_found = false;
int v_1 = cursor;
lab0: {
bra = cursor;
if (!(eq_s("y")))
lab0:
{
bra = cursor;
if (!(eq_s("y"))) {
break lab0;
}
ket = cursor;
@ -480,22 +450,22 @@ public boolean stem() {
}
cursor = v_1;
int v_2 = cursor;
lab1: {
while(true)
lab1:
{
while (true) {
int v_3 = cursor;
lab2: {
golab3: while(true)
lab2:
{
golab3:
while (true) {
int v_4 = cursor;
lab4: {
if (!(in_grouping(g_v, 97, 121)))
lab4:
{
if (!(in_grouping(g_v, 97, 121))) {
break lab4;
}
bra = cursor;
if (!(eq_s("y")))
{
if (!(eq_s("y"))) {
break lab4;
}
ket = cursor;
@ -503,8 +473,7 @@ public boolean stem() {
break golab3;
}
cursor = v_4;
if (cursor >= limit)
{
if (cursor >= limit) {
break lab2;
}
cursor++;
@ -521,64 +490,61 @@ public boolean stem() {
I_p1 = limit;
I_p2 = limit;
int v_5 = cursor;
lab5: {
golab6: while(true)
lab5:
{
lab7: {
if (!(in_grouping(g_v, 97, 121)))
golab6:
while (true) {
lab7:
{
if (!(in_grouping(g_v, 97, 121))) {
break lab7;
}
break golab6;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab5;
}
cursor++;
}
golab8: while(true)
{
lab9: {
if (!(out_grouping(g_v, 97, 121)))
golab8:
while (true) {
lab9:
{
if (!(out_grouping(g_v, 97, 121))) {
break lab9;
}
break golab8;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab5;
}
cursor++;
}
I_p1 = cursor;
golab10: while(true)
{
lab11: {
if (!(in_grouping(g_v, 97, 121)))
golab10:
while (true) {
lab11:
{
if (!(in_grouping(g_v, 97, 121))) {
break lab11;
}
break golab10;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab5;
}
cursor++;
}
golab12: while(true)
{
lab13: {
if (!(out_grouping(g_v, 97, 121)))
golab12:
while (true) {
lab13:
{
if (!(out_grouping(g_v, 97, 121))) {
break lab13;
}
break golab12;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab5;
}
cursor++;
@ -614,22 +580,22 @@ public boolean stem() {
cursor = limit - v_17;
cursor = limit_backward;
int v_18 = cursor;
lab14: {
if (!(B_Y_found))
lab14:
{
if (!(B_Y_found)) {
break lab14;
}
while(true)
{
while (true) {
int v_19 = cursor;
lab15: {
golab16: while(true)
lab15:
{
golab16:
while (true) {
int v_20 = cursor;
lab17: {
bra = cursor;
if (!(eq_s("Y")))
lab17:
{
bra = cursor;
if (!(eq_s("Y"))) {
break lab17;
}
ket = cursor;
@ -637,8 +603,7 @@ public boolean stem() {
break golab16;
}
cursor = v_20;
if (cursor >= limit)
{
if (cursor >= limit) {
break lab15;
}
cursor++;
@ -663,8 +628,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return PorterStemmer.class.getName().hashCode();
}
}

358
lucene/analysis/common/src/java/org/tartarus/snowball/ext/PortugueseStemmer.java
View File

@ -6,48 +6,40 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class PortugueseStemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
new Among("", -1, 3),
new Among("\u00E3", 0, 1),
new Among("\u00F5", 0, 2)
private static final Among a_0[] = {
new Among("", -1, 3), new Among("\u00E3", 0, 1), new Among("\u00F5", 0, 2)
};
private final static Among a_1[] = {
new Among("", -1, 3),
new Among("a~", 0, 1),
new Among("o~", 0, 2)
private static final Among a_1[] = {
new Among("", -1, 3), new Among("a~", 0, 1), new Among("o~", 0, 2)
};
private final static Among a_2[] = {
private static final Among a_2[] = {
new Among("ic", -1, -1),
new Among("ad", -1, -1),
new Among("os", -1, -1),
new Among("iv", -1, 1)
};
private final static Among a_3[] = {
new Among("ante", -1, 1),
new Among("avel", -1, 1),
new Among("\u00EDvel", -1, 1)
private static final Among a_3[] = {
new Among("ante", -1, 1), new Among("avel", -1, 1), new Among("\u00EDvel", -1, 1)
};
private final static Among a_4[] = {
new Among("ic", -1, 1),
new Among("abil", -1, 1),
new Among("iv", -1, 1)
private static final Among a_4[] = {
new Among("ic", -1, 1), new Among("abil", -1, 1), new Among("iv", -1, 1)
};
private final static Among a_5[] = {
private static final Among a_5[] = {
new Among("ica", -1, 1),
new Among("\u00E2ncia", -1, 1),
new Among("\u00EAncia", -1, 4),
@ -95,7 +87,7 @@ private final static Among a_5[] = {
new Among("ivos", -1, 8)
};
private final static Among a_6[] = {
private static final Among a_6[] = {
new Among("ada", -1, 1),
new Among("ida", -1, 1),
new Among("ia", -1, 1),
@ -218,7 +210,7 @@ private final static Among a_6[] = {
new Among("ir\u00E1", -1, 1)
};
private final static Among a_7[] = {
private static final Among a_7[] = {
new Among("a", -1, 1),
new Among("i", -1, 1),
new Among("o", -1, 1),
@ -228,30 +220,30 @@ private final static Among a_7[] = {
new Among("\u00F3", -1, 1)
};
private final static Among a_8[] = {
private static final Among a_8[] = {
new Among("e", -1, 1),
new Among("\u00E7", -1, 2),
new Among("\u00E9", -1, 1),
new Among("\u00EA", -1, 1)
};
private static final char g_v[] = {17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 19, 12, 2 };
private static final char g_v[] = {
17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 19, 12, 2
};
private int I_p2;
private int I_p1;
private int I_pV;
private boolean r_prelude() {
int among_var;
while(true)
{
while (true) {
int v_1 = cursor;
lab0: {
lab0:
{
bra = cursor;
among_var = find_among(a_0);
if (among_var == 0)
{
if (among_var == 0) {
break lab0;
}
ket = cursor;
@ -263,8 +255,7 @@ private boolean r_prelude() {
slice_from("o~");
break;
case 3:
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -283,32 +274,34 @@ private boolean r_mark_regions() {
I_p1 = limit;
I_p2 = limit;
int v_1 = cursor;
lab0: {
lab1: {
int v_2 = cursor;
lab2: {
if (!(in_grouping(g_v, 97, 250)))
lab0:
{
lab1:
{
int v_2 = cursor;
lab2:
{
if (!(in_grouping(g_v, 97, 250))) {
break lab2;
}
lab3: {
int v_3 = cursor;
lab4: {
if (!(out_grouping(g_v, 97, 250)))
lab3:
{
int v_3 = cursor;
lab4:
{
if (!(out_grouping(g_v, 97, 250))) {
break lab4;
}
golab5: while(true)
{
lab6: {
if (!(in_grouping(g_v, 97, 250)))
golab5:
while (true) {
lab6:
{
if (!(in_grouping(g_v, 97, 250))) {
break lab6;
}
break golab5;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab4;
}
cursor++;
@ -316,21 +309,19 @@ private boolean r_mark_regions() {
break lab3;
}
cursor = v_3;
if (!(in_grouping(g_v, 97, 250)))
{
if (!(in_grouping(g_v, 97, 250))) {
break lab2;
}
golab7: while(true)
{
lab8: {
if (!(out_grouping(g_v, 97, 250)))
golab7:
while (true) {
lab8:
{
if (!(out_grouping(g_v, 97, 250))) {
break lab8;
}
break golab7;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab2;
}
cursor++;
@ -339,28 +330,27 @@ private boolean r_mark_regions() {
break lab1;
}
cursor = v_2;
if (!(out_grouping(g_v, 97, 250)))
{
if (!(out_grouping(g_v, 97, 250))) {
break lab0;
}
lab9: {
int v_6 = cursor;
lab10: {
if (!(out_grouping(g_v, 97, 250)))
lab9:
{
int v_6 = cursor;
lab10:
{
if (!(out_grouping(g_v, 97, 250))) {
break lab10;
}
golab11: while(true)
{
lab12: {
if (!(in_grouping(g_v, 97, 250)))
golab11:
while (true) {
lab12:
{
if (!(in_grouping(g_v, 97, 250))) {
break lab12;
}
break golab11;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab10;
}
cursor++;
@ -368,12 +358,10 @@ private boolean r_mark_regions() {
break lab9;
}
cursor = v_6;
if (!(in_grouping(g_v, 97, 250)))
{
if (!(in_grouping(g_v, 97, 250))) {
break lab0;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -383,64 +371,61 @@ private boolean r_mark_regions() {
}
cursor = v_1;
int v_8 = cursor;
lab13: {
golab14: while(true)
lab13:
{
lab15: {
if (!(in_grouping(g_v, 97, 250)))
golab14:
while (true) {
lab15:
{
if (!(in_grouping(g_v, 97, 250))) {
break lab15;
}
break golab14;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab13;
}
cursor++;
}
golab16: while(true)
{
lab17: {
if (!(out_grouping(g_v, 97, 250)))
golab16:
while (true) {
lab17:
{
if (!(out_grouping(g_v, 97, 250))) {
break lab17;
}
break golab16;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab13;
}
cursor++;
}
I_p1 = cursor;
golab18: while(true)
{
lab19: {
if (!(in_grouping(g_v, 97, 250)))
golab18:
while (true) {
lab19:
{
if (!(in_grouping(g_v, 97, 250))) {
break lab19;
}
break golab18;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab13;
}
cursor++;
}
golab20: while(true)
{
lab21: {
if (!(out_grouping(g_v, 97, 250)))
golab20:
while (true) {
lab21:
{
if (!(out_grouping(g_v, 97, 250))) {
break lab21;
}
break golab20;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab13;
}
cursor++;
@ -453,14 +438,13 @@ private boolean r_mark_regions() {
private boolean r_postlude() {
int among_var;
while(true)
{
while (true) {
int v_1 = cursor;
lab0: {
lab0:
{
bra = cursor;
among_var = find_among(a_1);
if (among_var == 0)
{
if (among_var == 0) {
break lab0;
}
ket = cursor;
@ -472,8 +456,7 @@ private boolean r_postlude() {
slice_from("\u00F5");
break;
case 3:
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -488,24 +471,21 @@ private boolean r_postlude() {
}
private boolean r_RV() {
if (!(I_pV <= cursor))
{
if (!(I_pV <= cursor)) {
return false;
}
return true;
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
if (!(I_p1 <= cursor)) {
return false;
}
return true;
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
if (!(I_p2 <= cursor)) {
return false;
}
return true;
@ -515,58 +495,51 @@ private boolean r_standard_suffix() {
int among_var;
ket = cursor;
among_var = find_among_b(a_5);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
switch (among_var) {
case 1:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_del();
break;
case 2:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_from("log");
break;
case 3:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_from("u");
break;
case 4:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_from("ente");
break;
case 5:
if (!r_R1())
{
if (!r_R1()) {
return false;
}
slice_del();
int v_1 = limit - cursor;
lab0: {
lab0:
{
ket = cursor;
among_var = find_among_b(a_2);
if (among_var == 0)
{
if (among_var == 0) {
cursor = limit - v_1;
break lab0;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
cursor = limit - v_1;
break lab0;
}
@ -574,14 +547,12 @@ private boolean r_standard_suffix() {
switch (among_var) {
case 1:
ket = cursor;
if (!(eq_s_b("at")))
{
if (!(eq_s_b("at"))) {
cursor = limit - v_1;
break lab0;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
cursor = limit - v_1;
break lab0;
}
@ -591,22 +562,20 @@ private boolean r_standard_suffix() {
}
break;
case 6:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_del();
int v_2 = limit - cursor;
lab1: {
ket = cursor;
if (find_among_b(a_3) == 0)
lab1:
{
ket = cursor;
if (find_among_b(a_3) == 0) {
cursor = limit - v_2;
break lab1;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
cursor = limit - v_2;
break lab1;
}
@ -614,22 +583,20 @@ private boolean r_standard_suffix() {
}
break;
case 7:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_del();
int v_3 = limit - cursor;
lab2: {
ket = cursor;
if (find_among_b(a_4) == 0)
lab2:
{
ket = cursor;
if (find_among_b(a_4) == 0) {
cursor = limit - v_3;
break lab2;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
cursor = limit - v_3;
break lab2;
}
@ -637,22 +604,20 @@ private boolean r_standard_suffix() {
}
break;
case 8:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_del();
int v_4 = limit - cursor;
lab3: {
ket = cursor;
if (!(eq_s_b("at")))
lab3:
{
ket = cursor;
if (!(eq_s_b("at"))) {
cursor = limit - v_4;
break lab3;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
cursor = limit - v_4;
break lab3;
}
@ -660,12 +625,10 @@ private boolean r_standard_suffix() {
}
break;
case 9:
if (!r_RV())
{
if (!r_RV()) {
return false;
}
if (!(eq_s_b("e")))
{
if (!(eq_s_b("e"))) {
return false;
}
slice_from("ir");
@ -675,15 +638,13 @@ private boolean r_standard_suffix() {
}
private boolean r_verb_suffix() {
if (cursor < I_pV)
{
if (cursor < I_pV) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_pV;
ket = cursor;
if (find_among_b(a_6) == 0)
{
if (find_among_b(a_6) == 0) {
limit_backward = v_2;
return false;
}
@ -695,13 +656,11 @@ private boolean r_verb_suffix() {
private boolean r_residual_suffix() {
ket = cursor;
if (find_among_b(a_7) == 0)
{
if (find_among_b(a_7) == 0) {
return false;
}
bra = cursor;
if (!r_RV())
{
if (!r_RV()) {
return false;
}
slice_del();
@ -712,50 +671,45 @@ private boolean r_residual_form() {
int among_var;
ket = cursor;
among_var = find_among_b(a_8);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
switch (among_var) {
case 1:
if (!r_RV())
{
if (!r_RV()) {
return false;
}
slice_del();
ket = cursor;
lab0: {
int v_1 = limit - cursor;
lab1: {
if (!(eq_s_b("u")))
lab0:
{
int v_1 = limit - cursor;
lab1:
{
if (!(eq_s_b("u"))) {
break lab1;
}
bra = cursor;
int v_2 = limit - cursor;
if (!(eq_s_b("g")))
{
if (!(eq_s_b("g"))) {
break lab1;
}
cursor = limit - v_2;
break lab0;
}
cursor = limit - v_1;
if (!(eq_s_b("i")))
{
if (!(eq_s_b("i"))) {
return false;
}
bra = cursor;
int v_3 = limit - cursor;
if (!(eq_s_b("c")))
{
if (!(eq_s_b("c"))) {
return false;
}
cursor = limit - v_3;
}
if (!r_RV())
{
if (!r_RV()) {
return false;
}
slice_del();
@ -776,43 +730,44 @@ public boolean stem() {
limit_backward = cursor;
cursor = limit;
int v_3 = limit - cursor;
lab0: {
lab1: {
int v_4 = limit - cursor;
lab2: {
int v_5 = limit - cursor;
lab3: {
int v_6 = limit - cursor;
lab4: {
if (!r_standard_suffix())
lab0:
{
lab1:
{
int v_4 = limit - cursor;
lab2:
{
int v_5 = limit - cursor;
lab3:
{
int v_6 = limit - cursor;
lab4:
{
if (!r_standard_suffix()) {
break lab4;
}
break lab3;
}
cursor = limit - v_6;
if (!r_verb_suffix())
{
if (!r_verb_suffix()) {
break lab2;
}
}
cursor = limit - v_5;
int v_7 = limit - cursor;
lab5: {
ket = cursor;
if (!(eq_s_b("i")))
lab5:
{
ket = cursor;
if (!(eq_s_b("i"))) {
break lab5;
}
bra = cursor;
int v_8 = limit - cursor;
if (!(eq_s_b("c")))
{
if (!(eq_s_b("c"))) {
break lab5;
}
cursor = limit - v_8;
if (!r_RV())
{
if (!r_RV()) {
break lab5;
}
slice_del();
@ -821,8 +776,7 @@ public boolean stem() {
break lab1;
}
cursor = limit - v_4;
if (!r_residual_suffix())
{
if (!r_residual_suffix()) {
break lab0;
}
}
@ -847,8 +801,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return PortugueseStemmer.class.getName().hashCode();
}
}

278
lucene/analysis/common/src/java/org/tartarus/snowball/ext/RomanianStemmer.java
View File

@ -6,23 +6,21 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class RomanianStemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
new Among("", -1, 3),
new Among("I", 0, 1),
new Among("U", 0, 2)
private static final Among a_0[] = {
new Among("", -1, 3), new Among("I", 0, 1), new Among("U", 0, 2)
};
private final static Among a_1[] = {
private static final Among a_1[] = {
new Among("ea", -1, 3),
new Among("a\u0163ia", -1, 7),
new Among("aua", -1, 2),
@ -41,7 +39,7 @@ private final static Among a_1[] = {
new Among("iilor", 14, 4)
};
private final static Among a_2[] = {
private static final Among a_2[] = {
new Among("icala", -1, 4),
new Among("iciva", -1, 4),
new Among("ativa", -1, 5),
@ -90,7 +88,7 @@ private final static Among a_2[] = {
new Among("itiv\u0103", -1, 6)
};
private final static Among a_3[] = {
private static final Among a_3[] = {
new Among("ica", -1, 1),
new Among("abila", -1, 1),
new Among("ibila", -1, 1),
@ -155,7 +153,7 @@ private final static Among a_3[] = {
new Among("iv\u0103", -1, 1)
};
private final static Among a_4[] = {
private static final Among a_4[] = {
new Among("ea", -1, 1),
new Among("ia", -1, 1),
new Among("esc", -1, 1),
@ -252,7 +250,7 @@ private final static Among a_4[] = {
new Among("eaz\u0103", -1, 1)
};
private final static Among a_5[] = {
private static final Among a_5[] = {
new Among("a", -1, 1),
new Among("e", -1, 1),
new Among("ie", 1, 1),
@ -260,51 +258,50 @@ private final static Among a_5[] = {
new Among("\u0103", -1, 1)
};
private static final char g_v[] = {17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 32, 0, 0, 4 };
private static final char g_v[] = {
17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 32, 0, 0, 4
};
private boolean B_standard_suffix_removed;
private int I_p2;
private int I_p1;
private int I_pV;
private boolean r_prelude() {
while(true)
{
while (true) {
int v_1 = cursor;
lab0: {
golab1: while(true)
lab0:
{
golab1:
while (true) {
int v_2 = cursor;
lab2: {
if (!(in_grouping(g_v, 97, 259)))
lab2:
{
if (!(in_grouping(g_v, 97, 259))) {
break lab2;
}
bra = cursor;
lab3: {
int v_3 = cursor;
lab4: {
if (!(eq_s("u")))
lab3:
{
int v_3 = cursor;
lab4:
{
if (!(eq_s("u"))) {
break lab4;
}
ket = cursor;
if (!(in_grouping(g_v, 97, 259)))
{
if (!(in_grouping(g_v, 97, 259))) {
break lab4;
}
slice_from("U");
break lab3;
}
cursor = v_3;
if (!(eq_s("i")))
{
if (!(eq_s("i"))) {
break lab2;
}
ket = cursor;
if (!(in_grouping(g_v, 97, 259)))
{
if (!(in_grouping(g_v, 97, 259))) {
break lab2;
}
slice_from("I");
@ -313,8 +310,7 @@ private boolean r_prelude() {
break golab1;
}
cursor = v_2;
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -332,32 +328,34 @@ private boolean r_mark_regions() {
I_p1 = limit;
I_p2 = limit;
int v_1 = cursor;
lab0: {
lab1: {
int v_2 = cursor;
lab2: {
if (!(in_grouping(g_v, 97, 259)))
lab0:
{
lab1:
{
int v_2 = cursor;
lab2:
{
if (!(in_grouping(g_v, 97, 259))) {
break lab2;
}
lab3: {
int v_3 = cursor;
lab4: {
if (!(out_grouping(g_v, 97, 259)))
lab3:
{
int v_3 = cursor;
lab4:
{
if (!(out_grouping(g_v, 97, 259))) {
break lab4;
}
golab5: while(true)
{
lab6: {
if (!(in_grouping(g_v, 97, 259)))
golab5:
while (true) {
lab6:
{
if (!(in_grouping(g_v, 97, 259))) {
break lab6;
}
break golab5;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab4;
}
cursor++;
@ -365,21 +363,19 @@ private boolean r_mark_regions() {
break lab3;
}
cursor = v_3;
if (!(in_grouping(g_v, 97, 259)))
{
if (!(in_grouping(g_v, 97, 259))) {
break lab2;
}
golab7: while(true)
{
lab8: {
if (!(out_grouping(g_v, 97, 259)))
golab7:
while (true) {
lab8:
{
if (!(out_grouping(g_v, 97, 259))) {
break lab8;
}
break golab7;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab2;
}
cursor++;
@ -388,28 +384,27 @@ private boolean r_mark_regions() {
break lab1;
}
cursor = v_2;
if (!(out_grouping(g_v, 97, 259)))
{
if (!(out_grouping(g_v, 97, 259))) {
break lab0;
}
lab9: {
int v_6 = cursor;
lab10: {
if (!(out_grouping(g_v, 97, 259)))
lab9:
{
int v_6 = cursor;
lab10:
{
if (!(out_grouping(g_v, 97, 259))) {
break lab10;
}
golab11: while(true)
{
lab12: {
if (!(in_grouping(g_v, 97, 259)))
golab11:
while (true) {
lab12:
{
if (!(in_grouping(g_v, 97, 259))) {
break lab12;
}
break golab11;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab10;
}
cursor++;
@ -417,12 +412,10 @@ private boolean r_mark_regions() {
break lab9;
}
cursor = v_6;
if (!(in_grouping(g_v, 97, 259)))
{
if (!(in_grouping(g_v, 97, 259))) {
break lab0;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -432,64 +425,61 @@ private boolean r_mark_regions() {
}
cursor = v_1;
int v_8 = cursor;
lab13: {
golab14: while(true)
lab13:
{
lab15: {
if (!(in_grouping(g_v, 97, 259)))
golab14:
while (true) {
lab15:
{
if (!(in_grouping(g_v, 97, 259))) {
break lab15;
}
break golab14;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab13;
}
cursor++;
}
golab16: while(true)
{
lab17: {
if (!(out_grouping(g_v, 97, 259)))
golab16:
while (true) {
lab17:
{
if (!(out_grouping(g_v, 97, 259))) {
break lab17;
}
break golab16;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab13;
}
cursor++;
}
I_p1 = cursor;
golab18: while(true)
{
lab19: {
if (!(in_grouping(g_v, 97, 259)))
golab18:
while (true) {
lab19:
{
if (!(in_grouping(g_v, 97, 259))) {
break lab19;
}
break golab18;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab13;
}
cursor++;
}
golab20: while(true)
{
lab21: {
if (!(out_grouping(g_v, 97, 259)))
golab20:
while (true) {
lab21:
{
if (!(out_grouping(g_v, 97, 259))) {
break lab21;
}
break golab20;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab13;
}
cursor++;
@ -502,14 +492,13 @@ private boolean r_mark_regions() {
private boolean r_postlude() {
int among_var;
while(true)
{
while (true) {
int v_1 = cursor;
lab0: {
lab0:
{
bra = cursor;
among_var = find_among(a_0);
if (among_var == 0)
{
if (among_var == 0) {
break lab0;
}
ket = cursor;
@ -521,8 +510,7 @@ private boolean r_postlude() {
slice_from("u");
break;
case 3:
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -537,24 +525,21 @@ private boolean r_postlude() {
}
private boolean r_RV() {
if (!(I_pV <= cursor))
{
if (!(I_pV <= cursor)) {
return false;
}
return true;
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
if (!(I_p1 <= cursor)) {
return false;
}
return true;
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
if (!(I_p2 <= cursor)) {
return false;
}
return true;
@ -564,13 +549,11 @@ private boolean r_step_0() {
int among_var;
ket = cursor;
among_var = find_among_b(a_1);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
return false;
}
switch (among_var) {
@ -589,9 +572,9 @@ private boolean r_step_0() {
case 5:
{
int v_1 = limit - cursor;
lab0: {
if (!(eq_s_b("ab")))
lab0:
{
if (!(eq_s_b("ab"))) {
break lab0;
}
return false;
@ -615,13 +598,11 @@ private boolean r_combo_suffix() {
int v_1 = limit - cursor;
ket = cursor;
among_var = find_among_b(a_2);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
return false;
}
switch (among_var) {
@ -652,12 +633,11 @@ private boolean r_combo_suffix() {
private boolean r_standard_suffix() {
int among_var;
B_standard_suffix_removed = false;
while(true)
{
while (true) {
int v_1 = limit - cursor;
lab0: {
if (!r_combo_suffix())
lab0:
{
if (!r_combo_suffix()) {
break lab0;
}
continue;
@ -667,13 +647,11 @@ private boolean r_standard_suffix() {
}
ket = cursor;
among_var = find_among_b(a_3);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
return false;
}
switch (among_var) {
@ -681,8 +659,7 @@ private boolean r_standard_suffix() {
slice_del();
break;
case 2:
if (!(eq_s_b("\u0163")))
{
if (!(eq_s_b("\u0163"))) {
return false;
}
bra = cursor;
@ -698,34 +675,32 @@ private boolean r_standard_suffix() {
private boolean r_verb_suffix() {
int among_var;
if (cursor < I_pV)
{
if (cursor < I_pV) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_pV;
ket = cursor;
among_var = find_among_b(a_4);
if (among_var == 0)
{
if (among_var == 0) {
limit_backward = v_2;
return false;
}
bra = cursor;
switch (among_var) {
case 1:
lab0: {
int v_3 = limit - cursor;
lab1: {
if (!(out_grouping_b(g_v, 97, 259)))
lab0:
{
int v_3 = limit - cursor;
lab1:
{
if (!(out_grouping_b(g_v, 97, 259))) {
break lab1;
}
break lab0;
}
cursor = limit - v_3;
if (!(eq_s_b("u")))
{
if (!(eq_s_b("u"))) {
limit_backward = v_2;
return false;
}
@ -742,13 +717,11 @@ private boolean r_verb_suffix() {
private boolean r_vowel_suffix() {
ket = cursor;
if (find_among_b(a_5) == 0)
{
if (find_among_b(a_5) == 0) {
return false;
}
bra = cursor;
if (!r_RV())
{
if (!r_RV()) {
return false;
}
slice_del();
@ -770,19 +743,20 @@ public boolean stem() {
r_standard_suffix();
cursor = limit - v_4;
int v_5 = limit - cursor;
lab0: {
lab1: {
int v_6 = limit - cursor;
lab2: {
if (!(B_standard_suffix_removed))
lab0:
{
lab1:
{
int v_6 = limit - cursor;
lab2:
{
if (!(B_standard_suffix_removed)) {
break lab2;
}
break lab1;
}
cursor = limit - v_6;
if (!r_verb_suffix())
{
if (!r_verb_suffix()) {
break lab0;
}
}
@ -807,8 +781,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return RomanianStemmer.class.getName().hashCode();
}
}

220
lucene/analysis/common/src/java/org/tartarus/snowball/ext/RussianStemmer.java
View File

@ -6,17 +6,17 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class RussianStemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
private static final Among a_0[] = {
new Among("\u0432", -1, 1),
new Among("\u0438\u0432", 0, 2),
new Among("\u044B\u0432", 0, 2),
@ -28,7 +28,7 @@ private final static Among a_0[] = {
new Among("\u044B\u0432\u0448\u0438\u0441\u044C", 6, 2)
};
private final static Among a_1[] = {
private static final Among a_1[] = {
new Among("\u0435\u0435", -1, 1),
new Among("\u0438\u0435", -1, 1),
new Among("\u043E\u0435", -1, 1),
@ -57,7 +57,7 @@ private final static Among a_1[] = {
new Among("\u044F\u044F", -1, 1)
};
private final static Among a_2[] = {
private static final Among a_2[] = {
new Among("\u0435\u043C", -1, 1),
new Among("\u043D\u043D", -1, 1),
new Among("\u0432\u0448", -1, 1),
@ -68,12 +68,11 @@ private final static Among a_2[] = {
new Among("\u0443\u044E\u0449", 6, 2)
};
private final static Among a_3[] = {
new Among("\u0441\u044C", -1, 1),
new Among("\u0441\u044F", -1, 1)
private static final Among a_3[] = {
new Among("\u0441\u044C", -1, 1), new Among("\u0441\u044F", -1, 1)
};
private final static Among a_4[] = {
private static final Among a_4[] = {
new Among("\u043B\u0430", -1, 1),
new Among("\u0438\u043B\u0430", 0, 2),
new Among("\u044B\u043B\u0430", 0, 2),
@ -122,7 +121,7 @@ private final static Among a_4[] = {
new Among("\u0443\u044E", 44, 2)
};
private final static Among a_5[] = {
private static final Among a_5[] = {
new Among("\u0430", -1, 1),
new Among("\u0435\u0432", -1, 1),
new Among("\u043E\u0432", -1, 1),
@ -161,12 +160,11 @@ private final static Among a_5[] = {
new Among("\u044C\u044F", 33, 1)
};
private final static Among a_6[] = {
new Among("\u043E\u0441\u0442", -1, 1),
new Among("\u043E\u0441\u0442\u044C", -1, 1)
private static final Among a_6[] = {
new Among("\u043E\u0441\u0442", -1, 1), new Among("\u043E\u0441\u0442\u044C", -1, 1)
};
private final static Among a_7[] = {
private static final Among a_7[] = {
new Among("\u0435\u0439\u0448\u0435", -1, 1),
new Among("\u043D", -1, 2),
new Among("\u0435\u0439\u0448", -1, 1),
@ -178,69 +176,65 @@ private static final char g_v[] = {33, 65, 8, 232 };
private int I_p2;
private int I_pV;
private boolean r_mark_regions() {
I_pV = limit;
I_p2 = limit;
int v_1 = cursor;
lab0: {
golab1: while(true)
lab0:
{
lab2: {
if (!(in_grouping(g_v, 1072, 1103)))
golab1:
while (true) {
lab2:
{
if (!(in_grouping(g_v, 1072, 1103))) {
break lab2;
}
break golab1;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
}
I_pV = cursor;
golab3: while(true)
{
lab4: {
if (!(out_grouping(g_v, 1072, 1103)))
golab3:
while (true) {
lab4:
{
if (!(out_grouping(g_v, 1072, 1103))) {
break lab4;
}
break golab3;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
}
golab5: while(true)
{
lab6: {
if (!(in_grouping(g_v, 1072, 1103)))
golab5:
while (true) {
lab6:
{
if (!(in_grouping(g_v, 1072, 1103))) {
break lab6;
}
break golab5;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
}
golab7: while(true)
{
lab8: {
if (!(out_grouping(g_v, 1072, 1103)))
golab7:
while (true) {
lab8:
{
if (!(out_grouping(g_v, 1072, 1103))) {
break lab8;
}
break golab7;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -252,8 +246,7 @@ private boolean r_mark_regions() {
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
if (!(I_p2 <= cursor)) {
return false;
}
return true;
@ -263,25 +256,24 @@ private boolean r_perfective_gerund() {
int among_var;
ket = cursor;
among_var = find_among_b(a_0);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
switch (among_var) {
case 1:
lab0: {
int v_1 = limit - cursor;
lab1: {
if (!(eq_s_b("\u0430")))
lab0:
{
int v_1 = limit - cursor;
lab1:
{
if (!(eq_s_b("\u0430"))) {
break lab1;
}
break lab0;
}
cursor = limit - v_1;
if (!(eq_s_b("\u044F")))
{
if (!(eq_s_b("\u044F"))) {
return false;
}
}
@ -296,8 +288,7 @@ private boolean r_perfective_gerund() {
private boolean r_adjective() {
ket = cursor;
if (find_among_b(a_1) == 0)
{
if (find_among_b(a_1) == 0) {
return false;
}
bra = cursor;
@ -307,34 +298,33 @@ private boolean r_adjective() {
private boolean r_adjectival() {
int among_var;
if (!r_adjective())
{
if (!r_adjective()) {
return false;
}
int v_1 = limit - cursor;
lab0: {
lab0:
{
ket = cursor;
among_var = find_among_b(a_2);
if (among_var == 0)
{
if (among_var == 0) {
cursor = limit - v_1;
break lab0;
}
bra = cursor;
switch (among_var) {
case 1:
lab1: {
int v_2 = limit - cursor;
lab2: {
if (!(eq_s_b("\u0430")))
lab1:
{
int v_2 = limit - cursor;
lab2:
{
if (!(eq_s_b("\u0430"))) {
break lab2;
}
break lab1;
}
cursor = limit - v_2;
if (!(eq_s_b("\u044F")))
{
if (!(eq_s_b("\u044F"))) {
cursor = limit - v_1;
break lab0;
}
@ -351,8 +341,7 @@ private boolean r_adjectival() {
private boolean r_reflexive() {
ket = cursor;
if (find_among_b(a_3) == 0)
{
if (find_among_b(a_3) == 0) {
return false;
}
bra = cursor;
@ -364,25 +353,24 @@ private boolean r_verb() {
int among_var;
ket = cursor;
among_var = find_among_b(a_4);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
switch (among_var) {
case 1:
lab0: {
int v_1 = limit - cursor;
lab1: {
if (!(eq_s_b("\u0430")))
lab0:
{
int v_1 = limit - cursor;
lab1:
{
if (!(eq_s_b("\u0430"))) {
break lab1;
}
break lab0;
}
cursor = limit - v_1;
if (!(eq_s_b("\u044F")))
{
if (!(eq_s_b("\u044F"))) {
return false;
}
}
@ -397,8 +385,7 @@ private boolean r_verb() {
private boolean r_noun() {
ket = cursor;
if (find_among_b(a_5) == 0)
{
if (find_among_b(a_5) == 0) {
return false;
}
bra = cursor;
@ -408,13 +395,11 @@ private boolean r_noun() {
private boolean r_derivational() {
ket = cursor;
if (find_among_b(a_6) == 0)
{
if (find_among_b(a_6) == 0) {
return false;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_del();
@ -425,8 +410,7 @@ private boolean r_tidy_up() {
int among_var;
ket = cursor;
among_var = find_among_b(a_7);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
@ -434,20 +418,17 @@ private boolean r_tidy_up() {
case 1:
slice_del();
ket = cursor;
if (!(eq_s_b("\u043D")))
{
if (!(eq_s_b("\u043D"))) {
return false;
}
bra = cursor;
if (!(eq_s_b("\u043D")))
{
if (!(eq_s_b("\u043D"))) {
return false;
}
slice_del();
break;
case 2:
if (!(eq_s_b("\u043D")))
{
if (!(eq_s_b("\u043D"))) {
return false;
}
slice_del();
@ -462,18 +443,19 @@ private boolean r_tidy_up() {
@Override
public boolean stem() {
int v_1 = cursor;
lab0: {
while(true)
lab0:
{
while (true) {
int v_2 = cursor;
lab1: {
golab2: while(true)
lab1:
{
golab2:
while (true) {
int v_3 = cursor;
lab3: {
bra = cursor;
if (!(eq_s("\u0451")))
lab3:
{
bra = cursor;
if (!(eq_s("\u0451"))) {
break lab3;
}
ket = cursor;
@ -481,8 +463,7 @@ public boolean stem() {
break golab2;
}
cursor = v_3;
if (cursor >= limit)
{
if (cursor >= limit) {
break lab1;
}
cursor++;
@ -498,52 +479,53 @@ public boolean stem() {
r_mark_regions();
limit_backward = cursor;
cursor = limit;
if (cursor < I_pV)
{
if (cursor < I_pV) {
return false;
}
int v_6 = limit_backward;
limit_backward = I_pV;
int v_7 = limit - cursor;
lab4: {
lab5: {
int v_8 = limit - cursor;
lab6: {
if (!r_perfective_gerund())
lab4:
{
lab5:
{
int v_8 = limit - cursor;
lab6:
{
if (!r_perfective_gerund()) {
break lab6;
}
break lab5;
}
cursor = limit - v_8;
int v_9 = limit - cursor;
lab7: {
if (!r_reflexive())
lab7:
{
if (!r_reflexive()) {
cursor = limit - v_9;
break lab7;
}
}
lab8: {
int v_10 = limit - cursor;
lab9: {
if (!r_adjectival())
lab8:
{
int v_10 = limit - cursor;
lab9:
{
if (!r_adjectival()) {
break lab9;
}
break lab8;
}
cursor = limit - v_10;
lab10: {
if (!r_verb())
lab10:
{
if (!r_verb()) {
break lab10;
}
break lab8;
}
cursor = limit - v_10;
if (!r_noun())
{
if (!r_noun()) {
break lab4;
}
}
@ -551,10 +533,10 @@ public boolean stem() {
}
cursor = limit - v_7;
int v_11 = limit - cursor;
lab11: {
ket = cursor;
if (!(eq_s_b("\u0438")))
lab11:
{
ket = cursor;
if (!(eq_s_b("\u0438"))) {
cursor = limit - v_11;
break lab11;
}
@ -581,8 +563,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return RussianStemmer.class.getName().hashCode();
}
}

368
lucene/analysis/common/src/java/org/tartarus/snowball/ext/SerbianStemmer.java
View File

@ -6,17 +6,17 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class SerbianStemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
private static final Among a_0[] = {
new Among("\u0430", -1, 1),
new Among("\u0431", -1, 2),
new Among("\u0432", -1, 3),
@ -49,7 +49,7 @@ private final static Among a_0[] = {
new Among("\u045F", -1, 29)
};
private final static Among a_1[] = {
private static final Among a_1[] = {
new Among("daba", -1, 73),
new Among("ajaca", -1, 12),
new Among("ejaca", -1, 14),
@ -182,7 +182,7 @@ private final static Among a_1[] = {
new Among("o\u0161\u0107u", -1, 71)
};
private final static Among a_2[] = {
private static final Among a_2[] = {
new Among("aca", -1, 124),
new Among("eca", -1, 125),
new Among("uca", -1, 126),
@ -2220,7 +2220,7 @@ private final static Among a_2[] = {
new Among("ro\u0161i\u0161", 2029, 90)
};
private final static Among a_3[] = {
private static final Among a_3[] = {
new Among("a", -1, 1),
new Among("oga", 0, 1),
new Among("ama", 0, 1),
@ -2253,30 +2253,33 @@ private static final char g_v[] = {17, 65, 16 };
private static final char g_sa[] = {65, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 128};
private static final char g_ca[] = {119, 95, 23, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 32, 136, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128, 0, 0, 0, 16 };
private static final char g_ca[] = {
119, 95, 23, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 32, 136, 0, 0, 0, 0, 0, 0, 0, 0,
0, 128, 0, 0, 0, 16
};
private static final char g_rg[] = {1};
private int I_p1;
private boolean B_no_diacritics;
private boolean r_cyr_to_lat() {
int among_var;
int v_1 = cursor;
lab0: {
while(true)
lab0:
{
while (true) {
int v_2 = cursor;
lab1: {
golab2: while(true)
lab1:
{
golab2:
while (true) {
int v_3 = cursor;
lab3: {
lab3:
{
bra = cursor;
among_var = find_among(a_0);
if (among_var == 0)
{
if (among_var == 0) {
break lab3;
}
ket = cursor;
@ -2376,8 +2379,7 @@ private boolean r_cyr_to_lat() {
break golab2;
}
cursor = v_3;
if (cursor >= limit)
{
if (cursor >= limit) {
break lab1;
}
cursor++;
@ -2394,27 +2396,26 @@ private boolean r_cyr_to_lat() {
private boolean r_prelude() {
int v_1 = cursor;
lab0: {
while(true)
lab0:
{
while (true) {
int v_2 = cursor;
lab1: {
golab2: while(true)
lab1:
{
golab2:
while (true) {
int v_3 = cursor;
lab3: {
if (!(in_grouping(g_ca, 98, 382)))
lab3:
{
if (!(in_grouping(g_ca, 98, 382))) {
break lab3;
}
bra = cursor;
if (!(eq_s("ije")))
{
if (!(eq_s("ije"))) {
break lab3;
}
ket = cursor;
if (!(in_grouping(g_ca, 98, 382)))
{
if (!(in_grouping(g_ca, 98, 382))) {
break lab3;
}
slice_from("e");
@ -2422,8 +2423,7 @@ private boolean r_prelude() {
break golab2;
}
cursor = v_3;
if (cursor >= limit)
{
if (cursor >= limit) {
break lab1;
}
cursor++;
@ -2436,27 +2436,26 @@ private boolean r_prelude() {
}
cursor = v_1;
int v_4 = cursor;
lab4: {
while(true)
lab4:
{
while (true) {
int v_5 = cursor;
lab5: {
golab6: while(true)
lab5:
{
golab6:
while (true) {
int v_6 = cursor;
lab7: {
if (!(in_grouping(g_ca, 98, 382)))
lab7:
{
if (!(in_grouping(g_ca, 98, 382))) {
break lab7;
}
bra = cursor;
if (!(eq_s("je")))
{
if (!(eq_s("je"))) {
break lab7;
}
ket = cursor;
if (!(in_grouping(g_ca, 98, 382)))
{
if (!(in_grouping(g_ca, 98, 382))) {
break lab7;
}
slice_from("e");
@ -2464,8 +2463,7 @@ private boolean r_prelude() {
break golab6;
}
cursor = v_6;
if (cursor >= limit)
{
if (cursor >= limit) {
break lab5;
}
cursor++;
@ -2478,18 +2476,19 @@ private boolean r_prelude() {
}
cursor = v_4;
int v_7 = cursor;
lab8: {
while(true)
lab8:
{
while (true) {
int v_8 = cursor;
lab9: {
golab10: while(true)
lab9:
{
golab10:
while (true) {
int v_9 = cursor;
lab11: {
bra = cursor;
if (!(eq_s("dj")))
lab11:
{
bra = cursor;
if (!(eq_s("dj"))) {
break lab11;
}
ket = cursor;
@ -2498,8 +2497,7 @@ private boolean r_prelude() {
break golab10;
}
cursor = v_9;
if (cursor >= limit)
{
if (cursor >= limit) {
break lab9;
}
cursor++;
@ -2517,18 +2515,18 @@ private boolean r_prelude() {
private boolean r_mark_regions() {
B_no_diacritics = true;
int v_1 = cursor;
lab0: {
golab1: while(true)
lab0:
{
lab2: {
if (!(in_grouping(g_sa, 263, 382)))
golab1:
while (true) {
lab2:
{
if (!(in_grouping(g_sa, 263, 382))) {
break lab2;
}
break golab1;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -2538,38 +2536,36 @@ private boolean r_mark_regions() {
cursor = v_1;
I_p1 = limit;
int v_3 = cursor;
lab3: {
golab4: while(true)
lab3:
{
lab5: {
if (!(in_grouping(g_v, 97, 117)))
golab4:
while (true) {
lab5:
{
if (!(in_grouping(g_v, 97, 117))) {
break lab5;
}
break golab4;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab3;
}
cursor++;
}
I_p1 = cursor;
if (!(I_p1 < 2))
{
if (!(I_p1 < 2)) {
break lab3;
}
golab6: while(true)
{
lab7: {
if (!(out_grouping(g_v, 97, 117)))
golab6:
while (true) {
lab7:
{
if (!(out_grouping(g_v, 97, 117))) {
break lab7;
}
break golab6;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab3;
}
cursor++;
@ -2578,50 +2574,49 @@ private boolean r_mark_regions() {
}
cursor = v_3;
int v_6 = cursor;
lab8: {
golab9: while(true)
lab8:
{
lab10: {
if (!(eq_s("r")))
golab9:
while (true) {
lab10:
{
if (!(eq_s("r"))) {
break lab10;
}
break golab9;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab8;
}
cursor++;
}
lab11: {
int v_8 = cursor;
lab12: {
if (!(cursor >= 2))
lab11:
{
int v_8 = cursor;
lab12:
{
if (!(cursor >= 2)) {
break lab12;
}
break lab11;
}
cursor = v_8;
golab13: while(true)
{
lab14: {
if (!(out_grouping(g_rg, 114, 114)))
golab13:
while (true) {
lab14:
{
if (!(out_grouping(g_rg, 114, 114))) {
break lab14;
}
break golab13;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab8;
}
cursor++;
}
}
if (!((I_p1 - cursor) > 1))
{
if (!((I_p1 - cursor) > 1)) {
break lab8;
}
I_p1 = cursor;
@ -2631,8 +2626,7 @@ private boolean r_mark_regions() {
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
if (!(I_p1 <= cursor)) {
return false;
}
return true;
@ -2642,8 +2636,7 @@ private boolean r_Step_1() {
int among_var;
ket = cursor;
among_var = find_among_b(a_1);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
@ -2667,8 +2660,7 @@ private boolean r_Step_1() {
slice_from("\u010Dajni");
break;
case 7:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("cajni");
@ -2743,8 +2735,7 @@ private boolean r_Step_1() {
slice_from("du\u0161ni");
break;
case 31:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("dusni");
@ -2810,8 +2801,7 @@ private boolean r_Step_1() {
slice_from("\u0161avi");
break;
case 52:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("savi");
@ -2823,8 +2813,7 @@ private boolean r_Step_1() {
slice_from("a\u010Dka");
break;
case 55:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("acka");
@ -2833,8 +2822,7 @@ private boolean r_Step_1() {
slice_from("u\u0161ka");
break;
case 57:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("uska");
@ -2861,8 +2849,7 @@ private boolean r_Step_1() {
slice_from("ti\u010Dni");
break;
case 65:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("ticni");
@ -2886,8 +2873,7 @@ private boolean r_Step_1() {
slice_from("osti");
break;
case 72:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("osti");
@ -2947,8 +2933,7 @@ private boolean r_Step_1() {
slice_from("a\u0161ni");
break;
case 91:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("asni");
@ -2961,13 +2946,11 @@ private boolean r_Step_2() {
int among_var;
ket = cursor;
among_var = find_among_b(a_2);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
return false;
}
switch (among_var) {
@ -3332,309 +3315,265 @@ private boolean r_Step_2() {
slice_from("at");
break;
case 121:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("luc");
break;
case 122:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("snj");
break;
case 123:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("os");
break;
case 124:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("ac");
break;
case 125:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("ec");
break;
case 126:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("uc");
break;
case 127:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("rosi");
break;
case 128:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("aca");
break;
case 129:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("jas");
break;
case 130:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("tas");
break;
case 131:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("gas");
break;
case 132:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("nas");
break;
case 133:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("kas");
break;
case 134:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("vas");
break;
case 135:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("bas");
break;
case 136:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("as");
break;
case 137:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("cin");
break;
case 138:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("astaj");
break;
case 139:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("istaj");
break;
case 140:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("ostaj");
break;
case 141:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("asta");
break;
case 142:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("ista");
break;
case 143:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("osta");
break;
case 144:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("ava");
break;
case 145:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("eva");
break;
case 146:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("iva");
break;
case 147:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("uva");
break;
case 148:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("ova");
break;
case 149:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("jeti");
break;
case 150:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("inj");
break;
case 151:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("ist");
break;
case 152:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("es");
break;
case 153:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("et");
break;
case 154:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("is");
break;
case 155:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("ir");
break;
case 156:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("ur");
break;
case 157:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("uj");
break;
case 158:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("ni");
break;
case 159:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("sn");
break;
case 160:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("ta");
break;
case 161:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("a");
break;
case 162:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("i");
break;
case 163:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("e");
break;
case 164:
if (!(B_no_diacritics))
{
if (!(B_no_diacritics)) {
return false;
}
slice_from("n");
@ -3645,13 +3584,11 @@ private boolean r_Step_2() {
private boolean r_Step_3() {
ket = cursor;
if (find_among_b(a_3) == 0)
{
if (find_among_b(a_3) == 0) {
return false;
}
bra = cursor;
if (!r_R1())
{
if (!r_R1()) {
return false;
}
slice_from("");
@ -3669,19 +3606,20 @@ public boolean stem() {
r_Step_1();
cursor = limit - v_4;
int v_5 = limit - cursor;
lab0: {
lab1: {
int v_6 = limit - cursor;
lab2: {
if (!r_Step_2())
lab0:
{
lab1:
{
int v_6 = limit - cursor;
lab2:
{
if (!r_Step_2()) {
break lab2;
}
break lab1;
}
cursor = limit - v_6;
if (!r_Step_3())
{
if (!r_Step_3()) {
break lab0;
}
}
@ -3700,8 +3638,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return SerbianStemmer.class.getName().hashCode();
}
}

341
lucene/analysis/common/src/java/org/tartarus/snowball/ext/SpanishStemmer.java
View File

@ -6,17 +6,17 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class SpanishStemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
private static final Among a_0[] = {
new Among("", -1, 6),
new Among("\u00E1", 0, 1),
new Among("\u00E9", 0, 2),
@ -25,7 +25,7 @@ private final static Among a_0[] = {
new Among("\u00FA", 0, 5)
};
private final static Among a_1[] = {
private static final Among a_1[] = {
new Among("la", -1, -1),
new Among("sela", 0, -1),
new Among("le", -1, -1),
@ -41,7 +41,7 @@ private final static Among a_1[] = {
new Among("nos", -1, -1)
};
private final static Among a_2[] = {
private static final Among a_2[] = {
new Among("ando", -1, 6),
new Among("iendo", -1, 6),
new Among("yendo", -1, 7),
@ -55,26 +55,22 @@ private final static Among a_2[] = {
new Among("\u00EDr", -1, 5)
};
private final static Among a_3[] = {
private static final Among a_3[] = {
new Among("ic", -1, -1),
new Among("ad", -1, -1),
new Among("os", -1, -1),
new Among("iv", -1, 1)
};
private final static Among a_4[] = {
new Among("able", -1, 1),
new Among("ible", -1, 1),
new Among("ante", -1, 1)
private static final Among a_4[] = {
new Among("able", -1, 1), new Among("ible", -1, 1), new Among("ante", -1, 1)
};
private final static Among a_5[] = {
new Among("ic", -1, 1),
new Among("abil", -1, 1),
new Among("iv", -1, 1)
private static final Among a_5[] = {
new Among("ic", -1, 1), new Among("abil", -1, 1), new Among("iv", -1, 1)
};
private final static Among a_6[] = {
private static final Among a_6[] = {
new Among("ica", -1, 1),
new Among("ancia", -1, 2),
new Among("encia", -1, 5),
@ -123,7 +119,7 @@ private final static Among a_6[] = {
new Among("ivos", -1, 9)
};
private final static Among a_7[] = {
private static final Among a_7[] = {
new Among("ya", -1, 1),
new Among("ye", -1, 1),
new Among("yan", -1, 1),
@ -138,7 +134,7 @@ private final static Among a_7[] = {
new Among("y\u00F3", -1, 1)
};
private final static Among a_8[] = {
private static final Among a_8[] = {
new Among("aba", -1, 2),
new Among("ada", -1, 2),
new Among("ida", -1, 2),
@ -237,7 +233,7 @@ private final static Among a_8[] = {
new Among("i\u00F3", -1, 2)
};
private final static Among a_9[] = {
private static final Among a_9[] = {
new Among("a", -1, 1),
new Among("e", -1, 2),
new Among("o", -1, 1),
@ -248,44 +244,47 @@ private final static Among a_9[] = {
new Among("\u00F3", -1, 1)
};
private static final char g_v[] = {17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 17, 4, 10 };
private static final char g_v[] = {
17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 17, 4, 10
};
private int I_p2;
private int I_p1;
private int I_pV;
private boolean r_mark_regions() {
I_pV = limit;
I_p1 = limit;
I_p2 = limit;
int v_1 = cursor;
lab0: {
lab1: {
int v_2 = cursor;
lab2: {
if (!(in_grouping(g_v, 97, 252)))
lab0:
{
lab1:
{
int v_2 = cursor;
lab2:
{
if (!(in_grouping(g_v, 97, 252))) {
break lab2;
}
lab3: {
int v_3 = cursor;
lab4: {
if (!(out_grouping(g_v, 97, 252)))
lab3:
{
int v_3 = cursor;
lab4:
{
if (!(out_grouping(g_v, 97, 252))) {
break lab4;
}
golab5: while(true)
{
lab6: {
if (!(in_grouping(g_v, 97, 252)))
golab5:
while (true) {
lab6:
{
if (!(in_grouping(g_v, 97, 252))) {
break lab6;
}
break golab5;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab4;
}
cursor++;
@ -293,21 +292,19 @@ private boolean r_mark_regions() {
break lab3;
}
cursor = v_3;
if (!(in_grouping(g_v, 97, 252)))
{
if (!(in_grouping(g_v, 97, 252))) {
break lab2;
}
golab7: while(true)
{
lab8: {
if (!(out_grouping(g_v, 97, 252)))
golab7:
while (true) {
lab8:
{
if (!(out_grouping(g_v, 97, 252))) {
break lab8;
}
break golab7;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab2;
}
cursor++;
@ -316,28 +313,27 @@ private boolean r_mark_regions() {
break lab1;
}
cursor = v_2;
if (!(out_grouping(g_v, 97, 252)))
{
if (!(out_grouping(g_v, 97, 252))) {
break lab0;
}
lab9: {
int v_6 = cursor;
lab10: {
if (!(out_grouping(g_v, 97, 252)))
lab9:
{
int v_6 = cursor;
lab10:
{
if (!(out_grouping(g_v, 97, 252))) {
break lab10;
}
golab11: while(true)
{
lab12: {
if (!(in_grouping(g_v, 97, 252)))
golab11:
while (true) {
lab12:
{
if (!(in_grouping(g_v, 97, 252))) {
break lab12;
}
break golab11;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab10;
}
cursor++;
@ -345,12 +341,10 @@ private boolean r_mark_regions() {
break lab9;
}
cursor = v_6;
if (!(in_grouping(g_v, 97, 252)))
{
if (!(in_grouping(g_v, 97, 252))) {
break lab0;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -360,64 +354,61 @@ private boolean r_mark_regions() {
}
cursor = v_1;
int v_8 = cursor;
lab13: {
golab14: while(true)
lab13:
{
lab15: {
if (!(in_grouping(g_v, 97, 252)))
golab14:
while (true) {
lab15:
{
if (!(in_grouping(g_v, 97, 252))) {
break lab15;
}
break golab14;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab13;
}
cursor++;
}
golab16: while(true)
{
lab17: {
if (!(out_grouping(g_v, 97, 252)))
golab16:
while (true) {
lab17:
{
if (!(out_grouping(g_v, 97, 252))) {
break lab17;
}
break golab16;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab13;
}
cursor++;
}
I_p1 = cursor;
golab18: while(true)
{
lab19: {
if (!(in_grouping(g_v, 97, 252)))
golab18:
while (true) {
lab19:
{
if (!(in_grouping(g_v, 97, 252))) {
break lab19;
}
break golab18;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab13;
}
cursor++;
}
golab20: while(true)
{
lab21: {
if (!(out_grouping(g_v, 97, 252)))
golab20:
while (true) {
lab21:
{
if (!(out_grouping(g_v, 97, 252))) {
break lab21;
}
break golab20;
}
if (cursor >= limit)
{
if (cursor >= limit) {
break lab13;
}
cursor++;
@ -430,14 +421,13 @@ private boolean r_mark_regions() {
private boolean r_postlude() {
int among_var;
while(true)
{
while (true) {
int v_1 = cursor;
lab0: {
lab0:
{
bra = cursor;
among_var = find_among(a_0);
if (among_var == 0)
{
if (among_var == 0) {
break lab0;
}
ket = cursor;
@ -458,8 +448,7 @@ private boolean r_postlude() {
slice_from("u");
break;
case 6:
if (cursor >= limit)
{
if (cursor >= limit) {
break lab0;
}
cursor++;
@ -474,24 +463,21 @@ private boolean r_postlude() {
}
private boolean r_RV() {
if (!(I_pV <= cursor))
{
if (!(I_pV <= cursor)) {
return false;
}
return true;
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
if (!(I_p1 <= cursor)) {
return false;
}
return true;
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
if (!(I_p2 <= cursor)) {
return false;
}
return true;
@ -500,18 +486,15 @@ private boolean r_R2() {
private boolean r_attached_pronoun() {
int among_var;
ket = cursor;
if (find_among_b(a_1) == 0)
{
if (find_among_b(a_1) == 0) {
return false;
}
bra = cursor;
among_var = find_among_b(a_2);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
if (!r_RV())
{
if (!r_RV()) {
return false;
}
switch (among_var) {
@ -539,8 +522,7 @@ private boolean r_attached_pronoun() {
slice_del();
break;
case 7:
if (!(eq_s_b("u")))
{
if (!(eq_s_b("u"))) {
return false;
}
slice_del();
@ -553,36 +535,32 @@ private boolean r_standard_suffix() {
int among_var;
ket = cursor;
among_var = find_among_b(a_6);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
switch (among_var) {
case 1:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_del();
break;
case 2:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_del();
int v_1 = limit - cursor;
lab0: {
ket = cursor;
if (!(eq_s_b("ic")))
lab0:
{
ket = cursor;
if (!(eq_s_b("ic"))) {
cursor = limit - v_1;
break lab0;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
cursor = limit - v_1;
break lab0;
}
@ -590,44 +568,39 @@ private boolean r_standard_suffix() {
}
break;
case 3:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_from("log");
break;
case 4:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_from("u");
break;
case 5:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_from("ente");
break;
case 6:
if (!r_R1())
{
if (!r_R1()) {
return false;
}
slice_del();
int v_2 = limit - cursor;
lab1: {
lab1:
{
ket = cursor;
among_var = find_among_b(a_3);
if (among_var == 0)
{
if (among_var == 0) {
cursor = limit - v_2;
break lab1;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
cursor = limit - v_2;
break lab1;
}
@ -635,14 +608,12 @@ private boolean r_standard_suffix() {
switch (among_var) {
case 1:
ket = cursor;
if (!(eq_s_b("at")))
{
if (!(eq_s_b("at"))) {
cursor = limit - v_2;
break lab1;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
cursor = limit - v_2;
break lab1;
}
@ -652,22 +623,20 @@ private boolean r_standard_suffix() {
}
break;
case 7:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_del();
int v_3 = limit - cursor;
lab2: {
ket = cursor;
if (find_among_b(a_4) == 0)
lab2:
{
ket = cursor;
if (find_among_b(a_4) == 0) {
cursor = limit - v_3;
break lab2;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
cursor = limit - v_3;
break lab2;
}
@ -675,22 +644,20 @@ private boolean r_standard_suffix() {
}
break;
case 8:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_del();
int v_4 = limit - cursor;
lab3: {
ket = cursor;
if (find_among_b(a_5) == 0)
lab3:
{
ket = cursor;
if (find_among_b(a_5) == 0) {
cursor = limit - v_4;
break lab3;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
cursor = limit - v_4;
break lab3;
}
@ -698,22 +665,20 @@ private boolean r_standard_suffix() {
}
break;
case 9:
if (!r_R2())
{
if (!r_R2()) {
return false;
}
slice_del();
int v_5 = limit - cursor;
lab4: {
ket = cursor;
if (!(eq_s_b("at")))
lab4:
{
ket = cursor;
if (!(eq_s_b("at"))) {
cursor = limit - v_5;
break lab4;
}
bra = cursor;
if (!r_R2())
{
if (!r_R2()) {
cursor = limit - v_5;
break lab4;
}
@ -725,22 +690,19 @@ private boolean r_standard_suffix() {
}
private boolean r_y_verb_suffix() {
if (cursor < I_pV)
{
if (cursor < I_pV) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_pV;
ket = cursor;
if (find_among_b(a_7) == 0)
{
if (find_among_b(a_7) == 0) {
limit_backward = v_2;
return false;
}
bra = cursor;
limit_backward = v_2;
if (!(eq_s_b("u")))
{
if (!(eq_s_b("u"))) {
return false;
}
slice_del();
@ -749,16 +711,14 @@ private boolean r_y_verb_suffix() {
private boolean r_verb_suffix() {
int among_var;
if (cursor < I_pV)
{
if (cursor < I_pV) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_pV;
ket = cursor;
among_var = find_among_b(a_8);
if (among_var == 0)
{
if (among_var == 0) {
limit_backward = v_2;
return false;
}
@ -767,15 +727,14 @@ private boolean r_verb_suffix() {
switch (among_var) {
case 1:
int v_3 = limit - cursor;
lab0: {
if (!(eq_s_b("u")))
lab0:
{
if (!(eq_s_b("u"))) {
cursor = limit - v_3;
break lab0;
}
int v_4 = limit - cursor;
if (!(eq_s_b("g")))
{
if (!(eq_s_b("g"))) {
cursor = limit - v_3;
break lab0;
}
@ -795,43 +754,38 @@ private boolean r_residual_suffix() {
int among_var;
ket = cursor;
among_var = find_among_b(a_9);
if (among_var == 0)
{
if (among_var == 0) {
return false;
}
bra = cursor;
switch (among_var) {
case 1:
if (!r_RV())
{
if (!r_RV()) {
return false;
}
slice_del();
break;
case 2:
if (!r_RV())
{
if (!r_RV()) {
return false;
}
slice_del();
int v_1 = limit - cursor;
lab0: {
ket = cursor;
if (!(eq_s_b("u")))
lab0:
{
ket = cursor;
if (!(eq_s_b("u"))) {
cursor = limit - v_1;
break lab0;
}
bra = cursor;
int v_2 = limit - cursor;
if (!(eq_s_b("g")))
{
if (!(eq_s_b("g"))) {
cursor = limit - v_1;
break lab0;
}
cursor = limit - v_2;
if (!r_RV())
{
if (!r_RV()) {
cursor = limit - v_1;
break lab0;
}
@ -851,27 +805,28 @@ public boolean stem() {
r_attached_pronoun();
cursor = limit - v_2;
int v_3 = limit - cursor;
lab0: {
lab1: {
int v_4 = limit - cursor;
lab2: {
if (!r_standard_suffix())
lab0:
{
lab1:
{
int v_4 = limit - cursor;
lab2:
{
if (!r_standard_suffix()) {
break lab2;
}
break lab1;
}
cursor = limit - v_4;
lab3: {
if (!r_y_verb_suffix())
lab3:
{
if (!r_y_verb_suffix()) {
break lab3;
}
break lab1;
}
cursor = limit - v_4;
if (!r_verb_suffix())
{
if (!r_verb_suffix()) {
break lab0;
}
}
@ -896,8 +851,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return SpanishStemmer.class.getName().hashCode();
}
}

72
lucene/analysis/common/src/java/org/tartarus/snowball/ext/SwedishStemmer.java
View File

@ -6,17 +6,17 @@ import org.tartarus.snowball.Among;
/**
* This class implements the stemming algorithm defined by a snowball script.
* <p>
* Generated by Snowball 2.0.0 - https://snowballstem.org/
* </p>
*
* <p>Generated by Snowball 2.0.0 - https://snowballstem.org/
*/
@SuppressWarnings("unused")
public class SwedishStemmer extends org.tartarus.snowball.SnowballStemmer {
private static final long serialVersionUID = 1L;
private static final java.lang.invoke.MethodHandles.Lookup methodObject = java.lang.invoke.MethodHandles.lookup();
private static final java.lang.invoke.MethodHandles.Lookup methodObject =
java.lang.invoke.MethodHandles.lookup();
private final static Among a_0[] = {
private static final Among a_0[] = {
new Among("a", -1, 1),
new Among("arna", 0, 1),
new Among("erna", 0, 1),
@ -56,7 +56,7 @@ private final static Among a_0[] = {
new Among("ast", -1, 1)
};
private final static Among a_1[] = {
private static final Among a_1[] = {
new Among("dd", -1, -1),
new Among("gd", -1, -1),
new Among("nn", -1, -1),
@ -66,7 +66,7 @@ private final static Among a_1[] = {
new Among("tt", -1, -1)
};
private final static Among a_2[] = {
private static final Among a_2[] = {
new Among("ig", -1, 1),
new Among("lig", 0, 1),
new Among("els", -1, 1),
@ -81,57 +81,53 @@ private static final char g_s_ending[] = {119, 127, 149 };
private int I_x;
private int I_p1;
private boolean r_mark_regions() {
I_p1 = limit;
int v_1 = cursor;
{
int c = cursor + 3;
if (0 > c || c > limit)
{
if (0 > c || c > limit) {
return false;
}
cursor = c;
}
I_x = cursor;
cursor = v_1;
golab0: while(true)
{
golab0:
while (true) {
int v_2 = cursor;
lab1: {
if (!(in_grouping(g_v, 97, 246)))
lab1:
{
if (!(in_grouping(g_v, 97, 246))) {
break lab1;
}
cursor = v_2;
break golab0;
}
cursor = v_2;
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
}
golab2: while(true)
{
lab3: {
if (!(out_grouping(g_v, 97, 246)))
golab2:
while (true) {
lab3:
{
if (!(out_grouping(g_v, 97, 246))) {
break lab3;
}
break golab2;
}
if (cursor >= limit)
{
if (cursor >= limit) {
return false;
}
cursor++;
}
I_p1 = cursor;
lab4: {
if (!(I_p1 < I_x))
lab4:
{
if (!(I_p1 < I_x)) {
break lab4;
}
I_p1 = I_x;
@ -141,16 +137,14 @@ private boolean r_mark_regions() {
private boolean r_main_suffix() {
int among_var;
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_p1;
ket = cursor;
among_var = find_among_b(a_0);
if (among_var == 0)
{
if (among_var == 0) {
limit_backward = v_2;
return false;
}
@ -161,8 +155,7 @@ private boolean r_main_suffix() {
slice_del();
break;
case 2:
if (!(in_grouping_b(g_s_ending, 98, 121)))
{
if (!(in_grouping_b(g_s_ending, 98, 121))) {
return false;
}
slice_del();
@ -172,22 +165,19 @@ private boolean r_main_suffix() {
}
private boolean r_consonant_pair() {
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_p1;
int v_3 = limit - cursor;
if (find_among_b(a_1) == 0)
{
if (find_among_b(a_1) == 0) {
limit_backward = v_2;
return false;
}
cursor = limit - v_3;
ket = cursor;
if (cursor <= limit_backward)
{
if (cursor <= limit_backward) {
limit_backward = v_2;
return false;
}
@ -200,16 +190,14 @@ private boolean r_consonant_pair() {
private boolean r_other_suffix() {
int among_var;
if (cursor < I_p1)
{
if (cursor < I_p1) {
return false;
}
int v_2 = limit_backward;
limit_backward = I_p1;
ket = cursor;
among_var = find_among_b(a_2);
if (among_var == 0)
{
if (among_var == 0) {
limit_backward = v_2;
return false;
}
@ -258,8 +246,4 @@ public boolean equals( Object o ) {
public int hashCode() {
return SwedishStemmer.class.getName().hashCode();
}
}

894
lucene/analysis/common/src/java/org/tartarus/snowball/ext/TamilStemmer.java
View File

File diff suppressed because it is too large Load Diff

1299
lucene/analysis/common/src/java/org/tartarus/snowball/ext/TurkishStemmer.java
View File

File diff suppressed because it is too large Load Diff

560
lucene/analysis/common/src/java/org/tartarus/snowball/ext/YiddishStemmer.java
View File

File diff suppressed because it is too large Load Diff

4
lucene/analysis/common/src/java/org/tartarus/snowball/ext/package-info.java
View File

@ -15,7 +15,5 @@
* limitations under the License.
*/
/**
* Autogenerated snowball stemmer implementations.
*/
/** Autogenerated snowball stemmer implementations. */
package org.tartarus.snowball.ext;

4
lucene/analysis/common/src/java/org/tartarus/snowball/package-info.java
View File

@ -15,7 +15,5 @@
* limitations under the License.
*/
/**
* Snowball stemmer API
*/
/** Snowball stemmer API */
package org.tartarus.snowball;