// Should not throw exception with invalid package
        protocolHelper.loadProtocols("org.invalid.package.does.not.exist");

        // Should have empty arrays initially
        assertEquals(0, protocolHelper.getWebProtocols().length);
        assertEquals(0, protocolHelper.getFileProtocols().length);
    }

    public void test_loadProtocols_emptyPackage() {

 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package com.google.common.collect.testing;

import static java.util.Arrays.asList;
import static java.util.Collections.emptyMap;
import static java.util.Collections.emptySet;
import static java.util.Collections.singletonMap;
import static java.util.Collections.unmodifiableMap;

import static com.google.common.collect.testing.SampleElements.Strings.BEFORE_FIRST;
import static com.google.common.collect.testing.SampleElements.Strings.BEFORE_FIRST_2;
import static java.lang.Math.max;
import static java.util.Arrays.asList;
import static java.util.Collections.sort;
import static junit.framework.Assert.assertEquals;

import com.google.common.annotations.GwtCompatible;
import com.google.common.annotations.GwtIncompatible;

        assertNotNull(result);
        assertEquals(0, result.length);
        assertSame(StringUtil.EMPTY_STRINGS, result);
    }

    public void test_distinct_emptyArray() {
        // Test distinct with empty array
        String[] input = new String[0];
        String[] result = invokeDistinct(input);
        assertSame(input, result);
    }

    public void test_distinct_singleElement() {

  public static Closer create() {
    return new Closer(SUPPRESSING_SUPPRESSOR);
  }

  @VisibleForTesting final Suppressor suppressor;

  // only need space for 2 elements in most cases, so try to use the smallest array possible
  private final Deque<Closeable> stack = new ArrayDeque<>(4);
  private @Nullable Throwable thrown;

  @VisibleForTesting
  Closer(Suppressor suppressor) {

(accessed with “<code>go</code> <code>build</code> <code>-race</code>”)
do exactly this.
</p>

<p>
A read of an array, struct, or complex number
may be implemented as a read of each individual sub-value
(array element, struct field, or real/imaginary component),
in any order.
Similarly, a write of an array, struct, or complex number
may be implemented as a write of each individual sub-value,
in any order.
</p>

<p>

// This is usually orders of magnitude faster than actually sorting.
func (m metaCacheEntries) isSorted() bool {
	return sort.SliceIsSorted(m, m.less)
}

// shallowClone will create a shallow clone of the array objects,
// but object metadata will not be cloned.
func (m metaCacheEntries) shallowClone() metaCacheEntries {
	dst := make(metaCacheEntries, len(m))
	copy(dst, m)
	return dst
}

 * limitations under the License.
 */

package com.google.common.hash;

import static java.nio.charset.StandardCharsets.UTF_8;
import static java.util.Arrays.asList;
import static org.junit.Assert.assertThrows;

import com.google.common.collect.ImmutableList;
import com.google.common.collect.ImmutableSet;
import com.google.common.collect.ImmutableTable;

            // Mock that it exists and is a directory
            doReturn(true).when(smbFile).exists();
            doReturn(true).when(smbFile).isDirectory();

            // Mock listFiles to return empty array (directory is empty)
            doReturn(new SmbFile[0]).when(smbFile).listFiles();

            when(mockTreeHandle.isSMB2()).thenReturn(false);

        recordNameField.setAccessible(true);
        Name mockRecordName = new Name(mockConfig);
        recordNameField.set(nameQueryResponse, mockRecordName);

        // Prepare a byte array with valid NetBIOS name format
        byte[] src = new byte[100];
        int srcIndex = 0;

        // Start with compressed name pointer (0xC0) to use questionName
        src[srcIndex] = (byte) 0xC0;