if (list.contains(key)) {
          assertEquals(list.indexOf(key) - 1, answer);
          return;
        }
        break;
    }
    // key is not present
    int nextHigherIndex = list.size();
    for (int i = list.size() - 1; i >= 0 && list.get(i) > key; i--) {
      nextHigherIndex = i;
    }
    switch (absentBehavior) {
      case NEXT_LOWER:
        assertEquals(nextHigherIndex - 1, answer);
        return;

        buf.enc_ndr_long(2); /* syntax version */
    }

    @Override
    public void decode_out(final NdrBuffer buf) throws NdrException {
        buf.dec_ndr_short(); /* max transmit frag size */
        buf.dec_ndr_short(); /* max receive frag size */
        buf.dec_ndr_long(); /* assoc. group */
        final int n = buf.dec_ndr_short(); /* secondary addr len */
        buf.advance(n); /* secondary addr */
        buf.align(4);

        buf.enc_ndr_long(2); /* syntax version */
    }

    @Override
    public void decode_out(final NdrBuffer buf) throws NdrException {
        buf.dec_ndr_short(); /* max transmit frag size */
        buf.dec_ndr_short(); /* max receive frag size */
        buf.dec_ndr_long(); /* assoc. group */
        final int n = buf.dec_ndr_short(); /* secondary addr len */
        buf.advance(n); /* secondary addr */
        buf.align(4);

                throw new RuntimeCIFSException(e);
            }
            bos.write(0x0);
        }

        System.arraycopy(bos.toByteArray(), 0, dst, dstIndex, bos.size());
        return bos.size();
    }

    @Override
    protected int readParameterWordsWireFormat(final byte[] buffer, final int bufferIndex) {
        return 0;
    }

    @Override

			}
		})
	}
}

func TestBatchJobSizeValidate(t *testing.T) {
	errInvalidBatchJobSizeFilter := BatchJobYamlErr{
		msg: "invalid batch-job size filter",
	}

	tests := []struct {
		sizeFilter BatchJobSizeFilter
		err        error
	}{
		{
			// Unspecified size filter is a valid filter
			sizeFilter: BatchJobSizeFilter{
				UpperBound: 0,
				LowerBound: 0,
			},
			err: nil,
		},
		{

    /**
     * Gets the maximum size for alphanumeric terms from configuration.
     *
     * @return the maximum alphanumeric term size
     */
    protected int getMaxAlphanumTermSize() {
        final FessConfig fessConfig = ComponentUtil.getFessConfig();
        return fessConfig.getCrawlerDocumentMaxAlphanumTermSizeAsInteger();
    }

    /**
     * Gets the maximum size for symbol terms from configuration.
     *

  }

  /**
   * In some cases our graph implementations return custom sets that define their own size() and
   * contains(). Verify that these sets are consistent with the elements of their iterator.
   */
  @CanIgnoreReturnValue
  static <T> Set<T> sanityCheckSet(Set<T> set) {
    assertThat(set).hasSize(Iterators.size(set.iterator()));
    for (Object element : set) {
      assertThat(set).contains(element);
    }

        QueryContext context = buildQuery("test");
        assertEquals(2, context.sortBuilders().size());
    }

    public void test_addDefaultSort_scoreField() {
        queryHelper.addDefaultSort("_score", "DESC");

        QueryContext context = buildQuery("test");
        assertEquals(1, context.sortBuilders().size());
        assertTrue(context.sortBuilders().get(0).toString().contains("_score"));
    }

      // We explicitly don't lock for iterator()
      assertFalse(Thread.holdsLock(mutex));
      return delegate.iterator();
    }

    @Override
    public int size() {
      assertTrue(Thread.holdsLock(mutex));
      return delegate.size();
    }

    @Override
    public boolean removeAll(Collection<?> collection) {
      assertTrue(Thread.holdsLock(mutex));
      return delegate.removeAll(collection);
    }

      for (int k = 0; k <= sampleSet.size(); k++) {
        int size = k;
        Set<Set<Integer>> expected =
            Sets.filter(
                Sets.powerSet(sampleSet),
                new Predicate<Set<Integer>>() {

                  @Override
                  public boolean apply(Set<Integer> input) {
                    return input.size() == size;
                  }
                });