- Sort Score
- Num 10 results
- Language All
Results 161 - 170 of 262 for Algorithm (0.15 seconds)
-
src/test/java/org/codelibs/fess/helper/SearchHelperTest.java
public void test_gzipCompress_and_gzipDecompress() { String testData = "This is test data for compression that should be long enough to actually compress effectively when using gzip compression algorithm"; byte[] originalBytes = testData.getBytes(); byte[] compressed = searchHelper.gzipCompress(originalBytes); byte[] decompressed = searchHelper.gzipDecompress(compressed);
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Fri Mar 13 23:01:26 GMT 2026 - 19.2K bytes - Click Count (0) -
src/main/resources/fess_config.properties
search_engine.password= # Interval (ms) for heartbeat checks to the search engine. search_engine.heartbeat_interval=10000 # Cipher algorithm used for encryption. app.cipher.algorithm=aes # Secret key for encryption (change this value for production). app.cipher.key=___change__me___ # Algorithm for digest calculation. app.digest.algorithm=sha256 # Regex pattern for properties to encrypt. app.encrypt.property.pattern=.*password|.*key|.*token|.*secret
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Mar 28 06:59:19 GMT 2026 - 59.3K bytes - Click Count (0) -
guava/src/com/google/common/collect/ImmutableList.java
default: return construct(elements.clone()); } } /** * Returns an immutable list containing the given elements, sorted according to their natural * order. The sorting algorithm used is stable, so elements that compare as equal will stay in the * order in which they appear in the input. * * <p>If your data has no duplicates, or you wish to deduplicate elements, use {@codeCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sun Mar 08 16:16:42 GMT 2026 - 30.6K bytes - Click Count (0) -
cmd/object-api-interface.go
BackendInfo() madmin.BackendInfo Legacy() bool // Only returns true for deployments which use CRCMOD as its object distribution algorithm. StorageInfo(ctx context.Context, metrics bool) StorageInfo LocalStorageInfo(ctx context.Context, metrics bool) StorageInfo // Bucket operations.
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 17.5K bytes - Click Count (0) -
cmd/encryption-v1.go
return crypto.ErrInvalidCustomerKey // To provide strict AWS S3 compatibility we return: access denied. } if subtle.ConstantTimeCompare(oldKey, newKey) == 1 && sealedKey.Algorithm == crypto.SealAlgorithm { return nil // don't rotate on equal keys if seal algorithm is latest } sealedKey = objectKey.Seal(newKey, sealedKey.IV, crypto.SSEC.String(), bucket, object) crypto.SSEC.CreateMetadata(metadata, sealedKey) return nil
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 38K bytes - Click Count (0) -
src/main/java/jcifs/internal/smb2/nego/Smb2NegotiateResponse.java
* * @return the selectedCipher */ public int getSelectedCipher() { return this.selectedCipher; } /** * Gets the pre-authentication integrity hash algorithm selected for SMB 3.1.1. * * @return the selectedPreauthHash */ public int getSelectedPreauthHash() { return this.selectedPreauthHash; } /**Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sun Aug 31 08:00:57 GMT 2025 - 24K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/Graph.java
* of {@code Graph} that provides methods for adding and removing nodes and edges. If you do not * need to mutate a graph (e.g. if you write a method than runs a read-only algorithm on the graph), * you should use the non-mutating {@link Graph} interface, or an {@link ImmutableGraph}. * * <p>You can create an immutable copy of an existing {@code Graph} using {@link * ImmutableGraph#copyOf(Graph)}:Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 13.6K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
* subtype of {@code ValueGraph} that provides methods for adding and removing nodes and edges. If * you do not need to mutate a graph (e.g. if you write a method than runs a read-only algorithm on * the graph), you should use the non-mutating {@link ValueGraph} interface, or an {@link * ImmutableValueGraph}. * * <p>You can create an immutable copy of an existing {@code ValueGraph} using {@linkCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 15K bytes - Click Count (0) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
int takeIndex; /** items index for next put, offer, or add. */ int putIndex; /** Number of items in the queue */ private int count; /* * Concurrency control uses the classic two-condition algorithm * found in any textbook. */ /** Monitor guarding all access */ final Monitor monitor; /** Guard for waiting takes */ private final Monitor.Guard notEmpty; /** Guard for waiting puts */
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 23 21:06:42 GMT 2026 - 22.4K bytes - Click Count (0) -
android/guava/src/com/google/common/net/HttpHeaders.java
public static final String UNSAFE_URL = "unsafe-url"; } /** * The HTTP <a href="https://www.w3.org/TR/service-workers/#update-algorithm">{@code * Service-Worker}</a> header field name. * * @since 20.0 */ public static final String SERVICE_WORKER = "Service-Worker"; /** The HTTP {@code TE} header field name. */
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Feb 24 14:36:23 GMT 2026 - 35.6K bytes - Click Count (0)