HomeSort by relevance Sort by last modified time
    Searched defs:nodeArray (Results 1 - 4 of 4) sorted by null

  /external/pdfium/xfa/fxfa/parser/
xfa_document_datamerger_imp.cpp 777 std::vector<CXFA_Node*> nodeArray;
796 nodeArray.push_back(pSubformNode);
799 for (CXFA_Node* pSubform : nodeArray) {
    [all...]
  /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/makedict/
FusionDictionary.java 478 private static int findInsertionIndex(final PtNodeArray nodeArray, int character) {
479 final ArrayList<PtNode> data = nodeArray.mData;
490 * @param nodeArray the node array to search in.
494 private static int findIndexOfChar(final PtNodeArray nodeArray, int character) {
495 final int insertionIndex = findInsertionIndex(nodeArray, character);
496 if (nodeArray.mData.size() <= insertionIndex) return CHARACTER_NOT_FOUND_INDEX;
497 return character == nodeArray.mData.get(insertionIndex).mChars[0] ? insertionIndex
505 PtNodeArray nodeArray = rootNodeArray;
512 int indexOfGroup = findIndexOfChar(nodeArray, codePoints[index]);
514 currentPtNode = nodeArray.mData.get(indexOfGroup)
    [all...]
  /libcore/luni/src/test/java/libcore/java/util/prefs/
OldAbstractPreferencesTest.java 816 String[] nodeArray = new String[]{"First node", "Second node", "Last node"};
819 for (i = 0; i < nodeArray.length; i++) {
820 pref.node(nodeArray[i]);
825 assertEquals(nodeArray.length, str.length);
826 for(i = 0; i < nodeArray.length; i++) {
827 pref.node(nodeArray[i]).removeNode();
829 assertEquals(nodeArray.length - i - 1, str.length);
    [all...]
  /prebuilts/tools/common/m2/repository/org/jsoup/jsoup/1.7.3/
jsoup-1.7.3.jar 

Completed in 378 milliseconds