- Sort Score
- Num 10 results
- Language All
Results 91 - 100 of 101 for history (0.12 seconds)
-
compat/maven-compat/src/main/java/org/apache/maven/artifact/ArtifactScopeEnum.java
* @return true is supplied scope is an inclusive sub-scope of current one. */ public boolean encloses(ArtifactScopeEnum scope) { final ArtifactScopeEnum s = checkScope(scope); // system scope is historic only - and simple if (id == system.id) { return scope.id == system.id; } for (ArtifactScopeEnum[][] set : COMPLIANCY_SETS) { if (id == set[0][0].id) {Created: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Fri Oct 25 12:31:46 GMT 2024 - 3.2K bytes - Click Count (0) -
.github/ISSUE_TEMPLATE/feature-request.md
it may already exist, even as a closed issue. --> <!-- Describe the feature. Please give us as much context as possible about the feature. For example, you could include a story about a time when you wanted to use the feature, and also tell us what you had to do instead. The last part is helpful because it gives us an idea of how much harder your life is without the feature.
Created: Wed Apr 08 16:19:15 GMT 2026 - Last Modified: Thu May 21 15:43:15 GMT 2020 - 580 bytes - Click Count (0) -
okhttp-hpacktests/src/test/java/okhttp3/internal/http2/hpackjson/Case.kt
package okhttp3.internal.http2.hpackjson import okhttp3.internal.http2.Header import okio.ByteString /** * Representation of an individual case (set of headers and wire format). There are many cases for a * single story. This class is used reflectively with Moshi to parse stories. */ data class Case( val seqno: Int = 0, val wire: ByteString? = null, val headers: List<Map<String, String>>, ) : Cloneable {
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Sat Dec 23 10:26:25 GMT 2023 - 1.3K bytes - Click Count (0) -
docs/en/docs/async.md
Nope! That's not the moral of the story. Concurrency is different than parallelism. And it is better on **specific** scenarios that involve a lot of waiting. Because of that, it generally is a lot better than parallelism for web application development. But not for everything. So, to balance that out, imagine the following short story: > You have to clean a big, dirty house.
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 05 18:13:19 GMT 2026 - 23.4K bytes - Click Count (0) -
docs/fr/docs/async.md
Mais les détails entre la **concurrence** et le **parallélisme** diffèrent sur de nombreux points. Pour expliquer la différence, voici une histoire de burgers : ### Burgers concurrents { #concurrent-burgers } Vous amenez votre crush 😍 dans votre fast food 🍔 favori, et faites la queue pendant que le serveur 💁 prend les commandes des personnes devant vous.Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 19 18:37:13 GMT 2026 - 27.3K bytes - Click Count (0) -
src/bytes/reader_test.go
}(i) } wg.Wait() } func TestEmptyReaderConcurrent(t *testing.T) { // Test for the race detector, to verify a Read that doesn't yield any bytes // is okay to use from multiple goroutines. This was our historic behavior. // See golang.org/issue/7856 r := NewReader([]byte{}) var wg sync.WaitGroup for i := 0; i < 5; i++ { wg.Add(2) go func() { defer wg.Done() var buf [1]byte r.Read(buf[:])
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Mon Dec 13 18:45:54 GMT 2021 - 8K bytes - Click Count (0) -
lib/fips140/v1.26.0.zip
resulting value will not preserve any of the cofactor-clearing // properties that clamping is meant to provide. It will however work as // expected as long as it is applied to points on the prime order subgroup, like // in Ed25519. In fact, it is lost to history why RFC 8032 adopted the // irrelevant RFC 7748 clamping, but it is now required for compatibility. func (s *Scalar) SetBytesWithClamping(x []byte) (*Scalar, error) { // The description above omits the purpose of the high bits of the clamping // for...
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Jan 08 17:58:32 GMT 2026 - 660.3K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
resulting value will not preserve any of the cofactor-clearing // properties that clamping is meant to provide. It will however work as // expected as long as it is applied to points on the prime order subgroup, like // in Ed25519. In fact, it is lost to history why RFC 8032 adopted the // irrelevant RFC 7748 clamping, but it is now required for compatibility. func (s *Scalar) SetBytesWithClamping(x []byte) (*Scalar, error) { // The description above omits the purpose of the high bits of the clamping // for...
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0) -
okhttp/src/jvmTest/resources/okhttp3/internal/publicsuffix/public_suffix_list.dat
// http://www.auda.org.au/ // Confirmed by registry <******@****.***> 2024-11-17 au // 2LDs com.au net.au org.au edu.au gov.au asn.au id.au // Historic 2LDs (closed to new registration, but sites still exist) conf.au oz.au // CGDNs - http://www.cgdn.org.au/ act.au nsw.au nt.au qld.au sa.au tas.au vic.au wa.au // 3LDs act.edu.au
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Fri Dec 27 13:39:56 GMT 2024 - 309.7K bytes - Click Count (1) -
CHANGELOG/CHANGELOG-1.32.md
Please see [the KEP](https://github.com/kubernetes/enhancements/tree/master/keps/sig-storage/1710-selinux-relabeling#story-3-cluster-upgrade) how we expect to warn users before any SELinux behavior changes and how they can opt-out before. Note that this field and feature gate is useful only with clusters that run with SELinux enabled. No action is required on clusters...
Created: Fri Apr 03 09:05:14 GMT 2026 - Last Modified: Thu Feb 26 23:58:21 GMT 2026 - 470.5K bytes - Click Count (0)