- Sort Score
- Num 10 results
- Language All
Results 261 - 270 of 294 for dpgraph (0.24 seconds)
-
build-tools-internal/src/main/java/org/elasticsearch/gradle/internal/info/GlobalBuildInfoPlugin.java
assertMinimumCompilerVersion(minimumCompilerVersion); // Print global build info header just before task execution project.getGradle().getTaskGraph().whenReady(graph -> logGlobalBuildInfo()); } private String formatJavaVendorDetails(JvmInstallationMetadata runtimeJdkMetaData) { JvmVendor vendor = runtimeJdkMetaData.getVendor();
Created: Wed Apr 08 16:19:15 GMT 2026 - Last Modified: Tue Aug 17 10:02:58 GMT 2021 - 18.1K bytes - Click Count (0) -
compat/maven-plugin-api/src/main/java/org/apache/maven/plugin/descriptor/PluginDescriptor.java
import org.codehaus.plexus.classworlds.realm.ClassRealm; import org.codehaus.plexus.component.repository.ComponentDescriptor; import org.codehaus.plexus.component.repository.ComponentSetDescriptor; import org.eclipse.aether.graph.DependencyNode; /** */ public class PluginDescriptor extends ComponentSetDescriptor implements Cloneable { private static final String LIFECYCLE_DESCRIPTOR = "META-INF/maven/lifecycle.xml";Created: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Fri Jun 06 14:28:57 GMT 2025 - 16.2K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/util/concurrent/CycleDetectingLockFactoryTest.java
lock02 = factory3.newReentrantLock(OtherOrder.SECOND); lock03 = factory3.newReentrantLock(OtherOrder.THIRD); } // In the unittest, create each ordered factory with its own set of lock // graph nodes (as opposed to using the static per-Enum map) to avoid // conflicts across different test runs. private <E extends Enum<E>> CycleDetectingLockFactory.WithExplicitOrdering<E> newInstanceWithExplicitOrdering(
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 16 22:45:21 GMT 2026 - 16.3K bytes - Click Count (0) -
guava-tests/test/com/google/common/util/concurrent/CycleDetectingLockFactoryTest.java
lock02 = factory3.newReentrantLock(OtherOrder.SECOND); lock03 = factory3.newReentrantLock(OtherOrder.THIRD); } // In the unittest, create each ordered factory with its own set of lock // graph nodes (as opposed to using the static per-Enum map) to avoid // conflicts across different test runs. private <E extends Enum<E>> CycleDetectingLockFactory.WithExplicitOrdering<E> newInstanceWithExplicitOrdering(
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 16 22:45:21 GMT 2026 - 16.3K bytes - Click Count (0) -
docs/tr/docs/advanced/behind-a-proxy.md
Çünkü uygulamamız proxy arkasında `/api/v1` path prefix'i ile çalışmaktadır; frontend'in OpenAPI şemasını `/api/v1/openapi.json` üzerinden çekmesi gerekir. ```mermaid graph LR browser("Browser") proxy["Proxy on http://0.0.0.0:9999/api/v1/app"] server["Server on http://127.0.0.1:8000/app"] browser --> proxy proxy --> server ``` /// tip | İpucu
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Fri Mar 20 07:53:17 GMT 2026 - 16.5K bytes - Click Count (0) -
android/guava/src/com/google/common/base/FinalizableReferenceQueue.java
* Finalizer directly with no problems. * * If this library is loaded in an application class loader, it's important that Finalizer not * have a strong reference back to the class loader. Otherwise, you could have a graph like this: * * Finalizer Thread runs instance of -> Finalizer.class loaded by -> Application class loader * which loaded -> ReferenceMap.class which has a static -> FinalizableReferenceQueue instance *
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 16 19:26:59 GMT 2026 - 15.8K bytes - Click Count (0) -
okhttp-idna-mapping-table/src/main/resources/okhttp3/internal/idna/IdnaMappingTable.txt
10788 ; mapped ; AB66 # 14.0 MODIFIER LETTER SMALL DZ DIGRAPH WITH RETROFLEX HOOK 10789 ; mapped ; 02A5 # 14.0 MODIFIER LETTER SMALL DZ DIGRAPH WITH CURL 1078A ; mapped ; 02A4 # 14.0 MODIFIER LETTER SMALL DEZH DIGRAPH
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Sat Feb 10 11:25:47 GMT 2024 - 854.1K bytes - Click Count (0) -
android/guava/src/com/google/common/io/Files.java
import com.google.common.base.Predicate; import com.google.common.base.Splitter; import com.google.common.collect.ImmutableList; import com.google.common.collect.ImmutableSet; import com.google.common.graph.SuccessorsFunction; import com.google.common.graph.Traverser; import com.google.common.hash.HashCode; import com.google.common.hash.HashFunction; import com.google.errorprone.annotations.CanIgnoreReturnValue;
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Jan 05 22:13:21 GMT 2026 - 32.8K bytes - Click Count (0) -
docs/SMB3_IMPLEMENTATION_PLAN.md
- Integrate with `CIFSContext` for witness support - Modify `SmbTransport` for failover handling - Update `DfsResolver` for witness-aware resolution --- ## Implementation Dependencies ```mermaid graph TD A[SMB3 Leases] --> B[Directory Leasing] A --> C[Persistent Handles] C --> D[Multi-Channel] D --> E[RDMA Support] C --> F[Witness Protocol] D --> F ``` ## Testing StrategyCreated: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 16 02:53:50 GMT 2025 - 10.7K bytes - Click Count (0) -
docs/de/docs/features.md
* Selbst Abhängigkeiten können Abhängigkeiten haben, woraus eine Hierarchie oder ein **„Graph“ von Abhängigkeiten** entsteht. * Alles **automatisch gehandhabt** durch das Framework.
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 19 17:58:09 GMT 2026 - 10.3K bytes - Click Count (0)