繁体   English   中英

带有双引号的字符串替换为带双引号的字符串

[英]c++ - Replace string with double quotes to a string with double quotes

我正在编写此软件,这使我在网站上的工作更加轻松。 我只是输入了一个脚本,它将用跨度为我突出显示代码。 到了那里,但是我有一个问题。 (我目前正在突出显示UnityC#)

我希望字符串为黄色,包括双引号,但是现在尝试这种方式会导致无限循环。 我知道引号做错了,但是我不知道那是什么。 请帮我 :)

原始变量是由std::string original ((istreambuf_iterator<char>(currentFile)), istreambuf_iterator<char>()); ,其中currentFile是我加载的脚本

std::size_t pos = 0;
while(original.find("\"", pos) != std::string::npos)
{
    //find the first occurrence of the quote
    std::size_t found = original.find("\"", pos);
    if(found != std::string::npos)
    {
        //save the start position of the string
        std::size_t start_pos = found;
        //save the end position by searching for the next quotation mark
        std::size_t end_pos = original.find_first_of("\"", start_pos+1);
        //Calculate the size of the string
        std::size_t length = end_pos-start_pos;
        //Make a copy of the word without the quotation marks
        std::string originalWord = original.substr(start_pos+1, length-1);
        //Make the new word with span, original word(without the quotation marks) and add quotation marks around the word
        std::string newWord = std::string("<span class='yellow_code'>") + "\"" + originalWord + "\"" + "</span>";
        std::cout<<originalWord<<" : "<<newWord<<std::endl;
        //Replace the string WITH the quotation marks for the newWord
        original.replace(start_pos, length+1, newWord);
        //Set the position to after the string
        pos = end_pos+1;
    }
    else
    {
        pos = found+1;
    }
}

当我运行它时,它将提示:/dataValues.dat:<span class ='yellow_code'>“ / dataValues.dat” </ span>无限。

怎么了?

问候,丹妮

问题在这里: pos = end_pos + 1; 这可以让您的索引比字符串短。

让我们看看您的示例发生了什么:

  • 原来originalbla..."/dataValues.dat"...end_pospos + 16
  • 替换后,您会得到bla...<span class='yellow_code'>"/dataValues.dat"</span>... end_pos并未更改,并指向黄色的第一个l
  • 在下一次搜索中,您再次找到相同的带引号的字符串...

您必须在end_pos添加<span...></span>的长度,以使其指向</span>

您没有添加添加到字符串中的开始和结束标签的大小。 这是一个如何做的例子

std::string start_tag = "<span class='yellow_code'>";
std::string end_tag = "\"</span>";

std::size_t pos = 0;
while(original.find("\"", pos) != std::string::npos)
{
    std::size_t found = original.find("\"", pos);
    if(found != std::string::npos)
    {
        std::size_t start_pos = found;
        std::size_t end_pos = original.find_first_of("\"", start_pos+1);
        if (end_pos == std::string::npos) // If the number of quotation characters is odd you would get undefined behavior
            break;
        std::size_t length = end_pos - start_pos;
        std::string originalWord = original.substr(start_pos+1, length-1);
        std::string newWord = start_tag + "\"" + originalWord + end_tag; // CHANGED: Added the start and end tags as std::string
        std::cout<<originalWord<<" : "<<newWord<<std::endl;
        original.replace(start_pos, length+1, newWord);
        pos = end_pos + start_tag.size() + end_tag.size(); // CHANGED: Added the size of the two tags
    }
}

更新

在查看posfoundstart_pos ,似乎其中两个是多余的。

std::size_t start_pos = 0;
while((start_pos = original.find("\"", start_pos)) != std::string::npos)
{
    std::size_t end_pos = original.find_first_of("\"", start_pos+1);
    if (end_pos == std::string::npos) // If the number of quotation characters is odd you would get undefined behavior
        break;
    std::size_t length = end_pos-start_pos;
    std::string originalWord = original.substr(start_pos+1, length-1);
    std::string newWord = start_tag + "\"" + originalWord + end_tag; // CHANGED: Added the start and end tags as std::string
    std::cout << originalWord << " : " << newWord <<std::endl;
    original.replace(start_pos, length+1, newWord);
    start_pos = end_pos + start_tag.size() + end_tag.size(); // CHANGED: Added the size of the two tags
}

在线尝试

您应该std::regex

text = std::regex_replace(text,std::regex("string to be replaced"),"string with it earlier should be replaced");

暂无
暂无

声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM