Lines Matching refs:identity
616 * The node identity of _startNode for this iterator
813 /* _currentNode precedes candidates. This is the identity, not the handle! */
1544 * Tell if this node identity is a descendant. Assumes that
1554 * @param identity The index number of the node in question.
1557 protected final boolean isDescendant(int identity)
1559 return (_parent2(identity) >= _startNode) || (_startNode == identity);
1901 public final int _exptype(int identity)
1903 return m_exptype.elementAt(identity);
1919 * @param identity A node identity, which <em>must not</em> be equal to
1922 public final int _exptype2(int identity)
1924 //return m_exptype.elementAt(identity);
1926 if (identity < m_blocksize)
1927 return m_exptype_map0[identity];
1929 return m_exptype_map[identity>>>m_SHIFT][identity&m_MASK];
1935 * @param identity A node identity, which <em>must not</em> be equal to
1938 public final int _nextsib2(int identity)
1940 //return m_nextsib.elementAt(identity);
1942 if (identity < m_blocksize)
1943 return m_nextsib_map0[identity];
1945 return m_nextsib_map[identity>>>m_SHIFT][identity&m_MASK];
1951 * @param identity A node identity, which <em>must not</em> be equal to
1954 public final int _firstch2(int identity)
1956 //return m_firstch.elementAt(identity);
1958 if (identity < m_blocksize)
1959 return m_firstch_map0[identity];
1961 return m_firstch_map[identity>>>m_SHIFT][identity&m_MASK];
1967 * @param identity A node identity, which <em>must not</em> be equal to
1970 public final int _parent2(int identity)
1972 //return m_parent.elementAt(identity);
1974 if (identity < m_blocksize)
1975 return m_parent_map0[identity];
1977 return m_parent_map[identity>>>m_SHIFT][identity&m_MASK];
1983 * @param identity A node identity, which <em>must not</em> be equal to
1986 public final int _type2(int identity)
1988 //int eType = _exptype2(identity);
1990 if (identity < m_blocksize)
1991 eType = m_exptype_map0[identity];
1993 eType = m_exptype_map[identity>>>m_SHIFT][identity&m_MASK];
2332 * @return The index identity of the node that was added.
2341 // Have we overflowed a DTM Identity's addressing range?
2516 * Given a node identity, get the index of the node's first attribute.
2518 * @param identity int identity of the node.
2519 * @return Identity of first attribute, or DTM.NULL to indicate none exists.
2521 protected int getFirstAttributeIdentity(int identity) {
2522 if (identity == NULL) {
2525 int type = _type2(identity);
2532 identity++;
2535 type = _type2(identity);
2539 return identity;
2554 * Given a node identity for an attribute, advance to the next attribute.
2556 * @param identity int identity of the attribute node. This
2559 * @return int DTM node-identity of the resolved attr,
2563 protected int getNextAttributeIdentity(int identity) {
2566 identity++;
2567 int type = _type2(identity);
2570 return identity;
2775 int identity = makeNodeIdentity(nodeHandle);
2776 if (identity == DTM.NULL)
2779 int type= _type2(identity);
2783 int startNode = identity;
2784 identity = _firstch2(identity);
2785 if (DTM.NULL != identity)
2792 type = _exptype2(identity);
2796 int dataIndex = m_dataOrQName.elementAt(identity);
2817 identity++;
2818 } while (_parent2(identity) >= startNode);
2835 int dataIndex = m_dataOrQName.elementAt(identity);
2857 int dataIndex = m_dataOrQName.elementAt(identity);
2888 int identity = makeNodeIdentity(nodeHandle);
2889 if (identity == DTM.NULL)
2892 int type= _type2(identity);
2896 int startNode = identity;
2897 identity = _firstch2(identity);
2898 if (DTM.NULL != identity)
2905 type = _exptype2(identity);
2909 int dataIndex = m_dataOrQName.elementAt(identity);
2930 identity++;
2931 } while (_parent2(identity) >= startNode);
2945 int dataIndex = m_dataOrQName.elementAt(identity);
2959 int dataIndex = m_dataOrQName.elementAt(identity);
3018 int identity = makeNodeIdentity(nodeHandle);
3020 if (identity == DTM.NULL)
3023 int type = _type2(identity);
3027 int startNode = identity;
3028 identity = _firstch2(identity);
3029 if (DTM.NULL != identity)
3036 type = _exptype2(identity);
3040 int dataIndex = m_dataOrQName.elementAt(identity);
3062 identity++;
3063 } while (_parent2(identity) >= startNode);
3076 int dataIndex = m_dataOrQName.elementAt(identity);
3099 int dataIndex = m_dataOrQName.elementAt(identity);
3129 int identity = makeNodeIdentity(nodeHandle);
3130 int type = _type2(identity);
3134 int dataIndex = _dataOrQName(identity);
3153 int dataIndex = m_dataOrQName.elementAt(identity);
3187 * @param nodeID The node identity
3237 * @param nodeID The Element node identity
3306 * @baseID The node identity of the base node, which can be an
3323 * @param nodeID The Element node identity
3340 * @param nodeID The node identity
