Inconsistent complexities in Data.Set
|Reported by:||dpt@…||Owned by:|
|Type of failure:||Test Case:|
|Related Tickets:||Differential Rev(s):|
The documentation for Data.Set says that 'insert' can be performed in time O(log n). On the other hand, the same operation can also be done with 'singleton' followed by 'union', for a claimed complexity of O(n), which doesn't seem credible.