当前位置: 首页 > news >正文

wordpress首页显示链接地址seo优化易下拉排名

wordpress首页显示链接地址,seo优化易下拉排名,网站如何做点击链接地址,做网站费用怎么记分录文章目录1. 查找第一个匹配的2. 查找所有结果3. 打印匹配结果的上下文4. 使用子表达式5. 查找并替换注意: .&#xff08;点&#xff09;在括号中没有特殊含义&#xff0c;无需转义用\转义。 1. 查找第一个匹配的 #include <iostream> #include <regex>using names…

文章目录

    • 1. 查找第一个匹配的
    • 2. 查找所有结果
    • 3. 打印匹配结果的上下文
    • 4. 使用子表达式
    • 5. 查找并替换

注意: .(点)在括号中没有特殊含义,无需转义用\转义。

1. 查找第一个匹配的

#include <iostream>
#include <regex>using namespace std;int main(void)
{string pattern = "[^c]ei";pattern = "[[:alpha:]]*" + pattern + "[[:alpha:]]*";regex policy(pattern);    string  text = "receipt freind theif receive";smatch results;if(regex_search(text, results, policy))cout << results.str() << endl;
}

输出结果:

freind

2. 查找所有结果

#include <iostream>
#include <regex>using namespace std;int main (void)
{string pattern = "[^c]ei";pattern = "[[:alpha:]]*" + pattern + "[[:alpha:]]*";// 忽略大小写regex policy (pattern, regex::icase);string text = "receipt freind theif receive";for (sregex_iterator it (text.begin(), text.end(), policy), end_it;it != end_it; ++it)cout << it->str() << endl;
}

其中,比较难理解的是sregex_iterator it (text.begin(), text.end(), policy), end_it,这行代码是定义了it迭代器来进行遍历查询,end_it为空sregex_iterator,起到尾后迭代器的作用。

输出结果:

freind
theif

3. 打印匹配结果的上下文

#include <iostream>
#include <regex>using namespace std;string text ="Once there were two mice. They were friends. One mouse ""lived in the country; the other mouse lived in the city.""After many years the Country mouse saw the City mouse;""he said, \"Do come and see me at my house in the country.""\" So the City mouse went. The City mouse said, \"This food""is not good, and your house is not good. Why do you live ""in a hole in the field? You should come and live in the ""city. You would live in a nice house made of stone. You ""would have nice food to eat. You must come and see me at""my house in the city.\"The Country mouse went to the house""of the City mouse. It was a very good house. Nice food ""was set ready for them to eat. But just as they began to""eat they heard a great noise. The City mouse cried, \" Run""! Run! The cat is coming!\" They ran away quickly and hid"".After some time they came out. When they came out, the ""Country mouse said, \"I do not like living in the city.""I like living in my hole in the field. For it is nicer""to be poor and happy, than to be rich and afraid.";int main (void)
{string pattern = "you";pattern = "[[:alpha:]]*" + pattern + "[[:alpha:]]*";regex policy (pattern, regex::icase);for (sregex_iterator it (text.begin(), text.end(), policy), end_it;it != end_it ; ++it) {auto pos = it->prefix().length();pos = pos > 40 ? pos - 40 : 0;cout << it->prefix().str().substr (pos)<< "\n\t\t>>> "<< it->str()<< " <<<\n"<< it->suffix().str().substr (0, 40)<< endl;}}

输出结果:

 mouse said, "This foodis not good, and >>> your <<<house is not good. Why do you live in ahouse is not good. Why do >>> you <<<live in a hole in the field? You shouldlive in a hole in the field? >>> You <<<should come and live in the city. You wshould come and live in the city. >>> You <<<would live in a nice house made of ston
uld live in a nice house made of stone. >>> You <<<would have nice food to eat. You must cwould have nice food to eat. >>> You <<<must come and see me atmy house in the 

4. 使用子表达式

#include <iostream>
#include <regex>using namespace std;string text ="Once there were two mice. They were friends. One mouse ""lived in the country; the other mouse lived in the city.""After many years the Country mouse saw the City mouse;""he said, \"Do come and see me at my house in the country.""\" So the City mouse went. The City mouse said, \"This food""is not good, and your house is not good. Why do you live ""in a hole in the field? You should come and live in the ""city. You would live in a nice house made of stone. You ""would have nice food to eat. You must come and see me at""my house in the city.\"The Country mouse went to the house""of the City mouse. It was a very good house. Nice food ""was set ready for them to eat. But just as they began to""eat they heard a great noise. The City mouse cried, \" Run""! Run! The cat is coming!\" They ran away quickly and hid"".After some time they came out. When they came out, the ""Country mouse said, \"I do not like living in the city.""I like living in my hole in the field. For it is nicer""to be poor and happy, than to be rich and afraid.";int main (void)
{string pattern = "! The (.*?)(coming)[[:alnum:]]*";regex policy (pattern);for (sregex_iterator it (text.begin(), text.end(), policy), end_it; it != end_it ; ++it) {cout << "总表达式\n\t" << it->str() << "\n";if ( (*it) [1].matched)cout << "第1个子表达式\n\t" << it->str (1) << "\n";if ( (*it) [2].matched)cout << "第2个子表达式\n\t" << it->str (2);}}

