* @param proposalsTwo
* @return a new merged, filtered, sorted array of {@link ICompletionProposal}s created from
* the two given arrays of {@link ICompletionProposal}s.
*/
private ICompletionProposal[] merge(ICompletionProposal[] proposalsOne, ICompletionProposal[] proposalsTwo) {
Set results = new TreeSet(new ProposalComparator());
if (proposalsOne != null) {
for (int i = 0; i < proposalsOne.length; i++)
results.add(proposalsOne[i]);
}