- Sort Score
- Result 10 results
- Languages All
Results 3201 - 3210 of 6,664 for four (0.3 sec)
-
docs/de/docs/tutorial/schema-extra-example.md
Wenn Sie das tun, werden die Beispiele Teil des internen **JSON-Schemas** für diese Body-Daten. <abbr title="26.08.2023">Während dies geschrieben wird</abbr>, unterstützt Swagger UI, das für die Anzeige der Dokumentations-Benutzeroberfläche zuständige Tool, jedoch nicht die Anzeige mehrerer Beispiele für die Daten in **JSON Schema**. Aber lesen Sie unten für einen Workaround weiter. ### OpenAPI-spezifische `examples`
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sat Nov 09 16:39:20 UTC 2024 - 10.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/base/PredicatesTest.java
* Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ package com.google.common.base; import static com.google.common.base.CharMatcher.whitespace;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 32.2K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/hash/HashFunctionBenchmark.java
* * <p>Parameters for the benchmark are: * * <ul> * <li>size: The length of the byte array to hash. * <li>hashFunctionEnum: The {@link HashFunction} to use for hashing. * </ul> * * @author Kurt Alfred Kluever */ @NullUnmarked public class HashFunctionBenchmark { // Use a statically configured random instance for all of the benchmarks private static final Random random = new Random(42);
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 2.4K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/CycleDetectingLockFactoryBenchmark.java
lockAndUnlockNested(detectingLocks, reps); } private static void lockAndUnlockNested(Lock[] locks, int reps) { for (int i = 0; i < reps; i++) { for (int j = 0; j < locks.length; j++) { locks[j].lock(); } for (int j = locks.length - 1; j >= 0; j--) { locks[j].unlock(); } } }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 2.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/SortedListsTest.java
return; } throw new AssertionError(); } public void testWithoutDups() { for (KeyPresentBehavior presentBehavior : KeyPresentBehavior.values()) { for (KeyAbsentBehavior absentBehavior : KeyAbsentBehavior.values()) { for (int key = 0; key <= 10; key++) { assertModelAgrees( LIST_WITHOUT_DUPS, key,Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 4K bytes - Viewed (0) -
fess-crawler/src/main/java/org/codelibs/fess/crawler/helper/impl/MimeTypeHelperImpl.java
public class MimeTypeHelperImpl implements MimeTypeHelper { /** The resource name for the MIME types configuration file. */ protected static final String MIME_TYPES_RESOURCE_NAME = "/org/codelibs/fess/crawler/mime/tika-mimetypes.xml"; /** The MimeTypes instance for detecting MIME types. */ protected MimeTypes mimeTypes; /** Whether to use the filename for MIME type detection. */ protected boolean useFilename = false;Registered: Sun Sep 21 03:50:09 UTC 2025 - Last Modified: Sun Jul 06 02:13:03 UTC 2025 - 6.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
if (graph.isDirected()) { // Note: works for both directed and undirected graphs, but we only use in the directed case. for (N node : graph.nodes()) { for (N reachableNode : reachableNodes(graph, node)) { transitiveClosure.putEdge(node, reachableNode); } } } else { // An optimization for the undirected case: for every node B reachable from node A,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
if (graph.isDirected()) { // Note: works for both directed and undirected graphs, but we only use in the directed case. for (N node : graph.nodes()) { for (N reachableNode : reachableNodes(graph, node)) { transitiveClosure.putEdge(node, reachableNode); } } } else { // An optimization for the undirected case: for every node B reachable from node A,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/suggest/index/writer/SuggestWriter.java
import org.opensearch.transport.client.Client; /** * Interface for writing suggest items. */ public interface SuggestWriter { /** * Writes the given suggest items to the specified index. * * @param client the client used to interact with the search engine * @param settings the settings for the suggest featureRegistered: Fri Sep 19 09:08:11 UTC 2025 - Last Modified: Fri Jul 04 14:00:23 UTC 2025 - 4.1K bytes - Viewed (0) -
callbacks/create.go
if !db.Statement.Unscoped { for _, c := range db.Statement.Schema.CreateClauses { db.Statement.AddClause(c) } } if supportReturning && len(db.Statement.Schema.FieldsWithDefaultDBValue) > 0 { if _, ok := db.Statement.Clauses["RETURNING"]; !ok { fromColumns := make([]clause.Column, 0, len(db.Statement.Schema.FieldsWithDefaultDBValue))Registered: Sun Sep 07 09:35:13 UTC 2025 - Last Modified: Tue Jul 29 11:06:13 UTC 2025 - 13K bytes - Viewed (0)