- Sort Score
- Result 10 results
- Languages All
Results 461 - 470 of 525 for seasca (0.29 sec)
-
docs/em/docs/tutorial/query-params-str-validations.md
{!> ../../docs_src/query_params_str_validations/tutorial003_py310.py!} ``` //// ## 🚮 🥔 🧬 👆 💪 🔬 <abbr title="A regular expression, regex or regexp is a sequence of characters that define a search pattern for strings.">🥔 🧬</abbr> 👈 🔢 🔜 🏏: //// tab | 🐍 3️⃣.6️⃣ & 🔛 ```Python hl_lines="11" {!> ../../docs_src/query_params_str_validations/tutorial004.py!} ``` ////
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 11.7K bytes - Viewed (0) -
docs/ja/docs/project-generation.md
### spaCyとFastAPIを使用した機械学習モデル - 機能 * **spaCy** のNERモデルの統合。 * **Azure Cognitive Search** のリクエストフォーマットを搭載。 * **リリース可能な** UvicornとGunicornを使用したPythonウェブサーバ。 * **Azure DevOps** のKubernetes (AKS) CI/CD デプロイを搭載。 * **多言語** プロジェクトのために、セットアップ時に言語を容易に選択可能 (spaCyに組み込まれている言語の中から)。
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Mon Jul 29 23:35:07 UTC 2024 - 7.1K bytes - Viewed (0) -
docs/en/docs/alternatives.md
It is used by many companies including Mozilla, Red Hat and Eventbrite. It was one of the first examples of **automatic API documentation**, and this was specifically one of the first ideas that inspired "the search for" **FastAPI**. /// note Django REST Framework was created by Tom Christie. The same creator of Starlette and Uvicorn, on which **FastAPI** is based. /// /// check | "Inspired **FastAPI** to"
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 20 19:20:23 UTC 2024 - 23.2K bytes - Viewed (0) -
src/test/java/org/codelibs/fess/it/search/SearchApiTests.java
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, * either express or implied. See the License for the specific language * governing permissions and limitations under the License. */ package org.codelibs.fess.it.search; import static org.junit.jupiter.api.Assertions.assertEquals; import static org.junit.jupiter.api.Assertions.assertFalse; import static org.junit.jupiter.api.Assertions.assertTrue; import java.util.HashMap;
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Thu Feb 22 01:37:57 UTC 2024 - 18.6K bytes - Viewed (0) -
src/bufio/bufio.go
// [Reader.ReadBytes] or ReadString instead. // ReadSlice returns err != nil if and only if line does not end in delim. func (b *Reader) ReadSlice(delim byte) (line []byte, err error) { s := 0 // search start index for { // Search buffer. if i := bytes.IndexByte(b.buf[b.r+s:b.w], delim); i >= 0 { i += s line = b.buf[b.r : b.r+i+1] b.r += i + 1 break } // Pending error? if b.err != nil {
Registered: Tue Nov 05 11:13:11 UTC 2024 - Last Modified: Thu Oct 12 14:39:08 UTC 2023 - 21.8K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Longs.java
* i, i + target.length)} contains exactly the same elements as {@code target}. * * @param array the array to search for the sequence {@code target} * @param target the array to search for as a sub-sequence of {@code array} */ public static int indexOf(long[] array, long[] target) { checkNotNull(array, "array"); checkNotNull(target, "target");
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 25 18:05:56 UTC 2024 - 29.3K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Longs.java
* i, i + target.length)} contains exactly the same elements as {@code target}. * * @param array the array to search for the sequence {@code target} * @param target the array to search for as a sub-sequence of {@code array} */ public static int indexOf(long[] array, long[] target) { checkNotNull(array, "array"); checkNotNull(target, "target");
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 17 15:52:18 UTC 2024 - 29K bytes - Viewed (0) -
docs/recipes.md
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Fri Feb 18 08:52:22 UTC 2022 - 40.2K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
*/ private static void selectInPlace(int required, double[] array, int from, int to) { // If we are looking for the least element in the range, we can just do a linear search for it. // (We will hit this whenever we are doing quantile interpolation: our first selection finds // the lower value, our second one finds the upper value by looking for the next least element.)
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 29.9K bytes - Viewed (0) -
src/main/resources/fess_label_fr.properties
labels.menu_plugin = Plugin labels.menu_storage = Stockage labels.sidebar.placeholder_search = Recherche... labels.sidebar.menu = MENU labels.footer.copyright=©2024 <a href="https://github.com/codelibs">Projet CodeLibs</a>. labels.search = Recherche labels.similar_doc_result_status = Des résultats similaires sont affichés. labels.search_result_status = Résultats <b>{2}</b><span class="hidden-phone"> -</span> <b>{3}</b> sur <b>{1}</b> pour <b>{0}</b>
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Fri Mar 22 11:58:34 UTC 2024 - 46.6K bytes - Viewed (0)