try {
            languageHelper.updateDocument(doc);
            fail("Should throw NullPointerException without detector");
        } catch (NullPointerException e) {
            // Expected since we don't have a detector
        }
    }

    public void test_updateDocument_emptyDoc() {
        Map<String, Object> doc = new HashMap<>();

        languageHelper.updateDocument(doc);

  /**
   * Given a set of features, add to it all the features directly or indirectly implied by any of
   * them, and return it.
   *
   * @param features the set of features to expand
   * @return the same set of features, expanded with all implied features
   */
  @CanIgnoreReturnValue
  public static Set<Feature<?>> addImpliedFeatures(Set<Feature<?>> features) {
    Queue<Feature<?>> queue = new ArrayDeque<>(features);

    EnumBiMap<Currency, Country> bimap = EnumBiMap.create(map);
    assertEquals(Country.CANADA, bimap.get(Currency.DOLLAR));
    assertEquals(Currency.DOLLAR, bimap.inverse().get(Country.CANADA));

    /* Map must have at least one entry if not an EnumBiMap. */
    assertThrows(
        IllegalArgumentException.class,
        () -> EnumBiMap.create(Collections.<Currency, Country>emptyMap()));
    assertThrows(

 * their ordinal for BloomFilter serialization.
 *
 * @author Dimitris Andreou
 * @author Kurt Alfred Kluever
 */
enum BloomFilterStrategies implements BloomFilter.Strategy {
  /**
   * See "Less Hashing, Same Performance: Building a Better Bloom Filter" by Adam Kirsch and Michael
   * Mitzenmacher. The paper argues that this trick doesn't significantly deteriorate the

import java.util.Map.Entry;
import java.util.Set;
import org.jspecify.annotations.NullMarked;
import org.jspecify.annotations.Nullable;

/**
 * Tests for {@link Maps#transformValues} when the backing map's views have iterators that don't
 * support {@code remove()}.
 *
 * @author Jared Levy
 */
@GwtCompatible
@NullMarked
public class MapsTransformValuesUnmodifiableIteratorTest extends MapInterfaceTest<String, String> {

            // Verify sequential values from 1 to 9
            for (int i = 0; i < actions.length; i++) {
                assertEquals(i + 1, actions[i], String.format("Action at index %d should have value %d", i, i + 1));
            }
        }
    }

    @Nested
    @DisplayName("Interface Methods Tests")
    class InterfaceMethodsTests {

        @Test

        return new SmbFileInputStream(mockFile, mockTree, mockHandle);
    }

    @BeforeEach
    void setUp() throws Exception {
        // Common, safe defaults for collaborators
        when(mockHandle.isValid()).thenReturn(true);
        when(mockHandle.acquire()).thenReturn(mockHandle);
        when(mockHandle.getTree()).thenReturn(mockTree);

 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */

   *
   * @param length the length of the array
   */
  public AtomicDoubleArray(int length) {
    this.longs = new AtomicLongArray(length);
  }

  /**
   * Creates a new {@code AtomicDoubleArray} with the same length as, and all elements copied from,
   * the given array.
   *
   * @param array the array to copy elements from
   * @throws NullPointerException if array is null
   */
  public AtomicDoubleArray(double[] array) {

 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */