Lines Matching defs:clients

42      * Initial capacity for IntRange clients array list. There will be
48 * One or more clients forming the continuous range [startId, endId].
58 final ArrayList<ClientRange> clients;
69 clients = new ArrayList<ClientRange>(INITIAL_CLIENTS_ARRAY_SIZE);
70 clients.add(new ClientRange(startId, endId, client));
80 clients = new ArrayList<ClientRange>(INITIAL_CLIENTS_ARRAY_SIZE);
81 clients.add(clientRange);
97 this.clients = new ArrayList<ClientRange>(intRange.clients.size());
99 this.clients.add(intRange.clients.get(i));
107 * to the clients array list directly, instead of via this method.
109 * number of clients grows large enough that it would make a difference.
113 int len = clients.size();
115 ClientRange nextRange = clients.get(i);
119 clients.add(i, range);
124 clients.add(range); // append to end of list
207 range.clients.add(0, new ClientRange(startId, endId, client));
222 range.clients.add(0, new ClientRange(startId, endId, client));
231 range.clients.addAll(joinRange.clients);
245 range.clients.add(0, new ClientRange(startId, endId, client));
254 range.clients.addAll(joinRange.clients);
269 range.clients.add(0, new ClientRange(startId, endId, client));
278 range.clients.addAll(joinRange.clients);
333 range.clients.addAll(joinRange.clients);
372 // search for it in the clients list
373 ArrayList<ClientRange> clients = range.clients;
376 int crLength = clients.size();
378 ClientRange cr = clients.get(0);
400 ClientRange cr = clients.get(crIndex);
406 clients.remove(crIndex);
411 clients.remove(crIndex);
429 // so clients.get(1) should always succeed.
430 int nextStartId = clients.get(1).startId;
438 largestEndId = clients.get(1).endId;
449 ClientRange nextCr = clients.get(nextIndex);
460 currentRange.clients.add(nextCr);