LinkedList<Object> list = ...; // Loop 1: int size = list.size(); for (int i = 0; i<size; i++) { Object o = list.get(i); /// do stuff } // Loop 2: for (Object o : list) { // do stuff } // Loop 3: Iterator<Object> it = list.iterator(); while (it.hasNext()) { Object o = it.next(); // do stuff }
Iterator<Integer> inIter = inQueue.iterator(); for (int i = 0; i < search.length; i++) if (!inIter.hasNext() || search[i] != inIter.next())
for (Iterator<Point> it = list.iterator(); it.hasNext(); ) {
/** * Loads the MRU file list in from a file and stores it in a LinkedList. * If no file exists, a new LinkedList is created. */ protected void load() { createConfigurationDirectory(); File file = new File(getFilename()); if (file.exists()) { try { ObjectInputStream ois = new ObjectInputStream( new FileInputStream(file)); _mruFileList = (LinkedList) ois.readObject(); ois.close(); // check that only files and url are in linked list Iterator it = _mruFileList.iterator(); while (it.hasNext()) { Object o = it.next(); if (!(o instanceof File) && !(o instanceof URL)) { it.remove(); } } } catch (Exception e) { _mruFileList = new LinkedList(); } } else { _mruFileList = new LinkedList(); } }
import java.util.*; public class C1 implements Iterable<C1.NC1> { private LinkedList<NC1> list; public static class NC1 { } public Iterator<C1.NC1> iterator() { return list.iterator(); } }
public static void product(LinkedList<Integer> list) { Iterator<Integer>productw = list.iterator(); int result = 1; for( int i=0; i<productw.size(); ++i ) { result *= productw.get(i) ; } // result has the answer }
LinkedList<String> lista = new LinkedList<String>(); //add Items to your linked list.... Iterator<String> itLista = lista.iterator(); while(itLista.hasNext()){ String s = lista.next(); ....//do what you will with the item in the list }
LinkedList tmpLinkedList = new LinkedList(result); for (Iterator iter = tmpLinkedList.iterator(); iter.hasNext() { if (iter.next().split("\\s").length != maxLength)) iter.remove(); } result.clear(); result.addAll(tmpLinkedList);
for (int i = 0; i < buckets.size(); i++) { LinkedList<Integer> innerList = buckets.get(i); for (Iterator<Integer> iterator = innerList.iterator(); iterator.hasNext();) { sorted.add(iterator.next()); iterator.remove(); // this guy is optional } }
LinkedList<Integer> ll = new LinkedList<Integer>(); Iterator<Integer> itr = ll.iterator(); int i = 0; int[] seq = {1, 2, 3, 4}; while (itr.hasNext()) { int val = itr.next(); assertEquals(seq[i], val); i++; }
public static <T> void removeDuplicates(LinkedList<T> list) { final Set<T> encountered = new HashSet<T>(); for (Iterator<T> iter = list.iterator(); iter.hasNext(); ) { final T t = iter.next(); final boolean first = encountered.add(t); if (!first) { iter.remove(); } } }
public void delete(String x, LinkedList<String> list) { synchronized (list) { for (Iterator<String> it = list.iterator(); it.hasNext();) if (it.next().equals(x)) it.remove(); } }
LinkedList<String> elements = ...; //to avoid the slow ArrayList.remove() int k = elements.size() - count; //elements to select/delete int remaining = elements.size(); //elements remaining to be iterated for (Iterator i = elements.iterator(); k > 0 && i.hasNext(); remaining--) { i.next(); if (random.nextInt(remaining) < k) { //or (random.nextDouble() < (double)k/remaining) i.remove(); k--; } }
Iterator<LinkedList <Object>> iterator = yourList.iterator(); while (iterator.hasNext()) { LinkedList<Object> embededList=iterator.next(); Iterator<Object> embededIterator= embededList.iterator(); while(embededIterator.hasNext()){ System.out.println(embededIterator.next()); } }
LinkedList<Integer> ll = new LinkedList<Integer>(); ll.add(1); ll.add(2); ll.add(3); System.out.println("Normal traversal"); for(Iterator<Integer> i = ll.iterator(); i.hasNext();) { System.out.println(i.next()); } System.out.println("Reverse"); for(Iterator<Integer> i = ll.descendingIterator(); i.hasNext();) { System.out.println(i.next()); }
Node node1 = new Node(); Node node2 = new Node(); LinkedList list = new LinkedList(); list.add(node1); list.add(node2); Iterator <Node> m_iterator=list.iterator(); //set iterator to first node m_iterator.next(); //then my node1 will know who it's next is: assertEquals(node2, m_iterator.next());
protected void endLocationPath() throws JaxenException { LocationPath path = (LocationPath) peekFrame().removeFirst(); addSteps( path, popFrame().iterator() ); push( path ); }
public void endFunction() throws JaxenException { FunctionCallExpr function = (FunctionCallExpr) peekFrame().removeFirst(); addParameters( function, popFrame().iterator() ); push( function ); }
protected void endStep() { Step step = (Step) peekFrame().removeFirst(); addPredicates( step, popFrame().iterator() ); push( step ); }
public void endFilterExpr() throws JaxenException { //System.err.println("endFilterExpr()"); Expr expr = (Expr) peekFrame().removeFirst(); FilterExpr filter = getXPathFactory().createFilterExpr( expr ); Iterator predIter = popFrame().iterator(); addPredicates( filter, predIter ); push( filter ); }