
com.simiacryptus.text.Cursor 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
Show all versions of char-trie Show documentation
Optimized Character Trie Implemented in Java 8
/*
* Copyright (c) 2019 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 Cursor.
*/
public class Cursor {
/**
* The Data.
*/
final CursorData data;
/**
*
*/
private final CharTrieIndex charTrieIndex;
private final short depth;
/**
* Instantiates a new Cursor.
*
* @param charTrieIndex the char trie index
* @param data the data
* @param depth the depth
*/
public Cursor(CharTrieIndex charTrieIndex, CursorData data, short depth) {
this.charTrieIndex = charTrieIndex;
this.data = data;
this.depth = depth;
}
/**
* Gets document.
*
* @return the document
*/
public CharSequence getDocument() {
return this.charTrieIndex.documents.get(data.documentId);
}
/**
* Has next boolean.
*
* @return the boolean
*/
public boolean hasNext() {
return (getPosition() + 1) < getDocument().length();
}
/**
* Gets token.
*
* @return the token
*/
public char getToken() {
int index = getPosition();
CharSequence document = getDocument();
return index >= document.length() ? NodewalkerCodec.END_OF_STRING : document.charAt(index);
}
/**
* Next cursor.
*
* @return the cursor
*/
public Cursor next() {
return new Cursor(this.charTrieIndex, data, (short) (depth + 1));
}
/**
* Gets position.
*
* @return the position
*/
public int getPosition() {
return data.position + depth - 1;
}
/**
* Gets document id.
*
* @return the document id
*/
public int getDocumentId() {
return data.documentId;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy