我正在尝试将迭代器用作 std::map 中的值，以便我可以通过对象的 id 高效地查找对象或通过其有效地迭代对象深度。
考虑以下代码:
#include <string>
#include <algorithm>
#include <array>
#include <iostream>
#include <random>
#include <map>
#include <unordered_map>
struct object {
static int next_id;
int id;
int depth;
std::map<int, object>::iterator id_it;
std::multimap<int, std::map<int, object>::iterator>::iterator depth_it;
static std::map<int, object> by_id;
static std::multimap<int, std::map<int, object>::iterator> by_depth;
object() = delete;
object(object const &) = delete;
object(object &&) = delete;
object & operator=(object const &) = delete;
object && operator=(object &&) = delete;
~object() = default;
object(int id) : id(id), depth(rand()) {}
void init(std::map<int, object>::iterator it) {
id_it = it;
depth_it = by_depth.emplace(depth, id_it);
}
static int create() {
auto it = by_id.emplace(next_id, next_id).first;
it->second.init(it);
++next_id;
return it->second.id;
}
static void set_depth(int o, int d) {
auto it = by_id.find(o);
if (it == by_id.end())
return;
auto & obj = it->second;
obj.depth = d;
by_depth.erase(obj.depth_it);
obj.depth_it = by_depth.emplace(obj.depth, obj.id_it);
}
static int get_depth(int o) {
auto it = by_id.find(o);
if (it == by_id.end())
return 0;
return it->second.depth;
}
static int get_id(int o) {
auto it = by_id.find(o);
if (it == by_id.end())
return 0;
return it->second.id;
}
static void destroy(int o) {
auto it = by_id.find(o);
if (it == by_id.end())
return;
by_depth.erase(it->second.depth_it);
by_id.erase(it->first);
}
template <typename T>
static void with(T f) {
for (auto it : by_depth) {
f(it.second->second.id);
}
}
};
int object::next_id = 10000;
std::map<int, object> object::by_id;
std::multimap<int, std::map<int, object>::iterator> object::by_depth;
int main() {
for (int i = 0; i < 100; ++i) {
object::create();
}
for (int i = 0; i < 100; ++i) {
object::set_depth(rand() % 100 + 10000, rand());
}
object::with([](int obj) {
std::cout << object::get_id(obj) << "->" << object::get_depth(obj) << std::endl;
});
for (int i = 0; i < 100; ++i) {
object::destroy(10000 + i);
}
object::with([](int obj) {
std::cout << "Object was not deleted!" << std::endl;
});
}
Clang 发出巨大错误，但 MSVC 在 STRICT 模式下可以很好地编译它。
这里的错误:
In file included from error.cpp:1:
In file included from /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/string:434:
In file included from /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/algorithm:593:
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/utility:221:9: error:
field has incomplete type 'object'
_T2 second;
^
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/__tree:602:16: note:
in instantiation of template class 'std::__1::pair<int, object>' requested here
value_type __value_;
^
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/__tree:624:22: note:
in instantiation of template class 'std::__1::__tree_node<std::__1::pair<int, object>,
void *>' requested here
typedef typename __node::base __node_base;
^
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/map:541:19: note:
in instantiation of template class 'std::__1::__tree_iterator<std::__1::pair<int, object>,
std::__1::__tree_node<std::__1::pair<int, object>, void *> *, long>' requested here
_TreeIterator __i_;
^
error.cpp:13:37: note: in instantiation of template class
'std::__1::__map_iterator<std::__1::__tree_iterator<std::__1::pair<int, object>,
std::__1::__tree_node<std::__1::pair<int, object>, void *> *, long> >' requested here
std::map<int, object>::iterator id_it;
^
error.cpp:9:8: note: definition of 'object' is not complete until the closing '}'
struct object {
^
In file included from error.cpp:6:
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/map:834:44: error:
no viable conversion from 'iterator' (aka '__tree_iterator<value_type, __node_pointer,
difference_type>') to 'iterator' (aka '__map_iterator<typename __base::iterator>')
iterator end() _NOEXCEPT {return __tree_.end();}
^~~~~~~~~~~~~
error.cpp:36:25: note: in instantiation of member function 'std::__1::map<int, object,
std::__1::less<int>, std::__1::allocator<std::__1::pair<const int, object> > >::end'
requested here
if (it == by_id.end())
^
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/map:539:24: note:
candidate constructor (the implicit copy constructor) not viable: no known conversion from
'iterator' (aka '__tree_iterator<value_type, __node_pointer, difference_type>') to 'const
std::__1::__map_iterator<std::__1::__tree_iterator<std::__1::pair<int, object>,
std::__1::__tree_node<std::__1::pair<int, object>, void *> *, long> > &' for 1st argument
class _LIBCPP_TYPE_VIS __map_iterator
^
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/map:539:24: note:
candidate constructor (the implicit move constructor) not viable: no known conversion from
'iterator' (aka '__tree_iterator<value_type, __node_pointer, difference_type>') to
'std::__1::__map_iterator<std::__1::__tree_iterator<std::__1::pair<int, object>,
std::__1::__tree_node<std::__1::pair<int, object>, void *> *, long> > &&' for 1st argument
class _LIBCPP_TYPE_VIS __map_iterator
^
In file included from error.cpp:6:
In file included from /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/map:371:
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/__tree:1968:19: error:
static_cast from '__node_pointer' (aka 'std::__1::__tree_node<std::__1::pair<int, object>,
void *> *') to '__node_base_pointer' (aka 'std::__1::__tree_node_base<void *> *') is not
allowed
static_cast<__node_base_pointer>(__np));
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/__tree:1990:5: note:
in instantiation of member function 'std::__1::__tree<std::__1::pair<int, object>,
std::__1::__map_value_compare<int, object, std::__1::less<int>, true>,
std::__1::allocator<std::__1::pair<int, object> > >::erase' requested here
erase(__i);
^
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/map:937:25: note:
in instantiation of function template specialization 'std::__1::__tree<std::__1::pair<int,
object>, std::__1::__map_value_compare<int, object, std::__1::less<int>, true>,
std::__1::allocator<std::__1::pair<int, object> > >::__erase_unique<int>' requested here
{return __tree_.__erase_unique(__k);}
^
error.cpp:60:15: note: in instantiation of member function 'std::__1::map<int, object,
std::__1::less<int>, std::__1::allocator<std::__1::pair<const int, object> > >::erase'
requested here
by_id.erase(it->first);
^
In file included from error.cpp:6:
In file included from /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/map:371:
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/__tree:650:59: error:
static_cast from '__node_pointer' (aka 'std::__1::__tree_node<std::__1::pair<int, object>,
void *> *') to '__node_base_pointer' (aka 'int') is not allowed
...= static_cast<__node_pointer>(__tree_next(static_cast<__node_base_pointer>(__ptr_)));
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/__tree:1961:5: note:
in instantiation of member function 'std::__1::__tree_iterator<std::__1::pair<int,
object>, std::__1::__tree_node<std::__1::pair<int, object>, void *> *, long>::operator++'
requested here
++__r;
^
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/__tree:1990:5: note:
in instantiation of member function 'std::__1::__tree<std::__1::pair<int, object>,
std::__1::__map_value_compare<int, object, std::__1::less<int>, true>,
std::__1::allocator<std::__1::pair<int, object> > >::erase' requested here
erase(__i);
^
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/map:937:25: note:
in instantiation of function template specialization 'std::__1::__tree<std::__1::pair<int,
object>, std::__1::__map_value_compare<int, object, std::__1::less<int>, true>,
std::__1::allocator<std::__1::pair<int, object> > >::__erase_unique<int>' requested here
{return __tree_.__erase_unique(__k);}
^
error.cpp:60:15: note: in instantiation of member function 'std::__1::map<int, object,
std::__1::less<int>, std::__1::allocator<std::__1::pair<const int, object> > >::erase'
requested here
by_id.erase(it->first);
^
In file included from error.cpp:6:
In file included from /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/map:371:
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/__tree:650:19: error:
cannot cast from type 'int' to pointer type '__node_pointer' (aka
'std::__1::__tree_node<std::__1::pair<int, object>, void *> *')
...= static_cast<__node_pointer>(__tree_next(static_cast<__node_base_pointer>(__ptr_)));
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/__tree:156:14: error:
member reference type 'int' is not a pointer
if (__x->__right_ != nullptr)
~~~ ^
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/__tree:650:47: note:
in instantiation of function template specialization 'std::__1::__tree_next<int>'
requested here
{__ptr_ = static_cast<__node_pointer>(__tree_next(static_cast<__node_base_pointe...
^
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/__tree:1961:5: note:
in instantiation of member function 'std::__1::__tree_iterator<std::__1::pair<int,
object>, std::__1::__tree_node<std::__1::pair<int, object>, void *> *, long>::operator++'
requested here
++__r;
^
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/__tree:1990:5: note:
in instantiation of member function 'std::__1::__tree<std::__1::pair<int, object>,
std::__1::__map_value_compare<int, object, std::__1::less<int>, true>,
std::__1::allocator<std::__1::pair<int, object> > >::erase' requested here
erase(__i);
^
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/map:937:25: note:
in instantiation of function template specialization 'std::__1::__tree<std::__1::pair<int,
object>, std::__1::__map_value_compare<int, object, std::__1::less<int>, true>,
std::__1::allocator<std::__1::pair<int, object> > >::__erase_unique<int>' requested here
{return __tree_.__erase_unique(__k);}
^
error.cpp:60:15: note: in instantiation of member function 'std::__1::map<int, object,
std::__1::less<int>, std::__1::allocator<std::__1::pair<const int, object> > >::erase'
requested here
by_id.erase(it->first);
^
In file included from error.cpp:6:
In file included from /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/map:371:
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/__tree:159:20: error:
member reference type 'int' is not a pointer
__x = __x->__parent_;
~~~ ^
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/__tree:160:17: error:
member reference type 'int' is not a pointer
return __x->__parent_;
~~~ ^
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/__tree:67:24: error:
member reference type 'int' is not a pointer
return __x == __x->__parent_->__left_;
~~~ ^
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/__tree:158:13: note:
in instantiation of function template specialization 'std::__1::__tree_is_left_child<int>'
requested here
while (!__tree_is_left_child(__x))
^
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/__tree:650:47: note:
in instantiation of function template specialization 'std::__1::__tree_next<int>'
requested here
{__ptr_ = static_cast<__node_pointer>(__tree_next(static_cast<__node_base_pointe...
^
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/__tree:1961:5: note:
in instantiation of member function 'std::__1::__tree_iterator<std::__1::pair<int,
object>, std::__1::__tree_node<std::__1::pair<int, object>, void *> *, long>::operator++'
requested here
++__r;
^
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/__tree:1990:5: note:
in instantiation of member function 'std::__1::__tree<std::__1::pair<int, object>,
std::__1::__map_value_compare<int, object, std::__1::less<int>, true>,
std::__1::allocator<std::__1::pair<int, object> > >::erase' requested here
erase(__i);
^
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/map:937:25: note:
in instantiation of function template specialization 'std::__1::__tree<std::__1::pair<int,
object>, std::__1::__map_value_compare<int, object, std::__1::less<int>, true>,
std::__1::allocator<std::__1::pair<int, object> > >::__erase_unique<int>' requested here
{return __tree_.__erase_unique(__k);}
^
error.cpp:60:15: note: in instantiation of member function 'std::__1::map<int, object,
std::__1::less<int>, std::__1::allocator<std::__1::pair<const int, object> > >::erase'
requested here
by_id.erase(it->first);
^
In file included from error.cpp:6:
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/map:1586:44: error:
no viable conversion from 'iterator' (aka '__tree_iterator<value_type, __node_pointer,
difference_type>') to 'iterator' (aka '__map_iterator<typename __base::iterator>')
iterator end() _NOEXCEPT {return __tree_.end();}
^~~~~~~~~~~~~
error.cpp:64:22: note: in instantiation of member function 'std::__1::multimap<int,
std::__1::__map_iterator<std::__1::__tree_iterator<std::__1::pair<int, object>,
std::__1::__tree_node<std::__1::pair<int, object>, void *> *, long> >,
std::__1::less<int>, std::__1::allocator<std::__1::pair<const int,
std::__1::__map_iterator<std::__1::__tree_iterator<std::__1::pair<int, object>,
std::__1::__tree_node<std::__1::pair<int, object>, void *> *, long> > > > >::end'
requested here
for (auto it : by_depth) {
^
error.cpp:81:5: note: in instantiation of function template specialization 'object::with<<lambda
at error.cpp:81:18> >' requested here
object::with([](int obj) {
^
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/map:539:24: note:
candidate constructor (the implicit copy constructor) not viable: no known conversion from
'iterator' (aka '__tree_iterator<value_type, __node_pointer, difference_type>') to 'const
std::__1::__map_iterator<std::__1::__tree_iterator<std::__1::pair<int,
std::__1::__map_iterator<std::__1::__tree_iterator<std::__1::pair<int, object>,
std::__1::__tree_node<std::__1::pair<int, object>, void *> *, long> > >,
std::__1::__tree_node<std::__1::pair<int,
std::__1::__map_iterator<std::__1::__tree_iterator<std::__1::pair<int, object>,
std::__1::__tree_node<std::__1::pair<int, object>, void *> *, long> > >, void *> *, long>
> &' for 1st argument
class _LIBCPP_TYPE_VIS __map_iterator
^
/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/map:539:24: note:
candidate constructor (the implicit move constructor) not viable: no known conversion from
'iterator' (aka '__tree_iterator<value_type, __node_pointer, difference_type>') to
'std::__1::__map_iterator<std::__1::__tree_iterator<std::__1::pair<int,
std::__1::__map_iterator<std::__1::__tree_iterator<std::__1::pair<int, object>,
std::__1::__tree_node<std::__1::pair<int, object>, void *> *, long> > >,
std::__1::__tree_node<std::__1::pair<int,
std::__1::__map_iterator<std::__1::__tree_iterator<std::__1::pair<int, object>,
std::__1::__tree_node<std::__1::pair<int, object>, void *> *, long> > >, void *> *, long>
> &&' for 1st argument
class _LIBCPP_TYPE_VIS __map_iterator
^
10 errors generated.
调用:g++ -std=c++11 file.cpp 其中 g++ 是 clang。
这是怎么回事？
最佳答案
clang 给你这些错误是正确的。我可以帮助解释它们的含义:
1) STL 容器不允许不完整的类型。参见 map with incomplete value type .
这就是其中一条错误消息试图告诉您的内容:“object”的定义在结束“}”之前未完成。
2) 您删除移动构造函数和复制构造函数:
object(object const &) = delete;
object(object &&) = delete;
当两者都被删除时，您的使用变得非常有限，这就是为什么您会收到以下错误:候选构造函数(隐式复制构造函数)不可行和候选构造函数(隐式移动构造函数) ) 不可行。
关于C++:使用 clang 编译以迭代器作为值的映射时出现巨大错误，我们在Stack Overflow上找到一个类似的问题： https://stackoverflow.com/questions/20390806/
我正在学习如何使用Nokogiri，根据这段代码我遇到了一些问题:require'rubygems'require'mechanize'post_agent=WWW::Mechanize.newpost_page=post_agent.get('http://www.vbulletin.org/forum/showthread.php?t=230708')puts"\nabsolutepathwithtbodygivesnil"putspost_page.parser.xpath('/html/body/div/div/div/div/div/table/tbody/tr/td/div
我有一个Ruby程序，它使用rubyzip压缩XML文件的目录树。gem。我的问题是文件开始变得很重，我想提高压缩级别，因为压缩时间不是问题。我在rubyzipdocumentation中找不到一种为创建的ZIP文件指定压缩级别的方法。有人知道如何更改此设置吗？是否有另一个允许指定压缩级别的Ruby库？ 最佳答案 这是我通过查看rubyzip内部创建的代码。level=Zlib::BEST_COMPRESSIONZip::ZipOutputStream.open(zip_file)do|zip|Dir.glob("**/*")d
类classAprivatedeffooputs:fooendpublicdefbarputs:barendprivatedefzimputs:zimendprotecteddefdibputs:dibendendA的实例a=A.new测试a.foorescueputs:faila.barrescueputs:faila.zimrescueputs:faila.dibrescueputs:faila.gazrescueputs:fail测试输出failbarfailfailfail.发送测试[:foo,:bar,:zim,:dib,:gaz].each{|m|a.send(m)resc
很好奇，就使用rubyonrails自动化单元测试而言，你们正在做什么？您是否创建了一个脚本来在cron中运行rake作业并将结果邮寄给您？git中的预提交Hook？只是手动调用？我完全理解测试，但想知道在错误发生之前捕获错误的最佳实践是什么。让我们理所当然地认为测试本身是完美无缺的，并且可以正常工作。下一步是什么以确保他们在正确的时间将可能有害的结果传达给您？ 最佳答案 不确定您到底想听什么，但是有几个级别的自动代码库控制:在处理某项功能时，您可以使用类似autotest的内容获得关于哪些有效，哪些无效的即时反馈。要确保您的提
假设我做了一个模块如下:m=Module.newdoclassCendend三个问题:除了对m的引用之外，还有什么方法可以访问C和m中的其他内容？我可以在创建匿名模块后为其命名吗(就像我输入“module...”一样)？如何在使用完匿名模块后将其删除，使其定义的常量不再存在？ 最佳答案 三个答案:是的，使用ObjectSpace.此代码使c引用你的类(class)C不引用m:c=nilObjectSpace.each_object{|obj|c=objif(Class===objandobj.name=~/::C$/)}当然这取决于
我正在尝试使用ruby和Savon来使用网络服务。测试服务为http://www.webservicex.net/WS/WSDetails.aspx?WSID=9&CATID=2require'rubygems'require'savon'client=Savon::Client.new"http://www.webservicex.net/stockquote.asmx?WSDL"client.get_quotedo|soap|soap.body={:symbol=>"AAPL"}end返回SOAP异常。检查soap信封，在我看来soap请求没有正确的命名空间。任何人都可以建议我
关闭。这个问题是opinion-based.它目前不接受答案。想要改进这个问题？更新问题，以便editingthispost可以用事实和引用来回答它.关闭4年前。Improvethisquestion我想在固定时间创建一系列低音和高音调的哔哔声。例如:在150毫秒时发出高音调的蜂鸣声在151毫秒时发出低音调的蜂鸣声200毫秒时发出低音调的蜂鸣声250毫秒的高音调蜂鸣声有没有办法在Ruby或Python中做到这一点？我真的不在乎输出编码是什么(.wav、.mp3、.ogg等等)，但我确实想创建一个输出文件。
我在我的项目目录中完成了compasscreate.和compassinitrails。几个问题:我已将我的.sass文件放在public/stylesheets中。这是放置它们的正确位置吗？当我运行compasswatch时，它不会自动编译这些.sass文件。我必须手动指定文件:compasswatchpublic/stylesheets/myfile.sass等。如何让它自动运行？文件ie.css、print.css和screen.css已放在stylesheets/compiled。如何在编译后不让它们重新出现的情况下删除它们？我自己编译的.sass文件编译成compiled/t
我正在用Ruby编写一个简单的程序来检查域列表是否被占用。基本上它循环遍历列表，并使用以下函数进行检查。require'rubygems'require'whois'defcheck_domain(domain)c=Whois::Client.newc.query("google.com").available?end程序不断出错(即使我在google.com中进行硬编码)，并打印以下消息。鉴于该程序非常简单，我已经没有什么想法了-有什么建议吗？/Library/Ruby/Gems/1.8/gems/whois-2.0.2/lib/whois/server/adapters/base.
我想将html转换为纯文本。不过，我不想只删除标签，我想智能地保留尽可能多的格式。为插入换行符标签，检测段落并格式化它们等。输入非常简单，通常是格式良好的html(不是整个文档，只是一堆内容，通常没有anchor或图像)。我可以将几个正则表达式放在一起，让我达到80%，但我认为可能有一些现有的解决方案更智能。 最佳答案 首先，不要尝试为此使用正则表达式。很有可能你会想出一个脆弱/脆弱的解决方案，它会随着HTML的变化而崩溃，或者很难管理和维护。您可以使用Nokogiri快速解析HTML并提取文本:require'nokogiri'h