FM / fwd

/usr/include/boost/hana/fwd

Name	Size	Mode	Actions
concept/	-	0755	rm
core/	-	0755	rm
accessors.hpp	1519	0644	edit dl rm
adapt_adt.hpp	1596	0644	edit dl rm
adapt_struct.hpp	1586	0644	edit dl rm
adjust.hpp	1787	0644	edit dl rm
adjust_if.hpp	2275	0644	edit dl rm
all.hpp	1185	0644	edit dl rm
all_of.hpp	1476	0644	edit dl rm
and.hpp	1441	0644	edit dl rm
any.hpp	1178	0644	edit dl rm
any_of.hpp	1445	0644	edit dl rm
ap.hpp	2649	0644	edit dl rm
append.hpp	2044	0644	edit dl rm
at.hpp	2824	0644	edit dl rm
at_key.hpp	2334	0644	edit dl rm
back.hpp	1355	0644	edit dl rm
basic_tuple.hpp	2292	0644	edit dl rm
bool.hpp	384	0644	edit dl rm
cartesian_product.hpp	1837	0644	edit dl rm
chain.hpp	1964	0644	edit dl rm
comparing.hpp	1924	0644	edit dl rm
concat.hpp	1838	0644	edit dl rm
contains.hpp	2378	0644	edit dl rm
core.hpp	619	0644	edit dl rm
count.hpp	1683	0644	edit dl rm
count_if.hpp	1634	0644	edit dl rm
cycle.hpp	2460	0644	edit dl rm
define_struct.hpp	1582	0644	edit dl rm
difference.hpp	854	0644	edit dl rm
div.hpp	1772	0644	edit dl rm
drop_back.hpp	2016	0644	edit dl rm
drop_front.hpp	2268	0644	edit dl rm
drop_front_exactly.hpp	2409	0644	edit dl rm
drop_while.hpp	2047	0644	edit dl rm
duplicate.hpp	1574	0644	edit dl rm
empty.hpp	1306	0644	edit dl rm
equal.hpp	2584	0644	edit dl rm
erase_key.hpp	876	0644	edit dl rm
eval.hpp	2012	0644	edit dl rm
eval_if.hpp	6453	0644	edit dl rm
extend.hpp	1733	0644	edit dl rm
extract.hpp	1547	0644	edit dl rm
fill.hpp	1412	0644	edit dl rm
filter.hpp	2600	0644	edit dl rm
find.hpp	1778	0644	edit dl rm
find_if.hpp	1734	0644	edit dl rm
first.hpp	1470	0644	edit dl rm
flatten.hpp	1727	0644	edit dl rm
fold.hpp	1066	0644	edit dl rm
fold_left.hpp	3004	0644	edit dl rm
fold_right.hpp	3193	0644	edit dl rm
for_each.hpp	1513	0644	edit dl rm
front.hpp	1401	0644	edit dl rm
fuse.hpp	1580	0644	edit dl rm
greater.hpp	1464	0644	edit dl rm
greater_equal.hpp	1563	0644	edit dl rm
group.hpp	3872	0644	edit dl rm
hash.hpp	2158	0644	edit dl rm
if.hpp	1651	0644	edit dl rm
index_if.hpp	1846	0644	edit dl rm
insert.hpp	1695	0644	edit dl rm
insert_range.hpp	1778	0644	edit dl rm
integral_constant.hpp	4791	0644	edit dl rm
intersection.hpp	872	0644	edit dl rm
intersperse.hpp	1780	0644	edit dl rm
is_disjoint.hpp	1445	0644	edit dl rm
is_empty.hpp	1453	0644	edit dl rm
is_subset.hpp	2800	0644	edit dl rm
keys.hpp	1338	0644	edit dl rm
lazy.hpp	4593	0644	edit dl rm
length.hpp	1415	0644	edit dl rm
less.hpp	1394	0644	edit dl rm
less_equal.hpp	1493	0644	edit dl rm
lexicographical_compare.hpp	3819	0644	edit dl rm
lift.hpp	1686	0644	edit dl rm
map.hpp	13142	0644	edit dl rm
max.hpp	1150	0644	edit dl rm
maximum.hpp	4344	0644	edit dl rm
members.hpp	1256	0644	edit dl rm
min.hpp	1525	0644	edit dl rm
minimum.hpp	4334	0644	edit dl rm
minus.hpp	2101	0644	edit dl rm
mod.hpp	1970	0644	edit dl rm
monadic_compose.hpp	2296	0644	edit dl rm
monadic_fold_left.hpp	4016	0644	edit dl rm
monadic_fold_right.hpp	4174	0644	edit dl rm
mult.hpp	1933	0644	edit dl rm
negate.hpp	1022	0644	edit dl rm
none.hpp	1217	0644	edit dl rm
none_of.hpp	1498	0644	edit dl rm
not.hpp	1220	0644	edit dl rm
not_equal.hpp	2115	0644	edit dl rm
one.hpp	1116	0644	edit dl rm
optional.hpp	18788	0644	edit dl rm
or.hpp	1426	0644	edit dl rm
ordering.hpp	1902	0644	edit dl rm
pair.hpp	5768	0644	edit dl rm
partition.hpp	2731	0644	edit dl rm
permutations.hpp	1563	0644	edit dl rm
plus.hpp	1944	0644	edit dl rm
power.hpp	1560	0644	edit dl rm
prefix.hpp	2097	0644	edit dl rm
prepend.hpp	2415	0644	edit dl rm
product.hpp	2636	0644	edit dl rm
range.hpp	5480	0644	edit dl rm
remove.hpp	2177	0644	edit dl rm
remove_at.hpp	2371	0644	edit dl rm
remove_if.hpp	2155	0644	edit dl rm
remove_range.hpp	2745	0644	edit dl rm
repeat.hpp	1624	0644	edit dl rm
replace.hpp	1842	0644	edit dl rm
replace_if.hpp	1853	0644	edit dl rm
replicate.hpp	2511	0644	edit dl rm
reverse.hpp	1187	0644	edit dl rm
reverse_fold.hpp	2886	0644	edit dl rm
scan_left.hpp	3712	0644	edit dl rm
scan_right.hpp	3811	0644	edit dl rm
second.hpp	1477	0644	edit dl rm
set.hpp	9981	0644	edit dl rm
size.hpp	929	0644	edit dl rm
slice.hpp	3524	0644	edit dl rm
sort.hpp	3770	0644	edit dl rm
span.hpp	2858	0644	edit dl rm
string.hpp	10794	0644	edit dl rm
suffix.hpp	2081	0644	edit dl rm
sum.hpp	3253	0644	edit dl rm
symmetric_difference.hpp	944	0644	edit dl rm
take_back.hpp	2178	0644	edit dl rm
take_front.hpp	2231	0644	edit dl rm
take_while.hpp	1692	0644	edit dl rm
tap.hpp	2183	0644	edit dl rm
then.hpp	1420	0644	edit dl rm
transform.hpp	1467	0644	edit dl rm
tuple.hpp	8554	0644	edit dl rm
type.hpp	19848	0644	edit dl rm
unfold_left.hpp	2546	0644	edit dl rm
unfold_right.hpp	2569	0644	edit dl rm
union.hpp	811	0644	edit dl rm
unique.hpp	3337	0644	edit dl rm
unpack.hpp	3560	0644	edit dl rm
value.hpp	3159	0644	edit dl rm
while.hpp	2432	0644	edit dl rm
zero.hpp	1095	0644	edit dl rm
zip.hpp	1918	0644	edit dl rm
zip_shortest.hpp	2039	0644	edit dl rm
zip_shortest_with.hpp	2163	0644	edit dl rm
zip_with.hpp	2042	0644	edit dl rm

