- Sort Score
- Num 10 results
- Language All
Results 231 - 240 of 323 for SMALL (0.03 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
docs/uk/docs/tutorial/metadata.md
| Параметр | Тип | Опис | |------------|------|-------------| | `title` | `str` | Назва API. | | `summary` | `str` | Короткий підсумок API. <small>Доступно з OpenAPI 3.1.0, FastAPI 0.99.0.</small> | | `description` | `str` | Короткий опис API. Може використовувати Markdown. | | `version` | `string` | Версія API. Це версія Вашого додатка, а не OpenAPI. Наприклад, `2.5.0`. |
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 19 18:27:41 GMT 2026 - 8.8K bytes - Click Count (0) -
src/archive/tar/reader_test.go
chksums []string // CRC32 checksum of files, leave as nil if not checked err error // Expected error to occur }{{ file: "testdata/gnu.tar", headers: []*Header{{ Name: "small.txt", Mode: 0640, Uid: 73025, Gid: 5000, Size: 5, ModTime: time.Unix(1244428340, 0), Typeflag: '0', Uname: "dsymonds", Gname: "eng", Format: FormatGNU,
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Tue Dec 30 15:28:53 GMT 2025 - 47.5K bytes - Click Count (0) -
src/test/java/org/codelibs/fess/api/chat/ChatApiManagerTest.java
createFacetQueryView("timestamp", "1month", "timestamp:[now-1M TO *]", "1year", "timestamp:[now-1y TO *]"), createFacetQueryView("size", "small", "content_length:[0 TO 10000]", "large", "content_length:[10000 TO *]")); final MockHttpServletRequest request = new MockHttpServletRequest(); request.setParameterValues("ex_q",
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Mar 14 01:39:16 GMT 2026 - 35K bytes - Click Count (0) -
docs/de/docs/tutorial/metadata.md
| Parameter | Typ | Beschreibung | |------------|------|-------------| | `title` | `str` | Der Titel der API. | | `summary` | `str` | Eine kurze Zusammenfassung der API. <small>Verfügbar seit OpenAPI 3.1.0, FastAPI 0.99.0.</small> | | `description` | `str` | Eine kurze Beschreibung der API. Kann Markdown verwenden. |
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 19 17:58:09 GMT 2026 - 6.8K bytes - Click Count (0) -
docs/es/docs/tutorial/metadata.md
| Parámetro | Tipo | Descripción | |------------|------|-------------| | `title` | `str` | El título de la API. | | `summary` | `str` | Un resumen corto de la API. <small>Disponible desde OpenAPI 3.1.0, FastAPI 0.99.0.</small> | | `description` | `str` | Una breve descripción de la API. Puede usar Markdown. |
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 19 18:15:55 GMT 2026 - 6.3K bytes - Click Count (0) -
guava/src/com/google/common/collect/Sets.java
* using a {@code LinkedHashSet} instead, at the cost of increased memory footprint, to get * deterministic iteration behavior. * * <p>This method is just a small convenience, either for {@code newHashSet(}{@link Arrays#asList * asList}{@code (...))}, or for creating an empty set then calling {@link Collections#addAll}.Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Feb 23 19:19:10 GMT 2026 - 83K bytes - Click Count (0) -
guava/src/com/google/common/collect/ImmutableBiMap.java
* new ImmutableBiMap.Builder<String, Integer>() * .put("one", 1) * .put("two", 2) * .put("three", 3) * .buildOrThrow(); * } * * <p>For <i>small</i> immutable bimaps, the {@code ImmutableBiMap.of()} methods are even more * convenient. * * <p>By default, a {@code Builder} will generate bimaps that iterate over entries in the order
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Sep 23 17:50:58 GMT 2025 - 22.7K bytes - Click Count (0) -
src/test/java/jcifs/ntlmssp/Type2MessageTest.java
byte[] rawMessage = originalMessage.toByteArray(); // Manually set targetNameOff to a value that makes it too small for context/reserved Type2Message.writeULong(rawMessage, 16, 0); // targetNameOff is at byte 16 // When Type2Message parsedMessage = new Type2Message(rawMessage);
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 38.9K bytes - Click Count (0) -
src/bytes/bytes.go
if j := bytealg.Index(s[i-last:], b[:n]); j >= 0 { return i + j - last } } else { // If bytealg.Index is not available a brute force search is // ~1.5-3x faster than Rabin-Karp since n is small. c0 := b[last] c1 := b[last-1] // There are at least 2 chars to match loop: for ; i < len(s); i++ { if s[i] == c0 && s[i-1] == c1 { for k := 2; k < n; k++ { if s[i-k] != b[last-k] {
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Mar 12 17:56:55 GMT 2026 - 36.3K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/Multimaps.java
} /** * Creates a new {@code Multimap} backed by {@code map}, whose internal value collections are * generated by {@code factory}. Most users should prefer {@link MultimapBuilder}, though a small * number of users will need this method to cover map or collection types that {@link * MultimapBuilder} does not support. *Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Feb 23 19:19:10 GMT 2026 - 86K bytes - Click Count (0)