* {@link Ordering#leastOf(Iterator, int)}, which provides a simpler API for that use case.
   */
  public void offerAll(Iterator<? extends T> elements) {
    while (elements.hasNext()) {
      offer(elements.next());
    }
  }

  /**
   * Returns the top {@code k} elements offered to this {@code TopKSelector}, or all elements if
   * fewer than {@code k} have been offered, in the order specified by the factory used to create

            boolean lessSpecific = false;

            for (Iterator<Method> maximal = maximals.iterator(); !lessSpecific && maximal.hasNext(); ) {
                Method max = maximal.next();

                switch (moreSpecific(appArgs, max.getParameterTypes())) {
                    case MORE_SPECIFIC:
                        // This method is more specific than the previously

            assertEquals("0123456789", new String(buffer, 0, bytesRead, "UTF-8"));

            // Read next chunk
            bytesRead = in.read(buffer);
            assertEquals(10, bytesRead, "Should read next chunk");
            assertEquals("ABCDEFGHIJ", new String(buffer, 0, bytesRead, "UTF-8"));
        }
    }

    @Test

        // When: Get transport by name
        SmbTransportImpl result = poolSpy.getSmbTransport(ctx, "test.server", 445, false, false);

        // Then: Should use trans1 (addr2 failed, so tried addr1 next)
        assertSame(trans1, result);

        // Verify fail count incremented for addr2 (was 1, now 2)
        assertEquals(2, poolSpy.failCounts.get("10.0.0.2"));

	// as well as the initialization of bigBuf.
	runOnce(&bytes.Buffer{})
	b.ResetTimer()

	b.RunParallel(func(pb *testing.PB) {
		var buf bytes.Buffer
		for pb.Next() {
			runOnce(&buf)
		}
	})
}

func writeTestsToFS(tests []WriteTest) fs.FS {
	fsys := fstest.MapFS{}
	for _, wt := range tests {
		fsys[wt.Name] = &fstest.MapFile{
			Data: wt.Data,

pkg runtime, func CallersFrames([]uintptr) *Frames
pkg runtime, func KeepAlive(interface{})
pkg runtime, func SetCgoTraceback(int, unsafe.Pointer, unsafe.Pointer, unsafe.Pointer)
pkg runtime, method (*Frames) Next() (Frame, bool)
pkg runtime, type Frame struct
pkg runtime, type Frame struct, Entry uintptr
pkg runtime, type Frame struct, File string
pkg runtime, type Frame struct, Func *Func

$element.attr(SELECTOR_ARIA_ATTR)\n    const $body = $element.next(SELECTOR_EXPANDABLE_BODY).children().first().children()\n\n    $body.stop()\n    if ($type === 'true') {\n      $body.slideUp(time, () => {\n        $element.next(SELECTOR_EXPANDABLE_BODY).addClass('d-none')\n      })\n      $element.attr(SELECTOR_ARIA_ATTR, 'false')\n      $element.trigger($.Event(EVENT_COLLAPSED))\n    } else if ($type === 'false') {\n      $element.next(SELECTOR_EXPANDABLE_BODY).removeClass('d-none')\n      $body.slideDown(time)\n...

   */
  public void removeAllZeros() {
    Iterator<Entry<K, AtomicLong>> entryIterator = map.entrySet().iterator();
    while (entryIterator.hasNext()) {
      Entry<K, AtomicLong> entry = entryIterator.next();
      AtomicLong atomic = entry.getValue();
      if (atomic != null && atomic.get() == 0L) {
        entryIterator.remove();
      }
    }
  }

  /**
   * Returns the sum of all values in this map.

* Once there are at least 3 people that would be willing to commit to help maintain that language, you can continue the next steps.
* Create a new discussion following the template.
* Tag the other 2 people that will help with the language, and ask them to confirm there they will help.

But even if you never use **FastAPI**, you would benefit from learning a bit about them.

/// note

If you are a Python expert, and you already know everything about type hints, skip to the next chapter.

///

## Motivation { #motivation }

Let's start with a simple example:

{* ../../docs_src/python_types/tutorial001_py310.py *}

Calling this program outputs:

```
John Doe
```