Edit: /usr/include/boost/hana/fwd/set.hpp (9981B)

/*!
@file
Forward declares `boost::hana::set`.

@copyright Louis Dionne 2013-2017
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)
 */

#ifndef BOOST_HANA_FWD_SET_HPP
#define BOOST_HANA_FWD_SET_HPP

#include <boost/hana/config.hpp>
#include <boost/hana/fwd/core/to.hpp>
#include <boost/hana/fwd/core/make.hpp>
#include <boost/hana/fwd/erase_key.hpp>

BOOST_HANA_NAMESPACE_BEGIN
    //! @ingroup group-datatypes
    //! Basic unordered container requiring unique, `Comparable` and
    //! `Hashable` keys.
    //!
    //! A set is an unordered container that can hold heterogeneous keys.
    //! A set requires (and ensures) that no duplicates are present when
    //! inserting new keys.
    //!
    //! @note
    //! The actual representation of a `hana::set` is implementation-defined.
    //! In particular, one should not take for granted the order of the
    //! template parameters and the presence of any additional constructors
    //! or assignment operators than what is documented. The canonical way of
    //! creating a `hana::set` is through `hana::make_set`. More details
    //! [in the tutorial](@ref tutorial-containers-types).
    //!
    //!
    //! Modeled concepts
    //! ----------------
    //! 1. `Comparable`\n
    //! Two sets are equal iff they contain the same elements, regardless of
    //! the order.
    //! @include example/set/comparable.cpp
    //!
    //! 2. Foldable\n
    //! Folding a set is equivalent to folding the sequence of its values.
    //! However, note that the values are not required to be in any specific
    //! order, so using the folds provided here with an operation that is not
    //! both commutative and associative will yield non-deterministic behavior.
    //! @include example/set/foldable.cpp
    //!
    //! 3. Searchable\n
    //! The elements in a set act as both its keys and its values. Since the
    //! elements of a set are unique, searching for an element will return
    //! either the only element which is equal to the searched value, or
    //! `nothing`. Also note that `operator[]` can be used instead of the
    //! `at_key` function.
    //! @include example/set/searchable.cpp
    //!
    //!
    //! Conversion from any `Foldable`
    //! ------------------------------
    //! Any `Foldable` structure can be converted into a `hana::set` with
    //! `to<set_tag>`. The elements of the structure must all be compile-time
    //! `Comparable`. If the structure contains duplicate elements, only
    //! the first occurence will appear in the resulting set. More
    //! specifically, conversion from a `Foldable` is equivalent to
    //! @code
    //!     to<set_tag>(xs) == fold_left(xs, make_set(), insert)
    //! @endcode
    //!
    //! __Example__
    //! @include example/set/to.cpp
