verify(treeConnection).getTreeType();
        verify(treeConnection).getConnectedShare();
    }

    @Test
    @DisplayName("isSameTree: different types and delegated compare")
    void isSameTreeCoversBranches() {
        // Covers non-impl (false) and impl path delegating to connection comparison
        // Not an impl -> false
        assertFalse(handle.isSameTree(mock(SmbTreeHandle.class)));

		if err != nil {
			writeCustomErrorResponseJSON(ctx, w, errorCodes.ToAPIErr(ErrInternalError), err.Error(), r.URL)
			return
		}
		writeSuccessResponseJSON(w, resp)
		return
	}

	// 3. Compare generated key with decrypted key
	if subtle.ConstantTimeCompare(key.Plaintext, decryptedKey) != 1 {
		response.DecryptionErr = "The generated and the decrypted data key do not match"
		resp, err := json.Marshal(response)

		})
	})
}

func fileEntryCompare(x, y string) int {
	xdir, xelem, _ := split(x)
	ydir, yelem, _ := split(y)
	if xdir != ydir {
		return strings.Compare(xdir, ydir)
	}
	return strings.Compare(xelem, yelem)
}

// Open opens the named file in the ZIP archive,
// using the semantics of fs.FS.Open:
// paths are always slash separated, with no
// leading / or ../ elements.

			break
		}
		if p.arch.Family == sys.S390X {
			// 3-operand jumps.
			target = &a[2]
			prog.From = a[0]
			if a[1].Reg != 0 {
				// Compare two registers and jump.
				prog.Reg = p.getRegister(prog, op, &a[1])
			} else {
				// Compare register with immediate and jump.
				prog.AddRestSource(a[1])
			}
			break
		}
		if p.arch.Family == sys.ARM64 {
			// Special 3-operand jumps.

  @SuppressWarnings("InlineMeInliner")
  public void testCompare() {
    for (short x : VALUES) {
      for (short y : VALUES) {
        // Only compare the sign of the result of compare().
        int expected = Short.compare(x, y);
        int actual = Shorts.compare(x, y);
        if (expected == 0) {
          assertWithMessage("%s, %s", x, y).that(actual).isEqualTo(expected);
        } else if (expected < 0) {

<img src="/img/tutorial/path-params/image03.png">

### 파이썬 *열거형*으로 작업하기 { #working-with-python-enumerations }

*경로 매개변수*의 값은 *열거형 멤버*가 됩니다.

#### *열거형 멤버* 비교 { #compare-enumeration-members }

생성한 열거형 `ModelName`의 *열거형 멤버*와 비교할 수 있습니다:

{* ../../docs_src/path_params/tutorial005_py310.py hl[17] *}

#### *열거형 값* 가져오기 { #get-the-enumeration-value }

    return new NullFriendlyComparator<>();
  }

  private static final class NullFriendlyComparator<T> implements Comparator<T>, Serializable {
    @Override
    public int compare(T left, T right) {
      return String.valueOf(left).compareTo(String.valueOf(right));
    }
  }

   * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the
   * first permutation will be in ascending order, and the last will be in descending order.
   *
   * <p>Elements that compare equal are considered equal and no new permutations are created by
   * swapping them.
   *
   * <p>An empty iterable has only one permutation, which is an empty list.
   *

### 查看文档 { #check-the-docs }

API 文档会显示预定义路径参数的可用值：

<img src="/img/tutorial/path-params/image03.png">

### 使用 Python 枚举 { #working-with-python-enumerations }

路径参数的值是一个枚举成员。

#### 比较枚举成员 { #compare-enumeration-members }

可以将其与枚举类 `ModelName` 中的枚举成员进行比较：

{* ../../docs_src/path_params/tutorial005_py310.py hl[17] *}

#### 获取枚举值 { #get-the-enumeration-value }

  }

  /**
   * Returns an immutable list containing the given elements, sorted according to their natural
   * order. The sorting algorithm used is stable, so elements that compare as equal will stay in the
   * order in which they appear in the input.
   *
   * <p>If your data has no duplicates, or you wish to deduplicate elements, use {@code