- Sort Score
- Result 10 results
- Languages All
Results 1 - 7 of 7 for newReset (0.1 sec)
-
build-logic/cleanup/src/main/kotlin/gradlebuild/cleanup/services/DaemonTracker.kt
@get:Inject abstract val execOperations: ExecOperations private val suspiciousDaemons = ConcurrentHashMap<String, MutableSet<String>>() private val daemonPids = ConcurrentHashMap.newKeySet<String>() private val logger = Logging.getLogger(DaemonTracker::class.java) override fun close() { logger.lifecycle("Cleaning up daemons...") cleanUpDaemons() }
Registered: Wed Nov 06 11:36:14 UTC 2024 - Last Modified: Mon Jan 08 12:45:57 UTC 2024 - 3.4K bytes - Viewed (0) -
compat/maven-compat/src/main/java/org/apache/maven/repository/legacy/resolver/conflict/NewestConflictResolver.java
/** * Resolves conflicting artifacts by always selecting the newest declaration. Newest is defined as the * declaration whose version is greater according to <code>ArtifactVersion.compareTo</code>. * * @see ArtifactVersion#compareTo * @since 3.0 */ @Named("newest") @Singleton @Deprecated public class NewestConflictResolver implements ConflictResolver {
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 2.2K bytes - Viewed (0) -
compat/maven-compat/src/test/java/org/apache/maven/repository/legacy/resolver/conflict/NewestConflictResolverTest.java
class NewestConflictResolverTest extends AbstractConflictResolverTest { // constructors ----------------------------------------------------------- public NewestConflictResolverTest() throws Exception { super("newest"); } // tests ------------------------------------------------------------------ /** * Tests that <code>a:2.0</code> wins in the scenario: * <pre> * a:1.0 * b:1.0 -> a:2.0
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 2.8K bytes - Viewed (0) -
cni/pkg/ipset/ipset.go
// doesn't support creating `list:set` types yet (is in main branch tho). // So this will actually create 2 underlying ipsets, one for v4 and one for v6 func NewIPSet(name string, v6 bool, deps NetlinkIpsetDeps) (IPSet, error) { var err error set := IPSet{ V4Name: fmt.Sprintf(V4Name, name), Deps: deps, Prefix: name, } err = deps.ipsetIPHashCreate(set.V4Name, false)
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Tue Apr 30 22:24:38 UTC 2024 - 3.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/Platform.java
return Sets.newHashSetWithExpectedSize(expectedSize); } /** Returns the platform preferred implementation of a thread-safe hash set. */ static <E> Set<E> newConcurrentHashSet() { return ConcurrentHashMap.newKeySet(); } /** * Returns the platform preferred implementation of an insertion ordered set based on a hash * table. */
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Aug 06 17:52:51 UTC 2024 - 5.5K bytes - Viewed (0) -
ci/official/utilities/rename_and_verify_wheels.sh
echo "More than one wheel file is present: moving the oldest to" echo "$TFCI_OUTPUT_DIR/extra_wheels." # List all .whl files by their modification time (ls -t) and move anything # other than the most recently-modified one (the newest one). mkdir -p $TFCI_OUTPUT_DIR/extra_wheels ls -t *.whl | tail -n +2 | xargs mv -t $TFCI_OUTPUT_DIR/extra_wheels fi # Repair wheels with auditwheel and delete the old one.
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Wed Oct 02 21:18:17 UTC 2024 - 4.3K bytes - Viewed (0) -
docs/debugging/inspect/export.go
} return versions, buf, nil } // decodeVersions will decode a number of versions from a buffer // and perform a callback for each version in order, newest first. // Any non-nil error is returned. func decodeVersions(buf []byte, versions int, fn func(idx int, hdr, meta []byte) error) (e error) { var tHdr, tMeta []byte // Zero copy bytes for i := 0; i < versions; i++ {
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue Nov 08 15:58:02 UTC 2022 - 9.1K bytes - Viewed (0)