- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 755 for npattern (0.1 sec)
-
src/net/http/pattern.go
// than the other. // // Precedence is defined by two rules: // 1. Patterns with a host win over patterns without a host. // 2. Patterns whose method and path is more specific win. One pattern is more // specific than another if the second matches all the (method, path) pairs // of the first and more. // // If rule 1 doesn't apply, then two patterns conflict if their relationship
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 16:36:30 UTC 2024 - 15.3K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/repositories/resolver/ResourceVersionLister.java
return Pattern.compile(acceptNamePattern); } private Pattern toControlRegexPattern(String pattern) { pattern = pattern.replaceAll("\\.", "\\\\."); // Creates a control regexp pattern where extra revision tokens _must_ have the same value as the original one String acceptNamePattern = pattern.replaceFirst("\\[revision]", "(.+)") .replaceAll("\\[revision]", "\1");
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Dec 11 13:37:56 UTC 2023 - 10.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/tf2xla/transforms/xla_legalize_tf.cc
// 3) Op specific patterns over patterns with MatchAnyOpTypeTag. // 4) Order of patterns in `RewritePatternSet`. // Add TF->HLO legalization patterns. PopulateLegalizeTfPatterns(context, &legalize_lower_patterns); // Add TF->TF lowering patterns. TF::PopulateTFLoweringBeforeHLOPatterns(context, &legalize_lower_patterns); if (tf2xla_fallback_device_type && prefer_tf2xla) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 28 21:49:50 UTC 2024 - 10.2K bytes - Viewed (0) -
subprojects/core-api/src/main/java/org/gradle/api/artifacts/repositories/IvyArtifactRepository.java
* * Patterns added in this way will be in addition to any layout-based patterns added via {@link #setUrl(Object)}. * * @param pattern The artifact pattern. */ void artifactPattern(String pattern); /** * Adds an independent pattern that will be used to locate ivy files in this repository. *
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue May 02 20:32:11 UTC 2023 - 9.9K bytes - Viewed (0) -
src/cmd/go/internal/work/build.go
preceded by a package pattern and an equal sign, which restricts the use of that argument list to the building of packages matching that pattern (see 'go help packages' for a description of package patterns). Without a pattern, the argument list applies only to the packages named on the command line. The flags may be repeated with different patterns in order to specify different arguments for
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 21 17:22:59 UTC 2024 - 33.2K bytes - Viewed (0) -
platforms/jvm/testing-jvm/src/test/groovy/org/gradle/api/tasks/testing/TestTest.groovy
import static org.gradle.util.internal.WrapUtil.toSet class TestTest extends AbstractConventionTaskTest { static final String TEST_PATTERN_1 = "pattern1" static final String TEST_PATTERN_2 = "pattern2" static final String TEST_PATTERN_3 = "pattern3" private File classesDir private File resultsDir private File binResultsDir private File reportDir
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Sep 18 20:52:40 UTC 2023 - 11.1K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/internal/bisect/bisect.go
} bits = 0 case '+', '-': if c == '+' && result == false { // Have already seen a -. Should be - from here on. return nil, &parseError{"invalid pattern syntax (+ after -): " + pattern} } if i > 0 { n := (i - start) * wid if n > 64 { return nil, &parseError{"pattern bits too long: " + pattern} } if n <= 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 22 18:11:19 UTC 2023 - 15.4K bytes - Viewed (0) -
src/html/template/template.go
// It accepts a list of glob patterns. // (Note that most file names serve as glob patterns matching only themselves.) func (t *Template) ParseFS(fs fs.FS, patterns ...string) (*Template, error) { return parseFS(t, fs, patterns) } func parseFS(t *Template, fsys fs.FS, patterns []string) (*Template, error) { var filenames []string for _, pattern := range patterns { list, err := fs.Glob(fsys, pattern) if err != nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 21 21:00:46 UTC 2024 - 17K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/stablehlo/passes/quantization_patterns.h
} } return success(); } }; // Populates common patterns that are usually compute heavy or memory bound. void PopulateCommonQuantizationPatterns( MLIRContext& ctx, RewritePatternSet& patterns, bool enable_per_channel_quantized_weight); // Populates conversion patterns for all quantizable ops, including // ops that are not compute-heavy and data movement ops.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 10.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/lower_tf.td
// input is a scalar or not. Restrict pattern to ranked inputs so that input to // the Sum op is also ranked. // TODO(hinsu): Support scalar inputs by introducing reshape to 1D. def NonScalarType : Type<Neg<HasAnyRankOfPred<[0]>>, "Non scalar type">; def LowerSoftmaxCrossEntropyWithLogitsOp : Pattern< (TF_SoftmaxCrossEntropyWithLogitsOp AnyRankedTensor:$features,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 04 13:30:42 UTC 2024 - 24.7K bytes - Viewed (0)