* under the License.
 */
package org.apache.maven.artifact.versioning;

/**
 * Describes an artifact version in terms of its components, converts it to/from a string and
 * compares two versions.
 *
 */
public interface ArtifactVersion extends Comparable<ArtifactVersion> {
    int getMajorVersion();

    int getMinorVersion();

    int getIncrementalVersion();

    int getBuildNumber();

   * exists. The resulting range may be empty if the two ranges are adjacent but non-overlapping.
   *
   * <p>For example, the gap of {@code [1..5]} and {@code (7..10)} is {@code (5..7]}. The resulting
   * range may be empty; for example, the gap between {@code [1..5)} {@code [5..7)} yields the empty
   * range {@code [5..5)}.
   *
   * <p>The gap exists if and only if the two ranges are either disconnected or immediately adjacent

     * Return the IP address of this address as a 32 bit integer.
     */

    @Override
    public int hashCode() {
        return this.addr.hashCode();
    }

    /**
     * Compare two addresses for equality. Two <code>UniAddress</code>s are equal
     * if they are both <code>UniAddress</code>' and refer to the same IP address.
     */
    @Override
    public boolean equals(final Object obj) {

# Header 1 { #header-1 }

Some text with a link to [FastAPI](https://fastapi.tiangolo.com).

## Header 2 { #header-2 }

Two links here: [How to](https://fastapi.tiangolo.com/how-to/) and [Project Generators](project-generation.md){.internal-link target=_blank}.

### Header 3 { #header-3 }

Another link: [**FastAPI** Project Generators](project-generation.md "Link title"){.internal-link target=_blank} with title.

# Header 4 { #header-4 }

        assertTrue(s1.contains("0102"), "Expected hex fileId in string");

        SmbFileHandleImpl h2 = new SmbFileHandleImpl(cfg, 77, tree, "//u/two", -1, -2, -3, -4, 0L);
        String s2 = h2.toString();
        assertTrue(s2.contains("//u/two"));
        assertTrue(s2.contains("77"), "Expected numeric fid in string");
    }

    static Stream<Arguments> equalsHashParams() {
        return Stream.of(

        when(tree.getConfig()).thenReturn(config);
        when(config.getMaximumBufferSize()).thenReturn(65535);
        when(config.getListSize()).thenReturn(65535);

        // Arrange: initial page with two entries, then one more entry, then no more files
        FileEntry fe1 = mock(FileEntry.class);
        lenient().when(fe1.getName()).thenReturn("file1");
        lenient().when(fe1.getFileIndex()).thenReturn(1);

    }
  }

  /**
   * A value class representing single connection between the origin node and another node.
   *
   * <p>There can be two types of connections (predecessor and successor), which is represented by
   * the two implementations.
   */
  private abstract static class NodeConnection<N> {
    final N node;

    NodeConnection(N node) {
      this.node = checkNotNull(node);
    }

Since **Pydantic v2** was released, the generated OpenAPI is a bit more exact and **correct** than before. 😎

In fact, in some cases, it will even have **two JSON Schemas** in OpenAPI for the same Pydantic model, for input and output, depending on if they have **default values**.

Let's see how that works and how to change it if you need to do that.

// Copyright 2009 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

//go:build ignore

// Compute Fibonacci numbers with two goroutines
// that pass integers back and forth.  No actual
// concurrency, just threads and synchronization
// and foreign code on multiple pthreads.

package main

import (
	big "."
	"runtime"
)

     */
    int getCount();

    /**
     * {@inheritDoc}
     *
     * <p>Returns {@code true} if the given object is also a multiset entry and the two entries
     * represent the same element and count. That is, two entries {@code a} and {@code b} are equal
     * if:
     *
     * {@snippet :
     * Objects.equals(a.getElement(), b.getElement()) && a.getCount() == b.getCount()
     * }
     */