Examples of org.apache.xml.utils.NodeVector

org.apache.xml.utils.NodeVector
A very simple table that stores a list of Nodes. @xsl.usage internal

   * Construct an empty XNodeSet object.  This is used to create a mutable 
   * nodeset to which random nodes may be added.
   */
  public NodeSequence(DTMManager dtmMgr)
  {
    super(new NodeVector());
    m_last = 0;
    m_dtmMgr = dtmMgr;
  }

View Full Code Here

   */
  public int nextNode()
  {
    // If the cache is on, and the node has already been found, then 
    // just return from the list.
    NodeVector vec = getVector();
    if (null != vec)
    {  
      if(m_next < vec.size())
      {
      int next = vec.elementAt(m_next);
        m_next++;
        return next;
      }
      else if((-1 != m_last) || (null == m_iter))
      {

View Full Code Here

  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)

View Full Code Here

  {
    if (b)
    {
      if(!hasCache())
      {
        SetVector(new NodeVector());
      }
//    else
//      getVector().RemoveAllNoClear();  // Is this good?
    }
    else

View Full Code Here

  /**
   * @see DTMIterator#setItem(int, int)
   */
  public void setItem(int node, int index)
  {
    NodeVector vec = getVector();
    if(null != vec)
    {
      vec.setElementAt(node, index);
      m_last = vec.size();
    }
    else
      m_iter.setItem(node, index);
  }

View Full Code Here

   {
      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;
    } // end addNodeInDocOrder(Vector v, Object obj)

View Full Code Here

        list = new long[1];
        list[0] = ctable.countNode(xctxt, this, sourceNode);
      }
      else
      {
        NodeVector ancestors =
          getMatchingAncestors(xctxt, sourceNode,
                               Constants.NUMBERLEVEL_SINGLE == m_level);
        int lastIndex = ancestors.size() - 1;


        if (lastIndex >= 0)
        {
          list = new long[lastIndex + 1];


          for (int i = lastIndex; i >= 0; i--)
          {
            int target = ancestors.elementAt(i);


            list[lastIndex - i] = ctable.countNode(xctxt, this, target);
          }
        }
      }

View Full Code Here

        list = new long[1];
        list[0] = ctable.countNode(xctxt, this, sourceNode);
      }
      else
      {
        NodeVector ancestors =
          getMatchingAncestors(xctxt, sourceNode,
                               Constants.NUMBERLEVEL_SINGLE == m_level);
        int lastIndex = ancestors.size() - 1;


        if (lastIndex >= 0)
        {
          list = new long[lastIndex + 1];


          for (int i = lastIndex; i >= 0; i--)
          {
            int target = ancestors.elementAt(i);


            list[lastIndex - i] = ctable.countNode(xctxt, this, target);
          }
        }
      }

View Full Code Here

  /**
   * If this iterator needs to cache nodes that are fetched, they
   * are stored in the Vector in the generic object.
   */
  protected NodeVector getVector() {
      NodeVector nv = (m_cache != null) ?  m_cache.getVector() : null;
      return nv;
  }

View Full Code Here

   * If the iterator needs to cache nodes as they are fetched,
   * then this method returns true. 
   */
  public boolean hasCache()
  {
    final NodeVector nv = getVector();
    return (nv != null);
  }

View Full Code Here

0 1 2 3 4 5

TOP

Related Classes of org.apache.xml.utils.NodeVector

org.apache.xalan.templates.ElemNumber

org.apache.xpath.axes.NodeSequence

org.apache.xpath.XPathContext

org.w3c.dom.Node

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.