Package java.util

Examples of java.util.Stack.pop()

87
88
89
90
91
92
93
94
95
96
97
            }
            break;
          case Yytoken.TYPE_RIGHT_BRACE:
            if(valueStack.size()>1){
              statusStack.pop();
              JSONObject map = (JSONObject)valueStack.pop();
              map.compactify(-0.9f);
              status=peekStatus(statusStack);
            }
            else{
              status=S_IN_FINISHED_VALUE;
View Full Code Here
107
108
109
110
111
112
113
114
115
116
117
          switch(token.type){
          case Yytoken.TYPE_COLON:
            break;
          case Yytoken.TYPE_VALUE:
            statusStack.pop();
            String key=(String)valueStack.pop();
            JSONObject parent=(JSONObject)valueStack.peek();
            parent.put(key,token.value);
            status=peekStatus(statusStack);
            break;
          case Yytoken.TYPE_LEFT_SQUARE:
View Full Code Here
114
115
116
117
118
119
120
121
122
123
124
            parent.put(key,token.value);
            status=peekStatus(statusStack);
            break;
          case Yytoken.TYPE_LEFT_SQUARE:
            statusStack.pop();
            key=(String)valueStack.pop();
            parent=(JSONObject)valueStack.peek();
            JSONArray newArray=new JSONArray();
            parent.put(key,newArray);
            status=S_IN_ARRAY;
            statusStack.push(new Integer(status));
View Full Code Here
124
125
126
127
128
129
130
131
132
133
134
            statusStack.push(new Integer(status));
            valueStack.push(newArray);
            break;
          case Yytoken.TYPE_LEFT_BRACE:
            statusStack.pop();
            key=(String)valueStack.pop();
            parent=(JSONObject)valueStack.peek();
            JSONObject newObject=new JSONObject();
            parent.put(key,newObject);
            status=S_IN_OBJECT;
            statusStack.push(new Integer(status));
View Full Code Here
148
149
150
151
152
153
154
155
156
157
158
            val.add(token.value);
            break;
          case Yytoken.TYPE_RIGHT_SQUARE:
            if(valueStack.size()>1){
              statusStack.pop();
              valueStack.pop();
              status=peekStatus(statusStack);
            }
            else{
              status=S_IN_FINISHED_VALUE;
            }
View Full Code Here
209
210
211
212
213
214
215
216
217
218
219
    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);

      if (DebugFile.trace) DebugFile.writeln(String.valueOf(iChilds) + " childs loaded for " + aChild[0]);
View Full Code Here
757
758
759
760
761
762
763
764
765
766
767
        {
            try
            {
                attemptsLeft--;
                AssociationRequest assocReq =
                        (AssociationRequest) reqStack.pop();

                if (DEBUG)
                    _log.debug("Trying association type: " + assocReq.getType());

                // was this association / session type attempted already?
View Full Code Here
62
63
64
65
66
67
68
69
70
71
72
      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();

        TreeDrawerNode leftNode = node.getLeft();
        if (leftNode != null) remaining.push(leftNode);
View Full Code Here
86
87
88
89
90
91
92
93
94
95
96
      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();

        TreeDrawerNode leftNode = node.getLeft();
        if (leftNode != null) remaining.push(leftNode);
View Full Code Here
109
110
111
112
113
114
115
116
117
118
119
    public TreeDrawerNode findNode(String nodeid)
    {
      Stack remaining = new Stack();
      remaining.push(this);
      while (remaining.empty() == false) {
        TreeDrawerNode node = (TreeDrawerNode) remaining.pop();
     
        if(node.getId().equals(nodeid)) return node;

        TreeDrawerNode leftNode = node.getLeft();
        if (leftNode != null) remaining.push(leftNode);
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.