I'm looking at Swift Set operations, and notice the time complexity is not ducmented, e.g. for insert(), remove(), and contains()
I see Set adopts Hashable, which means I could assume Set.contains() is O(1), but for remove() and insert(), I'm not quite sure whether it's O(1) or could be O(n).
The soucre code of Set is also hard to tell: swift/Set.swift at main · apple/swift · GitHub
_variant.remove(member) is hard to tell what is _variant implementation.
Could someone help to clarify the time complexity, as well as where is the proper place to report this so Apple could add the doc?