- Sort Score
- Result 10 results
- Languages All
Results 231 - 240 of 361 for engine (0.03 sec)
-
docs/de/docs/tutorial/security/index.md
Aber der Facebook Login unterstützt OpenID Connect nicht. Es hat seine eigene Variante von OAuth2. ### OpenID (nicht „OpenID Connect“) Es gab auch eine „OpenID“-Spezifikation. Sie versuchte das Gleiche zu lösen wie **OpenID Connect**, basierte aber nicht auf OAuth2. Es handelte sich also um ein komplett zusätzliches System.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 10:49:48 UTC 2025 - 5.1K bytes - Viewed (0) -
docs/de/docs/tutorial/dependencies/sub-dependencies.md
## Zweite Abhängigkeit, „Dependable“ und „Dependant“ Dann können Sie eine weitere Abhängigkeitsfunktion (ein „Dependable“) erstellen, die gleichzeitig eine eigene Abhängigkeit deklariert (also auch ein „Dependant“ ist): {* ../../docs_src/dependencies/tutorial005_an_py310.py hl[13] *} Betrachten wir die deklarierten Parameter:
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Mon Nov 18 02:25:44 UTC 2024 - 4.2K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http/DateFormatting.kt
BROWSER_COMPATIBLE_DATE_FORMATS[i] = format } position.index = 0 result = format.parse(this, position) if (position.index != 0) { // Something was parsed. It's possible the entire string was not consumed but we ignore // that. If any of the BROWSER_COMPATIBLE_DATE_FORMAT_STRINGS ended in "'GMT'" we'd have // to also check that position.getIndex() == value.length() otherwise parsing might have
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Fri Dec 27 13:39:56 UTC 2024 - 4.1K bytes - Viewed (0) -
src/main/java/jcifs/smb1/smb1/SmbComTransactionResponse.java
System.arraycopy(buffer, bufferIndex, txn_buf, bufDataStart + dataDisplacement, dataCount); bufferIndex += dataCount; } /* Check to see if the entire transaction has been * read. If so call the read methods. */ if (!parametersDone && parameterDisplacement + parameterCount == totalParameterCount) { parametersDone = true;
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 07:14:38 UTC 2025 - 5.9K bytes - Viewed (0) -
src/test/java/jcifs/smb/SmbFileFilterTest.java
@DisplayName("accept: name-based filter handles normal, empty, and null names") void accept_nameBasedFilter_handlesEdgeNames(String name, boolean expected) throws Exception { // Arrange: filter that accepts non-empty names ending with .txt SmbFileFilter filter = f -> { String n = f.getName(); return n != null && !n.isEmpty() && n.endsWith(".txt"); }; when(smbFile.getName()).thenReturn(name);
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 5.4K bytes - Viewed (0) -
LICENSE
Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the entire Program remains governed by this License without regard to the additional permissions.
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Apr 23 18:58:53 UTC 2021 - 33.7K 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) -
guava/src/com/google/common/hash/AbstractStreamingHasher.java
import com.google.errorprone.annotations.CanIgnoreReturnValue; import java.nio.ByteBuffer; import java.nio.ByteOrder; /** * A convenience base class for implementors of {@code Hasher}; handles accumulating data until an * entire "chunk" (of implementation-dependent length) is ready to be hashed. * * @author Kevin Bourrillion * @author Dimitris Andreou */ // TODO(kevinb): this class still needs some design-and-document-for-inheritance love
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Dec 21 03:10:51 UTC 2024 - 7.1K bytes - Viewed (0) -
ci/official/utilities/setup.sh
# simple" is MUCH more important than "don't repeat yourself." # -e: abort script if one command fails # -u: error if undefined variable used # -x: log all commands # -o pipefail: entire command fails if pipe fails. watch out for yes | ... # -o history: record shell history # -o allexport: export all functions and variables to be available to subscripts # (affects 'source $TFCI')
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Thu Jan 09 18:37:25 UTC 2025 - 6.2K bytes - Viewed (0)