- Sort Score
- Num 10 results
- Language All
Results 111 - 120 of 1,056 for seen (0.02 seconds)
-
docs/de/docs/deployment/docker.md
Sie können mehr darüber in der [Docker-Dokumentation für Shell und Exec Form lesen](https://docs.docker.com/reference/dockerfile/#shell-and-exec-form).
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 19 17:58:09 GMT 2026 - 32.4K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/graph/GraphMutationTest.java
public void undirectedGraph() { testGraphMutation(GraphBuilder.undirected()); } private static void testGraphMutation(GraphBuilder<? super Integer> graphBuilder) { Random gen = new Random(42); // Fixed seed so test results are deterministic. for (int trial = 0; trial < NUM_TRIALS; ++trial) { MutableGraph<Integer> graph = graphBuilder.allowsSelfLoops(true).build(); assertThat(graph.nodes()).isEmpty();
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 4.2K bytes - Click Count (0) -
guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
long seed = insertRandomly(elements, q); while (!q.isEmpty()) { elements.add(0, q.pollLast()); } assertEqualsUsingSeed(seed, expected, elements); } } public void testCorrectOrdering_randomAccess() { long seed = new Random().nextLong(); Random random = new Random(seed); PriorityQueue<Integer> control = new PriorityQueue<>();
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 16 13:11:08 GMT 2026 - 36.2K bytes - Click Count (0) -
android/guava/src/com/google/common/hash/Hashing.java
hashFunctions[0] = Murmur3_128HashFunction.GOOD_FAST_HASH_128; int seed = GOOD_FAST_HASH_SEED; for (int i = 1; i < hashFunctionsNeeded; i++) { seed += 1500450271; // a prime; shouldn't matter hashFunctions[i] = murmur3_128(seed); } return new ConcatenatedHashFunction(hashFunctions); } /**
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Jul 17 15:26:41 GMT 2025 - 29.8K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
long seed = insertRandomly(elements, q); while (!q.isEmpty()) { elements.add(0, q.pollLast()); } assertEqualsUsingSeed(seed, expected, elements); } } public void testCorrectOrdering_randomAccess() { long seed = new Random().nextLong(); Random random = new Random(seed); PriorityQueue<Integer> control = new PriorityQueue<>();
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 16 13:11:08 GMT 2026 - 36.2K bytes - Click Count (0) -
guava-tests/test/com/google/common/graph/NetworkMutationTest.java
testNetworkMutation(NetworkBuilder.undirected()); } private static void testNetworkMutation(NetworkBuilder<? super Integer, Object> networkBuilder) { Random gen = new Random(42); // Fixed seed so test results are deterministic. for (int trial = 0; trial < NUM_TRIALS; ++trial) { MutableNetwork<Integer, Object> network = networkBuilder.allowsParallelEdges(true).allowsSelfLoops(true).build();
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 4.6K bytes - Click Count (0) -
src/archive/tar/reader.go
// io.Seeker, but calling Seek always returns an error and performs // no action. Thus, we try an innocent seek to the current position // to see if Seek is really supported. pos1, err := sr.Seek(0, io.SeekCurrent) if pos1 >= 0 && err == nil { // Seek seems supported, so perform the real Seek. pos2, err := sr.Seek(n-1, io.SeekCurrent) if pos2 < 0 || err != nil { return err
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Tue Oct 07 19:46:36 GMT 2025 - 26.9K bytes - Click Count (0) -
cmd/test-utils_test.go
func randomizeBytes(s []byte, seed int64) []byte { // special value -1 means no explicit seeding. if seed != -1 { rand.Seed(seed) } n := len(s) var j int for i := 0; i < n-1; i++ { j = i + rand.Intn(n-i) s[i], s[j] = s[j], s[i] } return s } func TestToErrIsNil(t *testing.T) { if toObjectErr(nil) != nil {
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 77K bytes - Click Count (0) -
tensorflow/c/eager/c_api.h
// things like the available devices, resource manager etc. // TFE_Context must outlive all tensor handles created using it. In other // words, TFE_DeleteContext() must be called after all tensor handles have // been deleted (with TFE_DeleteTensorHandle). // // TODO(ashankar): Merge with TF_Session? typedef struct TFE_Context TFE_Context; TF_CAPI_EXPORT extern TFE_Context* TFE_NewContext(
Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Thu Apr 27 21:07:00 GMT 2023 - 22.8K bytes - Click Count (0) -
docs/de/docs/tutorial/first-steps.md
```JSON {"message": "Hello World"} ``` ### Interaktive API-Dokumentation { #interactive-api-docs } Gehen Sie als Nächstes auf [http://127.0.0.1:8000/docs](http://127.0.0.1:8000/docs). Sie werden die automatisch erzeugte, interaktive API-Dokumentation sehen (bereitgestellt durch [Swagger UI](https://github.com/swagger-api/swagger-ui)):Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 19 17:58:09 GMT 2026 - 14.9K bytes - Click Count (0)