rippled/FlatSets_8h_source.html

#pragma once


#include <boost/container/flat_set.hpp>


namespace xrpl {


template <class T>

void


SetUnion(boost::container::flat_set<T>& dst, boost::container::flat_set<T> const& src)

{

    if (src.empty())

        return;


    dst.reserve(dst.size() + src.size());

    dst.insert(boost::container::ordered_unique_range_t{}, src.begin(), src.end());

}


}  // namespace xrpl

xrpl
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
Definition algorithm.h:5

xrpl::SetUnion
void SetUnion(boost::container::flat_set< T > &dst, boost::container::flat_set< T > const &src)
Given two flat sets dst and src, compute dst = dst union src.
Definition FlatSets.h:15