- Sort Score
- Result 10 results
- Languages All
Results 1 - 6 of 6 for virtual (0.08 sec)
-
src/main/java/org/codelibs/fess/mylasta/direction/FessConfig.java
/** * Get the value for the key 'virtual.host.headers'. <br> * The value is, e.g. <br> * comment: Virtual Host: Host:fess.codelibs.org=fess * @return The value of found property. (NotNull: if not found, exception but basically no way) */ String getVirtualHostHeaders(); /** * Get the value for the key 'virtual.host.headers' as {@link Integer}. <br>Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Jul 17 08:28:31 UTC 2025 - 525.6K bytes - Viewed (2) -
docs/en/docs/release-notes.md
### Docs * 📝 Fix a typo in `docs/en/docs/virtual-environments.md`. PR [#12064](https://github.com/fastapi/fastapi/pull/12064) by [@aymenkrifa](https://github.com/aymenkrifa). * 📝 Add docs about Environment Variables and Virtual Environments. PR [#12054](https://github.com/fastapi/fastapi/pull/12054) by [@tiangolo](https://github.com/tiangolo).
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Fri Sep 05 12:48:45 UTC 2025 - 544.1K bytes - Viewed (0) -
RELEASE.md
built with Visual Studio 2019 version 16.4 in order to take advantage of the new `/d2ReducedOptimizeHugeFunctions` compiler flag. To use these new packages, you must install "Microsoft Visual C++ Redistributable for Visual Studio 2015, 2017 and 2019", available from Microsoft's website [here](https://support.microsoft.com/help/2977003/the-latest-supported-visual-c-downloads).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
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
the result of Step 1 is computed during the next loop. This is // possible because each iteration only uses T[i] in Step 2 and then // discards it in Step 6. d := bLimbs[i] c1 := addMulVVW(T[i:n+i], aLimbs, d) // Step 6 is replaced by shifting the virtual window we operate // over: T of the algorithm is T[i:] for us. That means that T1 in // Step 2 (T mod 2^_W) is simply T[i]. k0 in Step 3 is our m0inv. Y := T[i] * m.m0inv // Step 4 and 5 add Y × m to T, which as mentioned above is stored // at 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) -
src/main/webapp/css/admin/bootstrap.min.css.map
box-shadow($custom-select-box-shadow, $custom-select-focus-box-shadow);\n } @else {\n // Avoid using mixin so we can pass custom focus shadow properly\n box-shadow: $custom-select-focus-box-shadow;\n }\n\n &::-ms-value {\n // For visual consistency with other platforms/browsers,\n // suppress the default white text on blue background highlight given to\n // the selected option text when the (still closed) <select> receives focus\n // in IE and (under certain conditions)...Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sat Oct 26 01:49:09 UTC 2024 - 639.3K bytes - Viewed (1)