All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.apache.lucene.analysis.hunspell.Root Maven / Gradle / Ivy

/*
 * Licensed to the Apache Software Foundation (ASF) under one or more
 * contributor license agreements.  See the NOTICE file distributed with
 * this work for additional information regarding copyright ownership.
 * The ASF licenses this file to You under the Apache License, Version 2.0
 * (the "License"); you may not use this file except in compliance with
 * the License.  You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package org.apache.lucene.analysis.hunspell;

import java.util.Objects;

class Root implements Comparable> {
  final T word;
  final int entryId;

  Root(T word, int entryId) {
    this.word = word;
    this.entryId = entryId;
  }

  @Override
  public String toString() {
    return word.toString();
  }

  @Override
  public boolean equals(Object o) {
    if (this == o) return true;
    if (!(o instanceof Root)) return false;
    @SuppressWarnings("unchecked")
    Root root = (Root) o;
    return entryId == root.entryId && word.equals(root.word);
  }

  @Override
  public int hashCode() {
    return Objects.hash(word, entryId);
  }

  @Override
  public int compareTo(Root o) {
    T cs1 = this.word;
    T cs2 = o.word;
    for (int i = 0, len = Math.min(cs1.length(), cs2.length()); i < len; i++) {
      char a = cs1.charAt(i);
      char b = cs2.charAt(i);
      if (a != b) {
        return a - b;
      }
    }

    return cs1.length() - cs2.length();
  }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy