我无法得到std :: remove_if进行编译,因为你可以看到我选择了一种工作正常的替代手动曲柄方法,编译器错误位于代码之后的列表底部.
任何帮助将非常感激.
谢谢,汤姆
#include <iostream>
#include <fstream>
#include <set>
#include <algorithm>
#include <string>
//
// Find the largest compound word composed
// of sub-words from a list.
//
// - read list from file.
//
// Psuedo Code:
//
// 1. Read Next Word from File.
// 2. Search in list for word formed from word.
// 3. if Found in List
// 4. if Found Compound is longer then Current Compound
// 5. Replace
// 6. Remove all strings less then Current Compound Length
// 7.
//
typedef std::set<std::string> StrSet;
typedef StrSet::iterator StrSetIter;
struct if_substr
{
std::string m_word;
public:
if_substr(const std::string& w) : m_word(w) { }
bool operator() (const std::string& str) const
{
std::size_t f = m_word.find(str);
return (std::string::npos!=f && m_word.length()>str.length());
}
};
struct if_remove
{
std::string m_word;
public:
if_remove(const std::string& w) : m_word(w) { }
bool operator() (std::string str) const
{
return m_word.length()>str.length();
}
};
class FindLongestCompound
{
std::ifstream m_file;
StrSet m_words;
std::string m_current;
public:
FindLongestCompound(std::string filename)
{
m_file.open(filename, std::ifstream::in);
if (!m_file)
throw std::runtime_error("Failed to open file"+filename);
}
void Start(void)
{
std::string nextWord;
while(m_file >> nextWord)
{
std::cout << "read word: " << nextWord << std::endl;
if_substr ifSubstr(nextWord);
StrSetIter srchItem = std::find_if(std::begin(m_words), std::end(m_words),ifSubstr);
if (srchItem != m_words.end())
{
m_current = nextWord;
std::cout << "new current: " << m_current << std::endl;
if_remove ifRemove(m_current);
std::remove_if(m_words.begin(), m_words.end(),ifRemove);
#if 0
StrSetIter j = m_words.begin();
do
{
if (j->length() < m_current.length())
j = m_words.erase(j);
else
j++;
} while (j != m_words.end());
#endif
}
std::cout << "insert next word: " << nextWord << std::endl;
m_words.insert(nextWord);
}
}
std::string result() { return m_current; }
};
int main(int argc, char *argv[])
{
if (argc<2)
{
std::cout << "Please provide filename" << std::endl;
return -1;
}
FindLongestCompound flc(argv[1]);
flc.Start();
std::cout << "result: " << flc.result() << std::endl;
}
Run Code Online (Sandbox Code Playgroud)
Run Code Online (Sandbox Code Playgroud)--- errors --- In file included from stackoverflow.C:2: In file included from /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../include/c++/v1/iostream:38: In file included from /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../include/c++/v1/ios:216: In file included from /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../include/c++/v1/__locale:15: In file included from /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../include/c++/v1/string:439: /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../include/c++/v1/algorithm:2148:26: error: no viable overloaded '=' *__first = _VSTD::move(*__i); ~~~~~~~~ ^ ~~~~~~~~~~~~~~~~~ stackoverflow.C:91:8: note: in instantiation of function template specialization 'std::__1::remove_if<std::__1::__tree_const_iterator<std::__1::basic_string<char>, std::__1::__tree_node<std::__1::basic_string<char>, void *> *, long>, if_remove>' requested here std::remove_if(m_words.begin(), m_words.end(),ifRemove); ^ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../include/c++/v1/string:1415:19: note: candidate function not viable: 'this' argument has type 'const value_type' (aka 'const std::__1::basic_string<char>'), but method is not marked const basic_string& operator=(const basic_string& __str); ^ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../include/c++/v1/string:1422:45: note: candidate function not viable: 'this' argument has type 'const value_type' (aka 'const std::__1::basic_string<char>'), but method is not marked const _LIBCPP_INLINE_VISIBILITY basic_string& operator=(const value_type* __s) {return assign(__s);} ^ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../include/c++/v1/string:1423:19: note: candidate function not viable: 'this' argument has type 'const value_type' (aka 'const std::__1::basic_string<char>'), but method is not marked const basic_string& operator=(value_type __c); ^ 1 error generated.
问题不在于您的仿函数,而在于您正在使用的容器类型.你不能用std::remove_if一个std::set(你StrSet在这种情况下).
简而言之,std::remove_if不删除任何内容,只是更改元素的顺序,使"已删除"元素仅出现在某个点之后.只有erase真正消除它们.
std::set但是,A 具有定义的元素顺序,任何操作都不能绕过该顺序.假设您有以下一组按字典顺序排列的字符串:
{ "aaa", "bbb", "ccc", "ddd", "eee" }
Run Code Online (Sandbox Code Playgroud)
现在,您尝试std::remove_if使用一个移除所有仅元音字符串的仿函数.你会最终得到这个:
{ "bbb", "ccc", "ddd", "aaa", "eee" }
^
|
"removed" elements start here
Run Code Online (Sandbox Code Playgroud)
这适用于例如std::vector但不是std::set因为它会导致一个元素不再正确排序的集合("删除"元素仍然是集合的一部分!).所以你得到一个编译错误.
为了达到预期目标,请std::set::erase在循环中使用.它将正常工作,因为只有擦除元素的迭代器无效,因此end()仍然有效.
if_remove ifRemove(m_current);
for (StrSet::iterator set_iter = m_words.begin(); set_iter != m_words.end(); )
{
if (ifRemove(*set_iter))
{
set_iter = m_words.erase(set_iter);
}
else
{
++set_iter;
}
}
Run Code Online (Sandbox Code Playgroud)
在C++ 11中,您可以使用auto而不是StrSet::iterator.
| 归档时间: |
|
| 查看次数: |
330 次 |
| 最近记录: |