- Sort Score
- Result 10 results
- Languages All
Results 1221 - 1230 of 1,359 for hash (0.07 sec)
-
impl/maven-core/src/main/java/org/apache/maven/exception/DefaultExceptionHandler.java
} String message = System.lineSeparator() + "The project " + (result.getProjectId().isEmpty() ? "" : result.getProjectId() + " ") + "(" + result.getPomFile() + ") has " + children.size() + " error" + (children.size() == 1 ? "" : "s"); return new ExceptionSummary(null, message, null, children); }
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 10.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableList.java
* order. The sorting algorithm used is stable, so elements that compare as equal will stay in the * order in which they appear in the input. * * <p>If your data has no duplicates, or you wish to deduplicate elements, use {@code * ImmutableSortedSet.copyOf(elements)}; if you want a {@code List} you can use its {@code * asList()} view. *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Aug 16 19:14:45 UTC 2024 - 30.5K bytes - Viewed (0) -
cmd/sftp-server_test.go
} } func (s *TestSuiteIAM) SFTPValidLDAPLoginWithPassword(c *check) { ctx, cancel := context.WithTimeout(context.Background(), testDefaultTimeout) defer cancel() // we need to do this so that the user has a policy before authentication. // ldap user accounts without policies are denied access in sftp. policy := "mypolicy" policyBytes := []byte(`{ "Version": "2012-10-17", "Statement": [ {
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri Jun 28 09:06:25 UTC 2024 - 8.3K bytes - Viewed (0) -
api/maven-api-core/src/main/java/org/apache/maven/api/package-info.java
* that selects a particular version and downloads the artifact in the local repository. * There are two sub-interfaces, {@link org.apache.maven.api.DownloadedArtifact} which is used when * an artifact has been resolved</p> * * <p>{@link org.apache.maven.api.DependencyCoordinates} instances are used to express a dependency. * They are a {@code ArtifactCoordinates} completed with information about how the artifact will be used:
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Tue Aug 27 21:13:34 UTC 2024 - 6.7K bytes - Viewed (0) -
compat/maven-compat/src/main/java/org/apache/maven/repository/legacy/resolver/DefaultLegacyArtifactCollector.java
boolean updateScope = false; Artifact farthestArtifact = farthest.getArtifact(); Artifact nearestArtifact = nearest.getArtifact(); /* farthest is runtime and nearest has lower priority, change to runtime */ if (Artifact.SCOPE_RUNTIME.equals(farthestArtifact.getScope()) && (Artifact.SCOPE_TEST.equals(nearestArtifact.getScope())
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 36.7K bytes - Viewed (0) -
licenses/sigs.k8s.io/yaml/LICENSE
designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual,
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Tue Oct 31 19:53:28 UTC 2023 - 15.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/TraverserTest.java
* a * }</pre> */ private static final SuccessorsFunction<Character> SINGLE_ROOT = createSingleRootGraph(); /** * A graph that is not a tree (for example, it has two antiparallel edge between {@code e} and * {@code f} and thus has a cycle) but is a valid input to {@link Traverser#forTree} when starting * e.g. at node {@code a} (all edges without an arrow are directed facing downwards): * * <pre>{@code
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 47.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/TraverserTest.java
* a * }</pre> */ private static final SuccessorsFunction<Character> SINGLE_ROOT = createSingleRootGraph(); /** * A graph that is not a tree (for example, it has two antiparallel edge between {@code e} and * {@code f} and thus has a cycle) but is a valid input to {@link Traverser#forTree} when starting * e.g. at node {@code a} (all edges without an arrow are directed facing downwards): * * <pre>{@code
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 47.5K bytes - Viewed (0) -
src/main/resources/fess_message_de.properties
# ---------------------------------------------------------- # Lasta Taglib # ------------ errors.header=<ul class="has-error"> errors.footer=</ul> errors.prefix=<li><i class="fa fa-exclamation-circle"></i> errors.suffix=</li> # ----------------------------------------------------------
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Tue Oct 29 15:01:03 UTC 2019 - 11.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/RangeMap.java
// TODO(cpovirk): Consider documenting that IAE on the various methods that can throw it. RangeMap<K, V> subRangeMap(Range<K> range); /** * Returns {@code true} if {@code obj} is another {@code RangeMap} that has an equivalent {@link * #asMapOfRanges()}. */ @Override boolean equals(@CheckForNull Object o); /** Returns {@code asMapOfRanges().hashCode()}. */ @Override int hashCode();
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 7.7K bytes - Viewed (0)