public Builder<V> add(V v) { if (count == values.length) values = Arrays.copyOf(values, count * 2); Object[] values = this.values; int prevCount = this.count++; values[prevCount] = v; if (auto && detected && prevCount > 0) { V prev = (V) values[prevCount - 1]; int c = comparator.compare(prev, v); if (c == 0 && auto) { count = prevCount; if (quickResolver != null) values[prevCount - 1] = quickResolver.resolve(prev, v); } else if (c > 0) { detected = false; } } return this; }
public Builder<V> add(V v) { if (count == values.length) values = Arrays.copyOf(values, count * 2); Object[] values = this.values; int prevCount = this.count++; values[prevCount] = v; if (auto && detected && prevCount > 0) { V prev = (V) values[prevCount - 1]; int c = comparator.compare(prev, v); if (c == 0 && auto) { count = prevCount; if (quickResolver != null) values[prevCount - 1] = quickResolver.resolve(prev, v); } else if (c > 0) { detected = false; } } return this; }
public Builder<V> add(V v) { if (count == values.length) values = Arrays.copyOf(values, count * 2); Object[] values = this.values; int prevCount = this.count++; values[prevCount] = v; if (auto && detected && prevCount > 0) { V prev = (V) values[prevCount - 1]; int c = comparator.compare(prev, v); if (c == 0 && auto) { count = prevCount; if (quickResolver != null) values[prevCount - 1] = quickResolver.resolve(prev, v); } else if (c > 0) { detected = false; } } return this; }
public Builder<V> add(V v) { if (count == values.length) values = Arrays.copyOf(values, count * 2); Object[] values = this.values; int prevCount = this.count++; values[prevCount] = v; if (auto && detected && prevCount > 0) { V prev = (V) values[prevCount - 1]; int c = comparator.compare(prev, v); if (c == 0 && auto) { count = prevCount; if (quickResolver != null) values[prevCount - 1] = quickResolver.resolve(prev, v); } else if (c > 0) { detected = false; } } return this; }
private void autoEnforce() { if (!detected && count > 1) { sort(); int prevIdx = 0; V prev = (V) values[0]; for (int i = 1 ; i < count ; i++) { V next = (V) values[i]; if (comparator.compare(prev, next) != 0) values[++prevIdx] = prev = next; else if (quickResolver != null) values[prevIdx] = prev = quickResolver.resolve(prev, next); } count = prevIdx + 1; } detected = true; }
private void autoEnforce() { if (!detected && count > 1) { sort(); int prevIdx = 0; V prev = (V) values[0]; for (int i = 1 ; i < count ; i++) { V next = (V) values[i]; if (comparator.compare(prev, next) != 0) values[++prevIdx] = prev = next; else if (quickResolver != null) values[prevIdx] = prev = quickResolver.resolve(prev, next); } count = prevIdx + 1; } detected = true; }
private void autoEnforce() { if (!detected && count > 1) { sort(); int prevIdx = 0; V prev = (V) values[0]; for (int i = 1 ; i < count ; i++) { V next = (V) values[i]; if (comparator.compare(prev, next) != 0) values[++prevIdx] = prev = next; else if (quickResolver != null) values[prevIdx] = prev = quickResolver.resolve(prev, next); } count = prevIdx + 1; } detected = true; }
private void autoEnforce() { if (!detected && count > 1) { sort(); int prevIdx = 0; V prev = (V) values[0]; for (int i = 1 ; i < count ; i++) { V next = (V) values[i]; if (comparator.compare(prev, next) != 0) values[++prevIdx] = prev = next; else if (quickResolver != null) values[prevIdx] = prev = quickResolver.resolve(prev, next); } count = prevIdx + 1; } detected = true; }