- Sort Score
- Result 10 results
- Languages All
Results 141 - 150 of 627 for ordered (0.13 sec)
-
guava-testlib/src/com/google/common/collect/testing/google/SetGenerators.java
@Override protected SortedSet<String> create(String[] elements) { return ImmutableSortedSet.orderedBy(STRING_REVERSED).add(elements).build(); } /* * While the current implementation returns `this`, that's not something we mean to guarantee. * Callers of TestContainerGenerator.order need to be prepared for implementations to return a new * collection. */
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Aug 10 19:54:19 UTC 2025 - 15.9K bytes - Viewed (0) -
dbflute_fess/dfprop/classificationDefinitionMap.dfprop
# ; code=[column-name for code]; name=[column-name for name] # ; alias=[column-name for alias]; comment=[column-name for comment]} # ; where=[condition for select]; orderBy=[column-name for ordering] # ; exceptCodeList=[the list of except code] # } # } # } # # *The line that starts with '#' means comment-out. # map:{
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sat Jul 04 22:46:31 UTC 2015 - 2.2K bytes - Viewed (0) -
src/main/webapp/WEB-INF/view/admin/log/admin_log.jsp
<div class="data-wrapper"> <div class="row"> <div class="col-sm-12"> <table class="table table-bordered table-striped"> <thead> <tr> <th><la:message key="labels.log_file_name"/></th>
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Wed Feb 12 20:25:27 UTC 2020 - 4K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/ElementOrderTest.java
@RunWith(JUnit4.class) @NullUnmarked public final class ElementOrderTest { // Node order tests @Test public void nodeOrder_none() { MutableGraph<Integer> graph = GraphBuilder.directed().nodeOrder(unordered()).build(); assertThat(graph.nodeOrder()).isEqualTo(unordered()); } @Test public void nodeOrder_insertion() {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 8.1K bytes - Viewed (0) -
generics.go
sql := "ROW_NUMBER() OVER (PARTITION BY ? ?)" vars := []interface{}{partitionBy} if orderBy, ok := q.db.Statement.Clauses["ORDER BY"]; ok { vars = append(vars, orderBy) } else { vars = append(vars, clause.Clause{Name: "ORDER BY", Expression: clause.OrderBy{ Columns: []clause.OrderByColumn{{Column: clause.PrimaryColumn, Desc: true}}, }}) }
Registered: Sun Sep 07 09:35:13 UTC 2025 - Last Modified: Thu Sep 04 13:13:16 UTC 2025 - 15.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/collect/MinMaxPriorityQueueBenchmark.java
*/ static final class InvertedMinMaxPriorityQueue<T> extends ForwardingQueue<T> { MinMaxPriorityQueue<T> mmHeap; public InvertedMinMaxPriorityQueue(Comparator<T> comparator) { mmHeap = MinMaxPriorityQueue.orderedBy(comparator).create(); } @Override protected Queue<T> delegate() { return mmHeap; } @Override public @Nullable T poll() { return mmHeap.pollLast(); } }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 4.4K bytes - Viewed (0) -
src/main/webapp/WEB-INF/view/admin/role/admin_role_details.jsp
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Feb 13 07:47:04 UTC 2020 - 6.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraphBuilder.java
return newBuilder; } /** * Specifies the order of iteration for the elements of {@link ValueGraph#edges()}, {@link * ValueGraph#adjacentNodes(Object)}, {@link ValueGraph#predecessors(Object)}, {@link * ValueGraph#successors(Object)} and {@link ValueGraph#incidentEdges(Object)}. * * <p>The default value is {@link ElementOrder#unordered() unordered} for mutable graphs. For
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 7.9K bytes - Viewed (0) -
src/main/webapp/WEB-INF/view/admin/elevateword/admin_elevateword_details.jsp
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Feb 13 07:47:04 UTC 2020 - 8.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractGraphBuilder.java
*/ abstract class AbstractGraphBuilder<N> { final boolean directed; boolean allowsSelfLoops = false; ElementOrder<N> nodeOrder = ElementOrder.insertion(); ElementOrder<N> incidentEdgeOrder = ElementOrder.unordered(); Optional<Integer> expectedNodeCount = Optional.absent(); /** * Creates a new instance with the specified edge directionality. *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Dec 21 03:10:51 UTC 2024 - 1.4K bytes - Viewed (0)