- Sort Score
- Result 10 results
- Languages All
Results 381 - 390 of 424 for inside (0.94 sec)
-
lib/fips140/v1.1.0-rc1.zip
overhead in those modes. // To bring the old performance back, we mark all functions that loop // over Nat words with //go:norace. Because //go:norace does not // propagate across inlining, we must also mark functions that inline // //go:norace functions - specifically, those that inline add, addMulVVW, // assign, cmpGeq, rshift1, and sub. // choice represents a constant-time boolean. The value of choice is always // either 1 or 0. We use an int instead of bool in order to make decisions in // constant...
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Dec 11 16:27:41 UTC 2025 - 663K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/cache/DiskLruCache.kt
* value, the edit will fail silently. Callers should handle other problems by catching * `IOException` and responding appropriately. * * @constructor Create a cache which will reside in [directory]. This cache is lazily initialized on * first access and will be created if it does not exist. * @param directory a writable directory. * @param valueCount the number of values per cache entry. Must be positive.
Registered: Fri Dec 26 11:42:13 UTC 2025 - Last Modified: Wed May 28 23:28:25 UTC 2025 - 34.7K bytes - Viewed (0) -
docs/pt/docs/async.md
compatível e ganhar seus benefícios (e.g. *concorrência estruturada*). Eu criei outra biblioteca em cima do AnyIO, como uma fina camada acima, para melhorar um pouco as anotações de tipo e obter melhor **preenchimento automático**, **erros inline**, etc. Ela também possui uma introdução amigável e um tutorial para ajudar você a **entender** e escrever **seu próprio código async**: <a href="https://asyncer.tiangolo.com/" class="external-link" target="_blank">Asyncer</a>. Seria particularmente...
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Wed Nov 12 16:23:57 UTC 2025 - 25.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedMap.java
checkEntryNotNull(key, value); keys[i] = key; values[i] = value; } } else { // Need to sort and check for nulls and dupes. // Inline the Comparator implementation rather than transforming with a Function // to save code size. sort( entryArray, 0, size, (e1, e2) -> {
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Sep 22 21:07:18 UTC 2025 - 52.9K bytes - Viewed (0) -
fess-crawler/src/test/resources/extractor/eml/sample2.eml
ve/media/ico_verified-1407009642236.png" width="16" height="16" style="width:15px;height:15px;display:inline;margin:0;padding:0;display:block;-ms-interpolation-mode:bicubic;border:none;outline:none;display:inline-block;vertical-align:top;" class="inline-image" /> <a href="https://twitter.com/i/redirect?url=https%3A%2F%2Ftwitter.com%2Ftokyo_bousai%3Ft%3D1%26cn%3DZmxleGlibGVfcmVjc18y%26sig%3D469e0de8684fdb4a9be152419cb6a5c173720fed%26al%3D1%26refsrc%3Demail%26iid%3D7c2e8db7f2e0464eb1fb51f268e...
Registered: Sat Dec 20 11:21:39 UTC 2025 - Last Modified: Sat Jan 16 07:50:35 UTC 2016 - 91.6K bytes - Viewed (0) -
fess-crawler/src/test/resources/ajax/js/jquery-2.1.1.min.js
ueued--,n.queue(a,"fx").length||h.empty.fire()})})),1===a.nodeType&&("height"in b||"width"in b)&&(c.overflow=[o.overflow,o.overflowX,o.overflowY],j=n.css(a,"display"),k="none"===j?L.get(a,"olddisplay")||tb(a.nodeName):j,"inline"===k&&"none"===n.css(a,"float")&&(o.display="inline-block")),c.overflow&&(o.overflow="hidden",l.always(function(){o.overflow=c.overflow[0],o.overflowX=c.overflow[1],o.overflowY=c.overflow[2]}));for(d in b)if(e=b[d],Nb.exec(e)){if(delete b[d],f=f||"toggle"===e,e===(p?"hide...
Registered: Sat Dec 20 11:21:39 UTC 2025 - Last Modified: Sun Oct 11 02:16:55 UTC 2015 - 82.3K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Longs.java
| (b5 & 0xFFL) << 24 | (b6 & 0xFFL) << 16 | (b7 & 0xFFL) << 8 | (b8 & 0xFFL); } /* * Moving asciiDigits into this static holder class lets ProGuard eliminate and inline the Longs * class. */ static final class AsciiDigits { private AsciiDigits() {} private static final byte[] asciiDigits; static { byte[] result = new byte[128];Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Wed Oct 22 18:14:49 UTC 2025 - 29K bytes - Viewed (0) -
lib/fips140/v1.0.0-c2097c7c.zip
overhead in those modes. // To bring the old performance back, we mark all functions that loop // over Nat words with //go:norace. Because //go:norace does not // propagate across inlining, we must also mark functions that inline // //go:norace functions - specifically, those that inline add, addMulVVW, // assign, cmpGeq, rshift1, and sub. // choice represents a constant-time boolean. The value of choice is always // either 1 or 0. We use an int instead of bool in order to make decisions in // constant...
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Sep 25 19:53:19 UTC 2025 - 642.7K bytes - Viewed (0) -
src/main/resources/fess_config.properties
# Maximum length of site path in the response. response.max.site.path.length=100 # Whether to enable content title highlighting in the response. response.highlight.content_title.enabled=true # Inline MIME types for the response. response.inline.mimetypes=application/pdf,text/plain # HTTP headers for the response. response.headers=\ text/html=X-XSS-Protection: 1; mode=block\n\ text/html=Content-Security-Policy: reflected-xss block\n\
Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Thu Dec 11 09:47:03 UTC 2025 - 54.8K bytes - Viewed (0) -
docs/de/docs/async.md
Vorteile zu nutzen (z. B. *strukturierte Nebenläufigkeit*). Ich habe eine weitere Bibliothek auf Basis von AnyIO erstellt, als dünne Schicht obendrauf, um die Typannotationen etwas zu verbessern und bessere **Autovervollständigung**, **Inline-Fehler** usw. zu erhalten. Sie hat auch eine freundliche Einführung und ein Tutorial, um Ihnen zu helfen, **Ihren eigenen asynchronen Code zu verstehen** und zu schreiben: <a href="https://asyncer.tiangolo.com/" class="external-link" target="_blank">Asyncer</a>....
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Sat Sep 20 15:10:09 UTC 2025 - 27.9K bytes - Viewed (0)