Examples of com.sun.org.apache.xml.internal.utils.NodeVector

Package com.sun.org.apache.xml.internal.utils

Examples of com.sun.org.apache.xml.internal.utils.NodeVector

com.sun.org.apache.xml.internal.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

  /**
   * @see DTMIterator#setItem(int, int)
   */
  public void setItem(int node, int index)
  {
        NodeVector vec = getVector();
        if(null != vec)
        {
        int oldNode = vec.elementAt(index);
        if (oldNode != node && m_cache.useCount() > 1) {
            /* If we are going to set the node at the given index
             * to a different value, and the cache is shared
             * (has a use count greater than 1)
             * then make a copy of the cache and use it
             * so we don't overwrite the value for other
             * users of the cache.
             */
            IteratorCache newCache = new IteratorCache();
            final NodeVector nv;
            try {
                nv = (NodeVector) vec.clone();
            } catch (CloneNotSupportedException e) {
                // This should never happen
                e.printStackTrace();

View Full Code Here

        {
        // 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...

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

           // Keep our superclass informed of the current NodeVector
           // ... if we don't the smoketest fails (don't know why).
           super.setObject(obj);


           // A copy of the code of what SetVector() would do.
           NodeVector v = (NodeVector)obj;
           if (m_cache != null) {
               m_cache.setVector(v);
           } else if (v!=null) {
               m_cache = new IteratorCache();
               m_cache.setVector(v);

View Full Code Here

0 1 2 3

TOP

Related Classes of com.sun.org.apache.xml.internal.utils.NodeVector

com.sun.org.apache.xpath.internal.axes.NodeSequence

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.