Re:Libc++'s Implementation of std::string
by slavik81 on Thursday January 30, 2020 @10:36PM
(#22198795)
To be O(N), the time required for the lookup would have to continue to grow indefinitely. This has an upper bound.
[ Parent
| on HN ]
There are no comments on this comment yet.