Lines Matching defs:nodeArray

616     private static int findInsertionIndex(final PtNodeArray nodeArray, int character) {
617 final ArrayList<PtNode> data = nodeArray.mData;
628 * @param nodeArray the node array to search in.
632 private static int findIndexOfChar(final PtNodeArray nodeArray, int character) {
633 final int insertionIndex = findInsertionIndex(nodeArray, character);
634 if (nodeArray.mData.size() <= insertionIndex) return CHARACTER_NOT_FOUND_INDEX;
635 return character == nodeArray.mData.get(insertionIndex).mChars[0] ? insertionIndex
643 public static PtNode findWordInTree(PtNodeArray nodeArray, final String string) {
650 int indexOfGroup = findIndexOfChar(nodeArray, codePoints[index]);
652 currentPtNode = nodeArray.mData.get(indexOfGroup);
666 nodeArray = currentPtNode.mChildren;
668 } while (null != nodeArray && index < codePoints.length);
689 * @param nodeArray the parent node.
692 public static int countPtNodes(final PtNodeArray nodeArray) {
693 final int nodeSize = nodeArray.mData.size();
696 PtNode ptNode = nodeArray.mData.get(i);
706 * @param nodeArray the node array to count.
709 public static int countNodeArrays(final PtNodeArray nodeArray) {
711 for (int i = nodeArray.mData.size() - 1; i >= 0; --i) {
712 PtNode ptNode = nodeArray.mData.get(i);
722 private static boolean hasBigramsInternal(final PtNodeArray nodeArray) {
723 if (null == nodeArray) return false;
724 for (int i = nodeArray.mData.size() - 1; i >= 0; --i) {
725 PtNode ptNode = nodeArray.mData.get(i);
795 // final HashMap<String, ArrayList<PtNodeArray>> map, final PtNodeArray nodeArray) {
796 // final ArrayList<PtNode> branches = nodeArray.data;
824 // private static String getPseudoHash(final PtNodeArray nodeArray) {
826 // for (PtNode ptNode : nodeArray.data) {