Examples of pop()


Examples of net.sf.cglib.core.CodeEmitter.pop()

/* 64 */       e.load_this();
/* 65 */       e.getfield(delegate);
/* 66 */       e.dup();
/* 67 */       Label end = e.make_label();
/* 68 */       e.ifnonnull(end);
/* 69 */       e.pop();
/* 70 */       e.load_this();
/* 71 */       context.emitCallback(e, index);
/* 72 */       e.invoke_interface(LAZY_LOADER, LOAD_OBJECT);
/* 73 */       e.dup_x1();
/* 74 */       e.putfield(delegate);
View Full Code Here

Examples of net.sf.jsi.PriorityQueue.pop()

    PriorityQueue distanceQueue = new PriorityQueue(PriorityQueue.SORT_ORDER_DESCENDING);
    createNearestNDistanceQueue(p, count, distanceQueue, furthestDistance);

    while (distanceQueue.size() > 0) {
      v.execute(distanceQueue.getValue());
      distanceQueue.pop();
    }
  }

  /**
   * @see net.sf.jsi.SpatialIndex#nearestN(Point, TIntProcedure, int, float)
View Full Code Here

Examples of net.sourceforge.chaperon.helpers.IntegerList.pop()

        for (i = 0; i < table.getProductionLength(table.getActionArgument(state, tokenindex));  i++)
        {
          if (treestack.peek() instanceof ProductionContainer)
          {
            stack.pop();
            ProductionContainer container = (ProductionContainer) treestack.pop();
            switch (table.getProductionReduceType(container.productionindex))
            {
              case ParserTable.APPEND : // APPEND
                if (table.getProductionSymbol(newcontainer.productionindex)==
View Full Code Here

Examples of net.sourceforge.processdash.data.compiler.ListStack.pop()

      throws ExecutionException
    {
      ListStack stack = new ListStack();
      ExpressionContext context = new SimpleExpressionContext(prefix);
      script.run(stack, context);
      SimpleData value = (SimpleData) stack.pop();
      if (value != null)
        value = (SimpleData) value.getEditable(false);
      return value;
    }
View Full Code Here

Examples of net.sourceforge.processdash.data.compiler.Stack.pop()

        try {
            Stack stack = new ListStack();
            if (prefix != null)
                context = new RelativeExpressionContext(context, prefix);
            script.run(stack, context);
            return stack.pop();
        } catch (ExecutionException ee) {
            return null;
        }
    }
View Full Code Here

Examples of omschaub.azcvsupdater.utilities.StackX.pop()

            }
           

         
            while(!sortedArray.isEmpty()){
                String name = sortedArray.pop();
                if(name.startsWith("Azureus") )
                {
               
                if(Tab6.comboJar != null && !Tab6.comboJar.isDisposed())
                    Tab6.comboJar.add(name);
View Full Code Here

Examples of org.antlr.runtime.tree.CommonTreeNodeStream.pop()

    stream.consume(); // consume DN
    assertEquals(103, ((Tree)stream.LT(1)).getType());
    stream.consume(); // consume 103
    assertEquals(Token.UP, ((Tree)stream.LT(1)).getType());
    // RETURN
    stream.pop();
    assertEquals(107, ((Tree)stream.LT(1)).getType());
  }

  public void testNestedPushPop() throws Exception {
    // ^(101 ^(102 103) ^(104 105) ^(106 107) 108 109)
View Full Code Here

Examples of org.apache.commons.collections.ArrayStack.pop()

        while (f != null) {
            if (f.equals(parent)){
                if (l.isEmpty()){
                    break;
                }
                File rel = new File((String) l.pop());
                while(!l.isEmpty()) {
                    rel = new File(rel, (String) l.pop());
                }
                return rel;
            }
View Full Code Here

Examples of org.apache.commons.collections.BinaryHeap.pop()

        }

        // Bring the edges out in the right order.
        while ( !queue.isEmpty() )
        {
            Edge e = (Edge) queue.pop();

            if ( connectsLabels( graph, e ) )
            {
                addEdge( graph, e );
            }
View Full Code Here

Examples of org.apache.commons.collections.PriorityQueue.pop()

        }

        // Bring the edges out in the right order.
        while ( !queue.isEmpty() )
        {
            Edge e = (Edge) queue.pop();

            if ( connectsLabels( graph, e ) )
            {
                addEdge( graph, e );
            }
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.