- Sort Score
- Result 10 results
- Languages All
Results 601 - 610 of 835 for Light (0.93 sec)
-
src/main/java/org/codelibs/fess/mylasta/direction/sponsor/FessMultipartRequestHandler.java
handleFileUploadException(e); } } protected void prepareElementsHash() { // traditional name // #thinking jflute might lazy-loaded be unneeded? because created per request (2024/09/08) elementsAll = new HashMap<>(); elementsText = new HashMap<>(); elementsFile = new HashMap<>(); }
Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Sat Mar 15 06:53:53 UTC 2025 - 18.6K bytes - Viewed (1) -
compat/maven-model-builder/src/main/java/org/apache/maven/model/interpolation/reflection/ClassMap.java
Registered: Sun Dec 28 03:35:09 UTC 2025 - Last Modified: Sat Apr 05 11:52:05 UTC 2025 - 13.5K bytes - Viewed (0) -
src/test/java/jcifs/http/NtlmServletTest.java
* @throws CIFSException */ private void setupMocksForAuth() throws Exception { // This is a simplified way to get a transport context into the servlet. // A more robust solution might involve reflection or modifying the servlet for testability. try { java.lang.reflect.Field transportContextField = NtlmServlet.class.getDeclaredField("transportContext");Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 21 04:51:33 UTC 2025 - 11.5K bytes - Viewed (0) -
docs/contribute/concurrency.md
#### Blocking APIs Blocking APIs are convenient because you get top-to-bottom procedural code without indirection. Network calls work like regular method calls: ask for data and it is returned. If the request fails, you get a stacktrace right where the call was made. Blocking APIs may be inefficient because you hold a thread idle while waiting on the network. Threads are expensive because they have both a memory overhead and a context-switching overhead.
Registered: Fri Dec 26 11:42:13 UTC 2025 - Last Modified: Sun Feb 06 16:35:36 UTC 2022 - 7K bytes - Viewed (0) -
gradlew
# set -- "${ARGS[@]}" "$@" # # but POSIX shell has neither arrays nor command substitution, so instead we # post-process each arg (as a line of input to sed) to backslash-escape any # character that might be a shell metacharacter, then use eval to reverse # that process (while maintaining the separation between arguments), and wrap # the whole thing up as a single "set" statement. #Registered: Fri Dec 26 11:42:13 UTC 2025 - Last Modified: Thu Sep 18 20:55:41 UTC 2025 - 8.4K bytes - Viewed (0) -
docs/en/docs/tutorial/body.md
As it is discouraged, the interactive docs with Swagger UI won't show the documentation for the body when using `GET`, and proxies in the middle might not support it. /// ## Import Pydantic's `BaseModel` { #import-pydantics-basemodel } First, you need to import `BaseModel` from `pydantic`: {* ../../docs_src/body/tutorial001_py310.py hl[2] *}
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Sat Dec 20 15:55:38 UTC 2025 - 6.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
return new CompactLinkedHashSet<>(expectedSize); } private static final int ENDPOINT = -2; // TODO(user): predecessors and successors should be collocated (reducing cache misses). // Might also explore collocating all of [hash, next, predecessor, successor] fields of an // entry in a *single* long[], though that reduces the maximum size of the set by a factor of 2 /**
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Wed Aug 06 14:59:07 UTC 2025 - 9.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
return new CompactLinkedHashSet<>(expectedSize); } private static final int ENDPOINT = -2; // TODO(user): predecessors and successors should be collocated (reducing cache misses). // Might also explore collocating all of [hash, next, predecessor, successor] fields of an // entry in a *single* long[], though that reduces the maximum size of the set by a factor of 2 /**
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Wed Aug 06 14:59:07 UTC 2025 - 9.6K bytes - Viewed (0) -
guava/src/com/google/common/primitives/UnsignedLong.java
return (double) value; } // The top bit is set, which means that the double value is going to come from the top 53 bits. // So we can ignore the bottom 11, except for rounding. We can unsigned-shift right 1, aka // unsigned-divide by 2, and convert that. Then we'll get exactly half of the desired double // value. But in the specific case where the bottom two bits of the original number are 01, we
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Wed Jun 04 13:03:16 UTC 2025 - 8.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Cut.java
} C endpoint() { return endpoint; } @SuppressWarnings("unchecked") // catching CCE @Override public boolean equals(@Nullable Object obj) { if (obj instanceof Cut) { // It might not really be a Cut<C>, but we'll catch a CCE if it's not Cut<C> that = (Cut<C>) obj; try { int compareResult = compareTo(that); return compareResult == 0;
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Sep 22 18:35:44 UTC 2025 - 12.4K bytes - Viewed (0)