- Sort Score
- Num 10 results
- Language All
Results 1121 - 1130 of 1,810 for cause (0.02 seconds)
-
src/test/java/org/codelibs/fess/mylasta/direction/FessConfigImplTest.java
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Fri Mar 13 23:01:26 GMT 2026 - 12.9K bytes - Click Count (0) -
compat/maven-compat/src/test/java/org/apache/maven/repository/legacy/DefaultWagonManagerTest.java
wagon.clearExpectedContent(); wagon.addExpectedContent("path", "lower-case-checksum"); wagon.addExpectedContent("path.sha1", "2a25dc564a3b34f68237fc849066cbc7bb7a36a1"); wagonManager.getArtifact(artifact, repo, null, false); wagon.clearExpectedContent(); wagon.addExpectedContent("path", "upper-case-checksum");Created: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Fri Jun 06 14:28:57 GMT 2025 - 12.9K bytes - Click Count (0) -
docs/multi-user/README.md
- `aws:groups` - This is an array containing the group names, this value would point to group mappings for the user, use `jwt:groups` in case of OpenID connect and `ldap:groups` in case of AD/LDAP. ## Explore Further
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Tue Aug 12 18:20:36 GMT 2025 - 8.2K bytes - Click Count (0) -
guava/src/com/google/common/collect/TopKSelector.java
* #offer} and a call to {@link #topK}, with O(k) memory. In comparison, quickselect has the same * asymptotics but requires O(n) memory, and a {@code PriorityQueue} implementation takes O(n log * k). In benchmarks, this implementation performs at least as well as either implementation, and * degrades more gracefully for worst-case input. *Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sun Aug 31 13:15:26 GMT 2025 - 11.4K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/base/AbstractIteratorTest.java
private int rep; @Override public @Nullable Integer computeNext() { switch (rep++) { case 0: return 0; case 1: return 1; case 2: return endOfData(); default: throw new AssertionError("Should not have been invoked again"); } }Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Mar 13 13:01:07 GMT 2026 - 5.7K bytes - Click Count (0) -
src/main/java/jcifs/internal/smb1/trans2/Trans2QueryFSInformationResponse.java
AllocInfo inf; switch (this.informationLevel) { case FileSystemInformation.SMB_INFO_ALLOCATION: inf = new SmbInfoAllocation(); break; case FileSystemInformation.FS_SIZE_INFO: inf = new FileFsSizeInformation(); break; case FileSystemInformation.FS_FULL_SIZE_INFO: inf = new FileFsFullSizeInformation();Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 5K bytes - Click Count (0) -
impl/maven-cli/src/test/java/org/apache/maven/cling/invoker/LookupInvokerLoggingTest.java
// Simulate what MavenSimpleConfiguration does String value = switch (level) { case DEBUG -> "debug"; case INFO -> "info"; case ERROR -> "error"; }; System.setProperty(Constants.MAVEN_LOGGER_DEFAULT_LOG_LEVEL, value); } @OverrideCreated: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Wed Oct 08 21:10:33 GMT 2025 - 6.4K bytes - Click Count (0) -
impl/maven-core/src/main/java/org/apache/maven/graph/FilteredProjectDependencyGraph.java
* to "pull in" transitive dependencies of eliminated projects, as for case above, the properly filtered list would * be {@code a -> c}. * <p> * Original code would falsely report {@code a} project as "without dependencies", basically would lose link due * filtering. This causes build ordering issues in concurrent builders.
Created: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Thu Jun 19 16:34:39 GMT 2025 - 6.4K bytes - Click Count (0) -
docs/fr/docs/tutorial/query-params.md
``` ou ``` http://127.0.0.1:8000/items/foo?short=on ``` ou ``` http://127.0.0.1:8000/items/foo?short=yes ``` ou n'importe quelle autre variation de casse (tout en majuscules, uniquement la première lettre en majuscule, etc.), votre fonction verra le paramètre `short` avec une valeur `bool` à `True`. Sinon la valeur sera à `False`.
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 19 18:37:13 GMT 2026 - 5.3K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/NetworkConnections.java
/** * Returns the node that is adjacent to the origin node along {@code edge}. * * <p>In the directed case, {@code edge} is assumed to be an outgoing edge. */ N adjacentNode(E edge); /** * Remove {@code edge} from the set of incoming edges. Returns the former predecessor node. * * <p>In the undirected case, returns {@code null} if {@code isSelfLoop} is true. */ @CanIgnoreReturnValueCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sun Dec 22 03:38:46 GMT 2024 - 2.3K bytes - Click Count (0)