- Sort Score
- Result 10 results
- Languages All
Results 181 - 189 of 189 for simplify (0.1 sec)
-
android/guava/src/com/google/thirdparty/publicsuffix/PublicSuffixPatterns.java
* are thus excluded from consideration. Since it refers to elements in UNDER of the same type, * the type is actually not important here. The map is simply used for consistency reasons. */ public static final ImmutableMap<String, PublicSuffixType> EXCLUDED = TrieParser.parseTrie(
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue Aug 12 15:39:59 UTC 2025 - 75.3K bytes - Viewed (1) -
fess-crawler/src/main/resources/org/codelibs/fess/crawler/mime/tika-mimetypes.xml
</mime-type> <mime-type type="application/vnd.3m.post-it-notes"> <glob pattern="*.pwn"/> </mime-type> <mime-type type="application/vnd.accpac.simply.aso"> <glob pattern="*.aso"/> </mime-type> <mime-type type="application/vnd.accpac.simply.imp"> <glob pattern="*.imp"/> </mime-type> <mime-type type="application/vnd.acucobol"> <glob pattern="*.acu"/> </mime-type>Registered: Sun Sep 21 03:50:09 UTC 2025 - Last Modified: Thu Mar 13 08:18:01 UTC 2025 - 320.1K bytes - Viewed (1) -
CHANGELOG/CHANGELOG-1.22.md
as well as tracking of field ownership, running on the Kubernetes API server. Server-side Apply helps users and controllers manage their resources via declarative configurations. It allows them to create and/or modify their objects declaratively, simply by sending their fully specified intent. After being in beta for a couple releases, [Server-side Apply](https://kubernetes.io/docs/reference/using-api/server-side-apply/) is now generally available. ### Container Storage Interface graduations...
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Tue Dec 13 12:43:45 UTC 2022 - 454.1K bytes - Viewed (0) -
cmd/site-replication.go
rMap[id] = rl } } } } // append now for id, rl := range newRMap { // if rule is already in original list update non tranisition details with latest // else simply add to the map. This may happen if ILM expiry replication // was disabled for sometime and rules were updated independently in different // sites. Latest changes would get applied but merge only the non transition details
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 184.7K bytes - Viewed (1) -
CHANGELOG/CHANGELOG-1.16.md
- Passing an invalid policy name in the `--cpu-manager-policy` flag will now cause the kubelet to fail instead of simply ignoring the flag and running the `cpumanager`’s default policy instead. ([#80294](https://github.com/kubernetes/kubernetes/pull/80294), [@klueska](https://github.com/klueska))
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Wed Oct 23 20:13:20 UTC 2024 - 345.2K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.10.md
non-empty manifests directory. This makes the preflight checks less heavy-handed by specifically checking for well-known files (kube-apiserver.yaml, kube-controller-manager.yaml, kube-scheduler.yaml, etcd.yaml) in /etc/kubernetes/manifests instead of simply checking for a non-empty directory. ([#57287](https://github.com/kubernetes/kubernetes/pull/57287), [@mattkelly](https://github.com/mattkelly)) * PVC Protection alpha feature was renamed to Storage Protection. The Storage Protection feature...
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Thu May 05 13:44:43 UTC 2022 - 341.8K bytes - Viewed (0) -
okhttp/src/jvmTest/resources/okhttp3/internal/publicsuffix/public_suffix_list.dat
analytics-gateway.eu-west-1.amazonaws.com analytics-gateway.us-east-1.amazonaws.com analytics-gateway.us-east-2.amazonaws.com analytics-gateway.us-west-2.amazonaws.com // AWS Amplify // Submitted by AWS Security <******@****.***> // Reference: c35bed18-6f4f-424f-9298-5756f2f7d72b amplifyapp.com // AWS App Runner // Submitted by AWS Security <******@****.***>
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Fri Dec 27 13:39:56 UTC 2024 - 309.7K bytes - Viewed (1) -
lib/fips140/v1.0.0.zip
Step 2 and then // discards it in Step 6. d := bLimbs[i] c1 := addMulVVW(T[i:n+i], aLimbs, d) // Step 6 is replaced by shifting the virtual window we operate // over: T of the algorithm is T[i:] for us. That means that T1 in // Step 2 (T mod 2^_W) is simply T[i]. k0 in Step 3 is our m0inv. Y := T[i] * m.m0inv // Step 4 and 5 add Y × m to T, which as mentioned above is stored // at T[i:]. The two carries (from a × d and Y × m) are added up in // the next word T[n+i], and the carry bit from that addition...
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Jan 29 15:10:35 UTC 2025 - 635K bytes - Viewed (0) -
CREDITS
Secondary Licenses when the conditions for such availability set forth in the Eclipse Public License, v. 2.0 are satisfied: {name license(s), version(s), and exceptions or additional permissions here}." Simply including a copy of this Agreement, including this Exhibit A is not sufficient to license the Source Code under Secondary Licenses. If it is not possible or desirable to put the notice in a particularRegistered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Thu Mar 13 05:29:51 UTC 2025 - 1.8M bytes - Viewed (0)