std::ranges::split_view<V,Pattern>::begin
來自 cppreference.com
< cpp | ranges | split view
constexpr /*iterator*/ begin(); |
(C++20 起) | |
返回第一個找到的子範圍的迭代器。
為了提供range
概念所要求的均攤常數時間複雜度,此函式會在 split_view
內快取結果(透過 cached_begin_
成員),以供後續呼叫使用。
設 base_
為底層資料成員。等價於
constexpr /*iterator*/ begin() { if (!cached_begin_.has_value()) cached_begin_ = this->find_next(ranges::begin(base_)); return {*this, ranges::begin(base_), cached_begin_.value()}; }
目錄 |
[編輯] 返回值
一個迭代器。
[編輯] 複雜度
均攤 O(1)。
[編輯] 示例
執行此程式碼
#include <iomanip> #include <iostream> #include <ranges> #include <string_view> int main() { constexpr std::string_view sentence{"Keep..moving..forward.."}; constexpr std::string_view delim{".."}; std::ranges::split_view words{sentence, delim}; std::cout << "begin(): " << std::quoted(std::string_view{*words.begin()}) << "\nSubstrings: "; for (auto word : words) std::cout << std::quoted(std::string_view(word)) << ' '; std::ranges::split_view letters{sentence, std::string_view{""}}; std::cout << "\nbegin(): " << std::quoted(std::string_view{*letters.begin()}) << "\nLetters: "; for (auto letter : letters) std::cout << std::string_view(letter) << ' '; std::cout << '\n'; }
輸出
begin(): "Keep" Substrings: "Keep" "moving" "forward" "" begin(): "K" Letters: K e e p . . m o v i n g . . f o r w a r d . .
[編輯] 參閱
返回一個迭代器或一個哨兵到末尾 (public member function) | |
返回指向起始的迭代器 ( std::ranges::lazy_split_view<V,Pattern> 的公開成員函式) | |
(C++20) |
返回指向範圍開頭的迭代器 (定製點物件) |