Hi JUCE team,
I just noticed that the Arrays removeIf function is in O(n^2) because when it removes an element it directly moves all following elements down.
Although, the great benefit from the removeIf mechanic is that it can be implemented in O(n) by removing all elements first and then shifting the elements down to fill the gaps.
Hope this gets considered when you have the time 
Best, Rincewind