Java Code Examples for com.sun.org.apache.xml.internal.utils.NodeVector#size()

The following examples show how to use com.sun.org.apache.xml.internal.utils.NodeVector#size() . You can vote up the ones you like or vote down the ones you don't like, and go to the original project or source file by following the links above each example. You may check out the related API usage on the sidebar.
Example 1
Source File: NodeSequence.java    From openjdk-8-source with GNU General Public License v2.0 6 votes vote down vote up 
/**
 * @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;
}
Example 2
Source File: NodeSequence.java    From TencentKona-8 with GNU General Public License v2.0 6 votes vote down vote up 
/**
 * @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;
}
Example 3
Source File: NodeSequence.java    From hottub with GNU General Public License v2.0 6 votes vote down vote up 
/**
 * @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;
}
Example 4
Source File: NodeSequence.java    From jdk8u60 with GNU General Public License v2.0 6 votes vote down vote up 
/**
 * @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;
}
Example 5
Source File: NodeSequence.java    From openjdk-8 with GNU General Public License v2.0 6 votes vote down vote up 
/**
 * @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;
}
Example 6
Source File: NodeSequence.java    From openjdk-jdk8u with GNU General Public License v2.0 6 votes vote down vote up 
/**
 * @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;
}
Example 7
Source File: NodeSequence.java    From JDKSourceCode1.8 with MIT License 6 votes vote down vote up 
/**
 * @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;
}
Example 8
Source File: NodeSequence.java    From jdk1.8-source-analysis with Apache License 2.0 6 votes vote down vote up 
/**
 * @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;
}
Example 9
Source File: NodeSequence.java    From JDKSourceCode1.8 with MIT License 5 votes vote down vote up 
/**
 * @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;
      }
}
Example 10
Source File: NodeSequence.java    From Bytecoder with Apache License 2.0 5 votes vote down vote up 
/**
 * @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;
      }
}
Example 11
Source File: NodeSequence.java    From openjdk-jdk8u-backup with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * @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;
      }
}
Example 12
Source File: NodeSequence.java    From jdk8u60 with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * @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;
      }
}
Example 13
Source File: NodeSequence.java    From TencentKona-8 with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * @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;
      }
}
Example 14
Source File: NodeSequence.java    From jdk1.8-source-analysis with Apache License 2.0 5 votes vote down vote up 
/**
 * @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;
      }
}
Example 15
Source File: NodeSequence.java    From hottub with GNU General Public License v2.0 4 votes vote down vote up 
/**
* 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;
 }
Example 16
Source File: NodeSequence.java    From jdk8u60 with GNU General Public License v2.0 4 votes vote down vote up 
/**
* 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;
 }
Example 17
Source File: NodeSequence.java    From openjdk-jdk8u with GNU General Public License v2.0 4 votes vote down vote up 
/**
* 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;
 }
Example 18
Source File: NodeSequence.java    From openjdk-jdk9 with GNU General Public License v2.0 4 votes vote down vote up 
/**
* 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;
 }
Example 19
Source File: NodeSequence.java    From TencentKona-8 with GNU General Public License v2.0 4 votes vote down vote up 
/**
* 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;
 }
Example 20
Source File: NodeSequence.java    From openjdk-jdk8u-backup with GNU General Public License v2.0 4 votes vote down vote up 
/**
* 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;
 }