- Sort Score
- Num 10 results
- Language All
Results 1 - 8 of 8 for mlimit (0.1 seconds)
-
src/main/java/org/codelibs/fess/mylasta/direction/FessConfig.java
String SUGGEST_UPDATE_CONTENTS_LIMIT_NUM_PERCENTAGE = "suggest.update.contents.limit.num.percentage"; /** The key of the configuration. e.g. 10000 */ String SUGGEST_UPDATE_CONTENTS_LIMIT_NUM = "suggest.update.contents.limit.num"; /** The key of the configuration. e.g. 50000 */ String SUGGEST_UPDATE_CONTENTS_LIMIT_DOC_SIZE = "suggest.update.contents.limit.doc.size"; /** The key of the configuration. e.g. 1 */
Created: Sat Dec 20 09:19:18 GMT 2025 - Last Modified: Sat Dec 13 02:21:17 GMT 2025 - 525.7K bytes - Click Count (2) -
api/go1.14.txt
pkg syscall (freebsd-arm64), type RawSockaddrUnix struct, Len uint8 pkg syscall (freebsd-arm64), type RawSockaddrUnix struct, Path [104]int8 pkg syscall (freebsd-arm64), type Rlimit struct pkg syscall (freebsd-arm64), type Rlimit struct, Cur int64 pkg syscall (freebsd-arm64), type Rlimit struct, Max int64 pkg syscall (freebsd-arm64), type RouteMessage //deprecated pkg syscall (freebsd-arm64), type RouteMessage struct
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Fri Feb 17 20:31:46 GMT 2023 - 508.9K bytes - Click Count (0) -
api/go1.20.txt
pkg syscall (freebsd-riscv64), type RawSockaddrUnix struct, Path [104]int8 #53466 pkg syscall (freebsd-riscv64), type Rlimit struct #53466 pkg syscall (freebsd-riscv64), type Rlimit struct, Cur int64 #53466 pkg syscall (freebsd-riscv64), type Rlimit struct, Max int64 #53466 pkg syscall (freebsd-riscv64), type RouteMessage //deprecated #53466 pkg syscall (freebsd-riscv64), type RouteMessage struct #53466
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Fri Feb 17 21:23:32 GMT 2023 - 602.6K bytes - Click Count (0) -
RELEASE.md
* boosted trees: adding pruning mode. * tf.train.Checkpoint does not delete old checkpoints by default. * tfdbg: Limit the total disk space occupied by dumped tensor data to 100 GBytes. Add environment variable `TFDBG_DISK_BYTES_LIMIT` to allow adjustment of this upper limit. ## Thanks to our Contributors This release contains contributions from many people at Google, as well as:Created: Tue Dec 30 12:39:10 GMT 2025 - Last Modified: Tue Oct 28 22:27:41 GMT 2025 - 740.4K bytes - Click Count (3) -
docs/en/docs/release-notes.md
* 👷 Add custom token to Smokeshow and Preview Docs for download-artifact, to prevent API rate limits. PR [#9646](https://github.com/tiangolo/fastapi/pull/9646) by [@tiangolo](https://github.com/tiangolo). * 👷 Add custom tokens for GitHub Actions to avoid rate limits. PR [#9647](https://github.com/tiangolo/fastapi/pull/9647) by [@tiangolo](https://github.com/tiangolo). ## 0.96.0 ### Features
Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Sat Dec 27 19:06:15 GMT 2025 - 586.7K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.19.md
- CPU limits are now respected for Windows containers. If a node is over-provisioned, no weighting is used - only limits are respected. ([#86101](https://github.com/kubernetes/kubernetes/pull/86101), [@PatrickLang](https://github.com/PatrickLang)) [SIG Node, Testing and Windows]
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Wed Jan 05 05:42:32 GMT 2022 - 489.7K bytes - Click Count (0) -
lib/fips140/v1.1.0-rc1.zip
hintDecode(y []byte, h [][n]byte, p parameters) error { ω, k := p.ω, p.k if len(y) != ω+k { return errors.New("mldsa: internal error: invalid signature hint length") } var idx byte for i := range k { limit := y[ω+i] if limit < idx || limit > byte(ω) { return errInvalidSignatureH } first := idx for idx < limit { if idx > first && y[idx-1] >= y[idx] { return errInvalidSignatureH } h[i][y[idx]] = 1 idx++ } } for i := idx; i < byte(ω); i++ { if y[i] != 0 { return errInvalidSignatureH } } return nil } gol...Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Dec 11 16:27:41 GMT 2025 - 663K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
addMulVVW1024(&T[i], &aLimbs[0], d) Y := T[i] * m.m0inv c2 := addMulVVW1024(&T[i], &mLimbs[0], Y) T[n+i], c = bits.Add(c1, c2, c) } copy(x.reset(n).limbs, T[n:]) x.maybeSubtractModulus(choice(c), m) case 1536 / _W: const n = 1536 / _W // compiler hint T := make([]uint, n*2) var c uint for i := 0; i < n; i++ { d := bLimbs[i] c1 := addMulVVW1536(&T[i], &aLimbs[0], d) Y := T[i] * m.m0inv c2 := addMulVVW1536(&T[i], &mLimbs[0], Y) T[n+i], c = bits.Add(c1, c2, c) } copy(x.reset(n).limbs, T[n:]) x.maybeSu...
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0)