Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 341 - 350 of 419 for prie (0.03 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. cmd/bucket-replication.go

    	select {
    	case <-p.ctx.Done():
    	case healCh <- ri:
    	case ch <- ri:
    	default:
    		globalReplicationPool.Get().queueMRFSave(ri.ToMRFEntry())
    		p.mu.RLock()
    		prio := p.priority
    		maxWorkers := p.maxWorkers
    		p.mu.RUnlock()
    		switch prio {
    		case "fast":
    			replLogOnceIf(GlobalContext, fmt.Errorf("Unable to keep up with incoming traffic"), string(replicationSubsystem), logger.WarningKind)
    		case "slow":
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 118.2K bytes
    - Click Count (0)
  2. guava-tests/test/com/google/common/io/ByteStreamsTest.java

        ByteStreams.copy(inChannel, outChannel);
        assertThat(out.toByteArray()).isEqualTo(expected);
      }
    
    
      public void testCopyFileChannel() throws IOException {
        int chunkSize = 14407; // Random prime, unlikely to match any internal chunk size
        ByteArrayOutputStream out = new ByteArrayOutputStream();
        WritableByteChannel outChannel = Channels.newChannel(out);
    
        File testFile = createTempFile();
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 17 19:26:39 GMT 2026
    - 22K bytes
    - Click Count (0)
  3. okhttp/src/jvmTest/resources/okhttp3/internal/publicsuffix/public_suffix_list.dat

    // https://www.iana.org/domains/root/db/praxi.html
    praxi
    
    // press : Radix Technologies Inc.
    // https://www.iana.org/domains/root/db/press.html
    press
    
    // prime : Amazon Registry Services, Inc.
    // https://www.iana.org/domains/root/db/prime.html
    prime
    
    // prod : Charleston Road Registry Inc.
    // https://www.iana.org/domains/root/db/prod.html
    prod
    
    // productions : Binky Moon, LLC
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Fri Dec 27 13:39:56 GMT 2024
    - 309.7K bytes
    - Click Count (1)
  4. build-logic/cleanup/src/test/groovy/gradlebuild/cleanup/services/LeakingProcessKillPatternTest.groovy

            (line =~ KillLeakingJavaProcesses.generateLeakingProcessKillPattern(projectDir)).find()
        }
    
        def "matches google-chrome-for-testing"() {
            def line = '3723579 /usr/bin/google-chrome-for-testing --allow-pre-commit-input --disable-background-networking --disable-client-side-phishing-detection --disable-default-apps --disable-gpu --disable-hang-monitor --disable-popup-blocking --disab'
    
            def projectDir = "/whatever"
    
    Created: Wed Apr 01 11:36:16 GMT 2026
    - Last Modified: Fri Jul 12 03:42:46 GMT 2024
    - 14.8K bytes
    - Click Count (0)
  5. docs/fr/docs/tutorial/first-steps.md

    Il existe de nombreux autres objets et modèles qui seront automatiquement convertis en JSON (y compris des ORM, etc.). Essayez d’utiliser vos favoris, il est fort probable qu’ils soient déjà pris en charge.
    
    ### Étape 6 : le déployer { #step-6-deploy-it }
    
    Déployez votre application sur **[FastAPI Cloud](https://fastapicloud.com)** avec une seule commande : `fastapi deploy`. 🎉
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:37:13 GMT 2026
    - 15.1K bytes
    - Click Count (0)
  6. docs/pt/docs/tutorial/dependencies/dependencies-with-yield.md

    Mas ela existe para ser utilizada caso você precise. 🤓
    
    ///
    
    {* ../../docs_src/dependencies/tutorial008b_an_py310.py hl[18:22,31] *}
    
    Se você quiser capturar exceções e criar uma resposta personalizada com base nisso, crie um [Manipulador de Exceções Customizado](../handling-errors.md#install-custom-exception-handlers).
    
    ## Dependências com `yield` e `except` { #dependencies-with-yield-and-except }
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:20:43 GMT 2026
    - 13.8K bytes
    - Click Count (0)
  7. docs/ko/docs/features.md

    * [PyCharm](https://www.jetbrains.com/pycharm/)에서:
    
    ![editor support](https://fastapi.tiangolo.com/img/pycharm-completion.png)
    
    이전에 불가능하다고 생각했을 코드에서도 자동 완성을 받을 수 있습니다. 예를 들어, 요청에서 전달되는(중첩될 수도 있는) JSON 본문 내부의 `price` 키 같은 경우입니다.
    
    더 이상 잘못된 키 이름을 입력하거나, 문서 사이를 왔다 갔다 하거나, `username`을 썼는지 `user_name`을 썼는지 찾으려고 위아래로 스크롤할 필요가 없습니다.
    
    ### 간결함 { #short }
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Mar 20 14:06:26 GMT 2026
    - 11K bytes
    - Click Count (0)
  8. src/test/java/jcifs/smb/SmbTransportImplTest.java

                assertThrows(SmbUnsupportedOperationException.class, () -> transport.createEncryptionContext(new byte[] { 1 }, null));
            }
    
            @Test
            @DisplayName("createEncryptionContext rejects pre-SMB3 dialect")
            void createEncryptionContext_rejects_oldDialect() throws Exception {
                setField(transport, "smb2", true);
                Smb2NegotiateResponse nego = new Smb2NegotiateResponse(cfg);
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 17.6K bytes
    - Click Count (0)
  9. internal/logger/logger.go

    func RegisterError(f func(string, error, bool) string) {
    	errorFmtFunc = f
    }
    
    // uniq swaps away duplicate elements in data, returning the size of the
    // unique set. data is expected to be pre-sorted, and the resulting set in
    // the range [0:size] will remain in sorted order. Uniq, following a
    // sort.Sort call, can be used to prepare arbitrary inputs for use as sets.
    func uniq(data sort.Interface) (size int) {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 12.4K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/primitives/Ints.java

        //     ends up at a[d], which in turn ends up at a[2d], and so on until we get back to a[0].
        //     (All indices taken mod n.) If d and n are mutually prime, all elements will have been
        //     moved at that point. Otherwise, we can rotate the cycle a[1], a[1 + d], a[1 + 2d], etc,
        //     then a[2] etc, and so on until we have rotated all elements. There are gcd(d, n) cycles
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 17 16:45:58 GMT 2026
    - 31.3K bytes
    - Click Count (0)
Back to Top