com.simiacryptus.text.NodeData Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of char-trie Show documentation
Optimized Character Trie Implemented in Java 8
There is a newer version: 2.1.0
/*
 * Copyright (c) 2018 by Andrew Charneski.
 *
 * The author 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 com.simiacryptus.text;

/**
 * The type Node data.
 */
class NodeData {
  /**
   * The Token.
   */
// Primary data defining the tree
  char token;
  /**
   * The Number of children.
   */
  short numberOfChildren;
  /**
   * The First child index.
   */
  int firstChildIndex;
  /**
   * The Cursor count.
   */
// Associated data to be stored for each node
  long cursorCount;
  /**
   * The First cursor index.
   */
  long firstCursorIndex;

  /**
   * Instantiates a new Node data.
   *
   * @param token            the token
   * @param numberOfChildren the number of children
   * @param firstChildIndex  the first child index
   * @param cursorCount      the cursor count
   * @param firstCursorIndex the first cursor index
   */
  public NodeData(char token, short numberOfChildren, int firstChildIndex, long cursorCount, long firstCursorIndex) {
    this.token = token;
    this.numberOfChildren = numberOfChildren;
    this.firstChildIndex = firstChildIndex;
    this.cursorCount = cursorCount;
    this.firstCursorIndex = firstCursorIndex;
  }

  /**
   * Sets token.
   *
   * @param token the token
   * @return the token
   */
  public NodeData setToken(char token) {
    this.token = token;
    return this;
  }

  /**
   * Sets number of children.
   *
   * @param numberOfChildren the number of children
   * @return the number of children
   */
  public NodeData setNumberOfChildren(short numberOfChildren) {
    this.numberOfChildren = numberOfChildren;
    return this;
  }

  /**
   * Sets first child index.
   *
   * @param firstChildIndex the first child index
   * @return the first child index
   */
  public NodeData setFirstChildIndex(int firstChildIndex) {
    this.firstChildIndex = firstChildIndex;
    return this;
  }

  /**
   * Sets cursor count.
   *
   * @param cursorCount the cursor count
   * @return the cursor count
   */
  public NodeData setCursorCount(long cursorCount) {
    this.cursorCount = cursorCount;
    return this;
  }

  /**
   * Sets first cursor index.
   *
   * @param firstCursorIndex the first cursor index
   * @return the first cursor index
   */
  public NodeData setFirstCursorIndex(long firstCursorIndex) {
    this.firstCursorIndex = firstCursorIndex;
    return this;
  }

  @Override
  public boolean equals(Object o) {
    if (this == o) {
      return true;
    }
    if (o == null || getClass() != o.getClass()) {
      return false;
    }

    NodeData nodeData = (NodeData) o;

    if (token != nodeData.token) {
      return false;
    }
    if (numberOfChildren != nodeData.numberOfChildren) {
      return false;
    }
    if (firstChildIndex != nodeData.firstChildIndex) {
      return false;
    }
    if (cursorCount != nodeData.cursorCount) {
      return false;
    }
    return firstCursorIndex == nodeData.firstCursorIndex;
  }

  @Override
  public int hashCode() {
    int result = (int) token;
    result = 31 * result + (int) numberOfChildren;
    result = 31 * result + firstChildIndex;
    result = 31 * result + Long.hashCode(cursorCount);
    result = 31 * result + Long.hashCode(firstCursorIndex);
    return result;
  }

}