// Verify a sample of encrypted messages can be decrypted (to avoid extensive decryption that might fail)
        int sampleSize = Math.min(5, encrypted.size());
        for (int i = 0; i < sampleSize; i++) {
            try {
                byte[] decrypted = context.decryptMessage(encrypted.get(i));
                assertArrayEquals(messages.get(i).getBytes(), decrypted, "Sample message " + i + " should decrypt correctly");

  }

  public void testCopyOf_concurrentlyMutating() {
    List<String> sample = Lists.newArrayList("a", "b", "c");
    for (int delta : new int[] {-1, 0, 1}) {
      for (int i = 0; i < sample.size(); i++) {
        Collection<String> misleading = misleadingSizeCollection(delta);
        List<String> expected = sample.subList(0, i);
        misleading.addAll(expected);

    @Mock
    private NetbiosAddress mockAddress;

    @Mock
    private HttpServletRequest mockRequest;

    @Mock
    private HttpServletResponse mockResponse;

    private NtlmSsp ntlmSsp;

    // A sample challenge array
    private final byte[] challenge = new byte[] { 0x01, 0x23, 0x45, 0x67, (byte) 0x89, (byte) 0xab, (byte) 0xcd, (byte) 0xef };

    // Base64 encoded Type 1 message: NTLMSSP, Type 1, flags=0x00088207

   */
  public double populationCovariance() {
    checkState(count() != 0);
    return sumOfProductsOfDeltas / count();
  }

  /**
   * Returns the sample covariance of the values. The count must be greater than one.
   *
   * <p>This is not guaranteed to return zero when the dataset consists of the same pair of values
   * multiple times, due to numerical errors.
   *

      this.entryComparator = entryComparator(emptyMap.comparator());

      // derive values for inclusive filtering from the input samples
      SampleElements<Entry<K, V>> samples = delegate.samples();
      List<Entry<K, V>> samplesList =
          asList(samples.e0(), samples.e1(), samples.e2(), samples.e3(), samples.e4());
      sort(samplesList, entryComparator);
      this.firstInclusive = samplesList.get(0).getKey();

           Shell2Junit License Information

Feb, 2010

shell2junit library and sample code is licensed under Apache License, v.2.0.

(c) 2009 Manolo Carrasco (Manuel Carrasco Moñino)

=====

Apache License
Version 2.0, January 2004
http://www.apache.org/licenses/ 

1. Definitions.

"License" shall mean the terms and conditions for use, reproduction, and 
distribution as defined by Sections 1 through 9 of this document. 

    address[b++] = (value.ushr(8) and 0xff).toByte()
    address[b++] = (value and 0xff).toByte()
  }

  // All done. If compression happened, we need to move bytes to the right place in the
  // address. Here's a sample:
  //
  //      input: "1111:2222:3333::7777:8888"
  //     before: { 11, 11, 22, 22, 33, 33, 00, 00, 77, 77, 88, 88, 00, 00, 00, 00  }
  //   compress: 6
  //          b: 10

  @GwtIncompatible // java.nio.charset.Charset

  public void testIsWellFormed_3Bytes() {
    testBytes(3, EXPECTED_THREE_BYTE_ROUNDTRIPPABLE_COUNT);
  }

  /**
   * Tests that round tripping of a sample of four byte permutations work. All permutations are
   * prohibitively expensive to test for automated runs. This method tests specific four-byte cases.
   */
  public void testIsWellFormed_4BytesSamples() {

        }
    }

    @Test
    public void searchTestWithBoost() throws Exception {
        String field = "content";
        String query1 = "java";
        String query2 = "sample";
        Map<String, String> params = new HashMap<>();
        params.put("q", field + ":" + query1 + "^1000 OR " + field + ":" + query2);
        params.put("num", "100");

  }

  public void testCopyOf_concurrentlyMutating() {
    List<String> sample = Lists.newArrayList("a", "b", "c");
    for (int delta : new int[] {-1, 0, 1}) {
      for (int i = 0; i < sample.size(); i++) {
        Collection<String> misleading = misleadingSizeCollection(delta);
        List<String> expected = sample.subList(0, i);
        misleading.addAll(expected);