Search Options

Results per page
Sort
Preferred Languages
Advance

Results 91 - 100 of 111 for bigptr (0.19 sec)

  1. docs/ko/docs/tutorial/dependencies/dependencies-in-path-operation-decorators.md

        ```Python hl_lines="9  14"
        {!> ../../../docs_src/dependencies/tutorial006.py!}
        ```
    
    ## *경로 작동* 모음에 대한 의존성
    
    나중에 여러 파일을 가지고 있을 수 있는 더 큰 애플리케이션을 구조화하는 법([더 큰 애플리케이션 - 여러 파일들](../../tutorial/bigger-applications.md){.internal-link target=_blank})을 읽을 때, *경로 작동* 모음에 대한 단일 `dependencies` 매개변수를 선언하는 법에 대해서 배우게 될 것입니다.
    
    ## 전역 의존성
    
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Sun Feb 11 13:49:45 UTC 2024
    - 4.7K bytes
    - Viewed (0)
  2. src/compress/flate/writer_test.go

    	cbuf := make([]byte, 787)
    	_, err = io.CopyBuffer(w, struct{ io.Reader }{br}, cbuf)
    	if err != nil {
    		t.Fatal(err)
    	}
    	w.Close()
    
    	// We choose a different buffer size,
    	// bigger than a maximum block, and also a prime.
    	var b2 bytes.Buffer
    	cbuf = make([]byte, 81761)
    	br2 := bytes.NewBuffer(t1)
    	w2, err := NewWriter(&b2, i)
    	if err != nil {
    		t.Fatal(err)
    	}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Oct 20 18:41:18 UTC 2020
    - 5.4K bytes
    - Viewed (0)
  3. src/cmd/compile/internal/syntax/source.go

    		if n > 0 || s.ioerr != nil {
    			s.e += n
    			s.buf[s.e] = sentinel
    			return
    		}
    		// n == 0
    	}
    
    	s.buf[s.e] = sentinel
    	s.ioerr = io.ErrNoProgress
    }
    
    // nextSize returns the next bigger size for a buffer of a given size.
    func nextSize(size int) int {
    	const min = 4 << 10 // 4K: minimum buffer size
    	const max = 1 << 20 // 1M: maximum buffer size which is still doubled
    	if size < min {
    		return min
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Mar 05 19:25:46 UTC 2020
    - 5.7K bytes
    - Viewed (0)
  4. docs/en/docs/tutorial/background-tasks.md

    ## Caveat
    
    If you need to perform heavy background computation and you don't necessarily need it to be run by the same process (for example, you don't need to share memory, variables, etc), you might benefit from using other bigger tools like <a href="https://docs.celeryq.dev" class="external-link" target="_blank">Celery</a>.
    
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Sat May 18 23:43:13 UTC 2024
    - 5.6K bytes
    - Viewed (0)
  5. src/net/parse.go

    				n++
    			}
    			last = i + 1
    		}
    	}
    	if last < len(s) {
    		a[n] = s[last:]
    		n++
    	}
    	return a[0:n]
    }
    
    func getFields(s string) []string { return splitAtBytes(s, " \r\t\n") }
    
    // Bigger than we need, not too big to worry about overflow
    const big = 0xFFFFFF
    
    // Decimal to integer.
    // Returns number, characters consumed, success.
    func dtoi(s string) (n int, i int, ok bool) {
    	n = 0
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon May 06 14:00:54 UTC 2024
    - 5.7K bytes
    - Viewed (0)
  6. docs/zh/docs/tutorial/testing.md

    ## 分离测试
    
    在实际应用中,你可能会把你的测试放在另一个文件里。
    
    您的**FastAPI**应用程序也可能由一些文件/模块组成等等。
    
    ### **FastAPI** app 文件
    
    假设你有一个像 [更大的应用](bigger-applications.md){.internal-link target=_blank} 中所描述的文件结构:
    
    ```
    .
    ├── app
    │   ├── __init__.py
    │   └── main.py
    ```
    
    在 `main.py` 文件中你有一个 **FastAPI** app:
    
    
    ```Python
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Thu Apr 18 19:53:19 UTC 2024
    - 6K bytes
    - Viewed (0)
  7. src/os/path_windows_test.go

    	}
    	drive := strings.ToLower(filepath.VolumeName(cwd))
    	cwd = strings.ToLower(cwd[len(drive)+1:])
    	// Build a very long pathname. Paths in Go are supposed to be arbitrarily long,
    	// so let's make a long path which is comfortably bigger than MAX_PATH on Windows
    	// (256) and thus requires fixLongPath to be correctly interpreted in I/O syscalls.
    	veryLong := "l" + strings.Repeat("o", 500) + "ng"
    	for _, test := range []struct{ in, want string }{
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Apr 23 16:37:32 UTC 2024
    - 8K bytes
    - Viewed (0)
  8. docs/de/docs/tutorial/testing.md

    Und Ihre **FastAPI**-Anwendung könnte auch aus mehreren Dateien/Modulen, usw. bestehen.
    
    ### **FastAPI** Anwendungsdatei
    
    Nehmen wir an, Sie haben eine Dateistruktur wie in [Größere Anwendungen](bigger-applications.md){.internal-link target=_blank} beschrieben:
    
    ```
    .
    ├── app
    │   ├── __init__.py
    │   └── main.py
    ```
    
    In der Datei `main.py` haben Sie Ihre **FastAPI**-Anwendung:
    
    
    ```Python
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Sat Mar 30 20:20:01 UTC 2024
    - 7K bytes
    - Viewed (0)
  9. docs/fr/docs/deployment/docker.md

    ```Dockerfile
    FROM tiangolo/uvicorn-gunicorn-fastapi:python3.7
    
    COPY ./app /app
    ```
    
    ### Applications plus larges
    
    Si vous avez suivi la section sur la création d' [Applications avec plusieurs fichiers](../tutorial/bigger-applications.md){.internal-link target=_blank}, votre `Dockerfile` pourrait ressembler à ceci :
    
    ```Dockerfile
    FROM tiangolo/uvicorn-gunicorn-fastapi:python3.7
    
    COPY ./app /app/app
    ```
    
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Thu May 12 00:06:16 UTC 2022
    - 7.5K bytes
    - Viewed (0)
  10. src/crypto/internal/edwards25519/scalarmult.go

    	// fewer additions).
    
    	basepointNafTable := basepointNafTable()
    	var aTable nafLookupTable5
    	aTable.FromP3(A)
    	// Because the basepoint is fixed, we can use a wider NAF
    	// corresponding to a bigger table.
    	aNaf := a.nonAdjacentForm(5)
    	bNaf := b.nonAdjacentForm(8)
    
    	// Find the first nonzero coefficient.
    	i := 255
    	for j := i; j >= 0; j-- {
    		if aNaf[j] != 0 || bNaf[j] != 0 {
    			break
    		}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 05 21:53:10 UTC 2022
    - 6.3K bytes
    - Viewed (0)
Back to top