Package java.util

Examples of java.util.LinkedList.removeFirst()

654
655
656
657
658
659
660
661
662
663
664
        LinkedList queue = new LinkedList( parent.getChildren() );
        while( queue.size() != 0 ) {
            Element child = (Element)queue.getFirst();
            v.visit( child );
            queue.addAll( child.getChildren() );
            queue.removeFirst();
        }
    }

    /**
     * <p>
 
View Full Code Here
184
185
186
187
188
189
190
191
192
193
194
    }
   
//    console.out.println("DM is " + dm.getState());
    int nummod = 0;
    while (fs.size() > 0) {
      start = ((Integer) fs.removeFirst()).intValue();
      end = ((Integer) fe.removeFirst()).intValue();
      for (int i = start; i <= end; i++) {
        nummod++;
        // DEBUG
//        console.out.println("Setting priority for file " + i + " to " + newprio);
View Full Code Here
61
62
63
64
65
66
67
68
69
70
71
                        break;
                    }
                }

                if (lastKnownLength != 0 && readSize > totalReadSize) {
                    lines.removeFirst();
                }
            } finally {
                bfs.close();
            }
           
View Full Code Here
143
144
145
146
147
148
149
150
151
152
153
                throw new ChaiDBException(ErrorCode.LOCK_NULL, "The lock is null in the entry which treeid is exist.");
            else {
                if (lock.size() == 1) {
                    removeLock(treeName);
                }
                return (Lock) lock.removeFirst();
            }
        } else {
            return null;
        }
    }
View Full Code Here
782
783
784
785
786
787
788
789
790
791
792
      LinkedList msgs = state.getASFMessages();
     
      while (msgs.size() > 0)
      {
         AsfMessageHolder holder = (AsfMessageHolder)msgs.removeFirst();

         if (trace) { log.trace("sending " + holder.msg + " to the message listener" ); }
        
         MessageCallbackHandler.callOnMessage(del, state.getDistinguishedListener(), holder.consumerID,
                                              holder.queueName, false,
View Full Code Here
81
82
83
84
85
86
87
88
89
90
91
      {
         LinkedList ll = linkedLists[i];
        
         if (!ll.isEmpty())
         {
            obj = ll.removeFirst();
            break;
         }
                          
      }
     
View Full Code Here
67
68
69
70
71
72
73
74
75
76
77
  {
    Object o = null;
    LinkedList stack = (LinkedList) threadStack.get();
    if (stack != null)
    {
      o = stack.removeFirst();
    }
    return o;
  }
 
  public boolean empty()
View Full Code Here
115
116
117
118
119
120
121
122
123
124
125
   
    if (stack == null || stack.size() == 0) {
      throw new EmptyStackException();
    }
   
    Object result = stack.removeFirst();
    if (stack.size() > 0)
      currentTopAttributes.put(key, stack.getFirst());
    return result;
  }
View Full Code Here
233
234
235
236
237
238
239
240
241
242
243
                    final int[] indices = reaction.indices;
                    args = new Object[indices.length];
                    for ( int i = 0 ; i < indices.length ; ++i ) {
                        final int readIndex = indices[i];
                        final LinkedList reading = writes[readIndex];
                        args[i] = reading.removeFirst();
                        if (reading.isEmpty()) {
                            mask &= ~(1L << readIndex);
                        }
                    }
                    selectedReaction = reaction;
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
            queue.add( "" );
        }

        while ( !queue.isEmpty() )
        {
            String path = (String) queue.removeFirst();

            File currentDir = new File( dir, path );

            File[] files = currentDir.listFiles();
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.