20#ifndef RIPPLE_APP_PATHS_IMPL_FLAT_SETS_H_INCLUDED
21#define RIPPLE_APP_PATHS_IMPL_FLAT_SETS_H_INCLUDED
23#include <boost/container/flat_set.hpp>
36 boost::container::flat_set<T>& dst,
37 boost::container::flat_set<T>
const& src)
42 dst.reserve(dst.size() + src.size());
44 boost::container::ordered_unique_range_t{}, src.begin(), src.end());
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
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.