[
https://issues.apache.org/jira/browse/COLLECTIONS-296?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=12598778#action_12598778
]
Julius Davies commented on COLLECTIONS-296:
-------------------------------------------
I think the ignoreDups idea is excellent. I'll submit a newer patch
incorporating that later tonight.
Thanks for the java.util.Collections.binarySearch() tip! I've been converting
to Object[] and using Arrays.binarySearch() all these years! [blush]
> Introduce SortedUtils.merge() for merging sorted collections
> ------------------------------------------------------------
>
> Key: COLLECTIONS-296
> URL: https://issues.apache.org/jira/browse/COLLECTIONS-296
> Project: Commons Collections
> Issue Type: New Feature
> Components: Core
> Reporter: Julius Davies
> Priority: Minor
> Attachments: SortedUtils.patch
>
>
> Is there any interest in this?
> /**
> * Returns a new ArrayList where sorted Collection a and sorted
> Collection b
> * are combined such that ordering of the elements according to
> * Comparator c is retained. Uses the standard O(n) merge algorithm
> * for combining two sorted lists.
> *
> * @param a Object to combine with sorted Collection b. Must implement
> Comparable.
> * @param b Sorted Collection to combine with Object a.
> * @param c Comparator by which Collection a and Collection b have been
> sorted, or null
> * if the Collections are sorted according to their natural
> ordering.
> * @return a new sorted ArrayList
> */
> public static ArrayList merge(Collection a, Collection b, Comparator c);
--
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.
