func (hkvs HelpKVS) Lookup(key string) (HelpKV, bool) {
	for _, hkv := range hkvs {
		if hkv.Key == key {
			return hkv, true
		}
	}
	return HelpKV{}, false
}

// DefaultComment used across all sub-systems.
const DefaultComment = "optionally add a comment to this setting"

// Region help is documented in default config
var (
	SiteHelp = HelpKVS{
		HelpKV{
			Key:         NameKey,
			Type:        "string",

# Copyright 2022 The TensorFlow Authors. All Rights Reserved.
#
# 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(1024L, mockBasicFileInfo.getSize());
        assertEquals(FileInformation.FILE_BASIC_INFO, mockBasicFileInfo.getFileInformationLevel());

        // Verify all methods were called
        verify(mockBasicFileInfo).getAttributes();
        verify(mockBasicFileInfo).getCreateTime();
        verify(mockBasicFileInfo).getLastWriteTime();
        verify(mockBasicFileInfo).getLastAccessTime();

	clocked := make(chan bool)
	cunlock := make(chan bool)
	cdone := make(chan bool)
	for range numReaders {
		go parallelReader(context.Background(), m, clocked, cunlock, cdone)
	}
	// Wait for all parallel RLock()s to succeed.
	for range numReaders {
		<-clocked
	}
	for range numReaders {
		cunlock <- true
	}
	// Wait for the goroutines to finish.
	for range numReaders {
		<-cdone
	}
}

  }

  TF_Operation* UseT(const std::vector<TF_Output>& inputs) {
    TF_Operation* op;
    UseHelper(inputs, &op);
    return op;
  }

  // All the *Helper methods are used as a workaround for the restrictions that
  // one cannot call ASSERT_* methods in non-void-returning functions (when
  // exceptions are disabled during compilation)
  void UseHelper(const std::vector<TF_Output>& inputs, TF_Operation** op) {

  }

  public void testEqualsForEqualMap() {
    Map<K, V> map;
    try {
      map = makePopulatedMap();
    } catch (UnsupportedOperationException e) {
      return;
    }

    // Explicitly call `equals`; `assertEquals` might return fast
    assertTrue(map.equals(map));
    assertTrue(makePopulatedMap().equals(map));
    assertFalse(map.equals(emptyMap()));
    // no-inspection ObjectEqualsNull

    public static void afterClass() throws Exception {
        runner.close();
        runner.clean();
    }

    @Before
    public void before() throws Exception {
        runner.admin().indices().prepareDelete("_all").execute().actionGet();
        runner.refresh();
        suggester = Suggester.builder().build(runner.client(), "SuggestRequestBuilderTest");
        suggester.createIndexIfNothing();
    }

    @Test

    @EnumSource(RequestParam.class)
    @DisplayName("send handles each RequestParam enum constant")
    void send_eachRequestParam_isAccepted(RequestParam param) throws Exception {
        // Arrange: stub per-call return to ensure interaction with the exact enum
        when(tree.send(eq(request), eq(param))).thenReturn(response);

        // Act
        CommonServerMessageBlockResponse out = tree.send(request, param);

    }

    @Test
    void testEncodeSourceOffsetBeyondLength() {
        // Test with source offset + length exceeding source array bounds
        byte[] data = { 0x01, 0x02 };
        // This constructor call itself should not throw an error, as it's just storing the values.
        // The error should occur when System.arraycopy is called.
        ByteEncodable encodable = new ByteEncodable(data, 1, 2); // off=1, len=2, data.length=2. 1+2 > 2

 * .compare(a.foo, b.bar)}. {@code ComparisonChain} also has a potential performance problem that
 * {@code Comparator} doesn't: it evaluates all the parameters of all the {@code .compare} calls,
 * even when the result of the comparison is already known from previous {@code .compare} calls.
 * That can be expensive.
 *
 * @author Mark Davis
 * @author Kevin Bourrillion