commit/bbdaddc33eb0f97c35ded4b2435a8918befd1c49/FlatSets_8h_source.html

#ifndef XRPL_APP_PATHS_IMPL_FLAT_SETS_H_INCLUDED

#define XRPL_APP_PATHS_IMPL_FLAT_SETS_H_INCLUDED


#include <boost/container/flat_set.hpp>


namespace ripple {


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 ripple


#endif

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

ripple::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:16