Lines Matching defs:names
45 * The names of the fields in this ImmutableDescriptor with their
46 * original case. The names must be in alphabetical order as determined
49 private final String[] names;
53 * {@code names} array.
94 * <p>Construct a descriptor where the names and values of the fields
99 * more than once (which can happen because field names are not case
116 this.names = map.keySet().toArray(new String[size]);
133 if (names == null || values == null || names.length != values.length)
136 if (names.length == 0 && getClass() == ImmutableDescriptor.class)
140 for (int i = 0; i < names.length; i++) {
141 if (names[i] == null ||
142 compare.compare(lastName, names[i]) >= 0) {
146 lastName = names[i];
150 throw new InvalidObjectException("Bad names or values");
241 String[] names;
244 names = id.names;
246 && names.length > biggestImmutable.names.length)
249 names = d.getFieldNames();
250 for (String n : names) {
270 if (biggestImmutable.names.length == map.size())
279 return ((ImmutableDescriptor) d).names.length == 0;
293 return Arrays.binarySearch(names, name, String.CASE_INSENSITIVE_ORDER);
314 String[] result = new String[names.length];
321 result[i] = names[i] + "=" + value;
339 return names.clone();
345 * the same field names (possibly differing in case) and the same
374 onames = ((ImmutableDescriptor) o).names;
379 if (names.length != onames.length)
381 for (int i = 0; i < names.length; i++) {
382 if (!names[i].equalsIgnoreCase(onames[i]))
418 hashCode = Util.hashCode(names, values);
426 for (int i = 0; i < names.length; i++) {
429 sb.append(names[i]).append("=");
443 * names. This method always returns true, but a subclass can