If you declare a `response_class=StreamingResponse` in your *path operation function*, you can use `yield` to send each chunk of data in turn.

{* ../../docs_src/stream_data/tutorial001_py310.py ln[1:23] hl[20,23] *}

FastAPI will give each chunk of data to the `StreamingResponse` as is, it won't try to convert it to JSON or anything similar.

### Non-async *path operation functions* { #non-async-path-operation-functions }

    - 🔍 [Pydantic](https://docs.pydantic.dev), usado pelo FastAPI, para validação de dados e gerenciamento de configurações.
    - 💾 [PostgreSQL](https://www.postgresql.org) como banco de dados SQL.
- 🚀 [React](https://react.dev) para o frontend.
    - 💃 Usando TypeScript, hooks, Vite, e outras partes de uma _stack_ frontend moderna.
    - 🎨 [Tailwind CSS](https://tailwindcss.com) e [shadcn/ui](https://ui.shadcn.com) para os componentes de frontend.

        assertTrue(result);
        assertEquals("4 indices × 2 creates each (backup + rebuild)", 8, testClient.createdIndices.size());
        assertEquals("4 indices × 2 reindexes each (to backup + from backup)", 8, testClient.reindexPairs.size());
        assertEquals("4 indices × 2 deletes each (old + backup)", 8, testClient.deletedIndices.size());
    }

    @Test

  - 🔍 [Pydantic](https://docs.pydantic.dev), utilisé par FastAPI, pour la validation des données et la gestion des paramètres.
  - 💾 [PostgreSQL](https://www.postgresql.org) comme base de données SQL.
- 🚀 [React](https://react.dev) pour le frontend.
  - 💃 Utilisation de TypeScript, des hooks, de Vite et d'autres éléments d'un stack frontend moderne.

   *
   * <p>When all subscribers are dispatched to using a <i>direct</i> executor (which dispatches on
   * the same thread that posts the event), this yields a breadth-first dispatch order on each
   * thread. That is, all subscribers to a single event A will be called before any subscribers to
   * any events B and C that are posted to the event bus by the subscribers to A.
   */

/// tip

The important and "magic" thing here is that `get_current_user` will have a different list of `scopes` to check for each *path operation*.

All depending on the `scopes` declared in each *path operation* and each dependency in the dependency tree for that specific *path operation*.

///

## More details about `SecurityScopes` { #more-details-about-securityscopes }

			Type:        "number",
		},
		config.HelpKV{
			Key:         RetryInterval,
			Description: `sleep between each retries, allowed maximum value is '1m' e.g. '10s'`,
			Optional:    true,
			Type:        "duration",
		},
		config.HelpKV{
			Key:         httpTimeout,
			Description: `defines the maximum duration for each http request`,
			Optional:    true,
			Type:        "duration",
		},
		config.HelpKV{

!0;var g=a(this).closest("form");c&&d(g,this,h)?e(g,"enabled"):e(g,"disabled"),f=!1}}).on("afterValidation",k).on("blur",function(){a(this).valAttr("have-been-blurred",1)}).each(function(){var b=a(this),c=b.attr("data-validation");c.indexOf("checkbox_group")>-1&&b.closest("form").find('input[name="'+b.attr("name")+'"]').each(function(){a(this).on("change",function(){b.validate()})})}),i.find("[data-validation-async]").valAttr("event","change"),e(i,"disabled"),i.validateOnEvent(h.language,h)}).on...

   * value, you should always choose it explicitly.
   *
   * <p>The current implementation uses the concurrency level to create a fixed number of hashtable
   * segments, each governed by its own write lock. The segment lock is taken once for each explicit
   * write, and twice for each cache loading computation (once prior to loading the new value, and
   * once after loading completes). Much internal cache management is performed at the segment

### EventListener.Factory

In the preceding example we used a field, `callStartNanos`, to track the elapsed time of each event. This is handy, but it won’t work if multiple calls are executing concurrently. To accommodate this, use a `Factory` to create a new `EventListener` instance for each `Call`. This allows each listener to keep call-specific state.