by reserving space up front, we avoid rellocating storage as elements
are inserted
Signed-off-by: Casey Bodley <cbodley@redhat.com>
__u32 n;
decode(n, p);
s.clear();
+ s.reserve(n);
while (n--) {
T v;
decode(v, p);
decode_nohead(int len, boost::container::flat_set<T, Comp, Alloc>& s,
bufferlist::iterator& p)
{
+ s.reserve(len);
for (int i=0; i<len; i++) {
T v;
decode(v, p);
__u32 n;
decode(n, p);
m.clear();
+ m.reserve(n);
while (n--) {
T k;
decode(k, p);
{
__u32 n;
decode(n, p);
+ m.reserve(m.size() + n);
while (n--) {
T k;
decode(k, p);