- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 14 for adaptive (0.07 seconds)
-
fastapi/openapi/docs.py
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Tue Feb 24 09:28:10 GMT 2026 - 12.1K bytes - Click Count (0) -
src/main/resources/fess_config.properties
python.command.path=python # Encoding for file paths. path.encoding=UTF-8 # Whether to use a dedicated temporary directory. use.own.tmp.dir=true # Maximum length of log output. max.log.output.length=4000 # Adaptive load control value. adaptive.load.control=50 # CPU threshold (%) for web request load control. Returns 429 when CPU >= this value. (100: disabled) web.load.control=100
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Mar 28 06:59:19 GMT 2026 - 59.3K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/mylasta/direction/FessConfig.java
/** * Get the value for the key 'adaptive.load.control'. <br> * The value is, e.g. 50 <br> * comment: Adaptive load control value. * @return The value of found property. (NotNull: if not found, exception but basically no way) */ String getAdaptiveLoadControl(); /** * Get the value for the key 'adaptive.load.control' as {@link Integer}. <br>Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Mar 28 06:59:19 GMT 2026 - 576.9K bytes - Click Count (2) -
src/main/java/org/codelibs/fess/opensearch/client/SearchEngineClient.java
if (StringUtil.isBlank(fessConfig.getIndexReindexRequestsPerSecond())) { return null; } final String value = fessConfig.getIndexReindexRequestsPerSecond(); if ("adaptive".equalsIgnoreCase(value)) { if (fessConfig.availableProcessors() >= 4) { return null; }
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Thu Mar 26 14:36:23 GMT 2026 - 138.6K bytes - Click Count (1) -
RELEASE.md
with `UpdateEmbeddingCallback` the behavior of the layer would be same as `keras.layers.Embedding`. * `keras.optimizers.Adam` * Added the option to set adaptive epsilon to match implementations with Jax and PyTorch equivalents. ## Thanks to our Contributors This release contains contributions from many people at Google, as well as:Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Mon Mar 30 18:31:38 GMT 2026 - 746.5K bytes - Click Count (3) -
src/test/java/org/codelibs/fess/helper/VirtualHostHelperTest.java
result = virtualHostHelper.processVirtualHost(s -> "processed_" + s, "default"); assertEquals("processed_site1", result); // Headers persist in same request, so subsequent headers are additive // Test with case insensitive matching request.addHeader("X-Forwarded-Host", "TEST.COM"); result = virtualHostHelper.processVirtualHost(s -> "processed_" + s, "default");
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Fri Mar 13 23:01:26 GMT 2026 - 11.8K bytes - Click Count (0) -
docs/pt/docs/project-generation.md
# Full Stack FastAPI Template { #full-stack-fastapi-template } _Templates_, embora tipicamente venham com alguma configuração específica, são desenhados para serem flexíveis e customizáveis. Isso permite que você os modifique e adapte para as especificações do seu projeto, fazendo-os um excelente ponto de partida. 🏁Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 19 18:20:43 GMT 2026 - 2.1K bytes - Click Count (0) -
lib/fips140/v1.26.0.zip
// A tiny bit of leakage is acceptable because it's not adaptive, an // attacker only learns the magnitude of p - q. if diff.BitLenVarTime() <= N.BitLen()/2-100 { return errors.New("crypto/rsa: |p - q| too small") } // Check that d > 2^(nlen/2). // // See section 3 of https://crypto.stanford.edu/~dabo/papers/RSA-survey.pdf // for more details about attacks on small d values. // // Likewise, the leakage of the magnitude of d is not adaptive. if priv.d.BitLenVarTime() <= N.BitLen()/2 { return errors.New("crypto/rsa:...
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) -
src/main/webapp/js/purify.min.js
,"scope","selected","shape","size","sizes","slot","span","srclang","start","src","srcset","step","style","summary","tabindex","title","translate","type","usemap","valign","value","width","wrap","xmlns","slot"]),P=i(["accent-height","accumulate","additive","alignment-baseline","amplitude","ascent","attributename","attributetype","azimuth","basefrequency","baseline-shift","begin","bias","by","class","clip","clippathunits","clip-path","clip-rule","color","color-interpolation","color-interpolation-f...
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sun Mar 15 06:21:57 GMT 2026 - 22.7K bytes - Click Count (0) -
android/guava/src/com/google/common/math/IntMath.java
// Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b). // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two. // We bend over backwards to avoid branching, adapting a technique from // http://graphics.stanford.edu/~seander/bithacks.html#IntegerMinOrMax int delta = a - b; // can't overflow, since a and b are nonnegative
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Jan 29 22:14:05 GMT 2026 - 26.1K bytes - Click Count (0)