- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 640 for order1 (0.75 sec)
-
chainable_api.go
Having: tx.Statement.BuildCondition(query, args...), }) return } // Order specify order when retrieving records from database // // db.Order("name DESC") // db.Order(clause.OrderByColumn{Column: clause.Column{Name: "name"}, Desc: true}) // db.Order(clause.OrderBy{Columns: []clause.OrderByColumn{ // {Column: clause.Column{Name: "name"}, Desc: true},
Registered: Sun Sep 07 09:35:13 UTC 2025 - Last Modified: Sun May 25 07:40:40 UTC 2025 - 14.8K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java
* is not guaranteed to traverse the elements of the MonitorBasedPriorityBlockingQueue in * any particular order. If you need ordered traversal, consider using {@code * Arrays.sort(pq.toArray())}. Also, method {@code drainTo} can be used to remove some or * all elements in priority order and place them in another collection. * * <p>Operations on this class make no guarantees about the ordering of elements with equal
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue May 13 18:46:00 UTC 2025 - 18.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/TreeBasedTable.java
return new TreeBasedTable<>(Ordering.natural(), Ordering.natural()); } /** * Creates an empty {@code TreeBasedTable} that is ordered by the specified comparators. * * @param rowComparator the comparator that orders the row keys * @param columnComparator the comparator that orders the column keys */ public static <R, C, V> TreeBasedTable<R, C, V> create(
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Jul 18 15:05:43 UTC 2025 - 11.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeBasedTable.java
return new TreeBasedTable<>(Ordering.natural(), Ordering.natural()); } /** * Creates an empty {@code TreeBasedTable} that is ordered by the specified comparators. * * @param rowComparator the comparator that orders the row keys * @param columnComparator the comparator that orders the column keys */ public static <R, C, V> TreeBasedTable<R, C, V> create(
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Jul 18 15:05:43 UTC 2025 - 11.6K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/Helpers.java
return new EntryComparator<K, V>(keyComparator); } /** * Asserts that all pairs of {@code T} values within {@code valuesInExpectedOrder} are ordered * consistently between their order within {@code valuesInExpectedOrder} and the order implied by * the given {@code comparator}. * * @see #testComparator(Comparator, List) */ public static <T extends @Nullable Object> void testComparator(
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Aug 10 19:54:19 UTC 2025 - 17.2K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/app/service/CrawlingInfoService.java
} /** * Sets up the database query conditions for listing crawling information records. * Applies filters based on the pager criteria such as ID and session ID, * and orders results by creation time in descending order. * * @param cb the condition bean for building the database query * @param crawlingInfoPager the pager containing filter criteria */
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Jul 17 08:28:31 UTC 2025 - 19.9K bytes - Viewed (0) -
guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ImmutableCollection.java
} } /** If this collection is backed by an array of its elements in insertion order, returns it. */ Object @Nullable [] internalArray() { return null; } /** * If this collection is backed by an array of its elements in insertion order, returns the offset * where this collection's elements start. */ int internalArrayStart() {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Aug 06 18:32:41 UTC 2025 - 5.1K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/google/MultimapTestSuiteBuilder.java
} @Override public Iterable<K> order(List<K> insertionOrder) { Iterator<V> valueIter = sampleValuesIterator(); List<Entry<K, V>> entries = new ArrayList<>(); for (K k : insertionOrder) { entries.add(mapEntry(k, valueIter.next())); } Iterable<Entry<K, V>> ordered = multimapGenerator.order(entries); List<K> orderedValues = new ArrayList<>();
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 26.8K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/app/service/DataConfigService.java
* * <p>This method configures the condition bean with search criteria from the pager, * including name wildcards, handler name wildcards, and description matching. * Results are ordered by sort order and name in ascending order.</p> * * <p>Description matching supports:</p> * <ul> * <li>Wildcard matching (if starts or ends with *)</li> * <li>Prefix matching (if ends with *)</li>
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Jul 17 08:28:31 UTC 2025 - 8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MultimapBuilder.java
* Multimap#asMap()} will iterate through the keys in the order that they were first added to the * multimap, save that if all values associated with a key are removed and then the key is added * back into the multimap, that key will come last in the key iteration order. */ public static MultimapBuilderWithKeys<@Nullable Object> linkedHashKeys() {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Jul 16 17:42:14 UTC 2025 - 18K bytes - Viewed (0)