- Sort Score
- Num 10 results
- Language All
Results 681 - 690 of 1,264 for member (0.06 seconds)
-
src/main/java/org/codelibs/fess/app/web/admin/webconfig/EditForm.java
* Stored as a long value representing milliseconds since epoch. * Used for audit trail and concurrency control. */ @ValidateTypeFailure public Long updatedTime; /** * The version number of the web configuration for optimistic locking. * This field is required to prevent concurrent modification conflicts * by ensuring the configuration hasn't been modified by another process. */ @RequiredCreated: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Thu Jul 17 08:28:31 GMT 2025 - 2.3K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/util/IpAddressUtil.java
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Thu Nov 06 08:31:03 GMT 2025 - 9.4K bytes - Click Count (0) -
internal/config/api/api.go
if err != nil { return cfg, err } if replicationMaxWorkers <= 0 || replicationMaxWorkers > 500 { return cfg, config.ErrInvalidReplicationWorkersValue(nil).Msg("Number of replication workers should be between 1 and 500") } cfg.ReplicationMaxWorkers = replicationMaxWorkersCreated: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 11.5K bytes - Click Count (1) -
android/guava/src/com/google/common/hash/HashFunction.java
import java.nio.ByteBuffer; import java.nio.charset.Charset; import org.jspecify.annotations.Nullable; /** * A hash function is a collision-averse pure function that maps an arbitrary block of data to a * number called a <i>hash code</i>. * * <h3>Definition</h3> * * <p>Unpacking this definition: * * <ul> * <li><b>block of data:</b> the input for a hash function is always, in concept, an ordered byte
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 10.9K bytes - Click Count (0) -
cmd/batch-replicate_gen.go
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 40.7K bytes - Click Count (0) -
docs/ja/docs/tutorial/path-params.md
<img src="/img/tutorial/path-params/image03.png"> ### Python*列挙型*の利用 { #working-with-python-enumerations } *パスパラメータ*の値は*列挙型メンバ*となります。 #### *列挙型メンバ*の比較 { #compare-enumeration-members } これは、作成した列挙型 `ModelName` の*列挙型メンバ*と比較できます: {* ../../docs_src/path_params/tutorial005_py310.py hl[17] *} #### *列挙値*の取得 { #get-the-enumeration-value }
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Fri Mar 20 14:07:17 GMT 2026 - 10.8K bytes - Click Count (0) -
internal/grid/benchmark_test.go
got := 0 for b := range in { PutByteBuffer(b) got++ } if got != requests { return NewRemoteErrf("wrong number of requests. want %d, got %d", requests, got) } return nil }, Subroute: "some-subroute", OutCapacity: 1, InCapacity: 1, // Only one message buffered. })) errFatal(err)Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 15.5K bytes - Click Count (0) -
cmd/object-api-listobjects_test.go
if len(testCase.resultL.Objects) != len(resultL.Objects) { t.Logf("want: %v", objInfoNames(testCase.resultL.Objects)) t.Logf("got: %v", objInfoNames(resultL.Objects)) t.Errorf("Test %d: %s: Expected number of object in the result to be '%d', but found '%d' objects instead", i+1, instanceType, len(testCase.resultL.Objects), len(resultL.Objects)) } for j := 0; j < len(testCase.resultL.Objects); j++ {
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Oct 10 18:57:03 GMT 2025 - 76.1K bytes - Click Count (0) -
docs/ja/docs/tutorial/path-params-numeric-validations.md
## 数値の検証: 以上 { #number-validations-greater-than-or-equal } `Query`と`Path`(、そして後述する他のもの)を用いて、数値の制約を宣言できます。 ここで、`ge=1`の場合、`item_id`は`1`「より大きい`g`か、同じ`e`」整数でなければなりません。 {* ../../docs_src/path_params_numeric_validations/tutorial004_an_py310.py hl[10] *} ## 数値の検証: より大きいと小なりイコール { #number-validations-greater-than-and-less-than-or-equal } 以下も同様です:Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Fri Mar 20 14:07:17 GMT 2026 - 7.6K bytes - Click Count (0) -
docs/security/README.md
``` In case of a S3 multi-part operation each part is en/decrypted with the scheme shown in Figure 1. However, for each part a unique secret key is derived from the OEK and the part number using a PRF. So in case of multi-part not the OEK but the output of `PRF(OEK, part_id)` is used as secret key. #### Cryptographic Primitives
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Wed Feb 26 09:25:50 GMT 2025 - 13.8K bytes - Click Count (0)