Examples of java.util.Stack.push()

java.util.Stack.push()
Pushes an item onto the top of this stack. This has exactly the same effect as:
```
 addElement(item)
```
@param item the item to be pushed onto this stack. @return the item argument. @see java.util.Vector#addElement


    int iChilds = oChilds.load(oConn, aChild);


    if (DebugFile.trace) DebugFile.writeln(String.valueOf(iChilds) + " childs loaded for " + getString(DB.gu_project));


    for (int c=0; c<iChilds;c++) oPending.push(oChilds.get(0,c));


    while (!oPending.empty()) {
      aChild[0] = oPending.pop();


      iChilds = oChilds.load(oConn, aChild);

View Full Code Here

      catch (java.lang.InstantiationException ignore) { /* never thrown*/ }


      oSubProjMap.put (aChild[0], oProj.getString(DB.gu_project));


      for (int c=0; c<iChilds;c++)
        oPending.push(oChilds.get(0,c));
    } // wend


    // Re-expandir todos los hijos del padre absoluto del clon
    oProj = new Project((String) oSubProjMap.get(get(DB.gu_project)));
    String sTopParent = oProj.topParent(oConn);

View Full Code Here

        {
            AssociationSessionType type = (AssociationSessionType) iter.next();


            // create the appropriate Association Request
            AssociationRequest newReq = createAssociationRequest(type, opUrl);
            if (newReq != null) reqStack.push(newReq);
        }


        // perform the association attempts
        int attemptsLeft = maxAttempts;
        LinkedHashMap alreadyTried = new LinkedHashMap();

View Full Code Here

                    {
                        if (DEBUG) _log.debug("Retrieved association type " +
                                              "from the association error: " +
                                              newReq.getType());


                        reqStack.push(newReq);
                    }
                }
            }
            catch (OpenIDException e)
            {

View Full Code Here

            parseProperties(req, resources, generatedXML, path, type,
                            properties);
        } else {
            // The stack always contains the object of the current level
            Stack stack = new Stack();
            stack.push(path);


            // Stack of the objects one level below
            Stack stackBelow = new Stack();


            while ((!stack.isEmpty()) && (depth >= 0)) {

View Full Code Here

                                (NameClassPair) enumeration.nextElement();
                            String newPath = currentPath;
                            if (!(newPath.endsWith("/")))
                                newPath += "/";
                            newPath += ncPair.getName();
                            stackBelow.push(newPath);
                        }
                    } catch (NamingException e) {
                        resp.sendError
                            (HttpServletResponse.SC_INTERNAL_SERVER_ERROR,
                             path);

View Full Code Here

    public double getMaxCorr() {
      double curCorr = getCorr();
      if (isLeaf())  return curCorr;
      
      Stack remaining = new Stack();
      remaining.push(this);
      while (remaining.empty() == false) {
        TreeDrawerNode node = (TreeDrawerNode) remaining.pop();
        if (node.getCorr() > curCorr)
          curCorr = node.getCorr();

View Full Code Here

        TreeDrawerNode node = (TreeDrawerNode) remaining.pop();
        if (node.getCorr() > curCorr)
          curCorr = node.getCorr();


        TreeDrawerNode leftNode = node.getLeft();
        if (leftNode != null) remaining.push(leftNode);


        TreeDrawerNode rightNode = node.getRight();
        if (rightNode != null) remaining.push(rightNode);
      }

View Full Code Here


        TreeDrawerNode leftNode = node.getLeft();
        if (leftNode != null) remaining.push(leftNode);


        TreeDrawerNode rightNode = node.getRight();
        if (rightNode != null) remaining.push(rightNode);
      }
      
      return curCorr;
    }

View Full Code Here

    public double getMinCorr() {
      double curCorr = getCorr();
      if (isLeaf())  return curCorr;
      
      Stack remaining = new Stack();
      remaining.push(this);
      while (remaining.empty() == false) {
        TreeDrawerNode node = (TreeDrawerNode) remaining.pop();
        if (node.getCorr() < curCorr)
          curCorr = node.getCorr();

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.