- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 280 for Structures (0.19 sec)
-
docs/en/docs/features.md
* Because pydantic data structures are just instances of classes you define; auto-completion, linting, mypy and your intuition should all work properly with your validated data. * Validate **complex structures**: * Use of hierarchical Pydantic models, Python `typing`’s `List` and `Dict`, etc.
Plain Text - Registered: Sun Apr 28 07:19:10 GMT 2024 - Last Modified: Fri Mar 22 01:42:11 GMT 2024 - 9.3K bytes - Viewed (0) -
src/cmd/cgo/godefs.go
fmt.Fprintf(&buf, "\n") override := make(map[string]string) // Allow source file to specify override mappings. // For example, the socket data structures refer // to in_addr and in_addr6 structs but we want to be // able to treat them as byte arrays, so the godefs // inputs in package syscall say // // // +godefs map struct_in_addr [4]byte
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Thu Sep 08 14:33:35 GMT 2022 - 4.5K bytes - Viewed (0) -
cmd/last-minute.go
l.LastSec++ } } // LastMinuteHistogram keeps track of last minute sizes added. type LastMinuteHistogram [sizeLastElemMarker]lastMinuteLatency // Merge safely merges two LastMinuteHistogram structures into one func (l LastMinuteHistogram) Merge(o LastMinuteHistogram) (merged LastMinuteHistogram) { for i := range l { merged[i] = l[i].merge(o[i]) } return merged }
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Wed Jul 05 17:40:45 GMT 2023 - 4.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBiMap.java
Arrays.fill(result, oldSize, newSize, ABSENT); return result; } @Override public int size() { return size; } /** * Ensures that all of the internal structures in the HashBiMap are ready for this many elements. */ private void ensureCapacity(int minCapacity) { if (nextInBucketKToV.length < minCapacity) { int oldCapacity = nextInBucketKToV.length;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 06 16:06:58 GMT 2023 - 36.4K bytes - Viewed (0) -
okhttp-testing-support/src/main/kotlin/okhttp3/TestUtilJvm.kt
} /** * Okio buffers are internally implemented as a linked list of arrays. Usually this implementation * detail is invisible to the caller, but subtle use of certain APIs may depend on these internal * structures. * * We make such subtle calls in [okhttp3.internal.ws.MessageInflater] because we try to read a * compressed stream that is terminated in a web socket frame even though the DEFLATE stream is * not terminated.
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Thu Apr 11 22:09:35 GMT 2024 - 4.3K bytes - Viewed (0) -
tensorflow/c/eager/gradient_checker.cc
// Get theta shape and store in theta_dims. int num_dims = TF_NumDims(theta_tensor); vector<int64_t> theta_dims(num_dims); GetDims(theta_tensor, theta_dims.data()); // Initialize auxilary data structures. vector<float> thetaPlus_data(num_elems); vector<float> thetaMinus_data(num_elems); AbstractTensorHandle* f_outputs[1]; // Numerical Grad Check for (int i = 0; i < num_elems; i++) {
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Thu Feb 15 09:49:45 GMT 2024 - 7.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
return set; } /** * Creates a {@code CompactLinkedHashSet} instance, with a high enough "initial capacity" that it * <i>should</i> hold {@code expectedSize} elements without rebuilding internal data structures. * * @param expectedSize the number of elements you expect to add to the returned set * @return a new, empty {@code CompactLinkedHashSet} with enough capacity to hold {@code
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashMap.java
} /** * Creates a {@code CompactLinkedHashMap} instance, with a high enough "initial capacity" that it * <i>should</i> hold {@code expectedSize} elements without rebuilding internal data structures. * * @param expectedSize the number of elements you expect to add to the returned set * @return a new, empty {@code CompactLinkedHashMap} with enough capacity to hold {@code
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 10.2K bytes - Viewed (0) -
docs/fr/docs/features.md
* Parce que les structures de données de pydantic consistent seulement en une instance de classe que vous définissez; l'auto-complétion, le linting, mypy et votre intuition devrait être largement suffisante pour valider vos données. * Valide les **structures complexes**: * Utilise les modèles hiérarchique de Pydantic, le `typage` Python pour les `Lists`, `Dict`, etc.
Plain Text - Registered: Sun Apr 28 07:19:10 GMT 2024 - Last Modified: Thu Apr 18 19:53:19 GMT 2024 - 11.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
} /** * Creates a {@code CompactLinkedHashMap} instance, with a high enough "initial capacity" that it * <i>should</i> hold {@code expectedSize} elements without rebuilding internal data structures. * * @param expectedSize the number of elements you expect to add to the returned set * @return a new, empty {@code CompactLinkedHashMap} with enough capacity to hold {@code
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K bytes - Viewed (0)