Lines Matching refs:add
79 case 0: l.add(two); break;
80 case 1: l.add(0, two); break;
90 case 0: q.add(two); break;
109 case 0: q.add(two); break;
125 c.add(two);
170 c.add(one);
187 list.add(new ConcurrentHashMap<Integer, Boolean>());
188 list.add(new ConcurrentSkipListMap<Integer, Boolean>());
194 list.add(new Hashtable<Integer, Boolean>());
195 list.add(new HashMap<Integer, Boolean>());
196 list.add(new TreeMap<Integer, Boolean>());
201 list.add(new TreeMap<Integer, Boolean>(Collections.reverseOrder(cmp)));
207 list.add(new ConcurrentSkipListSet<Integer>());
208 list.add(new CopyOnWriteArraySet<Integer>());
214 list.add(new HashSet<Integer>());
215 list.add(new TreeSet<Integer>());
216 list.add(new TreeSet<Integer>(Collections.reverseOrder()));
222 list.add(new CopyOnWriteArrayList<Integer>());
228 list.add(new Vector<Integer>());
229 list.add(new ArrayList<Integer>());
236 list.add(new LinkedBlockingQueue<Integer>(10));
237 list.add(new LinkedTransferQueue<Integer>());
238 list.add(new ConcurrentLinkedQueue<Integer>());
245 list.add(new LinkedBlockingQueue<Integer>(10));
251 list.add(new LinkedBlockingDeque<Integer>(10));
252 list.add(new ConcurrentLinkedDeque<Integer>());
258 list.add(new ArrayDeque<Integer>());
259 list.add(new LinkedList<Integer>());