Hi guys,

Just wanted to let you know that CollectionSortBehaviour::RemSortedItem breaks if there are multiple elements with the same priority. The current implementation tries to find the index of the element to remove by binary searching. This works fine if everything has a unique priority, but if there are multiple elements with the same priority then this might attempt to remove any elements matching the input priority.

For now we've just changed the implementation to a linear search:

void CollectionSortBehaviour::RemSortedItem(SortComparer comparer, SortedCollection list, Noesis:::BaseComponent* item)
{
list->Remove(item);
}

Obviously this changes the O(log n) -> O(n), but that's fine for us as n is trivially small.