- Sort Score
- Result 10 results
- Languages All
Results 991 - 1000 of 1,088 for closer (0.06 sec)
-
src/main/resources/fess_label_en.properties
labels.index_title=Fess labels.index_form_search_btn=Search labels.index_osdd_title=Search labels.index_form_option_btn=Options labels.index_help=Help labels.search_options=Search Options labels.search_options_close=Close labels.search_options_clear=Clear labels.search_cache_msg=This is a cache of {0}. It is a snapshot of the page at {1}. labels.search_unknown=Unknown labels.footer_back_to_top=Back to top labels.header_brand_name=Fess
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Fri Mar 22 11:58:34 UTC 2024 - 40.7K bytes - Viewed (0) -
api/maven-api-core/src/main/java/org/apache/maven/api/JavaPathType.java
* <p>Path types are often exclusive. For example, a dependency should not be both on the Java class-path * and on the Java module-path.</p> * * <h2>Relationship with Java compiler standard location</h2> * This enumeration is closely related to the {@link JavaFileManager.Location} enumerations. * A difference is that the latter enumerates input and output files, while {@code JavaPathType}
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Mon May 13 09:53:45 UTC 2024 - 15K bytes - Viewed (0) -
guava/src/com/google/common/math/BigIntegerMath.java
* <p>For the case of {@link RoundingMode#HALF_EVEN}, this implementation uses the IEEE 754 * default rounding mode: if the two nearest representable values are equally near, the one with * the least significant bit zero is chosen. (In such cases, both of the nearest representable * values are even integers; this method returns the one that is a multiple of a greater power of * two.) *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 16 17:21:56 UTC 2024 - 18.8K bytes - Viewed (0) -
android/guava/src/com/google/common/reflect/ClassPath.java
scan(path, scannedUris, builder); } } scanJarFile(jarFile, builder); } finally { try { jarFile.close(); } catch (IOException ignored) { // similar to try-with-resources, but don't fail scanning } } } private void scanJarFile(JarFile file, ImmutableSet.Builder<ResourceInfo> builder) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Jan 05 17:43:40 UTC 2022 - 24.9K bytes - Viewed (0) -
src/main/webapp/js/admin/plugins/timepicker/bootstrap-timepicker.min.js
class="'+this.icons.down+'"></span></a></td>':"")+"</tr></table>",this.template){case"modal":a='<div class="bootstrap-timepicker-widget modal hide fade in" data-backdrop="'+(this.modalBackdrop?"true":"false")+'"><div class="modal-header"><a href="#" class="close" data-dismiss="modal">×</a><h3>Pick a Time</h3></div><div class="modal-content">'+f+'</div><div class="modal-footer"><a href="#" class="btn btn-primary" data-dismiss="modal">OK</a></div></div>';break;case"dropdown":a='<div class="bootstrap-timepicker-widget...
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Thu Feb 13 04:21:06 UTC 2020 - 18.2K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Chars.java
if (array[i] > max) { max = array[i]; } } return max; } /** * Returns the value nearest to {@code value} which is within the closed range {@code [min..max]}. * * <p>If {@code value} is within the range {@code [min..max]}, {@code value} is returned * unchanged. If {@code value} is less than {@code min}, {@code min} is returned, and if {@code
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Aug 27 16:47:48 UTC 2024 - 23.9K bytes - Viewed (0) -
cmd/erasure-healing_test.go
if err != nil { t.Fatal(err) } firstGr, err := obj.GetObjectNInfo(ctx, bucket, object, nil, nil, ObjectOptions{NoLock: true}) if err != nil { t.Fatal(err) } defer firstGr.Close() firstHealedH := sha256.New() _, err = io.Copy(firstHealedH, firstGr) if err != nil { t.Fatal(err) } firstHealedDataSha256 := firstHealedH.Sum(nil)
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Mon Jun 10 15:51:27 UTC 2024 - 49K bytes - Viewed (0) -
architecture/ambient/ztunnel.md
Ztunnel, of course, needs to be dynamically configured in order to make decisions on how it should handle traffic. For this purpose, we chose to use xDS transport protocol due to our expertise and existing infrastructure, and because the protocol is well suited to our needs. However, while we chose to use the xDS *transport protocol*, we chose to not use the xDS resource types, such as Clusters and Listeners.
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Wed Jul 17 23:10:17 UTC 2024 - 16.8K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Floats.java
for (int i = 1; i < array.length; i++) { max = Math.max(max, array[i]); } return max; } /** * Returns the value nearest to {@code value} which is within the closed range {@code [min..max]}. * * <p>If {@code value} is within the range {@code [min..max]}, {@code value} is returned * unchanged. If {@code value} is less than {@code min}, {@code min} is returned, and if {@code
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 17 15:52:18 UTC 2024 - 25.8K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Doubles.java
for (int i = 1; i < array.length; i++) { max = Math.max(max, array[i]); } return max; } /** * Returns the value nearest to {@code value} which is within the closed range {@code [min..max]}. * * <p>If {@code value} is within the range {@code [min..max]}, {@code value} is returned * unchanged. If {@code value} is less than {@code min}, {@code min} is returned, and if {@code
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 17 15:52:18 UTC 2024 - 27.9K bytes - Viewed (0)