This method is equivalent to {@link #add}. @param e the element to add
257258259260261262263264265266267
deliveringCount.increment(); iter.remove(); toTimeout.addLast(ref); } } //Note! //It is possible there are message ids in the toRecover that are not in the queue
10141015101610171018101910201021102210231024
.get(itemId); if (listenerList == null) { listenerList = new LinkedList(); propertySetToListenerListMap.put(itemId, listenerList); } listenerList.addLast(listener); } } /** * Removes a previously registered single Property change listener.
919293949596979899100101
startTime = System.currentTimeMillis(); for(int x = loopCount; x > 0; x--) { // unrolled a few times to minimize effect of loop ll.addFirst(o1); ll.addLast(o2); ll.removeFirst(); ll.removeLast(); ll.add(o1); ll.remove(0); //
9899100101102103104105106107108
ll.removeLast(); ll.add(o1); ll.remove(0); // ll.addFirst(o1); ll.addLast(o2); ll.removeFirst(); ll.removeLast(); ll.add(o1); ll.remove(0); //
105106107108109110111112113114115
ll.removeLast(); ll.add(o1); ll.remove(0); // ll.addFirst(o1); ll.addLast(o2); ll.removeFirst(); ll.removeLast(); ll.add(o1); ll.remove(0); }
205206207208209210211212213214215
} } if(!lessSpecific) { maximals.addLast(app); } } if(maximals.size() > 1) {
533534535536537538539540541542543
pathElements.removeLast(); } } else { pathElements.addLast( token ); } } StringBuffer cleanedPath = new StringBuffer();
336337338339340341342343344345346
} } TransitionTarget parent = tt.getParent(); if (parent != null && !stateSet.contains(parent)) { stateSet.add(parent); todoList.addLast(parent); } } transSet.clear(); stateSet.clear(); todoList.clear();
560561562563564565566567568569570
//or it is a leaf state // NOTE: Digester has to verify this precondition! if (st.isSimple()) { states.add(st); //leaf } else if (st.isOrthogonal()) { //TODO: Remove else if in v1.0 wrkSet.addLast(st.getParallel()); //parallel } else { // composite state List initialStates = st.getInitial().getTransition(). getTargets(); wrkSet.addAll(initialStates);