- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 100 for prea (0.02 sec)
-
src/main/resources/fess_indices/_aws/fess.json
"naši", "napište", "re", "což", "tím", "takže", "svých", "její", "svými", "jste", "aj", "tu", "tedy", "teto", "bylo", "kde", "ke", "pravé", "ji", "nad", "nejsou", "či", "pod", "téma", "mezi", "přes", "ty", "pak", "vám", "ani", "když", "však", "neg", "jsem", "tento", "článku", "články", "aby", "jsme", "před", "pta", "jejich", "byl", "ještě", "až", "bez", "také", "pouze", "první", "vaše", "která", "nás", "nový", "tipy", "pokud", "může", "strana", "jeho", "své", "jiné", "zprávy", "nové", "není", "vás",...
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sat Jun 14 00:36:40 UTC 2025 - 117.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ObjectCountLinkedHashMap.java
} private void setPredecessor(int entry, int pred) { long predMask = (~0L) << 32; links[entry] = (links[entry] & ~predMask) | ((long) pred << 32); } private void setSucceeds(int pred, int succ) { if (pred == ENDPOINT) { firstEntry = succ; } else { setSuccessor(pred, succ); } if (succ == ENDPOINT) { lastEntry = pred; } else { setPredecessor(succ, pred);
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 5.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedHashMultimap.java
} private void succeedsInValueSet( @Nullable ValueEntry<K, V> pred, @Nullable ValueEntry<K, V> succ) { if (pred == null) { firstEntry = succ; } else { pred.successorInValueSet = succ; } if (succ == null) { lastEntry = pred; } else { succ.predecessorInValueSet = pred; } }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 19.1K bytes - Viewed (0) -
.pre-commit-config.yaml
rev: v0.12.10 hooks: - id: ruff args: - --fix - id: ruff-format ci: autofix_commit_msg: 🎨 [pre-commit.ci] Auto format from pre-commit.com hooks
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Mon Aug 25 20:03:02 UTC 2025 - 735 bytes - Viewed (1) -
guava-tests/test/com/google/common/util/concurrent/AtomicDoubleArrayTest.java
for (int i : new int[] {0, SIZE - 1}) { double prev = 0.0; double unused = Math.E + Math.PI; for (double x : VALUES) { assertBitEquals(prev, aa.get(i)); assertFalse(aa.compareAndSet(i, unused, x)); assertBitEquals(prev, aa.get(i)); assertTrue(aa.compareAndSet(i, prev, x)); assertBitEquals(x, aa.get(i)); prev = x; } } }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue May 13 18:46:00 UTC 2025 - 14.6K bytes - Viewed (0) -
src/main/resources/fess_label_it.properties
labels.millisec=millisecondi labels.permissions=Permessi labels.virtual_hosts=Host virtuali labels.virtual_host=Host virtuale labels.label_type=Etichetta labels.file_crawling_button_create=Crea labels.file_crawling_button_create_job=Crea nuovo lavoro labels.web_crawling_configuration=Scansione web labels.web_crawling_title_details=Configurazione scansione web labels.included_urls=URL da includere nella scansione
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Jul 10 04:56:21 UTC 2025 - 43.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
} private void setPredecessor(int entry, int pred) { requirePredecessors()[entry] = pred + 1; } private void setSucceeds(int pred, int succ) { if (pred == ENDPOINT) { firstEntry = succ; } else { setSuccessor(pred, succ); } if (succ == ENDPOINT) { lastEntry = pred; } else { setPredecessor(succ, pred); } } @Override
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Aug 06 14:59:07 UTC 2025 - 9.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeMultiset.java
/** Constructor for the header node. */ AvlNode() { this.elem = null; this.elemCount = 1; } // For discussion of pred() and succ(), see the comment on the pred and succ fields. private AvlNode<E> pred() { return requireNonNull(pred); } private AvlNode<E> succ() { return requireNonNull(succ); }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 33.8K bytes - Viewed (0) -
docs/es/docs/tutorial/security/oauth2-jwt.md
</div> Y copia el resultado a la variable `SECRET_KEY` (no uses la del ejemplo). Crea una variable `ALGORITHM` con el algoritmo usado para firmar el token JWT y configúralo a `"HS256"`. Crea una variable para la expiración del token. Define un Modelo de Pydantic que se usará en el endpoint de token para el response. Crea una función de utilidad para generar un nuevo token de acceso.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 10:49:48 UTC 2025 - 10.9K bytes - Viewed (0) -
docs/es/docs/how-to/custom-docs-ui-assets.md
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Mon Apr 28 18:31:44 UTC 2025 - 8K bytes - Viewed (0)