Namespaces
Variants

    std::sub_match<BidirIt>:: length

    From ja.cppreference.net
    C++
    Text processing library
    Regular expressions library
    Classes
    (C++11)
    (C++11)
    (C++11)
    Algorithms
    (C++11)
    (C++11)
    (C++11)
    Iterators
    (C++11)
    (C++11)
    Exceptions
    (C++11)
    Traits
    (C++11)
    Constants
    (C++11)
    (C++11)
    (C++11)
    Regex Grammar
    (C++11)
    std::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