Examples of org.apache.xml.utils.NodeVector.elementAt()

org.apache.xml.utils.NodeVector.elementAt()
Get the nth element. @param i Index of node to get @return Node at specified index

    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

    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

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

View Full Code Here

        {
          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[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

    {  
        // There is a cache
      if(m_next < vec.size())
      {
            // The node is in the cache, so just return it.
      int next = vec.elementAt(m_next);
        m_next++;
        return next;
      }
      else if(cacheComplete() || (-1 != m_last) || (null == m_iter))
      {

View Full Code Here

    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

  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

View Full Code Here

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

View Full Code Here

        {
          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

0 1 2 3

TOP

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.