- Sort Score
- Result 10 results
- Languages All
Results 1881 - 1890 of 3,591 for Game (0.03 sec)
-
src/main/java/jcifs/ntlmssp/Type1Message.java
} /** * Returns the supplied workstation name. * * @return A <code>String</code> containing the supplied workstation name. */ public String getSuppliedWorkstation() { return this.suppliedWorkstation; } /** * Sets the supplied workstation name for this message. * * @param suppliedWorkstation
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 07:14:38 UTC 2025 - 7.8K bytes - Viewed (0) -
src/test/java/jcifs/smb/StaticJAASConfigurationTest.java
@ValueSource(strings = { "", "svc/******@****.***" }) @DisplayName("Name parameter is ignored (null/empty/arbitrary)") void nameParameter_isIgnoredAndDoesNotAffectResult(String name) { // Arrange StaticJAASConfiguration cfg = new StaticJAASConfiguration(); // Act AppConfigurationEntry[] entries = cfg.getAppConfigurationEntry(name); // Assert
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 7K bytes - Viewed (0) -
docs/en/docs/how-to/custom-request-and-route.md
After that, all of the processing logic is the same. But because of our changes in `GzipRequest.body`, the request body will be automatically decompressed when it is loaded by **FastAPI** when needed. ## Accessing the request body in an exception handler { #accessing-the-request-body-in-an-exception-handler } /// tip
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 4.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/Multiset.java
* exactly one entry for each distinct element in the multiset (thus it always has the same size * as the {@link #elementSet}). The order of the elements in the element set is unspecified. * * <p>The entry set is backed by the same data as the multiset, so any change to either is * immediately reflected in the other. However, multiset changes may or may not be reflected in
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue Jul 08 18:32:10 UTC 2025 - 20.9K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java
* * <p>This method is used when testing iterators without a known ordering. We poll the target * iterator's next element and pass it to the reference iterator through this method so it can * return the same element. This enables the assertion to pass and the reference iterator to * properly update its state. */ void promoteToNext(E e) { if (nextElements.remove(e)) { nextElements.push(e);
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed May 14 19:40:47 UTC 2025 - 20.8K bytes - Viewed (0) -
docs/uk/docs/tutorial/response-model.md
```Python hl_lines="3 5" { "name": "Bar", "description": "The bartenders", "price": 62, "tax": 20.2 } ``` вони будуть включені у відповідь. #### Дані з тими самими значеннями, що й типові Якщо дані мають ті самі значення, що й типові, як у елемента з item_id `baz`: ```Python hl_lines="3 5-6" { "name": "Baz", "description": None, "price": 50.2,
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Tue Jun 24 19:14:01 UTC 2025 - 24.8K bytes - Viewed (0) -
docs/ru/docs/tutorial/response-model.md
/// {* ../../docs_src/response_model/tutorial005_py310.py hl[29,35] *} /// tip | Подсказка При помощи кода `{"name","description"}` создается объект множества (`set`) с двумя строковыми значениями. Того же самого можно достичь используя `set(["name", "description"])`. /// #### Что если использовать `list` вместо `set`?
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Mon Nov 18 02:25:44 UTC 2024 - 27.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
/** * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting * and ending with the same node. * * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1). */ public static <N> boolean hasCycle(Graph<N> graph) { int numEdges = graph.edges().size();
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 22.7K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graphs.java
/** * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting * and ending with the same node. * * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1). */ public static <N> boolean hasCycle(Graph<N> graph) { int numEdges = graph.edges().size();
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 23.3K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/opensearch/config/bsentity/dbmeta/PathMappingDbm.java
import org.dbflute.Entity; import org.dbflute.dbmeta.AbstractDBMeta; import org.dbflute.dbmeta.info.ColumnInfo; import org.dbflute.dbmeta.info.UniqueInfo; import org.dbflute.dbmeta.name.TableSqlName; import org.dbflute.dbmeta.property.PropertyGateway; import org.dbflute.dbway.DBDef; import org.dbflute.util.DfTypeUtil; /** * The DBM of PathMapping. * * @author ESFlute (using FreeGen) */
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Jul 17 08:28:31 UTC 2025 - 11.4K bytes - Viewed (0)