std::sub_match<BidirIt>::length

来自cppreference.com
< cpp‎ | regex‎ | sub match
difference_type length() const;

返回匹配中的字符数。

返回值

若匹配合法则为 std::distance(first, second),否则为 0

复杂度

常数。

示例

#include <iostream>
#include <regex>
#include <string>
 
int main()
{
    std::string sentence{"Quick red fox jumped over a lazy cow."};
    const std::regex re{"([A-z]+) ([a-z]+) ([a-z]+) ([a-z]+)"};
    std::smatch words;
    std::regex_search(sentence, words, re);
    for (const auto& m : words)
        std::cout << '[' << m << "], length = " << m.length() << '\n';
}

输出:

[Quick red fox jumped], length = 20
[Quick], length = 5
[red], length = 3
[fox], length = 3
[jumped], length = 6