- Sort Score
- Num 10 results
- Language All
Results 161 - 170 of 268 for healing (0.04 seconds)
-
docs/pt/docs/_llm-test.md
A única regra rígida para títulos é que o LLM deixe a parte do hash dentro de chaves inalterada, o que garante que os links não quebrem. Veja a seção `### Headings` no prompt geral em `scripts/translate.py`. Para algumas instruções específicas do idioma, veja, por exemplo, a seção `### Headings` em `docs/de/llm-prompt.md`. //// ## Termos usados na documentação { #terms-used-in-the-docs } //// tab | Teste * você * seuCreated: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 19 18:20:43 GMT 2026 - 12.1K bytes - Click Count (0) -
android/guava-tests/benchmark/com/google/common/math/LongMathRoundingBenchmark.java
/** * Benchmarks for the rounding methods of {@code LongMath}. * * @author Louis Wasserman */ @NullUnmarked public class LongMathRoundingBenchmark { @Param({"DOWN", "UP", "FLOOR", "CEILING", "HALF_EVEN", "HALF_UP", "HALF_DOWN"}) RoundingMode mode; private static final long[] positive = new long[ARRAY_SIZE]; private static final long[] nonzero = new long[ARRAY_SIZE];Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 2.6K bytes - Click Count (0) -
guava-tests/benchmark/com/google/common/math/IntMathRoundingBenchmark.java
nonzero[i] = randomNonZeroBigInteger(Integer.SIZE - 2).intValue(); ints[i] = RANDOM_SOURCE.nextInt(); } } @Param({"DOWN", "UP", "FLOOR", "CEILING", "HALF_EVEN", "HALF_UP", "HALF_DOWN"}) RoundingMode mode; @Benchmark int log2(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK;
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 2.6K bytes - Click Count (0) -
docs/zh-hant/docs/_llm-test.md
Hello again. //// //// tab | 資訊 標題唯一的硬性規則是保留花括號中的雜湊片段不變,以確保連結不會失效。 請見 `scripts/translate.py` 中通用提示的 `### Headings` 小節。 關於語言特定的說明,參見例如 `docs/de/llm-prompt.md` 中的 `### Headings` 小節。 //// ## 文件中使用的術語 { #terms-used-in-the-docs } //// tab | 測試 * you * your * e.g. * etc. * `foo` as an `int` * `bar` as a `str` * `baz` as a `list` * 教學 - 使用者指南Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Fri Mar 20 17:05:38 GMT 2026 - 10K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/helper/MarkdownRenderer.java
htmlRenderer = HtmlRenderer.builder().extensions(extensions).softbreak("<br/>").build(); // Configure OWASP HTML Sanitizer with allowed tags htmlSanitizer = new HtmlPolicyBuilder() // Headings .allowElements("h1", "h2", "h3", "h4", "h5", "h6") // Text formatting .allowElements("p", "br", "hr") .allowElements("strong", "em", "b", "i", "u", "s", "del")Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Mon Jan 12 10:32:40 GMT 2026 - 5.3K bytes - Click Count (0) -
AI_POLICY.md
3. **A relationship, not a transaction.** We view community PRs as an important part of our relationship with the Gradle community. We hope contributors will learn from the review process, stay engaged, and continue helping us build Gradle. ## In summary We welcome AI-assisted contributions from people who understand what they're submitting and are ready to collaborate on it.
Created: Wed Apr 01 11:36:16 GMT 2026 - Last Modified: Fri Mar 27 18:43:39 GMT 2026 - 3.1K bytes - Click Count (0) -
android/guava-tests/benchmark/com/google/common/math/QuantilesBenchmark.java
} } } private double[] dataset(int i) { // We must test on a fresh clone of the dataset each time. Doing sorts and quickselects on a // dataset which is already sorted or partially sorted is cheating. return datasets[i & 0xFF].clone(); } @Benchmark double median(int reps) { double dummy = 0.0; for (int i = 0; i < reps; i++) { dummy += algorithm.singleQuantile(1, 2, dataset(i));Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed May 14 19:40:47 GMT 2025 - 3.2K bytes - Click Count (0) -
guava-tests/benchmark/com/google/common/math/QuantilesBenchmark.java
} } } private double[] dataset(int i) { // We must test on a fresh clone of the dataset each time. Doing sorts and quickselects on a // dataset which is already sorted or partially sorted is cheating. return datasets[i & 0xFF].clone(); } @Benchmark double median(int reps) { double dummy = 0.0; for (int i = 0; i < reps; i++) { dummy += algorithm.singleQuantile(1, 2, dataset(i));Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed May 14 19:40:47 GMT 2025 - 3.2K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/SortedMultisets.java
} @Override public @Nullable E floor(@ParametricNullness E e) { return getElementOrNull(multiset().headMultiset(e, CLOSED).lastEntry()); } @Override public @Nullable E ceiling(@ParametricNullness E e) { return getElementOrNull(multiset().tailMultiset(e, CLOSED).firstEntry()); } @Override public @Nullable E higher(@ParametricNullness E e) {Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Aug 07 16:05:33 GMT 2025 - 5.5K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/TreeMultiset.java
return (node == null) ? 0 : node.height; } private @Nullable AvlNode<E> ceiling( Comparator<? super E> comparator, @ParametricNullness E e) { int cmp = comparator.compare(e, getElement()); if (cmp < 0) { return (left == null) ? this : MoreObjects.firstNonNull(left.ceiling(comparator, e), this); } else if (cmp == 0) { return this; } else {
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 16 13:11:08 GMT 2026 - 34K bytes - Click Count (0)