public List<String> order(List<String> insertionOrder) {
                    List<String> order = new ArrayList<>();
                    for (String s : insertionOrder) {
                      int index = order.indexOf(s);
                      if (index == -1) {
                        order.add(s);
                      } else {
                        order.add(index, s);
                      }

 *
 * <p>
 * The factory maintains a map of keys to an array of {@link Extractor} objects.
 * When multiple extractors are associated with a single key, they are sorted by weight
 * in descending order. The {@link #getExtractor(String)} method returns a composite
 * extractor that iterates through the available extractors until one successfully
 * extracts the data.
 * </p>
 *
 * <p>

## Sign the CLA

                  protected Set<String> create(String[] elements) {
                    return new SafeTreeSet<>(asList(elements));
                  }

                  @Override
                  public List<String> order(List<String> insertionOrder) {
                    return new ArrayList<>(Sets.newTreeSet(insertionOrder));
                  }
                })
            .withFeatures(
                CollectionSize.ANY,

      },
      "queryId": {
        "type": "keyword"
      },
      "userSessionId": {
        "type": "keyword"
      },
      "url": {
        "type": "keyword"
      },
      "order": {
        "type": "integer"
      },
      "requestedAt": {
        "type": "date",
        "format": "date_optional_time"
      },
      "queryRequestedAt": {
        "type": "date",

  public boolean contains(@Nullable Object obj) {
    if (!(obj instanceof EndpointPair)) {
      return false;
    }
    EndpointPair<?> endpointPair = (EndpointPair<?>) obj;

    if (graph.isDirected() != endpointPair.isOrdered()) {
      return false;
    }

    if (graph.isDirected()) {
      Object source = endpointPair.source();
      Object target = endpointPair.target();

      assertEquals(ByteOrder.LITTLE_ENDIAN, bb.order());
      assertThat(bb.remaining()).isAtLeast(chunkSize);
      for (int i = 0; i < chunkSize; i++) {
        out.write(bb.get());
      }
    }

    @Override
    protected void processRemaining(ByteBuffer bb) {
      assertFalse(remainingCalled);
      remainingCalled = true;
      assertEquals(ByteOrder.LITTLE_ENDIAN, bb.order());

     */
    public LruHashSet(final int limitSize) {
        map = new LruHashMap<>(limitSize);
    }

    /**
     * Returns an iterator over the elements in this set. The elements are
     * returned in no particular order.
     *
     * @return an Iterator over the elements in this set.
     * @see ConcurrentModificationException
     */
    @Override
    public Iterator<E> iterator() {
        return map.keySet().iterator();
    }

    /**
     * Helper method to write integer in little-endian format.
     */
    private void writeLittleEndianInt(ByteArrayOutputStream baos, int value) {
        ByteBuffer buffer = ByteBuffer.allocate(4);
        buffer.order(ByteOrder.LITTLE_ENDIAN);
        buffer.putInt(value);
        baos.write(buffer.array(), 0, 4);
    }

    /**
     * Test constructor with KERB_CHECKSUM_HMAC_MD5 type.
     *

    "mappings" : {
      "click_log" : {
        "properties" : {
          "urlId" : {
            "type" : "keyword"
          },
          "docId" : {
            "type" : "keyword"
          },
          "order" : {
            "type" : "integer"
          },
          "queryId" : {
            "type" : "keyword"
          },
          "queryRequestedAt" : {
            "type" : "date",