better naming

dap/utils/sorter.py

@@ -20,13 +20,13 @@ class Sorter:
         self.max_ID = max(self.max_ID, ID)
 
     def flush_ready(self):
-        res = self._collect_contiguous_IDs()
+        res = self._collect_contiguous_entries()
         skipped = self._skip_over_gap()
         if skipped:
-            res += self._drop_old_entries()
+            res += self._collect_old_entries()
         return res
 
-    def _collect_contiguous_IDs(self):
+    def _collect_contiguous_entries(self):
         res = []
         while self.next_ID in self.buffer:
             current = self.buffer.pop(self.next_ID)
@@ -41,7 +41,7 @@ class Sorter:
             self.next_ID = threshold
         return skip
 
-    def _drop_old_entries(self):
+    def _collect_old_entries(self):
         res = []
         for i in sorted(self.buffer):
             if i >= self.next_ID: