- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 1,267 for PRE (0.03 sec)
-
.pre-commit-config.yaml
rev: v0.2.0 hooks: - id: ruff args: - --fix - id: ruff-format ci: autofix_commit_msg: 🎨 [pre-commit.ci] Auto format from pre-commit.com hooks
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Tue Mar 26 16:56:53 UTC 2024 - 737 bytes - Viewed (0) -
src/cmd/go/testdata/mod/example.com_retract_self_prerelease_v1.9.1-pre.txt
latest version and all other release version. A pre-release version higher than the highest release version is still available, and that should be matched by @latest. -- .mod -- module example.com/retract/self/prerelease go 1.15 -- .info -- {"Version":"v1.9.1-pre"} -- p.go --
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Aug 26 21:17:01 UTC 2020 - 369 bytes - Viewed (0) -
src/cmd/go/testdata/mod/example.com_split-incompatible_v2.1.0-pre+incompatible.txt
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 17 13:54:10 UTC 2021 - 347 bytes - Viewed (0) -
platforms/core-runtime/files/src/test/groovy/org/gradle/api/internal/file/pattern/HasPrefixAndSuffixPatternStepTest.groovy
!step.matches("Pre-Suf") !step.matches("") !step.matches("something else") } def "matches name case insensitive"() { def step = new HasPrefixAndSuffixPatternStep("pre", "suf", CASE_INSENSITIVE) expect: step.matches("pre-suf") step.matches("PRE-SUF") step.matches("Pre-Suf") !step.matches("PRE") !step.matches("SUF")
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 08:55:52 UTC 2023 - 2.1K bytes - Viewed (0) -
src/go/doc/comment/testdata/list7.txt
- ❦ - $ ❦ - $ ❦ ❦ 1! List. ❦ -- html -- <p>Almost list markers (but not quite): <pre>- </pre> <p>❦ <pre>- $ </pre> <p>❦ <pre>- $ </pre> <p>❦ <p>❦ <pre>1! List. </pre>
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:31:48 UTC 2022 - 565 bytes - Viewed (0) -
doc/go1.17_spec.html
<pre> func(int) int </pre> <p> These two invocations are equivalent: </p> <pre> t.Mv(7) f := t.Mv; f(7) </pre> <p> Similarly, the expression </p> <pre> pt.Mp </pre> <p> yields a function value of type </p> <pre> func(float32) float32 </pre> <p>
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 11 20:22:45 UTC 2024 - 211.6K bytes - Viewed (0) -
src/cmd/go/testdata/script/mod_tidy_convergence_loop.txt
# | # + --- z # # The module dependency graph of m initially contains w.1 (and, by extension, # y.2-pre and z.2-pre). This is an arbitrary point in the cycle of possible # configurations. # # w.1 requires y.2-pre and z.2-pre # x.1 requires z.2-pre and w.2-pre # y.1 requires w.2-pre and x.2-pre # z.1 requires x.2-pre and y.2-pre # # At each point, exactly one missing package can be resolved by adding a
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Jun 03 21:13:11 UTC 2023 - 9.2K bytes - Viewed (0) -
src/main/webapp/WEB-INF/view/common/help_ja.jsp
たとえば、Fess または CodeLibs を含むドキュメントを検索するには次のように入力します。 <pre>Fess OR CodeLibs</pre> </dd> <dt>ワイルドカード</dt> <dd> 検索語内で 1 文字または複数文字のワイルドカードをサポートしています。 ? は 1 文字のワイルドカードとして指定でき、* は複数文字のワイルドカードとして指定することができます。 <pre>Fess*</pre> または <pre>Fe?s</pre> 検索語の先頭文字では利用できません。 </dd> <dt>範囲検索</dt> <dd> 範囲検索はフィールド値の範囲を指定することでその条件にマッチするドキュメントを検索します。 範囲の境界値を含める場合は [] を利用して、含めない場合は {} を利用します。
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Mon Feb 26 14:01:31 UTC 2018 - 3.4K bytes - Viewed (0) -
src/main/webapp/WEB-INF/view/common/help.jsp
a query. AND operator matches documents where both terms exist anywhere in the text of a single document. <pre>Fess AND CodeLibs</pre> </dd> </dd> <dt>OR</dt> <dd> OR operator matches documents where any terms exist anywhere in the text of a single document. <pre>Fess OR CodeLibs</pre> </dd> <dt>Wildcard</dt> <dd> single and multiple character wildcard searches within single terms
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Mon Feb 26 14:01:31 UTC 2018 - 2.4K bytes - Viewed (0) -
maven-compat/src/test/java/org/apache/maven/repository/legacy/resolver/conflict/OldestConflictResolverTest.java
* <pre> * a:1.0 * a:2.0 * </pre> */ @Test void testEqual() { ResolutionNode a1n = createResolutionNode(a1); ResolutionNode a2n = createResolutionNode(a2); assertResolveConflict(a1n, a1n, a2n); } /** * Tests that <code>a:1.0</code> wins in the scenario: * <pre> * a:2.0 * a:1.0 * </pre>
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Thu Apr 25 05:46:50 UTC 2024 - 2.8K bytes - Viewed (0)