#ifdef BOOST_HANA_DOXYGEN_INVOKED
    template <typename implementation_defined>
    struct set {
        //! Default-construct a set. This constructor only exists when all the
        //! elements of the set are default-constructible.
        constexpr set() = default;

//! Copy-construct a set from another set. This constructor only
        //! exists when all the elements of the set are copy-constructible.
        constexpr set(set const& other) = default;

//! Move-construct a set from another set. This constructor only
        //! exists when all the elements of the set are move-constructible.
        constexpr set(set&& other) = default;

//! Equivalent to `hana::equal`
        template <typename X, typename Y>
        friend constexpr auto operator==(X&& x, Y&& y);

//! Equivalent to `hana::not_equal`
        template <typename X, typename Y>
        friend constexpr auto operator!=(X&& x, Y&& y);

//! Equivalent to `hana::at_key`
        template <typename Key>
        constexpr decltype(auto) operator[](Key&& key);
    };
#else
    template <typename ...Xs>
    struct set;
#endif

//! Tag representing the `hana::set` container.
    //! @relates hana::set
    struct set_tag { };

//! Function object for creating a `hana::set`.
    //! @relates hana::set
    //!
    //! Given zero or more values `xs...`, `make<set_tag>` returns a `set`
    //! containing those values. The values must all be compile-time
    //! `Comparable`, and no duplicate values may be provided. To create
    //! a `set` from a sequence with possible duplicates, use `to<set_tag>`
    //! instead.
    //!
    //!
    //! Example
    //! -------
    //! @include example/set/make.cpp
#ifdef BOOST_HANA_DOXYGEN_INVOKED
    template <>
    constexpr auto make<set_tag> = [](auto&& ...xs) {
        return set<implementation_defined>{forwarded(xs)...};
    };
#endif

//! Equivalent to `make<set_tag>`; provided for convenience.
    //! @relates hana::set
    //!
    //!
    //! Example
    //! -------
    //! @include example/set/make.cpp
    constexpr auto make_set = make<set_tag>;

//! Insert an element in a `hana::set`.
    //! @relates hana::set
    //!
    //! If the set already contains an element that compares equal, then
    //! nothing is done and the set is returned as is.
    //!
    //!
    //! @param set
    //! The set in which to insert a value.
    //!
    //! @param element
    //! The value to insert. It must be compile-time `Comparable`.
    //!
    //!
    //! Example
    //! -------
    //! @include example/set/insert.cpp
#ifdef BOOST_HANA_DOXYGEN_INVOKED
    constexpr auto insert = [](auto&& set, auto&& element) {
        return tag-dispatched;
    };
#endif

