Does this code have a chance of working? preinfo
std::size_t comp_posit.find(*keyword);
std::size_t comp_delimiter.find(*delimiter);
std::size_t comp_delimiter_positive = s.find(comp_delimiter,comp_posit);
std::size_t range = comp_delimiter_positive - comp_posit;
auto comp_range = std::ranges::copy_n(comp_posit.begin(), range, out.begin());
I am down to one error,
error: request for member 'begin' in 'comp_posit',
which is of non-class type 'std::size_t' {aka 'long long unsigned int'}
code with fix std::ranges::copy_n(s.begin(), range, std::back_inserter(out));
previously I have used multiple std::vectors to store the .finds() from multiple for loops, and had to do it in stages of vectors, as the dataSift to variable vectors with the data shifting patterns causes issues.
I had hoped the std::ranges::copy_n would be easier coding from a single while loop that can keep looping through until set possibilities are exhausted?