Hi Tomas

On Thu, Oct 23, 2025 at 11:49:31PM +0200, Tomas Härdin via ffmpeg-devel wrote:
> ons 2025-10-22 klockan 15:05 +0200 skrev Michael Niedermayer via
> ffmpeg-devel:
> > One difference that favors lower level languages is that with
> > high level languages one looses sight of the cost of operations
> > 
> > Teh closer you are to the implementation of a data structure, like
> > if you are on the team of people who developed or maintains it.
> > The more likely you are also aware of its cost or one of the reviewer
> > would spot you doing a O(n^2) operation as if its O(1)
> 
> I'd argue the exact opposite. There are O(N²) spots in the code that
> are entirely the result of using C'isms where STL would have given you
> O(NlogN) basically for free. And where that still isn't enough there's
> std::unordered_met and the like. Complexity guarantees are part of the
> documentation for these types.

First, there are places where O(N²) is faster than O(NlogN)
And there are places where it doesnt matter.

For what remains, please open a issue and put be in the CC, not
saying ill fix em, but iam interrested

thx

[...]
-- 
Michael     GnuPG fingerprint: 9FF2128B147EF6730BADF133611EC787040B0FAB

It is dangerous to be right in matters on which the established authorities
are wrong. -- Voltaire