int c = segments[i].count; mcsum += mc[i] = segments[i].modCount; if (segments[i].containsValue(value)) return true; try { for (int i = 0; i < segments.length; ++i) { if (segments[i].containsValue(value)) { found = true; break;
int c = segments[i].count; mcsum += mc[i] = segments[i].modCount; if (segments[i].containsValue(value)) return true; try { for (int i = 0; i < segments.length; ++i) { if (segments[i].containsValue(value)) { found = true; break;