- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 10 for furono (0.17 sec)
-
src/main/java/org/codelibs/fess/mylasta/action/FessMessages.java
/** The key of the message: */ public static final String ERRORS_front_header = "{errors.front_header}"; /** The key of the message: */ public static final String ERRORS_front_footer = "{errors.front_footer}"; /** The key of the message: <div class="alert alert-warning"> */ public static final String ERRORS_front_prefix = "{errors.front_prefix}"; /** The key of the message: </div> */
Java - Registered: Mon May 06 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 119.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
return topDown(startNodes, InsertionOrder.FRONT); } /** * In top-down traversal, an ancestor node is always traversed before any of its descendant * nodes. The traversal order among descendant nodes (particularly aunts and nieces) are * determined by the {@code InsertionOrder} parameter: nieces are placed at the FRONT before
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 30 20:12:45 GMT 2023 - 19.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ObjectArrays.java
return result; } /** * Returns a new array that prepends {@code element} to {@code array}. * * @param element the element to prepend to the front of {@code array} * @param array the array of elements to append * @return an array whose size is one larger than {@code array}, with {@code element} occupying
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jun 12 15:59:22 GMT 2023 - 9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
/* * Segments maintain a table of entry lists that are ALWAYS kept in a consistent state, so can * be read without locking. Next fields of nodes are immutable (final). All list additions are * performed at the front of each bin. This makes it easy to check changes, and also fast to * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 91.9K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/base/CharMatcherBenchmark.java
List<Integer> list = Lists.newArrayList(); for (int i = 0; i < length; i++) { list.add(i); } Collections.shuffle(list, rand); if (forceSlow) { // Move zero index to front to force a matching character (if percent > 0) list.set(list.indexOf(0), list.get(0)); list.set(0, 0); } // Get threshold in the range [0, length], rounding up to ensure that
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 194.8K bytes - Viewed (0) -
guava/src/com/google/common/cache/LocalCache.java
/* * Segments maintain a table of entry lists that are ALWAYS kept in a consistent state, so can * be read without locking. Next fields of nodes are immutable (final). All list additions are * performed at the front of each bin. This makes it easy to check changes, and also fast to * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 150.3K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
} /** * Utility for remove and iterator.remove: Delete item at position i. Call only when occupying * monitor. */ void removeAt(int i) { final E[] items = this.items; // if removing front item, just advance if (i == takeIndex) { items[takeIndex] = null; takeIndex = inc(takeIndex); } else { // slide over all others up through putIndex. for (; ; ) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/LocalCache.java
/* * Segments maintain a table of entry lists that are ALWAYS kept in a consistent state, so can * be read without locking. Next fields of nodes are immutable (final). All list additions are * performed at the front of each bin. This makes it easy to check changes, and also fast to * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 144.7K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/base/CharMatcherBenchmark.java
List<Integer> list = Lists.newArrayList(); for (int i = 0; i < length; i++) { list.add(i); } Collections.shuffle(list, rand); if (forceSlow) { // Move zero index to front to force a matching character (if percent > 0) list.set(list.indexOf(0), list.get(0)); list.set(0, 0); } // Get threshold in the range [0, length], rounding up to ensure that
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 194.8K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
} /** * Utility for remove and iterator.remove: Delete item at position i. Call only when occupying * monitor. */ void removeAt(int i) { final E[] items = this.items; // if removing front item, just advance if (i == takeIndex) { items[takeIndex] = null; takeIndex = inc(takeIndex); } else { // slide over all others up through putIndex. for (; ; ) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0)