- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 2,495 for SET (0.01 sec)
-
clause/set.go
} // MergeClause merge assignments clauses func (set Set) MergeClause(clause *Clause) { copiedAssignments := make([]Assignment, len(set)) copy(copiedAssignments, set) clause.Expression = Set(copiedAssignments) } // Assignments implements Assigner for Set. func (set Set) Assignments() []Assignment { return []Assignment(set) } func Assignments(values map[string]interface{}) Set { keys := make([]string, 0, len(values))
Registered: Sun Dec 28 09:35:17 UTC 2025 - Last Modified: Tue Sep 09 01:34:33 UTC 2025 - 1.7K bytes - Viewed (0) -
cmd/metacache-set.go
// Retention configuration, needed to be passed along with lifecycle if set. Retention lock.Retention `msg:"-"` // Replication configuration Replication replicationConfig `msg:"-"` // StopDiskAtLimit will stop listing on each disk when limit number off objects has been returned. StopDiskAtLimit bool // pool and set of where the cache is located. pool, set int } func init() { gob.Register(listPathOptions{})
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Sun Sep 28 20:59:21 UTC 2025 - 30.7K bytes - Viewed (0) -
cmd/metrics-v3-cluster-erasure-set.go
labels := []string{poolIDL, poolLV, setIDL, setLV} m.Set(erasureSetReadQuorum, float64(h.ReadQuorum), labels...) m.Set(erasureSetWriteQuorum, float64(h.WriteQuorum), labels...) m.Set(erasureSetOnlineDrivesCount, float64(h.HealthyDrives), labels...) m.Set(erasureSetHealingDrivesCount, float64(h.HealingDrives), labels...) m.Set(erasureSetHealth, b2f(h.Healthy), labels...) readHealthy := trueRegistered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Tue May 14 07:25:56 UTC 2024 - 4.4K bytes - Viewed (0) -
buildscripts/verify-healing-empty-erasure-set.sh
#!/bin/bash -e # set -E set -o pipefail if [ ! -x "$PWD/minio" ]; then echo "minio executable binary not found in current directory" exit 1 fi WORK_DIR="$PWD/.verify-$RANDOM" MINIO_CONFIG_DIR="$WORK_DIR/.minio" MINIO=("$PWD/minio" --config-dir "$MINIO_CONFIG_DIR" server) function start_minio_3_node() { export MINIO_ROOT_USER=minio export MINIO_ROOT_PASSWORD=minio123 export MINIO_ERASURE_SET_DRIVE_COUNT=6
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Jul 12 20:51:54 UTC 2024 - 3.7K bytes - Viewed (0) -
src/main/assemblies/files/fess.in.bat
set FESS_JAVA_OPTS=%FESS_JAVA_OPTS% -Des-foreground=yes set FESS_JAVA_OPTS=%FESS_JAVA_OPTS% -Dfess.home="%FESS_HOME%" set FESS_JAVA_OPTS=%FESS_JAVA_OPTS% -Dfess.es.dir="%SEARCH_ENGINE_HOME%" set FESS_JAVA_OPTS=%FESS_JAVA_OPTS% -Dfess.context.path=/ set FESS_JAVA_OPTS=%FESS_JAVA_OPTS% -Dfess.port=8080 set FESS_JAVA_OPTS=%FESS_JAVA_OPTS% -Dfess.webapp.path=%FESS_HOME%\app set FESS_JAVA_OPTS=%FESS_JAVA_OPTS% -Dfess.temp.path=%FESS_HOME%\temp
Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Thu Nov 27 03:48:59 UTC 2025 - 4.8K bytes - Viewed (0) -
src/main/java/org/codelibs/core/collection/LruHashSet.java
import java.util.Iterator; import java.util.Set; /** * A {@link Set} implementation that stores its elements in a {@link LruHashMap}. * <p> * This set has a fixed maximum capacity. When the capacity is reached and a new element is added, * the least recently used element is removed. * </p> * @author shinsuke * @param <E> the type of elements maintained by this set */Registered: Sat Dec 20 08:55:33 UTC 2025 - Last Modified: Sat Jul 05 00:11:05 UTC 2025 - 3.7K bytes - Viewed (0) -
internal/once/singleton.go
// Until the value is set all Get() calls will block. type Singleton[T any] struct { v *T set chan struct{} } // NewSingleton creates a new unset singleton. func NewSingleton[T any]() *Singleton[T] { return &Singleton[T]{set: make(chan struct{}), v: nil} } // Get will return the singleton value. func (s *Singleton[T]) Get() *T { <-s.set return s.v }
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Thu Aug 15 12:04:40 UTC 2024 - 952 bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/google/SetGenerators.java
if (set.isEmpty()) { /* * The (tooLow + 1, tooHigh) arguments below would be invalid because tooLow would be * greater than tooHigh. */ return ContiguousSet.create(Range.openClosed(0, 1), DiscreteDomain.integers()).subSet(0, 1); } int tooHigh = set.last() + 1; int tooLow = set.first() - 1; set.add(tooHigh);
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Sep 08 18:35:13 UTC 2025 - 15.9K bytes - Viewed (0) -
internal/config/api/help.go
Help = config.HelpKVS{ config.HelpKV{ Key: apiRequestsMax, Description: `set the maximum number of concurrent requests (default: auto)`, Optional: true, Type: "number", }, config.HelpKV{ Key: apiClusterDeadline, Description: `set the deadline for cluster readiness check` + defaultHelpPostfix(apiClusterDeadline), Optional: true, Type: "duration",Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 16 08:43:49 UTC 2024 - 4.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/TestUtil.java
*/ @CanIgnoreReturnValue static <T> Set<T> sanityCheckSet(Set<T> set) { assertThat(set).hasSize(Iterators.size(set.iterator())); for (Object element : set) { assertThat(set).contains(element); } assertThat(set).doesNotContain(new Object()); assertThat(set).isEqualTo(ImmutableSet.copyOf(set)); return set; }
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sat Jan 18 02:54:30 UTC 2025 - 4K bytes - Viewed (0)