惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

酷 壳 – CoolShell
酷 壳 – CoolShell
H
Hacker News: Front Page
P
Palo Alto Networks Blog
T
ThreatConnect
Apple Machine Learning Research
Apple Machine Learning Research
博客园_首页
T
True Tiger Recordings
P
Privacy & Cybersecurity Law Blog
B
Blog
IT之家
IT之家
Last Week in AI
Last Week in AI
F
Full Disclosure
Hacker News: Ask HN
Hacker News: Ask HN
C
Comments on: Blog
Microsoft Azure Blog
Microsoft Azure Blog
C
Cybersecurity and Infrastructure Security Agency CISA
Microsoft Security Blog
Microsoft Security Blog
博客园 - 【当耐特】
N
News and Events Feed by Topic
NISL@THU
NISL@THU
腾讯CDC
雷峰网
雷峰网
Security Latest
Security Latest
李成银的技术随笔
M
Microsoft Research Blog - Microsoft Research
L
LangChain Blog
L
Lohrmann on Cybersecurity
cs.CL updates on arXiv.org
cs.CL updates on arXiv.org
C
Check Point Blog
Y
Y Combinator Blog
Recent Announcements
Recent Announcements
博客园 - Franky
N
News | PayPal Newsroom
V
V2EX
A
About on SuperTechFans
The Register - Security
The Register - Security
月光博客
月光博客
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Google Online Security Blog
Google Online Security Blog
MyScale Blog
MyScale Blog
Cisco Talos Blog
Cisco Talos Blog
Vercel News
Vercel News
WordPress大学
WordPress大学
C
Cyber Attacks, Cyber Crime and Cyber Security
The Hacker News
The Hacker News
IntelliJ IDEA : IntelliJ IDEA – the Leading IDE for Professional Development in Java and Kotlin | The JetBrains Blog
IntelliJ IDEA : IntelliJ IDEA – the Leading IDE for Professional Development in Java and Kotlin | The JetBrains Blog
爱范儿
爱范儿
A
Arctic Wolf
L
LINUX DO - 最新话题
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More

博客园 - 撬棍

【.Net】2、8、16进制转换 【.Net】执行CMD命令 【.Net】获取随机数函数 【.Net】注册程序开机启动 - 撬棍 【.Net】把窗体“钉”到桌面上 【.Net】多语言查看MSDN 【.Net】 显示星期字符串 【.Net】 判断时间字符串正确性 【.Net】 实现窗口拖动 【.Net】 Winform 单例运行实例 [C++]函数返回值 [C++]数组参数 - 撬棍 [C++]const的指针使用 [C++]指针类型出参 [VBA]Excel输出utf-8编码格式文件 使用WideCharToMultiByte [C语言学习]之打印万年历 - 撬棍 - 博客园 [VB6.0]让程序在任务列表和资源管理器“隐身” - 撬棍 [InstallShield]FindAllFiles与SetFileInfo配合实现文件加多文件属性设置 [VB]修改注册表让程序开机自动运行 - 撬棍
【C++】split
撬棍 · 2011-03-20 · via 博客园 - 撬棍

--------------------------------------------------1-------------------------------------------------------------------

void split(const std::string& src)
{
    stringstream ss;
    ss << src;
    while (!ss.eof())
    {
        std::string content;
        std::getline(ss, content, '|');
        std::cout << content << std::endl;
    }
}

--------------------------------------------------2-------------------------------------------------------------------

#include   <vector> 
#include   <string> 
#include   <boost/algorithm/string.hpp> int main()   

std::string str("1-56-89-52-41-56 "); 
std::vector <std::string> result; 
boost::algorithm::split(result, str, boost::algorithm::is_any_of( "- ")); 

}

--------------------------------------------------3-------------------------------------------------------------------

////////////////////////////////////////////////////////////////////////////// 

// Function Name     : split 

// Description       : split "source" with "delims" into string vector. 

// Input Parameters : source -- the string with spliter

//                      delims -- the spliters 

//                      vec     -- output

//                      result -- string vector

// Return Value      : how many slice had found.

////////////////////////////////////////////////////////////////////////////// 

size_t split(const std::string& source,

              const char *delims,

              std::vector <std::string> &vec,

              bool keepEmpty /*= false*/)

{

    // find the index of which not delims

    std::string::size_type beg = source.find_first_not_of(delims); 

    std::string::size_type end; 

    std::string::size_type nextBeg = beg; 

    while(std::string::npos != beg)

    { 

        //find the index which is delims, than [beg, end] is the slice we want

        end = source.find_first_of(delims, nextBeg + 1);

        nextBeg = end; 

        if(end < beg)

        {

            //we find that case : two delims

            if(keepEmpty)

            vec.push_back(" ");

        }

       else if(std::string::npos != end)

        {

            vec.push_back(source.substr(beg, end - beg));

            //update the begin index from the end index

            beg = source.find_first_not_of(delims, nextBeg);

        }

        else

        {

            vec.push_back(source.substr(beg));

            break;

        }

    }

    return vec.size();

}