首页
学习
活动
专区
圈层
工具
发布
社区首页 >问答首页 >如何boost::range::sort() a boost::transformed_range?

如何boost::range::sort() a boost::transformed_range?
EN

Stack Overflow用户
提问于 2017-03-11 05:12:49
回答 1查看 1.2K关注 0票数 1

我想从基于foo成员的vector<foo>中获取唯一的元素。我使用boost::adaptors::transform选择成员,然后排序,然后使用boost::adaptors::unique。我在执行排序步骤时遇到了麻烦。暂时抛开unique调用不谈,我已经在Coliru上尝试了以下代码。

代码语言:javascript
复制
#include <iostream>
#include <string>
#include <vector>
#include <boost/range/adaptor/transformed.hpp>
#include <boost/range/algorithm/sort.hpp>

struct foo
{
    foo(std::string a) : bar(a) {}

    std::string bar;
    bool operator<(const foo& rhs) const {return bar < rhs.bar;}
};

int main()
{
    std::vector<foo> words = { foo("z"), foo("d"), foo("b"), foo("c") };

    #if 1
    {
        auto asString = boost::adaptors::transform(words, +[](const foo& x) {return x.bar;});
        auto sortedStrings = boost::range::sort(asString);
        for (const auto& el : sortedStrings)
            std::cout << el << std::endl;
    }
    #else
    {
        auto asString = boost::adaptors::transform(words, +[](const foo& x) {return x.bar;});
        std::sort(asString.begin().base(), asString.end().base());
        for (const auto& el : asString)
            std::cout << el << std::endl;
    }

    {
        auto sortedStrings = boost::range::sort(words);
        for (const auto& el : sortedStrings)
            std::cout << el.bar << std::endl;
    }
    #endif


    return 0;
}

#if部分不起作用:

代码语言:javascript
复制
In file included from /usr/local/include/c++/6.3.0/bits/char_traits.h:39:0,
                 from /usr/local/include/c++/6.3.0/ios:40,
                 from /usr/local/include/c++/6.3.0/ostream:38,
                 from /usr/local/include/c++/6.3.0/iostream:39,
                 from main.cpp:1:
/usr/local/include/c++/6.3.0/bits/stl_algobase.h: In instantiation of 'void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = boost::iterators::transform_iterator<std::__cxx11::basic_string<char> (*)(const foo&), __gnu_cxx::__normal_iterator<foo*, std::vector<foo> >, boost::iterators::use_default, boost::iterators::use_default>; _ForwardIterator2 = boost::iterators::transform_iterator<std::__cxx11::basic_string<char> (*)(const foo&), __gnu_cxx::__normal_iterator<foo*, std::vector<foo> >, boost::iterators::use_default, boost::iterators::use_default>]':
/usr/local/include/c++/6.3.0/bits/stl_algo.h:84:20:   required from 'void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = boost::iterators::transform_iterator<std::__cxx11::basic_string<char> (*)(const foo&), __gnu_cxx::__normal_iterator<foo*, std::vector<foo> >, boost::iterators::use_default, boost::iterators::use_default>; _Compare = __gnu_cxx::__ops::_Iter_less_iter]'
/usr/local/include/c++/6.3.0/bits/stl_algo.h:1918:34:   required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = boost::iterators::transform_iterator<std::__cxx11::basic_string<char> (*)(const foo&), __gnu_cxx::__normal_iterator<foo*, std::vector<foo> >, boost::iterators::use_default, boost::iterators::use_default>; _Compare = __gnu_cxx::__ops::_Iter_less_iter]'
/usr/local/include/c++/6.3.0/bits/stl_algo.h:1950:38:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = boost::iterators::transform_iterator<std::__cxx11::basic_string<char> (*)(const foo&), __gnu_cxx::__normal_iterator<foo*, std::vector<foo> >, boost::iterators::use_default, boost::iterators::use_default>; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]'
/usr/local/include/c++/6.3.0/bits/stl_algo.h:1965:25:   required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = boost::iterators::transform_iterator<std::__cxx11::basic_string<char> (*)(const foo&), __gnu_cxx::__normal_iterator<foo*, std::vector<foo> >, boost::iterators::use_default, boost::iterators::use_default>; _Compare = __gnu_cxx::__ops::_Iter_less_iter]'
/usr/local/include/c++/6.3.0/bits/stl_algo.h:4707:18:   required from 'void std::sort(_RAIter, _RAIter) [with _RAIter = boost::iterators::transform_iterator<std::__cxx11::basic_string<char> (*)(const foo&), __gnu_cxx::__normal_iterator<foo*, std::vector<foo> >, boost::iterators::use_default, boost::iterators::use_default>]'
/usr/local/include/boost/range/algorithm/sort.hpp:33:14:   required from 'RandomAccessRange& boost::range::sort(RandomAccessRange&) [with RandomAccessRange = boost::range_detail::transformed_range<std::__cxx11::basic_string<char> (*)(const foo&), std::vector<foo> >]'
main.cpp:27:57:   required from here
/usr/local/include/c++/6.3.0/bits/stl_algobase.h:148:11: error: no matching function for call to 'swap(boost::iterators::detail::iterator_facade_base<boost::iterators::transform_iterator<std::__cxx11::basic_string<char> (*)(const foo&), __gnu_cxx::__normal_iterator<foo*, std::vector<foo> >, boost::iterators::use_default, boost::iterators::use_default>, std::__cxx11::basic_string<char>, boost::iterators::random_access_traversal_tag, std::__cxx11::basic_string<char>, long int, false, false>::reference, boost::iterators::detail::iterator_facade_base<boost::iterators::transform_iterator<std::__cxx11::basic_string<char> (*)(const foo&), __gnu_cxx::__normal_iterator<foo*, std::vector<foo> >, boost::iterators::use_default, boost::iterators::use_default>, std::__cxx11::basic_string<char>, boost::iterators::random_access_traversal_tag, std::__cxx11::basic_string<char>, long int, false, false>::reference)'
       swap(*__a, *__b);

#else部分中具有基本迭代器类型的std::sort确实可以工作。我不明白为什么。在我的实际用例中,我还使用了boost::adaptors::indirectboost::adaptors::filter (我更喜欢在进行排序之前进行过滤,或者至少尝试这样做,看看它的性能如何),这就是为什么在进行转换之前,我不会简单地使用lambda谓词对words进行排序。

EN

回答 1

Stack Overflow用户

回答已采纳

发布于 2017-03-13 02:05:24

问题是您有一个不能交换的临时字符串的视图。您可以使用以下代码修复您的代码:

代码语言:javascript
复制
auto asString = boost::adaptors::transform(words, +[](foo& x) -> std::string& {return x.bar;});

Demo

请注意,这样做可以直接对字符串进行排序,而不是对类进行排序。

票数 2
EN
页面原文内容由Stack Overflow提供。腾讯云小微IT领域专用引擎提供翻译支持
原文链接:

https://stackoverflow.com/questions/42727801

复制
相关文章

相似问题

领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档