boundary 查找

最新推荐文章于 2024-09-15 13:31:12 发布

路口游子

最新推荐文章于 2024-09-15 13:31:12 发布

阅读量459

点赞数 1

分类专栏： C++

本博客仅供免费阅读，不提供咨询服务。请勿私信。

本文链接：https://blog.csdn.net/durongze/article/details/86586056

版权

C++ 专栏收录该内容

103 篇文章 3 订阅

订阅专栏

#include <iostream>
#include <string>

std::string boundary="----DDDD-YYYY-ZZZZ-$$$$";
std::string first_boundary="--"+boundary+"\r\n\r\n";
std::string next_boundary="\r\n\r\n--"+boundary+"\r\n\r\n";
std::string last_boundary="\r\n\r\n--"+boundary+"--\r\n\r\n";

int main()
{
    int cnt = 0;
    std::string context = first_boundary + "11111111111111111" + next_boundary + "222222222222222" + last_boundary;
    auto iterHead = context.begin();
    auto iterTail = context.begin();
    std::size_t iterTailPos = context.rfind(*context.begin(), context.size() - 7);
    for (iterTail += iterTailPos ;context.end() != iterHead && context.end() != iterTail + 6 ; ++iterHead, ++iterTail)
    {
         if (*iterHead == *iterTail)
         {
            ++cnt;
         }
         else
         {
             iterTailPos = context.rfind(*context.begin(), iterTailPos-1);
             if (0 >= iterTailPos)
             {
                 break;
             }
             else
             {
                 iterHead = context.begin();
                 iterTail = context.begin() + iterTailPos;
                 continue;
             }
         }
    }

std::cout << "boundary["<< iterTailPos << "," << context.size() - 6 << "]:" << context.substr(iterTailPos, context.size() - 6) << std::endl;
std::cout << "cnt:" << cnt << "," << context.size() - 6 - iterTailPos << std::endl;

return 0;
}