// First entry size: 4 (nextOffset) + 4 (action) + 4 (nameLength) + nameBytes
        int entry1Size = 12 + fileNameBytes1.length;
        int entry1AlignedSize = ((entry1Size + 3) / 4) * 4; // Align to 4 bytes

        int entry2Size = 12 + fileNameBytes2.length;
        int entry2AlignedSize = ((entry2Size + 3) / 4) * 4; // Align to 4 bytes

        // First notification

      @Override
      <E extends @Nullable Object> int resultIndex(
          Comparator<? super E> comparator,
          @ParametricNullness E key,
          List<? extends E> list,
          int foundIndex) {
        // Of course, we have to use binary search to find the precise
        // breakpoint...
        int lower = foundIndex;
        int upper = list.size() - 1;

Par exemple, vous pourriez déclarer que quelque chose peut être un `str` ou `None` :

```python
from typing import Union


def say_hi(name: Union[str, None]):
        print(f"Hi {name}!")
```

`typing` propose également un raccourci pour déclarer que quelque chose peut être `None`, avec `Optional`.

Voici un conseil issu de mon point de vue très subjectif :

/**
 * A mutable value of type {@code int}, for multisets to use in tracking counts of values.
 *
 * @author Louis Wasserman
 */
@GwtCompatible
final class Count implements Serializable {
  private int value;

  Count(int value) {
    this.value = value;
  }

  public int get() {
    return value;
  }

  public void add(int delta) {
    value += delta;
  }

   * A sensible definition of {@link #setCount(Object, int, int)} in terms of {@link #count(Object)}
   * and {@link #setCount(Object, int)}. If you override either of these methods, you may wish to
   * override {@link #setCount(Object, int, int)} to forward to this implementation.
   *
   * @since 7.0
   */
  protected boolean standardSetCount(@ParametricNullness E element, int oldCount, int newCount) {

@NullUnmarked
public class IntMathBenchmark {
  private static final int[] exponent = new int[ARRAY_SIZE];
  private static final int[] factorial = new int[ARRAY_SIZE];
  private static final int[] binomial = new int[ARRAY_SIZE];
  private static final int[] positive = new int[ARRAY_SIZE];
  private static final int[] nonnegative = new int[ARRAY_SIZE];
  private static final int[] ints = new int[ARRAY_SIZE];

  @BeforeExperiment
  void setUp() {

    /**
     * Directory lease flag for recursive caching
     */
    public static final int DIRECTORY_LEASE_FLAG_RECURSIVE = 0x00000001;

    /**
     * Directory lease flag for enabling notifications
     */
    public static final int DIRECTORY_LEASE_FLAG_NOTIFICATIONS = 0x00000002;

    private Smb2LeaseKey leaseKey;
    private int leaseState;
    private DirectoryCacheScope cacheScope;
    private long maxCacheAge;

            return 0;
        }

        @Override
        int readParametersWireFormat(byte[] buffer, int bufferIndex, int len) {
            return 0;
        }

        @Override
        int readDataWireFormat(byte[] buffer, int bufferIndex, int len) {
            return 0;
        }

        // Helper methods to access private fields using reflection

      @Override
      public int compare(byte[] left, byte[] right) {
        // If theUnsafe weren't available, we wouldn't have selected this Comparator implementation.
        Unsafe theUnsafe = requireNonNull(UnsafeComparator.theUnsafe);

        int stride = 8;
        int minLength = Math.min(left.length, right.length);
        int strideLimit = minLength & ~(stride - 1);
        int i;

        /*

<<breaking-changes>>.
endif::[]
<% if (priorVersions.size() > 0) { %>
// Add previous release to the list
Other versions:

<%
print priorVersions.join("\n| ")
print "\n"
}

if (notableHighlights.empty == false) { %>
// tag::notable-highlights[]
<% for (highlight in notableHighlights) { %>
[discrete]
[[${ highlight.anchor }]]
=== ${highlight.title}