- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 300 for doSlow (0.09 sec)
-
internal/config/lambda/target/lazyinit.go
type lazyInit struct { done uint32 m sync.Mutex } func (l *lazyInit) Do(f func() error) error { if atomic.LoadUint32(&l.done) == 0 { return l.doSlow(f) } return nil } func (l *lazyInit) doSlow(f func() error) error { l.m.Lock() defer l.m.Unlock() if atomic.LoadUint32(&l.done) == 0 { if err := f(); err != nil { return err }
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue Mar 07 16:12:41 UTC 2023 - 1.3K bytes - Viewed (0) -
architecture/standards/0001-use-architectural-decision-records.md
### Format The format for ADR should follow this template: ```markdown # ADR-000X - Title ## Date 20YY-MM-DD ## Context Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat.
Registered: Wed Nov 06 11:36:14 UTC 2024 - Last Modified: Sat Mar 02 21:54:40 UTC 2024 - 2.8K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/google/SetGenerators.java
/* * The (tooLow + 1, tooHigh) arguments below would be invalid because tooLow would be * greater than tooHigh. */ return ContiguousSet.create(Range.openClosed(0, 1), DiscreteDomain.integers()).subSet(0, 1); } int tooHigh = set.last() + 1; int tooLow = set.first() - 1; set.add(tooHigh); set.add(tooLow);
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 15.6K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/connection/RoutePlanner.kt
import okhttp3.HttpUrl /** * Policy on choosing which connection to use for an exchange and any retries that follow. This uses * the following strategies: * * 1. If the current call already has a connection that can satisfy the request it is used. Using * the same connection for an initial exchange and its follow-ups may improve locality. *
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Wed Dec 20 23:27:07 UTC 2023 - 4.2K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/google/SetGenerators.java
/* * The (tooLow + 1, tooHigh) arguments below would be invalid because tooLow would be * greater than tooHigh. */ return ContiguousSet.create(Range.openClosed(0, 1), DiscreteDomain.integers()).subSet(0, 1); } int tooHigh = set.last() + 1; int tooLow = set.first() - 1; set.add(tooHigh); set.add(tooLow);
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 15.6K bytes - Viewed (0) -
docs/integrations/veeam/README.md
- Follow through the wizard as above for Veeam Backup and Replication as the steps are the same between both products - Under Backup Infrastructure -> Backup Repositories, right click and "Add Backup Repository" - Follow the wizard. Under the "Object Storage Backup Repository" section, choose the MinIO object storage you created above
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Sep 29 04:28:45 UTC 2022 - 5.4K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/http/RetryAndFollowUpInterceptor.kt
return true } /** * Figures out the HTTP request to make in response to receiving [userResponse]. This will * either add authentication headers, follow redirects or handle a client request timeout. If a * follow-up is either unnecessary or not applicable, this returns null. */ @Throws(IOException::class) private fun followUpRequest( userResponse: Response, exchange: Exchange?,
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Mon Apr 15 13:24:48 UTC 2024 - 12.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ListMultimap.java
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Jan 24 17:47:51 UTC 2022 - 3.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/ListMultimap.java
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Jan 24 17:47:51 UTC 2022 - 3.5K bytes - Viewed (0) -
CONTRIBUTING.md
============ Keeping the project small and stable limits our ability to accept new contributors. We are not seeking new committers at this time, but some small contributions are welcome. If you've found a security problem, please follow our [bug bounty][security] program. If you've found a bug, please contribute a failing test case so we can study and fix it. If you have a new feature idea, please build it in an external library. There are
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Tue Feb 14 08:26:50 UTC 2023 - 2K bytes - Viewed (0)