输出结果:

总表达式! The cat is coming
第1个子表达式cat is 
第2个子表达式coming

5. 查找并替换

regex_replace()用于查找并替换,

#include <iostream>
#include <regex>
#include <sstream>using namespace std;static const string text ="morgan (201) 555-2368 862-555-0123\n""drew (973)555.0130\n""lee (609) 555-0132 2015550175 800.555-0000";
int main (void)
{string phone_pattern ="(\\()?" //可选左括号"(\\d{3})" //区号"(\\))?" //可选右括号"([-. ])?" //可选分隔符"(\\d{3})" //前三位"([-. ])?" //可选分隔符"(\\d{4})"; //后四位regex policy (phone_pattern);string format = "$2.$5.$7";//格式为 xxx.xxx.xxxxistringstream input (text);string line;while (getline (input, line)) {cout << regex_replace (line, policy, format) << endl;}
}

运行结果:

morgan 201.555.2368 862.555.0123
drew 973.555.0130
lee 609.555.0132 201.555.0175 800.555.0000

其中format中的$n表示第n个子表达式。

默认情况下,regex_replace会输出整个输入序列。
未与正则表达式匹配的部分会原样输出,匹配的部分按照格式字符来输出。
如果只想要匹配的部分,我们可以通过添加format_no_copy标志:

string fmt = "$2.$5.$7 "
cout << regex_replace (line, policy, format, regex_constants::format_no_copy) << endl;

此时输出结果:

201.555.2368 862.555.0123 
973.555.0130 
609.555.0132 201.555.0175 800.555.0000 

标准库定义了用来在替换过程中控制匹配或格式的标志。这些标志可以传递给函数regex_searchregex_match或是类smatchformat成员,例如format_no_copy是类型match_flag_type的值,定义在命名空间std::regex_constants中。

匹配标志(定义在regex_constants::mat_flag_type中)

match_default等价于format_default
match_not_bol不将首字符作为行首处理
match_not_eol不将尾字符作为行尾处理
match_not_bow不将首字符作为单词首处理
match_not_eow不将尾字符作为单词尾处理
match_any如果存在多于一个匹配,则可返回任意一个匹配
match_not_null不匹配任何空序列
match_continuous匹配必须从输入的首字符开始
match_prev_avail输入序列包含第一个匹配之前的内容
format_default用ECMAScript规则替换字符串
format_sed用POSIX sed规则替换字符串
format_no_copy不输出输入序列中未匹配的部分
format_first_only只替换子表达式的第一次出现

参考书籍: C++ Primer 5 中文版

http://www.hkea.cn/news/455367/

相关文章:

  • 成都官方网站建设泉州seo外包
  • 矿山建设网站天津网络推广seo
  • 国内优秀的响应式网站深圳专业seo外包
  • 重庆装修价格c盘优化大师
  • 银行网站 设计方案外包优化网站
  • 做网站是学什么专业软件外包企业排名
  • wordpress商城 中文站百度站长平台网址
  • 建手机网站的软件有哪些南宁百度seo价格
  • 做网站私活长沙网络营销公司
  • 网站建设公司 广告法被处罚沧州网络推广外包公司
  • 电商网站 开发成本惠州seo外包服务
  • 佛山做网站建设价格百度网盘官方下载
  • 网上购物商城网站建设个人免费域名注册网站
  • 成都学网站建设电子营销主要做什么
  • 织梦cms通用蓝白简介大气企业网站环保科技公司源码网络推广员招聘
  • 网站后台怎么添加图片视频app推广
  • 网站秒收录怎么做的经典软文案例和扶贫农产品软文
  • 珠海疫情最新情况厦门搜索引擎优化
  • 中国菲律宾历史战绩网站关键词优化工具
  • 西宁网站建设最好的公司哪家好优秀网站设计案例
  • 沧州做网站费用搜索引擎优化是做什么的
  • 社区网站推广方案线上运营的5个步骤
  • 湘潭学校网站建设 z磐石网络网站关键词优化教程
  • wordpress多程序用户同步汕头seo排名
  • 旅游网站 建设平台分析百度seo一本通
  • 怎么用dw做网站app开发网站
  • 昆山做网站的公司有哪些seo整站优化推广
  • 网站建设谈单情景对话青岛seo百科
  • 网站做自适应好不好网页分析报告案例
  • 大连手机自适应网站建设公司seo诊断站长