- Sort Score
- Result 10 results
- Languages All
Results 41 - 44 of 44 for stray (1.24 sec)
-
doc/go_spec.html
<h3 id="Bootstrapping">Bootstrapping</h3> <p> Current implementations provide several built-in functions useful during bootstrapping. These functions are documented for completeness but are not guaranteed to stay in the language. They do not return a result. </p> <pre class="grammar"> Function Behavior print prints all arguments; formatting of arguments is implementation-specific
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Tue Dec 02 23:07:19 UTC 2025 - 286.5K bytes - Viewed (1) -
src/main/webapp/css/bootstrap.min.css.map
to `.form-control` as it's not specific enough. For details, see\n// https://github.com/twbs/bootstrap/issues/11586.\n\n[type=\"search\"] {\n outline-offset: -2px; // 1\n -webkit-appearance: textfield; // 2\n}\n\n// 1. A few input types should stay LTR\n// See https://rtlstyling.com/posts/rtl-styling#form-inputs\n// 2. RTL only output\n// See https://rtlcss.com/learn/usage-guide/control-directives/#raw\n\n/* rtl:raw:\n[type=\"tel\"],\n[type=\"url\"],\n[type=\"email\"],\n[type=\"number\"] {\n...
Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Sun Jan 12 06:14:02 UTC 2025 - 575.5K bytes - Viewed (0) -
lib/fips140/v1.0.0-c2097c7c.zip
now involves a // subtraction. // 2. If step 2 (both [x] and [y] are even) runs, abort immediately. This // case needs to be handled by the caller. // 3. Subtract copies of [x] and [y] as needed in step 6 (both [u] and [v] // are odd) so coefficients stay in bounds. // 4. Replace the [u >= v] check with [u > v]. This changes the end // condition to [v = 0] rather than [u = 0]. This saves an extra // subtraction due to which coefficients were negated. // 5. Rename x and y to a and n, to capture that...
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Sep 25 19:53:19 UTC 2025 - 642.7K bytes - Viewed (0) -
lib/fips140/v1.1.0-rc1.zip
now involves a // subtraction. // 2. If step 2 (both [x] and [y] are even) runs, abort immediately. This // case needs to be handled by the caller. // 3. Subtract copies of [x] and [y] as needed in step 6 (both [u] and [v] // are odd) so coefficients stay in bounds. // 4. Replace the [u >= v] check with [u > v]. This changes the end // condition to [v = 0] rather than [u = 0]. This saves an extra // subtraction due to which coefficients were negated. // 5. Rename x and y to a and n, to capture that...
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Dec 11 16:27:41 UTC 2025 - 663K bytes - Viewed (0)