switch len(parts) {
		default:
			t.Errorf("%s:%d: unable to understand comments: %s", input, lineno, line)
		case 1:
			// no comment
		case 2:
			// might be printed form or hex
			note := strings.TrimSpace(parts[1])
			if isHexes(note) {
				hexes = note
			} else {
				printed = note
			}
		case 3:
			// printed form, then hex
			printed = strings.TrimSpace(parts[1])
			hexes = strings.TrimSpace(parts[2])

	AssertEqual(t, u2.Mobile, "133xxxx")
}

func TestCreateFromMapWithoutPK(t *testing.T) {
	if !isMysql() {
		t.Skipf("This test case skipped, because of only supporting for mysql")
	}

	// case 1: one record, create from map[string]interface{}
	mapValue1 := map[string]interface{}{"name": "create_from_map_with_schema1", "age": 1}

        AllocInfo inf;
        switch (this.informationLevel) {
        case FileSystemInformation.SMB_INFO_ALLOCATION:
            inf = new SmbInfoAllocation();
            break;
        case FileSystemInformation.FS_SIZE_INFO:
            inf = new FileFsSizeInformation();
            break;
        case FileSystemInformation.FS_FULL_SIZE_INFO:
            inf = new FileFsFullSizeInformation();

  /**
   * Add {@code node} as a predecessor to the origin node. In the case of an undirected graph, it
   * also becomes a successor. Associates {@code value} with the edge connecting the two nodes.
   */
  void addPredecessor(N node, V value);

  /**
   * Add {@code node} as a successor to the origin node. In the case of an undirected graph, it also

        switch (action) {
        case FILE_ACTION_ADDED:
            return DirectoryChangeType.FILE_ADDED;
        case FILE_ACTION_REMOVED:
            return DirectoryChangeType.FILE_REMOVED;
        case FILE_ACTION_MODIFIED:
            return DirectoryChangeType.FILE_MODIFIED;
        case FILE_ACTION_RENAMED_OLD_NAME:
        case FILE_ACTION_RENAMED_NEW_NAME:

    }

    /**
     * Returns whether two strings are equal ignoring case. If both are null, returns <code>true</code>.
     *
     * @param target1
     *            the first string
     * @param target2
     *            the second string
     * @return {@literal true} if the strings are equal ignoring case
     */
    public static boolean equalsIgnoreCase(final String target1, final String target2) {

  }

  static <N, V> UndirectedGraphConnections<N, V> of(ElementOrder<N> incidentEdgeOrder) {
    switch (incidentEdgeOrder.type()) {
      case UNORDERED:
        return new UndirectedGraphConnections<>(
            new HashMap<N, V>(INNER_CAPACITY, INNER_LOAD_FACTOR));
      case STABLE:
        return new UndirectedGraphConnections<>(
            new LinkedHashMap<N, V>(INNER_CAPACITY, INNER_LOAD_FACTOR));
      default:

     * <p>
     * If either or both arrays are {@literal null}, the other array is returned as is.
     * If either or both arrays have a length of {@literal 0}, the other array is returned as is.
     * In any case, the returned array is the same instance as the argument array and is not copied.
     * </p>
     *
     * @param <T>
     *            the type of the array elements
     * @param a
     *            first array

In that case, they will be applied to all the *path operations* in the application:

{* ../../docs_src/dependencies/tutorial012_an_py39.py hl[16] *}


And all the ideas in the section about [adding `dependencies` to the *path operation decorators*](dependencies-in-path-operation-decorators.md){.internal-link target=_blank} still apply, but in this case, to all of the *path operations* in the app.

     */
    public static Class<?> getRawClass(final Type type) {
        return switch (type) {
        case Class<?> clazz -> clazz;
        case ParameterizedType paramType -> getRawClass(paramType.getRawType());
        case WildcardType wildcard -> getRawClass(wildcard.getUpperBounds()[0]);
        case GenericArrayType arrayType -> {
            Class<?> rawClass = getRawClass(arrayType.getGenericComponentType());