Java NodeVector.size方法代码示例

import com.sun.org.apache.xml.internal.utils.NodeVector; //导入方法依赖的package包/类
/**
 * @see DTMIterator#getCurrentNode()
 */
public int getCurrentNode()
{
      if(hasCache())
      {
              int currentIndex = m_next-1;
              NodeVector vec = getVector();
              if((currentIndex >= 0) && (currentIndex < vec.size()))
                      return vec.elementAt(currentIndex);
              else
                      return DTM.NULL;
      }

      if(null != m_iter)
      {
      return m_iter.getCurrentNode();
      }
      else
              return DTM.NULL;
}
 

import com.sun.org.apache.xml.internal.utils.NodeVector; //导入方法依赖的package包/类
/**
 * @see DTMIterator#getLength()
 */
public int getLength()
{
  IteratorCache cache = getCache();

      if(cache != null)
      {
      // Nodes from the iterator are cached
      if (cache.isComplete()) {
          // All of the nodes from the iterator are cached
          // so just return the number of nodes in the cache
          NodeVector nv = cache.getVector();
          return nv.size();
      }

      // If this NodeSequence wraps a mutable nodeset, then
      // m_last will not reflect the size of the nodeset if
      // it has been mutated...
      if (m_iter instanceof NodeSetDTM)
      {
          return m_iter.getLength();
      }

              if(-1 == m_last)
              {
                      int pos = m_next;
                      runTo(-1);
                      m_next = pos;
              }
          return m_last;
      }
      else
      {
              return (-1 == m_last) ? (m_last = m_iter.getLength()) : m_last;
      }
}
 

import com.sun.org.apache.xml.internal.utils.NodeVector; //导入方法依赖的package包/类
/**
* Add the node into a vector of nodes where it should occur in
* document order.
* @param node The node to be added.
* @return insertIndex.
* @throws RuntimeException thrown if this NodeSetDTM is not of
* a mutable type.
*/
protected int addNodeInDocOrder(int node)
{
   assertion(hasCache(), "addNodeInDocOrder must be done on a mutable sequence!");

   int insertIndex = -1;

   NodeVector vec = getVector();

   // This needs to do a binary search, but a binary search
   // is somewhat tough because the sequence test involves
   // two nodes.
   int size = vec.size(), i;

   for (i = size - 1; i >= 0; i--)
   {
     int child = vec.elementAt(i);

     if (child == node)
     {
       i = -2; // Duplicate, suppress insert

       break;
     }

     DTM dtm = m_dtmMgr.getDTM(node);
     if (!dtm.isNodeAfter(node, child))
     {
       break;
     }
   }

   if (i != -2)
   {
     insertIndex = i + 1;

     vec.insertElementAt(node, insertIndex);
   }

   // checkDups();
   return insertIndex;
 }