String[] result = invokeDistinct(input);
        assertSame(input, result);
    }

    @Test
    public void test_distinct_singleElement() {
        // Test distinct with single element
        String[] input = new String[] { "element" };
        String[] result = invokeDistinct(input);
        assertSame(input, result);
    }

    @Test
    public void test_distinct_noDuplicates() {

## 대안 API 문서 { #alternative-api-docs }

또한 [http://192.168.99.100/redoc](http://192.168.99.100/redoc) 또는 [http://127.0.0.1/redoc](http://127.0.0.1/redoc)(또는 Docker 호스트를 사용해 동등하게 접근)로 이동할 수도 있습니다.

대안 자동 문서([ReDoc](https://github.com/Rebilly/ReDoc) 제공)를 볼 수 있습니다:

![ReDoc](https://fastapi.tiangolo.com/img/index/index-02-redoc-simple.png)

 * callbacks. Its subclasses must manage threads manually; consider {@link
 * AbstractExecutionThreadService} if you need only a single execution thread.
 *
 * @author Jesse Wilson
 * @author Luke Sandberg
 * @since 1.0
 */
@GwtIncompatible
@J2ktIncompatible
public abstract class AbstractService implements Service {
  private static final ListenerCallQueue.Event<Listener> STARTING_EVENT =

  }

  @GwtIncompatible // NavigableSet
  @LazyInit
  transient @Nullable ImmutableSortedSet<E> descendingSet;

  /**
   * @since 12.0
   */
  @GwtIncompatible // NavigableSet
  @Override
  public ImmutableSortedSet<E> descendingSet() {
    // racy single-check idiom
    ImmutableSortedSet<E> result = descendingSet;
    if (result == null) {
      result = descendingSet = createDescendingSet();

    - [Node binaries](#node-binaries-8)
  - [Changelog since v1.18.11](#changelog-since-v11811)
  - [Dependencies](#dependencies-8)
    - [Added](#added-8)
    - [Changed](#changed-8)
    - [Removed](#removed-8)
- [v1.18.11](#v11811)
  - [Downloads for v1.18.11](#downloads-for-v11811)
  - [Changelog since v1.18.10](#changelog-since-v11810)
  - [Changes by Kind](#changes-by-kind-8)

import java.util.Map;
import java.util.Objects;
import java.util.Set;
import org.jspecify.annotations.Nullable;

/**
 * A collection that associates an ordered pair of keys, called a row key and a column key, with a
 * single value. A table may be sparse, with only a small fraction of row key / column key pairs
 * possessing a corresponding value.
 *
 * <p>The mappings corresponding to a given row key may be viewed as a {@link Map} whose keys are

    - [Node Binaries](#node-binaries-2)
  - [Changelog since v1.7.13](#changelog-since-v1713)
    - [Other notable changes](#other-notable-changes-2)
- [v1.7.13](#v1713)
  - [Downloads for v1.7.13](#downloads-for-v1713)
    - [Client Binaries](#client-binaries-3)
    - [Server Binaries](#server-binaries-3)
    - [Node Binaries](#node-binaries-3)
  - [Changelog since v1.7.12](#changelog-since-v1712)

				crypto.MetaAlgorithm: crypto.InsecureSealAlgorithm,
				crypto.MetaMultipart: "1",
			}
			if !isMulti {
				delete(m, crypto.MetaMultipart)
			}
			return m
		}
	)

	// Single part object tests

	mkSPObj := func(s int64) ObjectInfo {
		return ObjectInfo{
			Size:        getEncSize(s),
			UserDefined: udMap(false),
		}
	}

	testSP := []struct {
		decSz int64

    for (int i = 0; i < originalCount; i++) {
      Object key = new Object();
      Object value = new Object();
      int hash = map.hash(key);
      // chain all entries together as we only have a single bucket
      entry = segment.newEntryForTesting(key, hash, entry);
      segment.setValueForTesting(entry, value);
    }
    segment.setTableEntryForTesting(0, entry);
    segment.count = originalCount;

    for (int i = 0; i < originalCount; i++) {
      Object key = new Object();
      Object value = new Object();
      int hash = map.hash(key);
      // chain all entries together as we only have a single bucket
      entry = segment.newEntryForTesting(key, hash, entry);
      segment.setValueForTesting(entry, value);
    }
    segment.setTableEntryForTesting(0, entry);
    segment.count = originalCount;