static SortedSetDocValues replaceMissing(final SortedSetDocValues values, final BytesRef missing) throws IOException { final long missingOrd = values.lookupTerm(missing); if (missingOrd >= 0) { // The value already exists return replaceMissingOrd(values, missingOrd); } else { final long insertedOrd = -1 - missingOrd; return insertOrd(values, insertedOrd, missing); } }
static SortedSetDocValues replaceMissing(final SortedSetDocValues values, final BytesRef missing) throws IOException { final long missingOrd = values.lookupTerm(missing); if (missingOrd >= 0) { // The value already exists return replaceMissingOrd(values, missingOrd); } else { final long insertedOrd = -1 - missingOrd; return insertOrd(values, insertedOrd, missing); } }
static RandomAccessOrds replaceMissing(final RandomAccessOrds values, final BytesRef missing) { final long missingOrd = values.lookupTerm(missing); if (missingOrd >= 0) { // The value already exists return replaceMissingOrd(values, missingOrd); } else { final long insertedOrd = -1 - missingOrd; return insertOrd(values, insertedOrd, missing); } }
static RandomAccessOrds replaceMissing(final RandomAccessOrds values, final BytesRef missing) { final long missingOrd = values.lookupTerm(missing); if (missingOrd >= 0) { // The value already exists return replaceMissingOrd(values, missingOrd); } else { final long insertedOrd = -1 - missingOrd; return insertOrd(values, insertedOrd, missing); } }
static SortedSetDocValues replaceMissing(final SortedSetDocValues values, final BytesRef missing) throws IOException { final long missingOrd = values.lookupTerm(missing); if (missingOrd >= 0) { // The value already exists return replaceMissingOrd(values, missingOrd); } else { final long insertedOrd = -1 - missingOrd; return insertOrd(values, insertedOrd, missing); } }