Lines Matching refs:entries
107 // private transient ArrayList<RdnEntry> entries;
108 private transient ArrayList entries;
133 entries = new ArrayList(attrSet.size());
141 entries.add(nEntries, entry);
149 sort(); // arrange entries for comparison
164 entries = new ArrayList(DEFAULT_SIZE);
175 entries = new ArrayList(rdn.entries.size());
176 entries.addAll(rdn.entries);
202 entries = new ArrayList(DEFAULT_SIZE);
213 entries = new ArrayList(DEFAULT_SIZE);
238 entries.add(newEntry);
243 if (entries.size() > 1) {
244 Collections.sort(entries);
260 return ((RdnEntry) entries.get(0)).getValue();
278 return ((RdnEntry) entries.get(0)).getType();
290 int size = entries.size();
292 builder.append(entries.get(0));
296 builder.append(entries.get(next));
328 int minSize = Math.min(entries.size(), that.entries.size());
332 int diff = ((RdnEntry) entries.get(i)).compareTo(
333 that.entries.get(i));
338 return (entries.size() - that.entries.size()); // longer RDN wins
370 if (entries.size() != that.size()) {
373 for (int i = 0; i < entries.size(); i++) {
374 if (!entries.get(i).equals(that.entries.get(i))) {
395 for (int i = 0; i < entries.size(); i++) {
396 hash += entries.get(i).hashCode();
410 for (int i = 0; i < entries.size(); i++) {
411 RdnEntry entry = (RdnEntry) entries.get(i);
500 return entries.size();
758 entries = new ArrayList(DEFAULT_SIZE);