We'd love to accept your patches! Before we can take them, we have to jump a couple of legal hurdles.

Please fill out either the individual or corporate Contributor License Agreement (CLA).

  * If you are an individual writing original source code and you're sure you own the intellectual property, then you'll need to sign an [individual CLA](https://code.google.com/legal/individual-cla-v1.0.html).

            }
            return null;
        }

        /**
         * Closes the updater and finalizes the file update operation.
         * If changes were committed, the temporary file replaces the original.
         * Otherwise, the temporary file is deleted.
         */
        @Override
        public void close() {
            try {
                writer.flush();
            } catch (final IOException e) {

        assertTrue(result instanceof BoolQueryBuilder);
        BoolQueryBuilder boolResult = (BoolQueryBuilder) result;
        assertTrue(boolResult.hasClauses());
        // Verify the original query is preserved as a must clause
        assertEquals(1, boolResult.must().size());
        assertEquals(initialQuery, boolResult.must().get(0));
    }

    // Test addSorts
    public void test_addSorts() {

   * according to this method. In particular, none of the following sets of headers are equal
   * according to this method:
   *
   * 1. Original
   * ```
   * Content-Type: text/html
   * Content-Length: 50
   * ```
   *
   * 2. Different order
   *
   * ```
   * Content-Length: 50
   * Content-Type: text/html
   * ```
   *

   *
   * <p>The exact C++ equivalent is the MurmurHash3_x86_32 function (Murmur3A).
   *
   * <p>This method is called {@code murmur3_32_fixed} because it fixes a bug in the {@code
   * HashFunction} returned by the original {@code murmur3_32} method.
   *
   * @since 31.0
   */
  @SuppressWarnings("IdentifierName") // the best we could do for adjacent digit blocks
  public static HashFunction murmur3_32_fixed(int seed) {

            assertEquals(0x12345 & 0xFFFF, req.getMaxCount(), "maxCount should contain lower 16 bits");
            assertEquals(0x12345, req.getMinCount(), "minCount should remain original full value");
        }

        @Test
        @DisplayName("Named pipe request uses fixed 1024 hints")
        void namedPipeRequestHints() throws Exception {
            when(mockTree.isSMB2()).thenReturn(false);

/*
 * Copyright 2020 the original author or authors.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,

        assertEquals("malformed11:-invalid", result[2]);
        assertEquals("11-malformed:-invalid", result[3]);
    }

    @Override
    public void tearDown() throws Exception {
        // Restore original java.version property if it exists
        String originalVersion = System.getProperty("java.version");
        if (originalVersion != null) {
            System.setProperty("java.version", originalVersion);
        }

            return false;
        }
    }

    /**
     * Attempt to recover from a recoverable RDMA error
     *
     * @param connection RDMA connection to recover
     * @param error the original error
     * @return true if recovery succeeded, false otherwise
     */
    private boolean attemptRecovery(RdmaConnection connection, Exception error) {
        int retryCount = 0;

    /**
     * Returns the domain.
     */
    @Override
    public String getUserDomain() {
        return this.domain;
    }

    /**
     * Get the original specified user domain
     *
     * @return the original specified user domain
     */
    public String getSpecifiedUserDomain() {
        return this.domain;
    }

    /**
     * Returns the username.
     *