Lines Matching refs:identity
51 /** The identity of the root node. */
120 /** The document identity number(s). If we have overflowed the addressing
124 /** The mask for the identity.
160 * @param dtmIdentity The DTM identity ID for this DTM.
180 * @param dtmIdentity The DTM identity ID for this DTM.
315 * @param identity The node identity index.
317 protected void indexNode(int expandedTypeID, int identity)
332 index[index[0]] = identity;
349 * to the identity argument, or -1 if no node is higher or equal.
414 * Get the next node identity value in the list, and call the iterator
417 * @param identity The node identity (index).
418 * @return identity+1, or DTM.NULL.
420 protected abstract int getNextNodeIdentity(int identity);
453 * Get the simple type ID for the given node identity.
455 * @param identity The node identity.
459 protected short _type(int identity)
462 int info = _exptype(identity);
471 * Get the expanded type ID for the given node identity.
473 * @param identity The node identity.
477 protected int _exptype(int identity)
479 if (identity == DTM.NULL)
484 while (identity>=m_size)
486 if (!nextNode() && identity >= m_size)
489 return m_exptype.elementAt(identity);
494 * Get the level in the tree for the given node identity.
496 * @param identity The node identity.
500 protected int _level(int identity)
502 while (identity>=m_size)
505 if (!isMore && identity >= m_size)
510 while(NULL != (identity=_parent(identity)))
516 * Get the first child for the given node identity.
518 * @param identity The node identity.
520 * @return The first child identity, or DTM.NULL.
522 protected int _firstch(int identity)
526 int info = (identity >= m_size) ? NOTPROCESSED : m_firstch.elementAt(identity);
535 if (identity >= m_size &&!isMore)
539 info = m_firstch.elementAt(identity);
549 * Get the next sibling for the given node identity.
551 * @param identity The node identity.
553 * @return The next sibling identity, or DTM.NULL.
555 protected int _nextsib(int identity)
558 int info = (identity >= m_size) ? NOTPROCESSED : m_nextsib.elementAt(identity);
567 if (identity >= m_size &&!isMore)
571 info = m_nextsib.elementAt(identity);
581 * Get the previous sibling for the given node identity.
583 * @param identity The node identity.
585 * @return The previous sibling identity, or DTM.NULL.
587 protected int _prevsib(int identity)
590 if (identity < m_size)
591 return m_prevsib.elementAt(identity);
600 if (identity >= m_size && !isMore)
602 else if (identity < m_size)
603 return m_prevsib.elementAt(identity);
608 * Get the parent for the given node identity.
610 * @param identity The node identity.
612 * @return The parent identity, or DTM.NULL.
614 protected int _parent(int identity)
617 if (identity < m_size)
618 return m_parent.elementAt(identity);
627 if (identity >= m_size && !isMore)
629 else if (identity < m_size)
630 return m_parent.elementAt(identity);
781 * node handle, it works just fine... but the displayed identity
882 int identity = makeNodeIdentity(nodeHandle);
883 int firstChild = _firstch(identity);
888 /** Given a node identity, return a node handle. If extended addressing
890 * identity into the proper DTM ID.
913 /** Given a node handle, return a node identity. If extended addressing
915 * identity into the proper DTM ID and thence find the proper offset
916 * to add to the low bits of the identity
972 int identity = makeNodeIdentity(nodeHandle);
973 int firstChild = _firstch(identity);
1025 int identity = makeNodeIdentity(nodeHandle);
1026 int child = _firstch(identity);
1067 * Given a node identity, get the index of the node's first attribute.
1069 * @param identity int identity of the node.
1072 protected int getFirstAttributeIdentity(int identity) {
1073 int type = _type(identity);
1078 while (DTM.NULL != (identity = getNextNodeIdentity(identity)))
1082 type = _type(identity);
1086 return identity;
1110 int identity = makeNodeIdentity(nodeHandle);
1112 while (DTM.NULL != (identity = getNextNodeIdentity(identity)))
1114 type = _type(identity);
1118 if (_exptype(identity) == attType) return makeNodeHandle(identity);
1221 * Given a node identity for an attribute, advance to the next attribute.
1223 * @param identity int identity of the attribute node. This
1226 * @return int DTM node-identity of the resolved attr,
1230 protected int getNextAttributeIdentity(int identity) {
1232 while (DTM.NULL != (identity = getNextNodeIdentity(identity))) {
1233 int type = _type(identity);
1236 return identity;
1463 int identity = makeNodeIdentity(nodeHandle);
1464 if (_type(identity) == DTM.ELEMENT_NODE)
1466 SuballocatedIntVector nsContext=findNamespaceContext(identity);
1483 int identity = makeNodeIdentity(nodeHandle);
1484 if (_type(identity) == DTM.ELEMENT_NODE)
1486 while (DTM.NULL != (identity = getNextNodeIdentity(identity)))
1488 int type = _type(identity);
1490 return makeNodeHandle(identity);
1534 int identity = makeNodeIdentity(nodeHandle);
1535 while (DTM.NULL != (identity = getNextNodeIdentity(identity)))
1537 int type = _type(identity);
1540 return makeNodeHandle(identity);
1561 int identity = makeNodeIdentity(nodeHandle);
1563 if (identity > 0)
1564 return makeNodeHandle(_parent(identity));
1743 int identity = makeNodeIdentity(nodeHandle);
1744 int expandedNameID = _exptype(identity);
1852 int identity = makeNodeIdentity(nodeHandle);
1853 return (short) (_level(identity) + 1);
1857 * Get the identity of this node in the tree
1860 * @return the node identity
1876 * @param nodeId The node identity.