- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 51 for arrayT (0.14 sec)
-
staging/src/k8s.io/apiextensions-apiserver/pkg/apiserver/schema/cel/compilation_test.go
expectedSetCost: 62, }, { name: "boolean array with all", schemaGenerator: genArrayWithRule("boolean", "self.all(x, true)"), expectedCalcCost: 1887437, setMaxElements: 5, expectedSetCost: 17, }, // all array-of-array tests should have the same expected cost along the same expression, // since arrays-of-arrays are serialized the same in minimized form regardless of item type
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu May 16 20:13:14 UTC 2024 - 51.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/SetsTest.java
} private static byte[] prepended(byte b, byte[] array) { byte[] out = new byte[array.length + 1]; out[0] = b; System.arraycopy(array, 0, out, 1, array.length); return out; } @GwtIncompatible // java.nio.ByteBuffer private static byte[] toByteArray(int h) { return ByteBuffer.allocate(4).putInt(h).array(); } public void testNewEnumSet_empty() {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 17 15:27:58 UTC 2024 - 49.2K bytes - Viewed (0) -
src/reflect/type.go
// Make an array type. var iarray any = [1]unsafe.Pointer{} prototype := *(**arrayType)(unsafe.Pointer(&iarray)) array := *prototype array.TFlag = typ.TFlag & abi.TFlagRegularMemory array.Str = resolveReflectName(newName(s, "", false, false)) array.Hash = fnv1(typ.Hash, '[') for n := uint32(length); n > 0; n >>= 8 { array.Hash = fnv1(array.Hash, byte(n)) } array.Hash = fnv1(array.Hash, ']') array.Elem = typ
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 85.5K bytes - Viewed (0) -
src/go/types/expr.go
} n := check.indexedElts(e.Elts, utyp.elem, utyp.len) // If we have an array of unknown length (usually [...]T arrays, but also // arrays [n]T where n is invalid) set the length now that we know it and // record the type for the array (usually done by check.typ which is not // called for [...]T). We handle [...]T arrays and arrays with invalid // length the same here because it makes sense to "guess" the length for
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 02:09:54 UTC 2024 - 49.7K bytes - Viewed (0) -
src/cmd/compile/internal/types2/expr.go
} n := check.indexedElts(e.ElemList, utyp.elem, utyp.len) // If we have an array of unknown length (usually [...]T arrays, but also // arrays [n]T where n is invalid) set the length now that we know it and // record the type for the array (usually done by check.typ which is not // called for [...]T). We handle [...]T arrays and arrays with invalid // length the same here because it makes sense to "guess" the length for
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 02:09:54 UTC 2024 - 51.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedMap.java
// there's a way around creating the separate sortedKeys array, and if we're allocating // one array of size n, we might as well allocate two -- to say nothing of the allocation // done in Arrays.sort. for (int i = 0; i < size; i++) { // We're careful to put only K instances in. if (i > 0 && comparator.compare((K) sortedKeys[i - 1], (K) sortedKeys[i]) == 0) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 53K bytes - Viewed (0) -
staging/src/k8s.io/apiextensions-apiserver/test/integration/ratcheting_test.go
"change minItems on array to 10, invalidates previous object", map[string]interface{}{ "properties": map[string]interface{}{ "array": map[string]interface{}{ "minItems": 10, }, }, }}, applyPatchOperation{ "keep invalid field `array` unchanged, add new field with ratcheting", myCRDV1Beta1, myCRDInstanceName, map[string]interface{}{
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue May 28 08:48:22 UTC 2024 - 59.5K bytes - Viewed (0) -
src/runtime/map.go
// // If more than 8 keys hash to a bucket, we chain on // extra buckets. // // When the hashtable grows, we allocate a new array // of buckets twice as big. Buckets are incrementally // copied from the old bucket array to the new bucket array. // // Map iterators walk through the array of buckets and // return the keys in walk order (bucket #, then overflow // chain order, then bucket index). To maintain iteration
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 57.6K bytes - Viewed (0) -
src/runtime/mbitmap.go
// // Iteration through this type implements the tiling algorithm described at the // top of this file. type typePointers struct { // elem is the address of the current array element of type typ being iterated over. // Objects that are not arrays are treated as single-element arrays, in which case // this value does not change. elem uintptr // addr is the address the iterator is currently working from and describes
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:18:55 UTC 2024 - 60K bytes - Viewed (0) -
platforms/core-runtime/base-services/src/main/java/org/gradle/internal/service/DefaultServiceRegistry.java
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed May 29 06:47:40 UTC 2024 - 53.3K bytes - Viewed (0)