//! Remove an element from a `hana::set`.
    //! @relates hana::set
    //!
    //! Returns a new set containing all the elements of the original,
    //! except the one comparing `equal` to the given element. If the set
    //! does not contain such an element, a new set equal to the original
    //! set is returned.
    //!
    //!
    //! @param set
    //! The set in which to remove a value.
    //!
    //! @param element
    //! The value to remove. It must be compile-time `Comparable`.
    //!
    //!
    //! Example
    //! -------
    //! @include example/set/erase_key.cpp
#ifdef BOOST_HANA_DOXYGEN_INVOKED
    constexpr auto erase_key = [](auto&& set, auto&& element) {
        return tag-dispatched;
    };
#endif

//! Returns the union of two sets.
    //! @relates hana::set
    //!
    //! Given two sets `xs` and `ys`, `union_(xs, ys)` is a new set containing
    //! all the elements of `xs` and all the elements of `ys`, without
    //! duplicates. For any object `x`, the following holds: `x` is in
    //! `hana::union_(xs, ys)` if and only if `x` is in `xs` or `x` is in `ys`.
    //!
    //!
    //! @param xs, ys
    //! Two sets to compute the union of.
    //!
    //!
    //! Example
    //! -------
    //! @include example/set/union.cpp
#ifdef BOOST_HANA_DOXYGEN_INVOKED
    constexpr auto union_ = [](auto&& xs, auto&& ys) {
        return tag-dispatched;
    };
#endif

//! Returns the intersection of two sets.
    //! @relates hana::set
    //!
    //! Given two sets `xs` and `ys`, `intersection(xs, ys)` is a new set
    //! containing exactly those elements that are present both in `xs` and
    //! in `ys`.
    //! In other words, the following holds for any object `x`:
    //! @code
    //!     x ^in^ intersection(xs, ys) if and only if x ^in^ xs && x ^in^ ys
    //! @endcode
    //!
    //!
    //! @param xs, ys
    //! Two sets to intersect.
    //!
    //!
    //! Example
    //! -------
    //! @include example/set/intersection.cpp
#ifdef BOOST_HANA_DOXYGEN_INVOKED
    constexpr auto intersection = [](auto&& xs, auto&& ys) {
        return tag-dispatched;
    };
#endif
    //! Equivalent to `to<set_tag>`; provided for convenience.
    //! @relates hana::set
    constexpr auto to_set = to<set_tag>;

//! Returns the set-theoretic difference of two sets.
    //! @relates hana::set
    //!
    //! Given two sets `xs` and `ys`, `difference(xs, ys)` is a new set
    //! containing all the elements of `xs` that are _not_ contained in `ys`.
    //! For any object `x`, the following holds:
    //! @code
    //!     x ^in^ difference(xs, ys) if and only if x ^in^ xs && !(x ^in^ ys)
    //! @endcode
    //!
    //!
    //! This operation is not commutative, i.e. `difference(xs, ys)` is not
    //! necessarily the same as `difference(ys, xs)`. Indeed, consider the
    //! case where `xs` is empty and `ys` isn't. Then, `difference(xs, ys)`
    //! is empty but `difference(ys, xs)` is equal to `ys`. For the symmetric
    //! version of this operation, see `symmetric_difference`.
    //!
    //!
    //! @param xs
    //! A set param to remove values from.
    //!
    //! @param ys
    //! The set whose values are removed from `xs`.
    //!
    //!
    //! Example
    //! -------
    //! @include example/set/difference.cpp
#ifdef BOOST_HANA_DOXYGEN_INVOKED
    constexpr auto difference = [](auto&& xs, auto&& ys) {
        return tag-dispatched;
};
#endif

//! Returns the symmetric set-theoretic difference of two sets.
    //! @relates hana::set
    //!
    //! Given two sets `xs` and `ys`, `symmetric_difference(xs, ys)` is a new
    //! set containing all the elements of `xs` that are not contained in `ys`,
    //! and all the elements of `ys` that are not contained in `xs`. The
    //! symmetric difference of two sets satisfies the following:
    //! @code
    //!     symmetric_difference(xs, ys) == union_(difference(xs, ys), difference(ys, xs))
    //! @endcode
    //!
    //!
    //! @param xs, ys
    //! Two sets to compute the symmetric difference of.
    //!
    //!
    //! Example
    //! -------
    //! @include example/set/symmetric_difference.cpp
#ifdef BOOST_HANA_DOXYGEN_INVOKED
constexpr auto symmetric_difference = [](auto&& xs, auto&& ys) {
        return tag-dispatched;
    };
#endif

BOOST_HANA_NAMESPACE_END

#endif // !BOOST_HANA_FWD_SET_HPP

cmd: