* a {@code Map<R, Map<C, V>>}. A method call like {@code column(columnKey).get(rowKey)} still runs
 * quickly, since the row key is provided. However, {@code column(columnKey).size()} takes longer,
 * since an iteration across all row keys occurs.
 *
 * <p>Because a {@code TreeBasedTable} has unique sorted values for a given row, both {@code

	case string:
		return json.Unmarshal([]byte(value), l)
	case []byte:
		return json.Unmarshal(value, l)
	default:
		return errors.New("not supported")
	}
}

type Role struct {
	Name string `gorm:"size:256"`
}

func (role *Role) Scan(value interface{}) error {
	if b, ok := value.([]uint8); ok {
		role.Name = string(b)
	} else {
		role.Name = value.(string)
	}
	return nil
}

    assertThat(stats.evictionCount()).isEqualTo(removalListener.size());
    assertThat(stats.loadSuccessCount()).isEqualTo(computeCount.get());
    assertThat(stats.loadExceptionCount()).isEqualTo(exceptionCount.get() + computeNullCount.get());
    // each computed value is still in the cache, or was passed to the removal listener
    assertThat(cache.size() + removalListener.size()).isEqualTo(computeCount.get());
  }

  @J2ktIncompatible

    assertThat(stats.evictionCount()).isEqualTo(removalListener.size());
    assertThat(stats.loadSuccessCount()).isEqualTo(computeCount.get());
    assertThat(stats.loadExceptionCount()).isEqualTo(exceptionCount.get() + computeNullCount.get());
    // each computed value is still in the cache, or was passed to the removal listener
    assertThat(cache.size() + removalListener.size()).isEqualTo(computeCount.get());
  }

  @J2ktIncompatible

	u, ok := globalIAMSys.GetUser(r.Context(), r.Form.Get(peerRESTAccessKey))
	if !ok {
		s.writeErrorResponse(w, errAuthentication)
		return
	}

	size, err := strconv.Atoi(sizeStr)
	if err != nil {
		size = 64 * humanize.MiByte
	}

	concurrent, err := strconv.Atoi(concurrentStr)
	if err != nil {
		concurrent = 32
	}

	duration, err := time.ParseDuration(durationStr)

      @SuppressWarnings("unchecked") // we're careful to put only E's in here
      E[] contentsArray = (E[]) contents;
      ImmutableSortedSet<E> result = construct(comparator, size, contentsArray);
      this.size = result.size(); // we eliminated duplicates in-place in contentsArray
      this.forceCopy = true;
      return result;
    }
  }

  int unsafeCompare(Object a, @Nullable Object b) {

constraints.NotNull.message = {item} is required.
constraints.Null.message = {item} must be null.
constraints.Past.message = {item} must be a past value.
constraints.Pattern.message = {item} does not match "{regexp}".
constraints.Size.message = The size of {item} must be between {min} and {max}.
# ----------------------------------------------------------
# Hibernate Validator
# -------------------

constraints.NotNull.message = {item} is required.
constraints.Null.message = {item} must be null.
constraints.Past.message = {item} must be a past value.
constraints.Pattern.message = {item} does not match "{regexp}".
constraints.Size.message = The size of {item} must be between {min} and {max}.
# ----------------------------------------------------------
# Hibernate Validator
# -------------------

				}
			}

			if !isSameType {
				alterColumn = true
			}
		}
	}

	if !isSameType {
		// check size
		if length, ok := columnType.Length(); length != int64(field.Size) {
			if length > 0 && field.Size > 0 {
				alterColumn = true
			} else {
				// has size in data type and not equal
				// Since the following code is frequently called in the for loop, reg optimization is needed here

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

/**
 * An {@link OutputStream} that starts buffering to a byte array, but switches to file buffering
 * once the data reaches a configurable size.
 *
 * <p>When this stream creates a temporary file, it restricts the file's permissions to the current
 * user or, in the case of Android, the current app. If that is not possible (as is the case under