Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 571 - 580 of 1,292 for title (0.03 seconds)

  1. docs/zh/docs/advanced/path-operation-advanced-configuration.md

    如果你查看最终生成的 OpenAPI(在你的 API 的 `/openapi.json`),你也会看到你的扩展作为该 *路径操作* 的一部分:
    
    ```JSON hl_lines="22"
    {
        "openapi": "3.1.0",
        "info": {
            "title": "FastAPI",
            "version": "0.1.0"
        },
        "paths": {
            "/items/": {
                "get": {
                    "summary": "Read Items",
                    "operationId": "read_items_items__get",
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Mar 20 17:06:37 GMT 2026
    - 6.7K bytes
    - Click Count (0)
  2. docs/en/docs/advanced/dataclasses.md

        In this case, it's a list of `Item` dataclasses.
    
    6. Here we are returning a dictionary that contains `items` which is a list of dataclasses.
    
        FastAPI is still capable of <dfn title="converting the data to a format that can be transmitted">serializing</dfn> the data to JSON.
    
    7. Here the `response_model` is using a type annotation of a list of `Author` dataclasses.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 4K bytes
    - Click Count (0)
  3. docs/zh-hant/docs/async.md

    接下來,它 🤖 完成第一個工作(例如我們的「慢速檔案」📝)並繼續執行相關的所有操作。
    這個「等待其他事情」通常指的是一些相對較慢的(與處理器和 RAM 記憶體的速度相比)的 <abbr title="Input and Output - 輸入與輸出">I/O</abbr> 操作,比如說:
    
    * 透過網路傳送來自用戶端的資料
    * 從網路接收來自用戶端的資料
    * 從磁碟讀取檔案內容
    * 將內容寫入磁碟
    * 遠端 API 操作
    * 資料庫操作
    * 資料庫查詢
    * 等等
    
    由於大部分的執行時間都消耗在等待 <abbr title="Input and Output - 輸入與輸出">I/O</abbr> 操作上,因此這些操作被稱為 "I/O 密集型" 操作。
    
    之所以稱為「非同步」,是因為電腦/程式不需要與那些耗時的任務「同步」,等待任務完成的精確時間,然後才能取得結果並繼續工作。
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Mar 20 17:05:38 GMT 2026
    - 21.7K bytes
    - Click Count (0)
  4. docs/zh/docs/async.md

    接下来,它 🤖 完成第一个任务(比如是我们的"慢文件"📝) 并继续与之相关的一切。
    
    这个"等待其他事情"通常指的是一些相对较慢(与处理器和 RAM 存储器的速度相比)的 <abbr title="Input and Output - 输入和输出">I/O</abbr> 操作,比如说:
    
    * 通过网络发送来自客户端的数据
    * 客户端接收来自网络中的数据
    * 磁盘中要由系统读取并提供给程序的文件的内容
    * 程序提供给系统的要写入磁盘的内容
    * 一个 API 的远程调用
    * 一个数据库操作,直到完成
    * 一个数据库查询,直到返回结果
    * 等等.
    
    这个执行的时间大多是在等待 <abbr title="Input and Output - 输入和输出">I/O</abbr> 操作,因此它们被叫做 "I/O 密集型" 操作。
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Mar 20 17:06:37 GMT 2026
    - 21.6K bytes
    - Click Count (0)
  5. docs/ko/docs/async.md

    이 "다른 무언가를 기다리는 것"은 일반적으로 프로세서와 RAM 메모리 속도에 비해 상대적으로 "느린" <abbr title="Input and Output - 입력/출력">I/O</abbr> 작업을 의미합니다. 예를 들어 다음을 기다리는 것입니다:
    
    * 네트워크를 통해 클라이언트가 데이터를 보내는 것
    * 네트워크를 통해 클라이언트가 여러분의 프로그램이 보낸 데이터를 받는 것
    * 시스템이 디스크의 파일 내용을 읽어서 프로그램에 전달하는 것
    * 프로그램이 시스템에 전달한 내용을 디스크에 쓰는 것
    * 원격 API 작업
    * 데이터베이스 작업이 완료되는 것
    * 데이터베이스 쿼리가 결과를 반환하는 것
    * 기타 등등
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Mar 20 14:06:26 GMT 2026
    - 27.5K bytes
    - Click Count (0)
  6. src/main/webapp/js/marked.min.js

    (?:\n(?!hr|heading|lheading|blockquote|fences|list|html|table| +\n)[^\n]+)*)/,Ie=/^[^\n]+/,F=/(?!\s*\])(?:\\[\s\S]|[^\[\]\\])+/,Ae=k(/^ {0,3}\[(label)\]: *(?:\n[ \t]*)?([^<\s][^\s]*|<.*?>)(?:(?: +(?:\n[ \t]*)?| *\n[ \t]*)(title))? *(?:\n+|$)/).replace("label",F).replace("title",/(?:"(?:\\"?|[^"\\])*"|'[^'\n]*(?:\n[^'\n]+)*\n?'|\([^()]*\))/).getRegex(),Ce=k(/^(bull)([ \t][^\n]+?)?(?:\n|$)/).replace(/bull/g,Q).getRegex(),q="address|article|aside|base|basefont|blockquote|body|caption|center|col|col...
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sun Mar 15 06:21:57 GMT 2026
    - 41.5K bytes
    - Click Count (0)
  7. src/main/java/org/codelibs/fess/chat/ChatClient.java

            final String refs = sources.stream().map(s -> {
                final String title = s.getTitle();
                final String url = s.getUrl();
                if (title != null && !title.isEmpty() && url != null && !url.isEmpty()) {
                    return title + " (" + url + ")";
                } else if (title != null && !title.isEmpty()) {
                    return title;
                } else if (url != null && !url.isEmpty()) {
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Mar 21 06:04:58 GMT 2026
    - 56.6K bytes
    - Click Count (0)
  8. docs/en/docs/tutorial/dependencies/sub-dependencies.md

    declared multiple times for the same *path operation*, for example, multiple dependencies have a common sub-dependency, **FastAPI** will know to call that sub-dependency only once per request.
    
    And it will save the returned value in a <dfn title="A utility/system to store computed/generated values, to reuse them instead of computing them again.">"cache"</dfn> and pass it to all the "dependants" that need it in that specific request, instead of calling the dependency multiple times for the...
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Wed Feb 11 18:32:12 GMT 2026
    - 3.7K bytes
    - Click Count (0)
  9. docs/zh-hant/docs/advanced/path-operation-advanced-configuration.md

    而在檢視產生出的 OpenAPI(位於你的 API 的 `/openapi.json`)時,也可以在相應*路徑操作*中看到你的擴充:
    
    ```JSON hl_lines="22"
    {
        "openapi": "3.1.0",
        "info": {
            "title": "FastAPI",
            "version": "0.1.0"
        },
        "paths": {
            "/items/": {
                "get": {
                    "summary": "Read Items",
                    "operationId": "read_items_items__get",
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Mar 20 17:05:38 GMT 2026
    - 6.5K bytes
    - Click Count (0)
  10. docs/zh/docs/editor-support.md

    ## 功能 { #features }
    
    - **Path Operation 资源管理器** - 侧边栏树状视图展示应用中的所有 <dfn title="路由,端点">*路径操作*</dfn>。点击可跳转至任一路由或 APIRouter 的定义。
    - **路由搜索** - 使用 <kbd>Ctrl</kbd> + <kbd>Shift</kbd> + <kbd>E</kbd>(macOS 上为 <kbd>Cmd</kbd> + <kbd>Shift</kbd> + <kbd>E</kbd>)按路径、方法或名称进行搜索。
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Mar 20 14:29:48 GMT 2026
    - 2.3K bytes
    - Click Count (0)
Back to Top