- Sort Score
- Result 10 results
- Languages All
Results 1 - 5 of 5 for hints (0.04 sec)
-
docs/en/docs/release-notes.md
The key updated docs are: * Python Types Intro: * [Type Hints with Metadata Annotations](https://fastapi.tiangolo.com/python-types/#type-hints-with-metadata-annotations). * Tutorial:
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Fri Sep 05 12:48:45 UTC 2025 - 544.1K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/mylasta/direction/FessConfig.java
String QUERY_COLLAPSE_INNER_HITS_NAME = "query.collapse.inner.hits.name"; /** The key of the configuration. e.g. 0 */ String QUERY_COLLAPSE_INNER_HITS_SIZE = "query.collapse.inner.hits.size"; /** The key of the configuration. e.g. */ String QUERY_COLLAPSE_INNER_HITS_SORTS = "query.collapse.inner.hits.sorts"; /** The key of the configuration. e.g. */
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Jul 17 08:28:31 UTC 2025 - 525.6K bytes - Viewed (2) -
RELEASE.md
inner spec. This can be used to extract the structure of nested datasets. * Add `tf.data.experimental.AutoShardingPolicy.HINT` which can be used to provide hints to tf.distribute-based auto-sharding as to where in the input pipeline to insert sharding transformations. * Make tf.data.Options persistent across `tf.function` and `GraphDef`
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Mon Aug 18 20:54:38 UTC 2025 - 740K bytes - Viewed (2) -
CHANGELOG/CHANGELOG-1.19.md
- Using NUMA nodes instead of sockets for CPU manager hints. ([#99276](https://github.com/kubernetes/kubernetes/pull/99276), [@iwankgb](https://github.com/iwankgb)) [SIG Node]
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Wed Jan 05 05:42:32 UTC 2022 - 489.7K bytes - Viewed (0) -
lib/fips140/v1.0.0.zip
for details. case 1024 / _W: const n = 1024 / _W // compiler hint T := make([]uint, n*2) for i := 0; i < n; i++ { T[n+i] = addMulVVW1024(&T[i], &xLimbs[0], yLimbs[i]) } return x.Mod(&Nat{limbs: T}, m) case 1536 / _W: const n = 1536 / _W // compiler hint T := make([]uint, n*2) for i := 0; i < n; i++ { T[n+i] = addMulVVW1536(&T[i], &xLimbs[0], yLimbs[i]) } return x.Mod(&Nat{limbs: T}, m) case 2048 / _W: const n = 2048 / _W // compiler hint T := make([]uint, n*2) for i := 0; i < n; i++ { T[n+i] = addMulVVW2048(&T[i],...
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Jan 29 15:10:35 UTC 2025 - 635K bytes - Viewed (0)