if (!elements.hasNext()) {
      return of();
    }
    E first = elements.next();
    if (!elements.hasNext()) {
      return of(first);
    }

    Set<E> delegate = Sets.newLinkedHashSet();
    delegate.add(checkNotNull(first));
    do {
      delegate.add(checkNotNull(elements.next()));
    } while (elements.hasNext());

     */
    <T> T process(T object);

    /**
     * Process a model object using the first available processor implementation.
     *
     * <p>This method discovers processor implementations via ServiceLoader and
     * uses the first one found. If no implementations are available, the object
     * is returned unchanged. The processor is cached for performance.</p>
     *

But then you have to call "that method that converts the first letter to upper case".

Was it `upper`? Was it `uppercase`? `first_uppercase`? `capitalize`?

Then, you try with the old programmer's friend, editor autocompletion.

You type the first parameter of the function, `first_name`, then a dot (`.`) and then hit `Ctrl+Space` to trigger the completion.

        byte[] firstData = "First data set".getBytes();
        byte[] secondData = "Second data set".getBytes();
        byte[] buffer1 = new byte[100];
        byte[] buffer2 = new byte[100];

        System.arraycopy(firstData, 0, buffer1, 0, firstData.length);
        System.arraycopy(secondData, 0, buffer2, 0, secondData.length);

        // First read

        assertEquals("pre-generated-id-123", jobLog.getId());
    }

    @Test
    public void test_setId_overwriteExisting() {
        final JobLog jobLog = new JobLog();
        jobLog.setId("first-id");
        assertEquals("first-id", jobLog.getId());

        jobLog.setId("second-id");
        assertEquals("second-id", jobLog.getId());
    }

    @Test
    public void test_setId_withUuidFormat() {

  int sortedSet(int reps) {
    int dummy = 0;
    if (mutable) {
      for (int i = 0; i < reps; i++) {
        dummy += new TreeSet<Integer>(input).first();
      }
    } else {
      for (int i = 0; i < reps; i++) {
        dummy += ImmutableSortedSet.copyOf(input).first();
      }
    }
    return dummy;
  }

  private static final Ordering<Integer> ORDERING = Ordering.natural();

  public void testElement_size1() {
    assertEquals("size1Queue.element() should return first element", e0(), getQueue().element());
    expectUnchanged();
  }

  @CollectionFeature.Require(KNOWN_ORDER)
  @CollectionSize.Require(SEVERAL)
  public void testElement_sizeMany() {
    assertEquals("sizeManyQueue.element() should return first element", e0(), getQueue().element());
    expectUnchanged();
  }

            deleteMethod("/api/admin/fileconfig/setting/" + fId);
        }

        deleteTestToken();
    }

    @Test
    public void testGetFavorites_ok() {
        // First, do a search to get a queryId
        Map<String, String> searchParams = new HashMap<>();
        searchParams.put("q", "*");

        assertDoesNotThrow(() -> filter.destroy());
    }

    @Test
    void testDoFilter_noAuthorizationHeader_shouldChallengeClient() throws Exception {
        // Initialize filter first
        initializeFilter();

        // Test request without Authorization header should challenge client
        when(request.getHeader("Authorization")).thenReturn(null);

      j--;
    }
  }

  /** Returns {@code true} if the second list is a permutation of the first. */
  private static boolean isPermutation(List<?> first, List<?> second) {
    if (first.size() != second.size()) {
      return false;
    }
    Multiset<?> firstMultiset = HashMultiset.create(first);
    Multiset<?> secondMultiset = HashMultiset.create(second);
    return firstMultiset.equals(secondMultiset);
  }