Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1381 - 1390 of 1,416 for become (0.09 seconds)

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

  1. src/main/java/jcifs/smb/SmbFile.java

                if (isRetryableException(e) && shouldRetryConnection()) {
                    log.debug("Retrying tree connection after transient failure", e);
                    try {
                        Thread.sleep(100); // Brief delay before retry
                        this.treeHandle = this.treeConnection.connectWrapException(this.fileLocator);
                        if (this.fileLocator.getURL().getPath().contains("\\")) {
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 30 05:58:03 GMT 2025
    - 103.2K bytes
    - Click Count (0)
  2. tensorflow/c/c_api_test.cc

      TF_Run(session, run_options, nullptr, nullptr, 0, nullptr, nullptr, 0,
             nullptr, 0, run_metadata, s);
      EXPECT_EQ(TF_INVALID_ARGUMENT, TF_GetCode(s)) << TF_Message(s);
      EXPECT_EQ("Session was not created with a graph before Run()!",
                std::string(TF_Message(s)));
      TF_DeleteBuffer(run_metadata);
      TF_DeleteBuffer(run_options);
    
      TF_DeleteDeprecatedSession(session, s);
      ASSERT_EQ(TF_OK, TF_GetCode(s)) << TF_Message(s);
    
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Wed Jan 07 04:56:09 GMT 2026
    - 97.3K bytes
    - Click Count (0)
  3. docs/zh-hant/docs/deployment/docker.md

    若你的應用「很簡單」,這可能「不是問題」,你可能不需要指定嚴格的記憶體限制。但如果你「使用大量記憶體」(例如使用機器學習模型),你應該檢查實際消耗的記憶體,並調整「每台機器上執行的容器數量」(也許還要為叢集加機器)。
    
    若你採用「每個容器多個行程」,你就得確保啟動的行程數量不會「超過可用記憶體」。
    
    ## 啟動前的前置步驟與容器 { #previous-steps-before-starting-and-containers }
    
    如果你使用容器(例如 Docker、Kubernetes),那有兩種主要做法可用。
    
    ### 多個容器 { #multiple-containers }
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Mar 20 17:05:38 GMT 2026
    - 24.9K bytes
    - Click Count (0)
  4. internal/bucket/lifecycle/lifecycle_test.go

    				set:                     true,
    			},
    		},
    	}
    	for i, tc := range testCases {
    		var got NoncurrentVersionExpiration
    		dec := xml.NewDecoder(strings.NewReader(tc.xml))
    		if err := dec.Decode(&got); err != nil || got != tc.expected {
    			if err != nil {
    				t.Fatalf("%d: Failed to unmarshal xml %v", i+1, err)
    			}
    			t.Fatalf("%d: Expected %v but got %v", i+1, tc.expected, got)
    		}
    	}
    }
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 55.5K bytes
    - Click Count (0)
  5. src/main/webapp/js/admin/plugins/form-validator/jquery.form-validator.min.js

    bmitErrorMessageCallback(b,c,d))){var h={errorTitle:e.errorTitle,fields:"",errorMessageClass:d.errorMessageClass};a.each(c,function(a,b){h.fields+="<li>"+b+"</li>"}),a.each(h,function(a,b){f=f.replace("{"+a+"}",b)}),g?g.html(f):b.children().eq(0).before(a(f))}}};a.formUtils=a.extend(a.formUtils||{},{dialogs:b})}(a),function(a,b,c){"use strict";var d=0;a.fn.validateOnBlur=function(b,c){var d=this,e=this.find("*[data-validation]");return e.each(function(){var e=a(this);if(e.is("[type=radio]")){var...
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Mon Jan 01 05:12:47 GMT 2018
    - 32.8K bytes
    - Click Count (0)
  6. cmd/erasure-object_test.go

    	}
    	for _, test := range testCases {
    		t.Run("", func(t *testing.T) {
    			_, err := xl.GetObjectInfo(ctx, "bucket", "dir/obj", ObjectOptions{})
    			if err != nil {
    				t.Fatal("dir/obj not found before last test")
    			}
    			_, actualErr := xl.DeleteObject(ctx, test.bucket, test.object, ObjectOptions{})
    			if test.expectedErr != nil && actualErr != test.expectedErr {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 38.3K bytes
    - Click Count (0)
  7. cmd/site-replication.go

    	if err != nil {
    		return wrapSRErr(err)
    	}
    	return nil
    }
    
    // getAdminClient - NOTE: ensure to take at least a read lock on SiteReplicationSys
    // before calling this.
    func (c *SiteReplicationSys) getAdminClient(ctx context.Context, deploymentID string) (*madmin.AdminClient, error) {
    	creds, err := c.getPeerCreds()
    	if err != nil {
    		return nil, err
    	}
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 184.8K bytes
    - Click Count (1)
  8. docs/ko/docs/deployment/docker.md

    **컨테이너당 여러 프로세스**를 실행한다면, 시작되는 프로세스 수가 사용 가능한 것보다 **더 많은 메모리를 소비하지** 않는지 확인해야 합니다.
    
    ## 시작 전 단계와 컨테이너 { #previous-steps-before-starting-and-containers }
    
    컨테이너(예: Docker, Kubernetes)를 사용한다면, 사용할 수 있는 주요 접근 방식은 두 가지입니다.
    
    ### 여러 컨테이너 { #multiple-containers }
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Mar 20 14:06:26 GMT 2026
    - 32.6K bytes
    - Click Count (0)
  9. android/guava/src/com/google/common/net/InetAddresses.java

      }
    
      /**
       * Returns an integer representing an IPv4 address regardless of whether the supplied argument is
       * an IPv4 address or not.
       *
       * <p>IPv6 addresses are <b>coerced</b> to IPv4 addresses before being converted to integers.
       *
       * <p>As long as there are applications that assume that all IP addresses are IPv4 addresses and
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 19 18:53:45 GMT 2026
    - 47.7K bytes
    - Click Count (0)
  10. okhttp/src/jvmTest/kotlin/okhttp3/URLConnectionTest.kt

        // We know that a fresh connection was created if the server recorded a request with sequence
        // number 0. Since the client may have attempted to reuse the broken connection just before
        // creating a fresh connection, the server may have recorded 2 requests at this point. The order
        // of recording is non-deterministic.
        val requestAfter = server.takeRequest()
        assertThat(
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 133.3K bytes
    - Click Count (0)
Back to Top