// Package bufio implements buffered I/O. It wraps an io.Reader or io.Writer
// object, creating another object (Reader or Writer) that also implements
// the interface but provides buffering and some help for textual I/O.
package bufio

import (
	"bytes"
	"errors"
	"io"
	"strings"
	"unicode/utf8"
)

const (
	defaultBufSize = 4096
)

var (

has a complete list of false witnesses for 65 = 0x41 and # 85 = 0x55. # Some b^(m*2^j) = w-1 Result = PossiblyPrime W = 41 B = 8 # Some b^(m*2^j) = w-1 Result = PossiblyPrime W = 41 B = 12 # Some b^(m*2^j) = w-1 Result = PossiblyPrime W = 41 B = 2f # Some b^(m*2^j) = w-1 Result = PossiblyPrime W = 41 B = 39 # Some b^(m*2^j) = w-1 Result = PossiblyPrime W = 55 B = d # Some b^(m*2^j) = w-1 Result = PossiblyPrime W = 55 B = 26 # Some b^(m*2^j) = w-1 Result = PossiblyPrime W = 55 B = 2f # Some b^(m*2^j)...

公式サイトで以下のように言われているのは、それが理由です。

> Requestsは今までで最もダウンロードされたPythonパッケージである

使い方はとても簡単です。例えば、`GET`リクエストを実行するには、このように書けば良いです:

```Python
response = requests.get("http://example.com/some/url")
```

対応するFastAPIのパスオペレーションはこのようになります:

```Python hl_lines="1"
@app.get("/some/url")
def read_url():
    return {"message": "Hello World"}
```

 `requests.get(...)` と`@app.get(...)` には類似点が見受けられます。

/// check | **FastAPI**へ与えたインスピレーション

		}
		return metrics
	}

	for id, job := range m.metrics {
		metrics.Jobs[id] = job.metric()
	}
	return metrics
}

// keep job metrics for some time after the job is completed
// in-case some one wants to look at the older results.
func (m *batchJobMetrics) purgeJobMetrics() {
	t := time.NewTicker(6 * time.Hour)
	defer t.Stop()

	for {
		select {

  returns `nil`. (It now returns a pointer to a zero-valued object, like the real
  clients do.) This will break some downstream unit tests that were testing
  `result == nil` rather than `err != nil`, and in some cases may expose bugs

 * weak references.
 *
 * <p><strong>Performance</strong>
 *
 * <p>The extra bookkeeping done by cycle detecting locks comes at some cost to performance.
 * Benchmarks (as of December 2011) show that:
 *
 * <ul>
 *   <li>for an unnested {@code lock()} and {@code unlock()}, a cycle detecting lock takes 38ns as

    * try to only update vm if detach a non-existing disk when got <200, error> after detach disk operation
* This adds some useful metrics around pending changes and last successful ([#78602](https://github.com/kubernetes/kubernetes/pull/78602), [@paulgmiller](https://github.com/paulgmiller))
    * sync time.
 

   * expect, but there are some subtleties. First, we do guarantee that, if the output future at
   * index n is done, the output future at index n-1 is also done. (But as usual with futures, some
   * listeners for future n may complete before some for future n-1.) However, it is possible, if
   * one input completes with result X and another later with result Y, for Y to come before X in

- Some command line errors (for example, "kubectl list" -> "unknown command") were printed as log message with escaped line breaks instead of a multi-line plain text, which made the error harder to read. ([#107044](https://github.com/kubernetes/kubernetes/pull/107044), [@pohly](https://github.com/pohly)) [SIG CLI and Testing]

    assertThat(index).isNotEqualTo(0);

    // Above our method should be the call to get(). Don't assert on the class
    // because it could be some superclass.
    assertThat(e.getStackTrace()[index - 1].getMethodName()).isEqualTo("get");
  }

  private static int findStackFrame(ExecutionException e, String clazz, String method) {