Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1211 - 1220 of 1,264 for member (0.25 seconds)

  1. tensorflow/c/c_api.cc

            InvalidArgument("Node ", node->name(), " was not found in the graph");
        return -1;
      }
    
      tensorflow::shape_inference::ShapeHandle shape = ic->output(output.index);
    
      // Unknown rank means the number of dimensions is -1.
      if (!ic->RankKnown(shape)) {
        return -1;
      }
    
      return ic->Rank(shape);
    }
    
    void TF_GraphGetTensorShape(TF_Graph* graph, TF_Output output, int64_t* dims,
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Sat Oct 04 05:55:32 GMT 2025
    - 102.4K bytes
    - Click Count (0)
  2. docs/ko/docs/tutorial/query-params-str-validations.md

    /// tip | 팁
    
    Pydantic에는 [BeforeValidator](https://docs.pydantic.dev/latest/concepts/validators/#field-before-validator)와 같은 다른 것들도 있습니다. 🤓
    
    ///
    
    예를 들어, 이 커스텀 validator는 <abbr title="International Standard Book Number - 국제 표준 도서 번호">ISBN</abbr> 도서 번호의 경우 아이템 ID가 `isbn-`으로 시작하고, <abbr title="Internet Movie Database - 인터넷 영화 데이터베이스: 영화에 대한 정보를 제공하는 웹사이트">IMDB</abbr> 영화 URL ID의 경우 `imdb-`로 시작하는지 확인합니다:
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Mar 20 14:06:26 GMT 2026
    - 18.7K bytes
    - Click Count (0)
  3. tensorflow/c/eager/c_api_experimental.h

    // executed in sequence. Assigning nodes to different executors allows executing
    // nodes in parallel.
    // in_flight_nodes_limit: when is_async is true, this value controls the
    // maximum number of in flight async nodes. Enqueuing of additional async ops
    // after the limit is reached blocks until some inflight nodes finishes.
    // The effect is bounding the memory held by inflight TensorHandles that are
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Wed Feb 21 22:37:46 GMT 2024
    - 39.5K bytes
    - Click Count (1)
  4. tensorflow/BUILD

    filegroup(
        name = "tensorflow_def_file",
        srcs = [":tf_custom_op_library_additional_deps.dll"],
        output_group = "def_file",
    )
    
    # Filter the DEF file to reduce the number of symbols to 64K or less.
    # Note that we also write the name of the pyd file into DEF file so that
    # the dynamic libraries of custom ops can find it at runtime.
    genrule(
        name = "tensorflow_filtered_def_file",
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Tue Mar 24 21:00:18 GMT 2026
    - 53.1K bytes
    - Click Count (0)
  5. src/main/resources/fess_label_ja.properties

    labels.ldap_admin_security_credentials=パスワード
    labels.ldap_base_dn=Base DN
    labels.ldapAccountFilter=アカウントフィルター
    labels.ldapGroupFilter=グループフィルター
    labels.ldapMemberofAttribute=memberOf属性
    labels.ldap_account_filter=アカウントフィルター
    labels.ldap_group_filter=グループフィルター
    labels.ldap_memberof_attribute=memberOf属性
    labels.notification_login=ログインページ
    labels.notification_search_top=検索トップページ
    labels.storage_endpoint=エンドポイント
    labels.storage_access_key=アクセスキー
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Mar 28 11:54:13 GMT 2026
    - 56.7K bytes
    - Click Count (0)
  6. src/test/java/org/codelibs/fess/helper/SystemHelperTest.java

            final String pidPart = instanceId.substring(instanceId.lastIndexOf(':') + 1);
            assertTrue(Long.parseLong(pidPart) > 0, "PID should be a positive number");
        }
    
        @Test
        public void test_isEoled() {
            assertEquals(systemHelper.getCurrentTimeAsLong() > systemHelper.eolTime, systemHelper.isEoled());
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Mar 28 06:59:19 GMT 2026
    - 44.4K bytes
    - Click Count (0)
  7. cmd/bucket-metadata_gen.go

    		default:
    			bts, err = msgp.Skip(bts)
    			if err != nil {
    				err = msgp.WrapError(err)
    				return
    			}
    		}
    	}
    	o = bts
    	return
    }
    
    // Msgsize returns an upper bound estimate of the number of bytes occupied by the serialized message
    func (z *BucketMetadata) Msgsize() (s int) {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 25.4K bytes
    - Click Count (0)
  8. cmd/iam-object-store.go

    	// Loads things in the same order as `LoadIAMCache()`
    
    	bootstrapTraceMsgFirstTime("loading policy documents")
    
    	policyLoadStartTime := UTCNow()
    	policiesList := listedConfigItems[policiesListKey]
    	count := 32 // number of parallel IAM loaders
    	for {
    		if len(policiesList) < count {
    			policyDocs, err := iamOS.loadPolicyDocConcurrent(ctx, policiesList...)
    			if err != nil {
    				return err
    			}
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 26.6K bytes
    - Click Count (0)
  9. cmd/peer-rest-client.go

    			continue
    		}
    		all[i] = newPeerRESTClient(host, endpoints.FindGridHostsFromPeer(host))
    		remote = append(remote, all[i])
    	}
    	if len(all) != len(remote)+1 {
    		peersLogIf(context.Background(), fmt.Errorf("Expected number of all hosts (%v) to be remote +1 (%v)", len(all), len(remote)), logger.WarningKind)
    	}
    	return remote, all
    }
    
    // MonitorBandwidth - send http trace request to peer nodes
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 26.1K bytes
    - Click Count (0)
  10. internal/bucket/replication/replication_test.go

    		if err != nil {
    			t.Fatalf("Got unexpected error: %v", err)
    		}
    		got := cfg.FilterActionableRules(ObjectOpts{Name: tc.prefix})
    		if len(got) != len(tc.ExpectedRules) {
    			t.Fatalf("Expected matching number of actionable rules: `%v`, got: `%v`", tc.ExpectedRules, got)
    		}
    		for i := range got {
    			if got[i].Destination.ARN != tc.ExpectedRules[i].Destination.ARN || got[i].Priority != tc.ExpectedRules[i].Priority {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 32.4K bytes
    - Click Count (0)
Back to Top