Lines Matching refs:current
204 * Traverse to the next node after the current node.
207 * @param current The current node of the iteration.
211 public int next(int context, int current)
213 return getParent(current);
217 * Traverse to the next node after the current node that is matched
221 * @param current The current node of the iteration.
226 public int next(int context, int current, int expandedTypeID)
229 current = makeNodeIdentity(current);
231 while (DTM.NULL != (current = m_parent.elementAt(current)))
233 if (m_exptype.elementAt(current) == expandedTypeID)
234 return makeNodeHandle(current);
287 * Traverse to the next node after the current node.
290 * @param current The current node of the iteration.
294 public int next(int context, int current)
296 return (context == current)
297 ? getFirstAttribute(context) : getNextAttribute(current);
301 * Traverse to the next node after the current node that is matched
305 * @param current The current node of the iteration.
310 public int next(int context, int current, int expandedTypeID)
313 current = (context == current)
314 ? getFirstAttribute(context) : getNextAttribute(current);
318 if (getExpandedTypeID(current) == expandedTypeID)
319 return current;
321 while (DTM.NULL != (current = getNextAttribute(current)));
441 for (int current = _firstch(makeNodeIdentity(context));
442 DTM.NULL != current;
443 current = _nextsib(current))
445 if (m_exptype.elementAt(current) == expandedTypeID)
446 return makeNodeHandle(current);
453 * Traverse to the next node after the current node.
456 * @param current The current node of the iteration.
460 public int next(int context, int current)
462 return getNextSibling(current);
466 * Traverse to the next node after the current node that is matched
470 * @param current The current node of the iteration.
475 public int next(int context, int current, int expandedTypeID)
478 for (current = _nextsib(makeNodeIdentity(current));
479 DTM.NULL != current;
480 current = _nextsib(current))
482 if (m_exptype.elementAt(current) == expandedTypeID)
483 return makeNodeHandle(current);
694 * Traverse to the next node after the current node.
697 * @param current The current node of the iteration.
701 public int next(int context, int current)
706 for (current = makeNodeIdentity(current) + 1; ; current++)
708 int type = _type(current); // may call nextNode()
710 if (!isDescendant(subtreeRootIdent, current))
716 return makeNodeHandle(current); // make handle.
721 * Traverse to the next node after the current node that is matched
725 * @param current The current node of the iteration.
730 public int next(int context, int current, int expandedTypeID)
735 current = makeNodeIdentity(current) + 1;
739 return makeNodeHandle(getNextIndexed(subtreeRootIdent, current, expandedTypeID));
742 for (; ; current++)
744 int exptype = _exptype(current); // may call nextNode()
746 if (!isDescendant(subtreeRootIdent, current))
752 return makeNodeHandle(current); // make handle.
798 * Traverse to the next node after the current node.
801 * @param current The current node of the iteration.
805 public int next(int context, int current)
810 for (current = makeNodeIdentity(current) + 1; ; current++)
817 _exptype(current); // make sure it's here.
819 if (!isDescendant(subtreeRootIdent, current))
822 return makeNodeHandle(current); // make handle.
919 * Traverse to the next node after the current node.
922 * @param current The current node of the iteration.
926 public int next(int context, int current)
929 current=makeNodeIdentity(current);
933 current++; // Only works on IDs, not handles.
936 int type = _type(current); // may call nextNode()
944 return makeNodeHandle(current); // make handle.
949 * Traverse to the next node after the current node that is matched
953 * @param current The current node of the iteration.
958 public int next(int context, int current, int expandedTypeID)
961 current=makeNodeIdentity(current);
965 current++;
967 int etype = _exptype(current); // may call nextNode()
975 return makeNodeHandle(current); // make handle.
987 * Traverse to the next node after the current node.
990 * @param current The current node of the iteration.
994 public int next(int context, int current)
996 return getNextSibling(current);
1000 * Traverse to the next node after the current node that is matched
1004 * @param current The current node of the iteration.
1009 public int next(int context, int current, int expandedTypeID)
1012 while (DTM.NULL != (current = getNextSibling(current)))
1014 if (getExpandedTypeID(current) == expandedTypeID)
1015 return current;
1029 * Traverse to the next node after the current node.
1032 * @param current The current node of the iteration.
1036 public int next(int context, int current)
1039 return (context == current)
1041 : getNextNamespaceNode(context, current, false);
1045 * Traverse to the next node after the current node that is matched
1049 * @param current The current node of the iteration.
1054 public int next(int context, int current, int expandedTypeID)
1057 current = (context == current)
1059 : getNextNamespaceNode(context, current, false);
1063 if (getExpandedTypeID(current) == expandedTypeID)
1064 return current;
1067 != (current = getNextNamespaceNode(context, current, false)));
1080 * Traverse to the next node after the current node.
1083 * @param current The current node of the iteration.
1087 public int next(int context, int current)
1090 return (context == current)
1092 : getNextNamespaceNode(context, current, true);
1096 * Traverse to the next node after the current node that is matched
1100 * @param current The current node of the iteration.
1105 public int next(int context, int current, int expandedTypeID)
1108 current = (context == current)
1110 : getNextNamespaceNode(context, current, true);
1114 if (getExpandedTypeID(current) == expandedTypeID)
1115 return current;
1118 != (current = getNextNamespaceNode(context, current, true)));
1160 public int first(int current, int expandedTypeID)
1163 current = makeNodeIdentity(current);
1165 while (NULL != (current = m_parent.elementAt(current)))
1167 if (m_exptype.elementAt(current) == expandedTypeID)
1168 return makeNodeHandle(current);
1176 * Traverse to the next node after the current node.
1179 * @param current The current node of the iteration.
1183 public int next(int context, int current)
1192 * Traverse to the next node after the current node that is matched
1196 * @param current The current node of the iteration.
1201 public int next(int context, int current, int expandedTypeID)
1215 * Tell if the current identity is an ancestor of the context identity.
1238 * Traverse to the next node after the current node.
1241 * @param current The current node of the iteration.
1245 public int next(int context, int current)
1250 for (current = makeNodeIdentity(current) - 1; current >= 0; current--)
1252 short type = _type(current);
1255 || isAncestor(subtreeRootIdent, current))
1258 return makeNodeHandle(current); // make handle.
1265 * Traverse to the next node after the current node that is matched
1269 * @param current The current node of the iteration.
1274 public int next(int context, int current, int expandedTypeID)
1279 for (current = makeNodeIdentity(current) - 1; current >= 0; current--)
1281 int exptype = m_exptype.elementAt(current);
1284 || isAncestor(subtreeRootIdent, current))
1287 return makeNodeHandle(current); // make handle.
1302 * Traverse to the next node after the current node.
1305 * @param current The current node of the iteration.
1309 public int next(int context, int current)
1314 for (current = makeNodeIdentity(current) - 1; current >= 0; current--)
1316 short type = _type(current);
1321 return makeNodeHandle(current); // make handle.
1328 * Traverse to the next node after the current node that is matched
1332 * @param current The current node of the iteration.
1337 public int next(int context, int current, int expandedTypeID)
1342 for (current = makeNodeIdentity(current) - 1; current >= 0; current--)
1344 int exptype = m_exptype.elementAt(current);
1349 return makeNodeHandle(current); // make handle.
1363 * Traverse to the next node after the current node.
1366 * @param current The current node of the iteration.
1370 public int next(int context, int current)
1372 return getPreviousSibling(current);
1376 * Traverse to the next node after the current node that is matched
1380 * @param current The current node of the iteration.
1385 public int next(int context, int current, int expandedTypeID)
1388 while (DTM.NULL != (current = getPreviousSibling(current)))
1390 if (getExpandedTypeID(current) == expandedTypeID)
1391 return current;
1436 * Traverse to the next node after the current node.
1439 * @param current The current node of the iteration.
1443 public int next(int context, int current)
1449 * Traverse to the next node after the current node that is matched
1453 * @param current The current node of the iteration.
1458 public int next(int context, int current, int expandedTypeID)
1497 * Traverse to the next node after the current node.
1500 * @param current The current node of the iteration.
1504 public int next(int context, int current)
1509 for (current = makeNodeIdentity(current) + 1; ; current++)
1512 int type = _type(current); // may call nextNode()
1516 return makeNodeHandle(current); // make handle.
1521 * Traverse to the next node after the current node that is matched
1525 * @param current The current node of the iteration.
1530 public int next(int context, int current, int expandedTypeID)
1535 for (current = makeNodeIdentity(current) + 1; ; current++)
1537 int exptype = _exptype(current); // may call nextNode()
1545 return makeNodeHandle(current); // make handle.
1572 * Traverse to the next node after the current node.
1575 * @param current The current node of the iteration.
1579 public int next(int context, int current)
1585 * Traverse to the next node after the current node that is matched
1589 * @param current The current node of the iteration.
1594 public int next(int context, int current, int expandedTypeID)