How to use
hasFlag
method
in
org.apache.lucene.analysis.hunspell.Dictionary

Best Java code snippets using org.apache.lucene.analysis.hunspell.Dictionary.hasFlag (Showing top 6 results out of 315)

char wordFlags[] = Dictionary.decodeFlags(scratch);
if (checkKeepCase && Dictionary.hasFlag(wordFlags, (char)dictionary.keepcase)) {
 continue;
if (checkNeedAffix && Dictionary.hasFlag(wordFlags, (char)dictionary.needaffix)) {
 continue;
if (checkOnlyInCompound && Dictionary.hasFlag(wordFlags, (char)dictionary.onlyincompound)) {
 continue;

 dictionary.flagLookup.get(forms.ints[forms.offset+i], scratch);
 char wordFlags[] = Dictionary.decodeFlags(scratch);
 if (Dictionary.hasFlag(wordFlags, flag)) {
  if (chainedPrefix == false && prefixFlag >= 0 && !Dictionary.hasFlag(wordFlags, (char)prefixFlag)) {
   dictionary.flagLookup.get(append, scratch);
   char appendFlags[] = Dictionary.decodeFlags(scratch);
   boolean suffixCircumfix = Dictionary.hasFlag(appendFlags, (char)dictionary.circumfix);
   if (circumfix != suffixCircumfix) {
    continue;
  if (caseVariant && dictionary.keepcase != -1 && Dictionary.hasFlag(wordFlags, (char)dictionary.keepcase)) {
   continue;
  if (dictionary.onlyincompound != -1 && Dictionary.hasFlag(wordFlags, (char)dictionary.onlyincompound)) {
   continue;
dictionary.flagLookup.get(append, scratch);
char appendFlags[] = Dictionary.decodeFlags(scratch);
circumfix = Dictionary.hasFlag(appendFlags, (char)dictionary.circumfix);

  compatible = !Dictionary.hasFlag(appendFlags, (char) dictionary.onlyincompound);
 assert prevFlag >= 0;
 boolean allowed = dictionary.onlyincompound == -1 || 
          !Dictionary.hasFlag(appendFlags, (char) dictionary.onlyincompound);
 compatible = allowed && hasCrossCheckedFlag((char)prevFlag, appendFlags, false);
} else {
  compatible = !Dictionary.hasFlag(appendFlags, (char) dictionary.onlyincompound);
 assert prevFlag >= 0;
 boolean allowed = dictionary.onlyincompound == -1 || 
          !Dictionary.hasFlag(appendFlags, (char) dictionary.onlyincompound);
 compatible = allowed && hasCrossCheckedFlag((char)prevFlag, appendFlags, previousWasPrefix);
} else {

char wordFlags[] = Dictionary.decodeFlags(scratch);
if (checkKeepCase && Dictionary.hasFlag(wordFlags, (char)dictionary.keepcase)) {
 continue;
if (checkNeedAffix && Dictionary.hasFlag(wordFlags, (char)dictionary.needaffix)) {
 continue;
if (checkOnlyInCompound && Dictionary.hasFlag(wordFlags, (char)dictionary.onlyincompound)) {
 continue;

 dictionary.flagLookup.get(forms.ints[forms.offset+i], scratch);
 char wordFlags[] = Dictionary.decodeFlags(scratch);
 if (Dictionary.hasFlag(wordFlags, flag)) {
  if (chainedPrefix == false && prefixFlag >= 0 && !Dictionary.hasFlag(wordFlags, (char)prefixFlag)) {
   dictionary.flagLookup.get(append, scratch);
   char appendFlags[] = Dictionary.decodeFlags(scratch);
   boolean suffixCircumfix = Dictionary.hasFlag(appendFlags, (char)dictionary.circumfix);
   if (circumfix != suffixCircumfix) {
    continue;
  if (caseVariant && dictionary.keepcase != -1 && Dictionary.hasFlag(wordFlags, (char)dictionary.keepcase)) {
   continue;
  if (dictionary.onlyincompound != -1 && Dictionary.hasFlag(wordFlags, (char)dictionary.onlyincompound)) {
   continue;
dictionary.flagLookup.get(append, scratch);
char appendFlags[] = Dictionary.decodeFlags(scratch);
circumfix = Dictionary.hasFlag(appendFlags, (char)dictionary.circumfix);

  compatible = !Dictionary.hasFlag(appendFlags, (char) dictionary.onlyincompound);
 assert prevFlag >= 0;
 boolean allowed = dictionary.onlyincompound == -1 || 
          !Dictionary.hasFlag(appendFlags, (char) dictionary.onlyincompound);
 compatible = allowed && hasCrossCheckedFlag((char)prevFlag, appendFlags, false);
} else {
  compatible = !Dictionary.hasFlag(appendFlags, (char) dictionary.onlyincompound);
 assert prevFlag >= 0;
 boolean allowed = dictionary.onlyincompound == -1 || 
          !Dictionary.hasFlag(appendFlags, (char) dictionary.onlyincompound);
 compatible = allowed && hasCrossCheckedFlag((char)prevFlag, appendFlags, previousWasPrefix);
} else {

Popular methods of Dictionary

<init>
Creates a new Dictionary containing the information read from the provided InputStreams to hunspell
affixFST
applyMappings
caseFold
folds single character (according to LANG if present)
cleanInput
decodeFlags
encodeFlags
escapeDash
getAliasValue
getDictionaryEncoding
Parses the encoding specified in the affix file readable through the provided InputStream
getFlagParsingStrategy
Determines the appropriate FlagParsingStrategy based on the FLAG definition line taken from the affi
getJavaEncoding
Retrieves the CharsetDecoder for the given encoding. Note, This isn't perfect as I think ISCII-DEVAN

Popular in Java

Making http requests using okhttp
requestLocationUpdates (LocationManager)
setContentView (Activity)
getExternalFilesDir (Context)
URI (java.net)
A Uniform Resource Identifier that identifies an abstract or physical resource, as specified by RFC
SQLException (java.sql)
An exception that indicates a failed JDBC operation. It provides the following information about pro
TreeSet (java.util)
TreeSet is an implementation of SortedSet. All optional operations (adding and removing) are support
UUID (java.util)
UUID is an immutable representation of a 128-bit universally unique identifier (UUID). There are mul
JFrame (javax.swing)
Table (org.hibernate.mapping)
A relational table
Best plugins for Eclipse

How to use hasFlagmethodin org.apache.lucene.analysis.hunspell.Dictionary

Best Java code snippets using org.apache.lucene.analysis.hunspell.Dictionary.hasFlag (Showing top 6 results out of 315)

How to use
hasFlag
method
in
org.apache.lucene.analysis.hunspell.Dictionary