- Sort Score
- Num 10 results
- Language All
Results 21 - 30 of 33 for 2x (0.06 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
src/main/webapp/js/admin/adminlte.min.js
.fn[i],s="card",r='[data-card-widget="card-refresh"]',d={source:"",sourceSelector:"",params:{},trigger:r,content:".card-body",loadInContent:!0,loadOnInit:!0,loadErrorTemplate:!0,responseType:"",overlayTemplate:'<div class="overlay"><i class="fas fa-2x fa-sync-alt fa-spin"></i></div>',errorTemplate:'<span class="text-danger"></span>',onLoadStart:function(){},onLoadDone:function(e){return e},onLoadFail:function(e,t,a){}},f=function(){function e(e,t){if(this._element=e,this._parent=e.parents(".card...
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Oct 26 01:49:09 GMT 2024 - 45.3K bytes - Click Count (0) -
docs/changelogs/upgrading_to_okhttp_4.md
Unfortunately it crashes on OkHttp 4.x’s bytecode. Until [Google’s bug][advanced_profiling_bug] is fixed you must disable advanced profiling in Android Studio.  R8 / ProGuard ------------- R8 and ProGuard are both code optimizers for `.class` files. R8 is the [default optimizer][r8] in Android Studio 3.4 and newer. It works well with all
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Sun Feb 06 16:58:16 GMT 2022 - 10.9K bytes - Click Count (0) -
docs/features/interceptors.md
 ### Application Interceptors Interceptors are registered as either _application_ or _network_ interceptors. We'll use the `LoggingInterceptor` defined above to show the difference.
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Sun Feb 06 02:19:09 GMT 2022 - 8.1K bytes - Click Count (0) -
guava-tests/test/com/google/common/hash/HashingTest.java
Random r = new Random(9); for (int i = 0; i < ITERS; i++) { countRemaps(r.nextLong(), map); } for (int shard = 2; shard <= MAX_SHARDS; shard++) { // Rough: don't exceed 1.2x the expected number of remaps by more than 20 assertThat((double) map.get(shard)).isAtMost(1.2 * ITERS / shard + 20); } } private void countRemaps(long h, AtomicLongMap<Integer> map) { int last = 0;
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Mar 13 13:01:07 GMT 2026 - 26.7K bytes - Click Count (2) -
okhttp/src/jvmTest/kotlin/okhttp3/URLConnectionTest.kt
server.enqueue(mockResponse) val responseAfter = MockResponse(body = "This comes after a busted connection") server.enqueue(responseAfter) server.enqueue(responseAfter) // Enqueue 2x because the broken connection may be reused. val response1 = getResponse(newRequest("/a")) response1.body .source() .timeout() .timeout(100, TimeUnit.MILLISECONDS)
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Tue Jan 27 09:00:39 GMT 2026 - 133.3K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.15.md
- Achieved 2X performance improvement on both required and preferred PodAffinity. ([#76243](https://github.com/kubernetes/kubernetes/pull/76243), [@Huang-Wei](https://github.com/Huang-Wei))
Created: Fri Apr 03 09:05:14 GMT 2026 - Last Modified: Thu May 05 13:44:43 GMT 2022 - 278.9K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.27.md
- Improved FormatMap: Improves performance by about 4x, or nearly 2x in the worst case ([#112661](https://github.com/kubernetes/kubernetes/pull/112661), [@aimuz](https://github.com/aimuz)) [SIG Node]
Created: Fri Apr 03 09:05:14 GMT 2026 - Last Modified: Wed Jul 17 07:48:22 GMT 2024 - 466.3K bytes - Click Count (2) -
lib/fips140/v1.26.0.zip
dLimbs := d.limbs[:size] mLimbs := m.nat.limbs[:size] // Each iteration of this loop computes x = 2x + b mod m, where b is a bit // from y. Effectively, it left-shifts x and adds y one bit at a time, // reducing it every time. // // To do the reduction, each iteration computes both 2x + b and 2x + b - m. // The next iteration (and finally the return line) will use either result // based on whether 2x + b overflows m. needSubtraction := no for i := _W - 1; i >= 0; i-- { carry := (y >> i) & 1 var borrow...
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) -
lib/fips140/v1.0.0-c2097c7c.zip
dLimbs := d.limbs[:size] mLimbs := m.nat.limbs[:size] // Each iteration of this loop computes x = 2x + b mod m, where b is a bit // from y. Effectively, it left-shifts x and adds y one bit at a time, // reducing it every time. // // To do the reduction, each iteration computes both 2x + b and 2x + b - m. // The next iteration (and finally the return line) will use either result // based on whether 2x + b overflows m. needSubtraction := no for i := _W - 1; i >= 0; i-- { carry := (y >> i) & 1 var borrow...
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0) -
docs/en/docs/release-notes.md
* ✨ Serialize JSON response with Pydantic (in Rust), when there's a Pydantic return type or response model. PR [#14962](https://github.com/fastapi/fastapi/pull/14962) by [@tiangolo](https://github.com/tiangolo). * This results in 2x (or more) performance increase for JSON responses. * New docs: [Custom Response - JSON Performance](https://fastapi.tiangolo.com/advanced/custom-response/#json-performance). ## 0.129.2 (2026-02-21) ### Internal
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Fri Apr 03 12:07:04 GMT 2026 - 631K bytes - Click Count (0)