- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 2,818 for fork (1.95 sec)
-
CONTRIBUTING.md
main channel of communication for contributors. There are some guidelines which will make applying PRs easier for us: + Create a topic branch from where you want to base your work (this is usually the master branch). Push your changes to a topic branch in your fork of the repository. + Make commits of logical units. + Respect the original code style: by using the same [codestyle][code-style],
Registered: Sun Sep 07 03:35:12 UTC 2025 - Last Modified: Sat Jun 07 09:55:33 UTC 2025 - 4.2K bytes - Viewed (0) -
README.md
### Contributing We welcome contributions! Please: 1. Fork the repository 2. Create a feature branch 3. Make your changes with appropriate tests 4. Run `mvn clean test` to ensure all tests pass 5. Submit a pull request ### License
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 30 09:24:52 UTC 2025 - 6.2K bytes - Viewed (0) -
android/pom.xml
<version>2.36.0</version> </path> </annotationProcessorPaths> <!-- Fork because we need args like add-exports. (But see the TODO above about .mvn/jvm.config.) --> <fork>true</fork> </configuration> <executions> <execution> <id>default-compile</id> <configuration>
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Sep 04 21:35:58 UTC 2025 - 24.3K bytes - Viewed (0) -
pom.xml
<version>2.36.0</version> </path> </annotationProcessorPaths> <!-- Fork because we need args like add-exports. (But see the TODO above about .mvn/jvm.config.) --> <fork>true</fork> </configuration> <executions> <execution> <id>default-compile</id> <configuration>
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Sep 04 21:35:58 UTC 2025 - 23.9K bytes - Viewed (0) -
README.md
- **Switch Expressions** - Optimized implementations using switch expressions for better performance - **Sequenced Collections** - Full support for Java 21 sequenced collections API with dedicated utility methods - **Performance Focused** - Optimized implementations for better runtime performance with reduced memory allocation
Registered: Fri Sep 05 20:58:11 UTC 2025 - Last Modified: Sun Aug 31 02:56:02 UTC 2025 - 12.7K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Futures.java
* * <p>"In the order that they complete" means, for practical purposes, about what you would * expect, but there are some subtleties. First, we do guarantee that, if the output future at * index n is done, the output future at index n-1 is also done. (But as usual with futures, some * listeners for future n may complete before some for future n-1.) However, it is possible, if
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 64.3K bytes - Viewed (0) -
docs/en/docs/tutorial/request-form-models.md
/// ## Pydantic Models for Forms { #pydantic-models-for-forms } You just need to declare a **Pydantic model** with the fields you want to receive as **form fields**, and then declare the parameter as `Form`: {* ../../docs_src/request_form_models/tutorial001_an_py39.py hl[9:11,15] *} **FastAPI** will **extract** the data for **each field** from the **form data** in the request and give you the Pydantic model you defined.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 2.2K bytes - Viewed (0) -
docs/en/docs/deployment/docker.md
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 29.5K bytes - Viewed (1) -
android/guava/src/com/google/common/graph/Graphs.java
if (graph.isDirected()) { // Note: works for both directed and undirected graphs, but we only use in the directed case. for (N node : graph.nodes()) { for (N reachableNode : reachableNodes(graph, node)) { transitiveClosure.putEdge(node, reachableNode); } } } else { // An optimization for the undirected case: for every node B reachable from node A,
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 22.7K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graphs.java
if (graph.isDirected()) { // Note: works for both directed and undirected graphs, but we only use in the directed case. for (N node : graph.nodes()) { for (N reachableNode : reachableNodes(graph, node)) { transitiveClosure.putEdge(node, reachableNode); } } } else { // An optimization for the undirected case: for every node B reachable from node A,
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 23.3K bytes - Viewed (0)