fgenesis / pngrim Goto Github PK

The following

std::vector<Pos> P, Q, R;

Could be upfront reserved for worst-case of w*h, thus reducing pointless resizes

P.reserve(w*h);
Q.reserve(w*h);
R.reserve(w*h);

This is with added memory consumption mind you, but still less-worse case than the existing
method which could land on a resize for the last Pos object which most vector implementations
have a resize factor ranging anywhere from the golden ratio to 2. So, w*h*2 worse case memory
existing method, this is half that.

All the queue operations seem to occur at the tail end. A vector could be used here instead for much better performance characteristics.

hey,

thanks for the PD algorithm in main.cpp : )
i've adapted it for a pixel library of mine successfully.

much appreciated!

• r-lyeh