Package java.util

Examples of java.util.Stack.pop()


                        {

                            while (!missingChildren.empty())
                            {
                                FileObject child = (FileObject)
                                    missingChildren.pop();
                                this.fireAllCreate(child);
                            }
                        }

                    }
View Full Code Here


        }
        u = u.divide(base);
      }
      // Then pop the stack
      while (!S.empty()) {
        s = s + S.pop();
      }
    }
    // Strip leading zeros.
    while (s.length() > 1 && s.charAt(0) == '0') {
      s = s.substring(1);
View Full Code Here

          contentHandler.characters(token.text.toCharArray(), 0, token.text.length());
          next = null;
        }
      }

      next = (TreeNode)stack.pop();
      previous = stack.isEmpty() ? null : (ProductionNode)stack.peek();

      if (locatorImpl!=null)
      {
        locatorImpl.setLineNumber(next.linenumber);
View Full Code Here

        next = next.next;
      }

      while ((next==null) && (!stack.isEmpty()))
      {
        next = (StackNodeList)stack.pop();

        if (text!=null)
        {
          contentHandler.characters(text, position, (lastposition+1)-position);
          increasePosition(text, position, (lastposition+1)-position);
View Full Code Here

  public static final void destroyInstance(Thread thread)
  {
    synchronized(_context) {
      Stack stack = (Stack)_context.get(thread);
      if (stack != null && !stack.isEmpty()) {
        Context ctx = (Context)stack.pop();
      }
    }
  }
 
 
View Full Code Here

   */
  public void draw(TreeDrawerNode startNode) {
    Stack remaining = new Stack();
    remaining.push(startNode);
    while (remaining.empty() == false) {
      TreeDrawerNode node = (TreeDrawerNode) remaining.pop();

      // just return if no subkids visible.
      if ((node.getMaxIndex() < minInd) ||
          (node.getMinIndex() > maxInd))
        continue;
View Full Code Here

            boolean blankline = nextTreeNode instanceof BlankLineNode;
            Task next = null;
            if (!blankline) {
                next = (Task) nextTreeNode.getUserObject();
                while (!nestingStack.isEmpty()) {
                  DefaultMutableTreeNode topStackNode = (DefaultMutableTreeNode) nestingStack.pop();
                  if (nextTreeNode.getParent()==topStackNode) {
                    nestingStack.push(topStackNode);
                    break;
                  }
                }
View Full Code Here

   */
  public void draw(TreeDrawerNode startNode) {
    Stack remaining = new Stack();
    remaining.push(startNode);
    while (remaining.empty() == false) {
      TreeDrawerNode node = (TreeDrawerNode) remaining.pop();
      // just return if no subkids visible.
      if ((node.getMaxIndex() < minInd) ||
          (node.getMinIndex() > maxInd))
        continue;
     
View Full Code Here

  private void interateGTR(PrintStream ps, TreeDrawerNode startNode) {
    int height = (int)getYmapHeight();
    Stack remaining = new Stack();
    remaining.push(startNode);
    while (remaining.empty() == false) {
      TreeDrawerNode node = (TreeDrawerNode) remaining.pop();
      TreeDrawerNode left = node.getLeft();
      TreeDrawerNode right = node.getRight();
     
      int rx = (int) (scaleGTR * (right.getCorr() - corrGTR));
      int lx = (int) (scaleGTR * (left.getCorr() - corrGTR));
View Full Code Here

            servlet.service(request, response);
          else
            serviceResource(request, response, config);
        }
      } finally {
        usedURIStack.pop();
        if (usedURIStack.empty())
          threadStacks.remove(t);
      }

    }
View Full Code Here

TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.