Examples of java.util.Stack.empty()

java.util.Stack.empty()
Tests if this stack is empty. @return true if and only if this stack containsno items; false otherwise.

        StringBuilder buff = new StringBuilder();
        while (parent != null) {
            stk.push(parent.getName());
            parent = parent.getParent();
        }
        while (!stk.empty()) {
            buff.append("/" + stk.pop());
        }
        buff.append(getName());
        namingContextName = buff.toString();
        }

View Full Code Here

        {
          int index = 0;


          indoubt = new Xid[values.size()];
                
          while (!values.empty())
          {
            TransactionImple id = (TransactionImple) values.pop();


            indoubt[index] = id.baseXid();

View Full Code Here

        {
          int index = 0;


          indoubt = new Xid[values.size()];
                
          while (!values.empty())
          {
            com.arjuna.ats.internal.jta.transaction.arjunacore.subordinate.jca.TransactionImple tx = (com.arjuna.ats.internal.jta.transaction.arjunacore.subordinate.jca.TransactionImple) values.pop();
            
            indoubt[index] = tx.baseXid();
            index++;

View Full Code Here

        StringBuffer buff = new StringBuffer();
        while (parent != null) {
            stk.push(parent.getName());
            parent = parent.getParent();
        }
        while (!stk.empty()) {
            buff.append("/" + stk.pop());
        }
        buff.append(getName());
        namingContextName = buff.toString();
        }

View Full Code Here

    nodesInLevel.put(new Integer(root.m_level), new Integer(1));


    ValidateEntry e = new ValidateEntry(root.m_nodeMBR, root);
    st.push(e);


    while (! st.empty())
    {
      e = (ValidateEntry) st.pop();


      Region tmpRegion = (Region) m_infiniteRegion.clone();

View Full Code Here

      Stack st = new Stack();
      Node root = readNode(m_rootID);


      if (root.m_children > 0 && query.intersects(root.m_nodeMBR)) st.push(root);


      while (! st.empty())
      {
        Node n = (Node) st.pop();


        if (n.m_level == 0)
        {

View Full Code Here


    Stack toReinsert = new Stack();
    condenseTree(toReinsert, pathBuffer);


    // re-insert eliminated nodes.
    while (! toReinsert.empty())
    {
      Node n = (Node) toReinsert.pop();
      m_pTree.deleteNode(n);


      for (int cChild = 0; cChild < n.m_children; cChild++)

View Full Code Here

         } else {
            break;
         }
      }


      boolean created = !toBeCreated.empty(); 
      while(!toBeCreated.empty()) {
         HttpURL newColl = Utils.createHttpURL(httpURL, (String)toBeCreated.pop());
         MkcolMethod mkcol = new MkcolMethod(newColl.getURI());
         mkcol.setFollowRedirects(true);
         generateIfHeader(mkcol, lockToken);

View Full Code Here

            break;
         }
      }


      boolean created = !toBeCreated.empty(); 
      while(!toBeCreated.empty()) {
         HttpURL newColl = Utils.createHttpURL(httpURL, (String)toBeCreated.pop());
         MkcolMethod mkcol = new MkcolMethod(newColl.getURI());
         mkcol.setFollowRedirects(true);
         generateIfHeader(mkcol, lockToken);
         int status = client.executeMethod(mkcol);

View Full Code Here

      return;
    }
    Stack stack = new Stack();
    if ( ast != null ) {
      stack.push( ast );
      while (!stack.empty()) {
        ast = (AST) stack.pop();
        strategy.visit( ast );
        if ( ast.getNextSibling() != null ) 
          stack.push( ast.getNextSibling() );
        if ( ast.getFirstChild() != null )

View Full Code Here

0 1 2 3 4 5 6 7 8 9

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.