}

		for i := 0; i < reflectValue.Len(); i++ {
			appendToRelations(reflectValue.Index(i), reflect.Indirect(reflect.ValueOf(values[i])), clear)
			if association.Error != nil {
				return
			}

			// TODO support save slice data, sql with case?
			association.Error = associationDB.Updates(reflectValue.Index(i).Addr().Interface()).Error
		}
	case reflect.Struct:
		// clear old data
		if clear && len(values) == 0 {

     * @return formatted file size string (e.g., "1.5M", "2.3G", "512K")
     */
    public static String formatFileSize(final long value) {
        double target = value;
        String unit = ""; // TODO l10n?
        String format = "0.#";
        if (value < 1024) {
            format = "0";
        } else if (value < 1024L * 1024L) {
            target /= 1024;
            unit = "K";

<aside class="main-sidebar sidebar-dark-primary">
	<la:link href="/admin/" styleClass="brand-link text-center">
		<span class="brand-text">
		<c:if test="${empty param.brandName or empty param.logoPath}"><img src="${fe:url('/images/logo-head.png')}" alt="<la:message key="labels.header_brand_name" />" /></c:if
		><c:if test="${not empty param.brandName and not empty param.logoPath}"><img src="${fe:url(param.logoPath)}" alt="${f:h(param.brandName)}" /></c:if>
		</span>

 *
 * @author Dimitris Andreou
 * @author Jon Noack
 */
@GwtIncompatible // not worth using in GWT for now
class CompactHashSet<E extends @Nullable Object> extends AbstractSet<E> implements Serializable {
  // TODO(user): cache all field accesses in local vars

  /** Creates an empty {@code CompactHashSet} instance. */
  public static <E extends @Nullable Object> CompactHashSet<E> create() {
    return new CompactHashSet<>();
  }

        if (lowerBounds.length == 0) { // ? extends something changes to capture-of
          return captureAsTypeVariable(wildcardType.getUpperBounds());
        } else {
          // TODO(benyu): handle ? super T somehow.
          return type;
        }
      }
      throw new AssertionError("must have been one of the known types");
    }

 * Collection} and {@link Iterator} interfaces.
 *
 * @author Doug Lea
 * @author Justin T. Sampson
 * @param <E> the type of elements held in this collection
 */
// TODO(kak): consider removing some of the @CanIgnoreReturnValue annotations as appropriate
@NullUnmarked
@GwtIncompatible
@J2ktIncompatible
public class MonitorBasedArrayBlockingQueue<E> extends AbstractQueue<E>

    if (oldNodeForKey != null) {
      replaceNodeForKey(oldNodeForKey, newNode);
    } else {
      insertPlacingAtEndOfIterationOrder(newNode);
    }

    // TODO(cpovirk): Don't perform rehash check if we replaced an existing entry (as in `put`)?
    rehashIfNecessary();
    return keyOrNull(oldNodeForValue);
  }

  private void rehashIfNecessary() {

   * @since 14.0
   */
  public static class Builder<C extends Comparable<?>> {
    private final List<Range<C>> ranges;

    public Builder() {
      this.ranges = new ArrayList<>();
    }

    // TODO(lowasser): consider adding union, in addition to add, that does allow overlap

    /**
     * Add the specified range to this builder. Adjacent ranges are permitted and will be merged,

    }

    @Test
    @DisplayName("Test buffer overflow protection")
    void testBufferOverflowProtection() {
        byte[] smallBuffer = new byte[23]; // One byte too small

        // Should throw ArrayIndexOutOfBoundsException
        assertThrows(ArrayIndexOutOfBoundsException.class, () -> {
            request.writeBytesWireFormat(smallBuffer, 0);
        });
    }

				if v, ok := columnType.Unique(); !sqlserver && (!ok || !v) {
					t.Fatalf("column code2 unique should be correct, name: %v, column: %#v", columnType.Name(),
						columnType)
				}
			case "code3":
				// TODO
				// if v, ok := columnType.Unique(); !ok || v {
				// 	t.Fatalf("column code unique should be correct, name: %v, column: %#v", columnType.Name(), columnType)
				// }
			}
		}
	}