- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 108 for setB (0.08 sec)
-
android/guava-testlib/src/com/google/common/collect/testing/features/FeatureUtil.java
source); } } /** Construct a new {@link java.util.Set} that is the intersection of the given sets. */ public static <T> Set<T> intersection(Set<? extends T> set1, Set<? extends T> set2) { Set<T> result = Helpers.<T>copyToSet(set1); result.retainAll(set2); return result; }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 21 15:08:35 UTC 2022 - 12.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/SetsTest.java
@Override protected Set<String> create(String[] elements) { Set<String> set1 = Sets.newHashSet(elements); set1.add(samples().e3()); Set<String> set2 = Sets.newHashSet(elements); set2.add(samples().e4()); return Sets.intersection(set1, set2); } })
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 17 15:27:58 UTC 2024 - 49.2K bytes - Viewed (0) -
test/typeparam/sets.go
} return true } // A _Set is a set of elements of some type. type _Set[Elem comparable] struct { m map[Elem]struct{} } // _Make makes a new set. func _Make[Elem comparable]() _Set[Elem] { return _Set[Elem]{m: make(map[Elem]struct{})} } // Add adds an element to a set. func (s _Set[Elem]) Add(v Elem) { s.m[v] = struct{}{} } // Delete removes an element from a set. If the element is not present
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 01 19:45:34 UTC 2022 - 5.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/SetsTest.java
@Override protected Set<String> create(String[] elements) { Set<String> set1 = Sets.newHashSet(elements); set1.add(samples().e3()); Set<String> set2 = Sets.newHashSet(elements); set2.add(samples().e4()); return Sets.intersection(set1, set2); } })
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 17 15:27:58 UTC 2024 - 47.8K bytes - Viewed (0) -
clause/set.go
package clause import "sort" type Set []Assignment type Assignment struct { Column Column Value interface{} } func (set Set) Name() string { return "SET" } func (set Set) Build(builder Builder) { if len(set) > 0 { for idx, assignment := range set { if idx > 0 { builder.WriteByte(',') } builder.WriteQuoted(assignment.Column) builder.WriteByte('=')
Registered: Wed Jun 12 16:27:09 UTC 2024 - Last Modified: Mon Nov 29 03:02:44 UTC 2021 - 1.4K bytes - Viewed (0) -
cmd/erasure-sets.go
for { select { case <-ctx.Done(): return case <-timer.C: var wg sync.WaitGroup for _, set := range s.sets { wg.Add(1) go func(set *erasureObjects) { defer wg.Done() if set == nil { return } set.cleanupDeletedObjects(ctx) }(set) } wg.Wait() // Reset for the next interval timer.Reset(globalAPIConfig.getDeleteCleanupInterval())
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 37.7K bytes - Viewed (0) -
pkg/util/sets/set.go
func (s Set[T]) Delete(item T) Set[T] { delete(s, item) return s } // DeleteAll removes items from the set. func (s Set[T]) DeleteAll(items ...T) Set[T] { for _, item := range items { delete(s, item) } return s } // Merge a set of objects that are in s2 into s // For example: // s = {a1, a2, a3} // s2 = {a3, a4, a5} // s.Merge(s2) = {a1, a2, a3, a4, a5} func (s Set[T]) Merge(s2 Set[T]) Set[T] {
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Sat Mar 30 05:26:03 UTC 2024 - 6.4K bytes - Viewed (0) -
staging/src/k8s.io/apimachinery/pkg/util/sets/set.go
return ret } // Insert adds items to the set. func (s Set[T]) Insert(items ...T) Set[T] { for _, item := range items { s[item] = Empty{} } return s } func Insert[T comparable](set Set[T], items ...T) Set[T] { return set.Insert(items...) } // Delete removes all items from the set. func (s Set[T]) Delete(items ...T) Set[T] { for _, item := range items { delete(s, item) } return s }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Apr 29 19:51:18 UTC 2024 - 5.8K bytes - Viewed (0) -
src/cmd/compile/internal/ir/bitset.go
type bitset8 uint8 func (f *bitset8) set(mask uint8, b bool) { if b { *(*uint8)(f) |= mask } else { *(*uint8)(f) &^= mask } } func (f bitset8) get2(shift uint8) uint8 { return uint8(f>>shift) & 3 } // set2 sets two bits in f using the bottom two bits of b. func (f *bitset8) set2(shift uint8, b uint8) { // Clear old bits. *(*uint8)(f) &^= 3 << shift // Set new bits. *(*uint8)(f) |= uint8(b&3) << shift
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Sep 29 22:03:56 UTC 2022 - 734 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 Jun 16 00:44:34 UTC 2024 - Last Modified: Fri Jun 07 22:18:44 UTC 2024 - 30.4K bytes - Viewed (0)