- Sort Score
- Result 10 results
- Languages All
Results 321 - 330 of 814 for doInit (0.06 sec)
-
android/guava-testlib/test/com/google/common/testing/GcFinalizationTest.java
@Override protected void finalize() { finalizerRan.countDown(); } }); // Don't copy this into your own test! // Use e.g. awaitClear or await(CountDownLatch) instead. GcFinalization.awaitFullGc(); // If this test turns out to be flaky, add a second call to awaitFullGc()
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 17 02:42:09 UTC 2024 - 7.9K bytes - Viewed (0) -
src/main/java/jcifs/internal/smb1/com/SmbComOpenAndX.java
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Sun Jul 01 13:12:10 UTC 2018 - 7K bytes - Viewed (0) -
compat/maven-compat/src/main/java/org/apache/maven/artifact/repository/metadata/AbstractRepositoryMetadata.java
String version = metadata.getVersion(); if (Artifact.LATEST_VERSION.equals(version) || Artifact.RELEASE_VERSION.equals(version)) { // meta-versions are not valid <version/> values...don't write them. metadata.setVersion(null); } if (changed || !metadataFile.exists()) { metadataFile.getParentFile().mkdirs();
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 7K bytes - Viewed (0) -
compat/maven-compat/src/main/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolver.java
final List<MetadataGraphEdge> ins = graph.getIncidentEdges(v); final MetadataGraphEdge edge = cleanEdges(v, ins, requestedScope); if (edge == null) { // no edges - don't need this vertex anymore if (entry.equals(v)) { // unless it's an entry point. // currently processing the entry point - it should not have any entry incident edges
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 8.2K bytes - Viewed (0) -
docs/en/docs/tutorial/header-params.md
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 5.6K bytes - Viewed (0) -
impl/maven-core/src/main/java/org/apache/maven/lifecycle/DefaultLifecycles.java
} lifecyclesPrinted = true; } // If people are going to make their own lifecycles then we need to tell people how to namespace them correctly // so that they don't interfere with internally defined lifecycles. Map<String, Lifecycle> phaseToLifecycleMap = new HashMap<>(); for (Lifecycle lifecycle : getLifeCycles()) {
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 6.6K bytes - Viewed (0) -
okhttp-testing-support/src/main/kotlin/okhttp3/OkHttpClientTestRule.kt
} } } private fun ensureAllTaskQueuesIdle() { val entryTime = System.nanoTime() for (queue in TaskRunner.INSTANCE.activeQueues()) { // We wait at most 1 second, so we don't ever turn multiple lost threads into // a test timeout failure. val waitTime = (entryTime + 1_000_000_000L - System.nanoTime()) if (!queue.idleLatch().await(waitTime, TimeUnit.NANOSECONDS)) {
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 10.5K bytes - Viewed (0) -
src/main/java/jcifs/internal/smb1/SMB1SigningDigest.java
* This constructor used to instance a SigningDigest object for * signing/verifying SMB using kerberos session key. * The MAC Key = concat(Session Key, Digest of Challenge); * Because of Kerberos Authentication don't have challenge, * The MAC Key = Session Key * * @param macSigningKey * The MAC key used to sign or verify SMB. */ public SMB1SigningDigest ( byte[] macSigningKey ) {
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Sun Aug 05 09:45:59 UTC 2018 - 10.6K bytes - Viewed (0) -
docs/en/docs/tutorial/security/get-current-user.md
Do you want to just have a `str`? Or just a `dict`? Or a database class model instance directly? It all works the same way. You actually don't have users that log in to your application but robots, bots, or other systems, that have just an access token? Again, it all works the same.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 7.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/Collections2.java
} void calculateNextPermutation() { int j = findNextJ(); if (j == -1) { nextPermutation = null; return; } /* * requireNonNull is safe because we don't clear nextPermutation until we're done calling this * method. */ requireNonNull(nextPermutation); int l = findNextL(j); Collections.swap(nextPermutation, j, l);
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 18 20:24:49 UTC 2024 - 23.1K bytes - Viewed (0)