- Sort Score
- Result 10 results
- Languages All
Results 191 - 200 of 606 for mezery (0.06 sec)
-
CONTRIBUTING.md
Code Contributions ------------------ Get working code on a personal branch with tests passing before you submit a PR: ``` ./gradlew clean check ``` Please make every effort to follow existing conventions and style in order to keep the code as readable as possible. Contribute code changes through GitHub by forking the repository and sending a pull request. We squash all pull requests on merge.
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Tue Feb 14 08:26:50 UTC 2023 - 2K bytes - Viewed (0) -
docs/contribute/contributing.md
Code Contributions ------------------ Get working code on a personal branch with tests passing before you submit a PR: ``` ./gradlew clean check ``` Please make every effort to follow existing conventions and style in order to keep the code as readable as possible. Contribute code changes through GitHub by forking the repository and sending a pull request. We squash all pull requests on merge.
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Tue Feb 14 08:26:50 UTC 2023 - 2K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/FeatureSpecificTestSuiteBuilder.java
@SuppressWarnings("unchecked") protected B self() { return (B) this; } // Test Data private @Nullable G subjectGenerator; // Gets run before every test. private Runnable setUp; // Gets run at the conclusion of every test. private Runnable tearDown; @CanIgnoreReturnValue protected B usingGenerator(G subjectGenerator) { this.subjectGenerator = subjectGenerator; return self();
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 10.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/ComparisonChain.java
* .result(); * } * } * * <p>The value of this expression will have the same sign as the <i>first nonzero</i> comparison * result in the chain, or will be zero if every comparison result was zero. * * <p><b>Note:</b> {@code ComparisonChain} instances are <b>immutable</b>. For this utility to work * correctly, calls must be chained as illustrated above. *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 11.1K bytes - Viewed (0) -
guava/src/com/google/common/escape/ArrayBasedEscaperMap.java
* proportional to the highest valued character that has a replacement. For example a replacement * map containing the single character '{@literal \}u1000' will require approximately 16K of memory. * As such sharing this data structure between escaper instances is the primary goal of this class. * * @author David Beaumont * @since 15.0 */ @GwtCompatible public final class ArrayBasedEscaperMap { /**
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Dec 28 01:26:26 UTC 2024 - 3.2K bytes - Viewed (0) -
ci/official/envs/ci_default
# ============================================================================== # Note: this file gets sourced in utilities/setup.sh, which has "set -u" # (error on undefined variables). This ensures that (a) every TFCI variable # has an explicit default value, and (b) no script can accidentally use a # variable that doesn't exist. Please keep this list in alphabetical order. # # Find usage in scripts with e.g.: # cd ci/official
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Mon Jan 27 22:53:36 UTC 2025 - 2.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
public static <N> ImmutableGraph<N> transitiveClosure(Graph<N> graph) { ImmutableGraph.Builder<N> transitiveClosure = GraphBuilder.from(graph).allowsSelfLoops(true).<N>immutable(); // Every node is, at a minimum, reachable from itself. Since the resulting transitive closure // will have no isolated nodes, we can skip adding nodes explicitly and let putEdge() do it. if (graph.isDirected()) {
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
public static <N> ImmutableGraph<N> transitiveClosure(Graph<N> graph) { ImmutableGraph.Builder<N> transitiveClosure = GraphBuilder.from(graph).allowsSelfLoops(true).<N>immutable(); // Every node is, at a minimum, reachable from itself. Since the resulting transitive closure // will have no isolated nodes, we can skip adding nodes explicitly and let putEdge() do it. if (graph.isDirected()) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 23.3K bytes - Viewed (0) -
.github/ISSUE_TEMPLATE/10_contributor_bug_report.yml
description: Create a report to help us improve labels: [ "a:bug", "to-triage" ] assignees: [ ] body: - type: markdown attributes: value: | Please follow the instructions below. We receive dozens of issues every week, so to stay productive, we will close issues that don't provide enough information. If you need help with Gradle or have a usage question, please reach [our community](http://help.gradle.org/) instead of creating an issue.
Registered: Wed Sep 10 11:36:15 UTC 2025 - Last Modified: Mon Sep 09 14:48:49 UTC 2024 - 3K bytes - Viewed (1) -
.github/DISCUSSION_TEMPLATE/questions.yml
labels: [question] body: - type: markdown attributes: value: | Thanks for your interest in FastAPI! 🚀 Please follow these instructions, fill every question, and do every step. 🙏 I'm asking this because answering questions and solving problems in GitHub is what consumes most of the time.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Thu Aug 03 15:59:41 UTC 2023 - 5.8K bytes - Viewed (0)