- Sort Score
- Result 10 results
- Languages All
Results 851 - 860 of 1,713 for caso (0.07 sec)
-
impl/maven-core/src/main/java/org/apache/maven/graph/FilteredProjectDependencyGraph.java
* Assume we have all projects {@code a, b, c} while active are {@code a, c} and relation among all projects * is {@code a -> b -> c}. This method handles well the case for transitive list. But, for non-transitive we need * to "pull in" transitive dependencies of eliminated projects, as for case above, the properly filtered list would * be {@code a -> c}. * <p>Registered: Sun Dec 28 03:35:09 UTC 2025 - Last Modified: Thu Jun 19 16:34:39 UTC 2025 - 6.4K bytes - Viewed (0) -
docs/en/docs/tutorial/background-tasks.md
Create a function to be run as the background task. It is just a standard function that can receive parameters. It can be an `async def` or normal `def` function, **FastAPI** will know how to handle it correctly. In this case, the task function will write to a file (simulating sending an email). And as the write operation doesn't use `async` and `await`, we define the function with normal `def`:
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Wed Dec 17 20:41:43 UTC 2025 - 4.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardNetwork.java
this.isDirected = builder.directed; this.allowsParallelEdges = builder.allowsParallelEdges; this.allowsSelfLoops = builder.allowsSelfLoops; this.nodeOrder = builder.nodeOrder.cast(); this.edgeOrder = builder.edgeOrder.cast(); // Prefer the heavier "MapRetrievalCache" for nodes if lookup is expensive. This optimizes // methods that access the same node(s) repeatedly, such as Graphs.removeEdgesConnecting().Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sat Dec 21 03:10:51 UTC 2024 - 6.9K bytes - Viewed (0) -
guava/src/com/google/common/graph/StandardNetwork.java
this.isDirected = builder.directed; this.allowsParallelEdges = builder.allowsParallelEdges; this.allowsSelfLoops = builder.allowsSelfLoops; this.nodeOrder = builder.nodeOrder.cast(); this.edgeOrder = builder.edgeOrder.cast(); // Prefer the heavier "MapRetrievalCache" for nodes if lookup is expensive. This optimizes // methods that access the same node(s) repeatedly, such as Graphs.removeEdgesConnecting().Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sat Dec 21 03:10:51 UTC 2024 - 6.9K bytes - Viewed (0) -
cmd/generic-handlers_test.go
r.Header = test.Header r.URL = test.URL h := setRequestValidityMiddleware(okHandler) h.ServeHTTP(w, r) switch { case test.ShouldFail && w.Code == http.StatusOK: t.Errorf("Test %d: should fail but status code is HTTP %d", i, w.Code) case !test.ShouldFail && w.Code != http.StatusOK: t.Errorf("Test %d: should not fail but status code is HTTP %d and not 200 OK", i, w.Code) } } }
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 6.2K bytes - Viewed (0) -
cmd/config-dir.go
defaultMinioConfigDir = ".minio" // Directory contains below files/directories for HTTPS configuration. certsDir = "certs" // Directory contains all CA certificates other than system defaults for HTTPS. certsCADir = "CAs" // Public certificate file for HTTPS. publicCertFile = "public.crt" // Private key file for HTTPS. privateKeyFile = "private.key" ) // ConfigDir - points to a user set directory.
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Sun Jan 02 17:15:06 UTC 2022 - 3K bytes - Viewed (0) -
internal/grid/grid.go
ctx context.Context } func (w *writerWrapper) Write(p []byte) (n int, err error) { buf := GetByteBufferCap(len(p)) buf = buf[:len(p)] copy(buf, p) select { case w.ch <- buf: return len(p), nil case <-w.ctx.Done(): return 0, context.Cause(w.ctx) } } // WriterToChannel will return an io.Writer that writes to the given channel.
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Sun Mar 30 00:56:02 UTC 2025 - 7K bytes - Viewed (0) -
docs/en/docs/deployment/concepts.md
Of course, there are some cases where there's no problem in running the previous steps multiple times, in that case, it's a lot easier to handle. /// tip Also, keep in mind that depending on your setup, in some cases you **might not even need any previous steps** before starting your application. In that case, you wouldn't have to worry about any of this. 🤷 ///
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 18.6K bytes - Viewed (1) -
docs/en/docs/python-types.md
Calling this program outputs: ``` John Doe ``` The function does the following: * Takes a `first_name` and `last_name`. * Converts the first letter of each one to upper case with `title()`. * <abbr title="Puts them together, as one. With the contents of one after the other.">Concatenates</abbr> them with a space in the middle. {* ../../docs_src/python_types/tutorial001_py39.py hl[2] *}
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Wed Dec 17 20:41:43 UTC 2025 - 15.6K bytes - Viewed (0) -
.github/pull_request_template.md
you have to acknowledge this by using the following check-box. - [ ] I hereby declare this contribution to be licenced under the [Apache License Version 2.0, January 2004](http://www.apache.org/licenses/LICENSE-2.0) - [ ] In any other case, please file an [Apache Individual Contributor License Agreement](https://www.apache.org/licenses/icla.pdf).
Registered: Sun Dec 28 03:35:09 UTC 2025 - Last Modified: Fri Jun 06 14:30:05 UTC 2025 - 1.5K bytes - Viewed (0)