github-code-scanning[bot] commented on code in PR #13168:
URL: https://github.com/apache/druid/pull/13168#discussion_r1056440414


##########
processing/src/main/java/org/apache/druid/collections/QueueBasedSorter.java:
##########
@@ -0,0 +1,90 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements.  See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership.  The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License.  You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied.  See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+package org.apache.druid.collections;
+
+import com.google.common.collect.Iterators;
+import com.google.common.collect.MinMaxPriorityQueue;
+import com.google.common.collect.Ordering;
+
+import java.util.ArrayList;
+import java.util.Comparator;
+import java.util.Iterator;
+import java.util.List;
+
+/**
+ * This sorter is applicable to two cases:
+ * 1.Result Set Merge
+ * 2.Sort the internal data of segment in the way of delayed materialization
+ */
+public class QueueBasedSorter<T> implements Sorter<T>
+{
+
+  private final MinMaxPriorityQueue<T[]> queue;
+
+  public QueueBasedSorter(int limit, Comparator<T[]> comparator)
+  {
+    this.queue = MinMaxPriorityQueue
+        .orderedBy(Ordering.from(comparator))
+        .maximumSize(limit)
+        .create();
+  }
+
+  public QueueBasedSorter(int limit, Ordering<T[]> ordering)
+  {
+    this.queue = MinMaxPriorityQueue
+        .orderedBy(ordering)
+        .maximumSize(limit)
+        .create();
+  }
+
+  @Override
+  public void add(T[] sorterElement)
+  {
+    queue.offer(sorterElement);

Review Comment:
   ## Ignored error status of call
   
   Method add ignores exceptional return value of 
MinMaxPriorityQueue<T\[\]>.offer.
   
   [Show more 
details](https://github.com/apache/druid/security/code-scanning/3586)



-- 
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

To unsubscribe, e-mail: [email protected]

For queries about this service, please contact Infrastructure at:
[email protected]


---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]

Reply via email to