.createRemote(Repository.newBuilder()
                        .id("apache-snapshots")
                        .url("https://repository.apache.org/content/repositories/snapshots/")
                        .releases(RepositoryPolicy.newBuilder().enabled("false").build())
                        .snapshots(RepositoryPolicy.newBuilder().enabled("true").build())
                        .build());

                    LOGGER.warn(
                            "File '{}' is more recent than the packaged artifact for '{}', "
                                    + "please run a full `mvn package` build",
                            relativizeOutputFile(outputFile),
                            project.getArtifactId());
                    return false;

 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
 Everyone is permitted to copy and distribute verbatim copies
 of this license document, but changing it is not allowed.

(This is the first released version of the Lesser GPL.  It also counts
 as the successor of the GNU Library Public License, version 2, hence
 the version number 2.1.)

                            Preamble

## Traefik を使ったローカル検証 { #testing-locally-with-traefik }

[Traefik](https://docs.traefik.io/) を使えば、パスプレフィックスを削除する構成をローカルで簡単に試せます。

[Traefik をダウンロード](https://github.com/containous/traefik/releases) してください。単一バイナリなので、圧縮ファイルを展開して端末から直接実行できます。

次の内容で `traefik.toml` というファイルを作成します:

```TOML hl_lines="3"
[entryPoints]
  [entryPoints.http]
    address = ":9999"

[providers]
  [providers.file]

  private MinMaxPriorityQueue(Builder<? super E> builder, int queueSize) {
    Ordering<E> ordering = builder.ordering();
    this.minHeap = new Heap(ordering);
    this.maxHeap = new Heap(ordering.reverse());
    minHeap.otherHeap = maxHeap;
    maxHeap.otherHeap = minHeap;

    this.maximumSize = builder.maximumSize;
    // TODO(kevinb): pad?
    this.queue = new Object[queueSize];
  }

  @Override

the number of items in the channel corresponds to the number of active uses,
the capacity of the channel corresponds to the maximum number of simultaneous uses,
sending an item acquires the semaphore, and receiving an item releases
the semaphore.
This is a common idiom for limiting concurrency.
</p>

<p>
This program starts a goroutine for every entry in the work list, but the

pkg syscall (linux-arm-cgo), type Utsname struct, Machine [65]uint8
pkg syscall (linux-arm-cgo), type Utsname struct, Nodename [65]uint8
pkg syscall (linux-arm-cgo), type Utsname struct, Release [65]uint8
pkg syscall (linux-arm-cgo), type Utsname struct, Sysname [65]uint8
pkg syscall (linux-arm-cgo), type Utsname struct, Version [65]uint8
pkg syscall (linux-arm-cgo), type WaitStatus uint32

          IllegalAccessException,
          InvocationTargetException,
          FactoryMethodReturnsNullException {
    if (cls.isEnum()) {
      return;
    }
    List<? extends Invokable<?, ?>> factories = Lists.reverse(getFactories(TypeToken.of(cls)));
    if (factories.isEmpty()) {
      return;
    }
    int numberOfParameters = factories.get(0).getParameters().size();

    assertThat(newFirst.getValue()).isEqualTo(valueThree);
    assertEquals(hashThree, newFirst.getHash());
    assertThat(newFirst.getNext()).isEqualTo(entryOne);

    // tail (remaining entries are copied in reverse order)
    newFirst = segment.removeFromChainForTesting(entryThree, entryOne);
    assertThat(newFirst.getKey()).isEqualTo(keyTwo);
    assertThat(newFirst.getValue()).isEqualTo(valueTwo);

    assertThat(newFirst.getValue()).isEqualTo(valueThree);
    assertEquals(hashThree, newFirst.getHash());
    assertThat(newFirst.getNext()).isEqualTo(entryOne);

    // tail (remaining entries are copied in reverse order)
    newFirst = segment.removeFromChainForTesting(entryThree, entryOne);
    assertThat(newFirst.getKey()).isEqualTo(keyTwo);
    assertThat(newFirst.getValue()).isEqualTo(valueTwo);