# std::sub_match<BidirIt>::length

> C++ Atlas: `cppatlas.com/w/cpp/regex/sub_match/length` | Source: https://en.cppreference.com/w/cpp/regex/sub_match/length | Domain: Regular expressions

Returns the number of characters in the match.

## Official Specification Summary (cppreference)

```cpp
difference_type length() const;
```

Returns the number of characters in the match.

### Return value

`std::distance(first, second)` if the match is valid, `​0​` otherwise.

### Complexity

Constant.

### Example

```cpp
#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';
}
```

Output:

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

---
Attribution: content from https://en.cppreference.com/w/cpp/regex/sub_match/length (cppreference.com), licensed under CC-BY-SA 3.0 and GFDL. Modified: converted to markdown, study notes added. Offline snapshot of 9 February 2025.