Struct template bidirectional_grapheme_subrange

Struct template bidirectional_grapheme_subrange

boost::text::bidirectional_grapheme_subrange

Synopsis

// In header: <boost/text/bidirectional.hpp>

template<typename CPIter> 
struct bidirectional_grapheme_subrange {
  // types
  typedef unspecified iterator;

  // construct/copy/destruct
  bidirectional_grapheme_subrange();
  bidirectional_grapheme_subrange(iterator, iterator, 
                                  unspecified = unspecified);
  bidirectional_grapheme_subrange(unspecified, unspecified, 
                                  unspecified = unspecified);

  // public member functions
  bool line_break() const;
  bool hard_break() const;
  bool allowed_break() const;
};

Description

Represents a subrange of graphemes ordered by the Unicode bidirectional algorithm, with or without a line break at the end; the line break may be a hard line break, or an allowed line break, according to the Unicode line break algorithm. This is the output type for the grapheme overloads of bidirectional_subranges().

`bidirectional_grapheme_subrange` public construct/copy/destruct

```
bidirectional_grapheme_subrange();
```

bidirectional_grapheme_subrange(iterator first, iterator last, 
                                unspecified b = unspecified);

bidirectional_grapheme_subrange(unspecified first, unspecified last, 
                                unspecified b = unspecified);

`bidirectional_grapheme_subrange` public member functions

```
bool line_break() const;
```
Returns true if this subrange ends with some kind of line break.
```
bool hard_break() const;
```
Returns true if this subrange ends with a hard line break.
```
bool allowed_break() const;
```
Returns true if this subrange ends with an allowed line break.