Lines Matching refs:size
623 constexpr StringRef( char const* rawChars, size_type size ) noexcept
625 m_size( size )
630 m_size( stdString.size() )
652 constexpr auto size() const noexcept -> size_type {
662 // If start + length > size(), then the substring is [start, size()).
663 // If start > size(), then the substring is empty.
681 constexpr auto operator "" _sr( char const* rawChars, std::size_t size ) noexcept -> StringRef {
682 return StringRef( rawChars, size );
686 constexpr auto operator "" _catch_sr( char const* rawChars, std::size_t size ) noexcept -> Catch::StringRef {
687 return Catch::StringRef( rawChars, size );
1486 intValues.reserve( values.size() );
1557 std::string rawMemoryToString( const void *object, std::size_t size );
3299 description.reserve( 4 + m_matchers.size()*32 );
3333 description.reserve( 4 + m_matchers.size()*32 );
3635 if (m_comparator.size() > v.size())
3668 if (m_comparator.size() != v.size())
3670 for (std::size_t i = 0; i < v.size(); ++i)
3687 if (m_comparator.size() != v.size())
3689 for (std::size_t i = 0; i < v.size(); ++i)
3721 if (m_target.size() != vec.size()) {
3982 return m_idx < m_values.size();
4043 if (m_current >= m_generators.size()) {
4050 return m_current < m_generators.size();
4243 if (m_repeat_index == m_returned.size()) {
4304 ChunkGenerator(size_t size, GeneratorWrapper<T> generator) :
4305 m_chunk_size(size), m_generator(std::move(generator))
4334 GeneratorWrapper<std::vector<T>> chunk(size_t size, GeneratorWrapper<T>&& generator) {
4336 pf::make_unique<ChunkGenerator<T>>(size, std::move(generator))
4682 assert(m_step != T(0) && "Step size cannot be zero");
4734 return m_current != m_elems.size();
5638 samples2.reserve(samples.size());
5926 assert(m_sectionStack.size() == 0);
7057 int n = static_cast<int>(resample.size());
7215 samples2.reserve(samples.size());
7256 samples2.reserve(samples.size());
8340 std::string expr; expr.reserve(m_info.capturedExpression.size() + 3);
8356 expr.reserve( m_info.macroName.size() + m_info.capturedExpression.size() + 4 );
8520 assert(at <= line().size());
8522 return at == line().size() ||
8529 assert(m_stringIndex < m_column.m_strings.size());
8537 while (m_end < line().size() && line()[m_end] != '\n')
8583 assert(m_stringIndex < m_column.m_strings.size());
8590 if (m_pos < line().size() && line()[m_pos] == '\n')
8593 while (m_pos < line().size() && isWhitespace(line()[m_pos]))
8596 if (m_pos == line().size()) {
8600 if (m_stringIndex < m_column.m_strings.size())
8640 auto end() const -> iterator { return { *this, m_strings.size() }; }
8687 m_iterators.reserve(m_columns.size());
8702 m_activeIterators(m_columns.size()) {
8703 m_iterators.reserve(m_columns.size());
8718 for (size_t i = 0; i < m_columns.size(); ++i) {
8723 if (col.size() < width)
8724 padding = std::string(width - col.size(), ' ');
8734 for (size_t i = 0; i < m_columns.size(); ++i) {
8887 if( next[1] != '-' && next.size() > 2 ) {
8889 for( size_t i = 1; i < next.size(); ++i ) {
8914 auto count() const -> size_t { return m_tokenBuffer.size() + (itEnd - it); }
8927 if( m_tokenBuffer.size() >= 2 ) {
9567 optWidth = (std::max)(optWidth, cols.left.size() + 2);
9607 const size_t totalParsers = m_options.size() + m_args.size();
10424 std::size_t size;
10441 size = sizeof(info);
10442 if( sysctl(mib, sizeof(mib) / sizeof(*mib), &info, &size, nullptr, 0) != 0 ) {
10516 if( lhs.size() + rhs.size() < 40 &&
10597 size_t name_start = enumInstance.size();
10601 return enumInstance.substr(name_start, enumInstance.size() - name_start);
10608 parsed.reserve( enumValues.size() );
10628 enumInfo->m_values.reserve( values.size() );
10631 assert( valueNames.size() == values.size() );
10787 //! Minimal size Catch2 needs for its own fatal error handling.
10841 // Windows does not support lowering the stack size guarantee.
11286 Catch::cout() << pluralise( matchedTestCases.size(), "test case" ) << '\n' << std::endl;
11288 Catch::cout() << pluralise( matchedTestCases.size(), "matching test case" ) << '\n' << std::endl;
11289 return matchedTestCases.size();
11315 size_t size = 0;
11318 size += spelling.size() + 2;
11321 std::string out; out.reserve(size);
11357 .indent( str.size() )
11361 Catch::cout() << pluralise( tagCounts.size(), "tag" ) << '\n' << std::endl;
11362 return tagCounts.size();
11370 maxNameLen = (std::max)( maxNameLen, factoryKvp.first.size() );
11384 return factories.size();
11736 description.reserve(5 + m_operation.size() + m_comparator.m_str.size() +
11737 m_comparator.caseSensitivitySuffix().size());
11880 for (auto i = start + 1; i < names.size() ; ++i) {
11891 for (size_t pos = 0; pos < names.size(); ++pos) {
11923 m_messages.back().message = static_cast<std::string>(trimmed(start, names.size() - 1));
11928 assert( m_captured == m_messages.size() );
11935 assert( index < m_messages.size() );
13767 return m_streams.size()-1;
13823 return s.size() >= prefix.size() && std::equal(prefix.begin(), prefix.end(), s.begin());
13829 return s.size() >= suffix.size() && std::equal(suffix.rbegin(), suffix.rend(), s.rbegin());
13832 return !s.empty() && s[s.size()-1] == suffix;
13858 while (real_begin < ref.size() && is_ws(ref[real_begin])) { ++real_begin; }
13859 size_t real_end = ref.size();
13870 str = str.substr( 0, i ) + withThis + str.substr( i+replaceThis.size() );
13871 if( i < str.size()-withThis.size() )
13872 i = str.find( replaceThis, i+withThis.size() );
13882 for(std::size_t pos = 0; pos < str.size(); ++pos ) {
13889 if( start < str.size() )
13890 subStrings.push_back( str.substr( start, str.size()-start ) );
13928 auto StringRef::substr( size_type start, size_type size ) const noexcept -> StringRef {
13930 return StringRef(m_start + start, (std::min)(m_size - start, size));
13941 return os.write(str.data(), str.size());
13945 lhs.append(rhs.data(), rhs.size());
13995 expandedTestSpec.substr( pos + registryKvp.first.size() );
14047 return parseSpecialTag( tag ) == TestCaseInfo::None && tag.size() > 0 && !std::isalnum( static_cast<unsigned char>(tag[0]) );
14086 if (startsWith(tag, '.') && tag.size() > 1) {
14149 std::size_t full_size = 2 * tags.size();
14151 full_size += tag.size();
14244 indexed_tests.reserve( unsortedTestCases.size() );
14259 sorted.reserve( indexed_tests.size() );
14292 filtered.reserve( testCases.size() );
14561 m_filters.reserve( m_filters.size() + filters.size() + 2 );
14568 if( filters.size() > 1 )
14689 Matches matches( m_filters.size() );
14717 m_substring.reserve(m_arg.size());
14718 m_patternName.reserve(m_arg.size());
14721 for( m_pos = 0; m_pos < m_arg.size(); ++m_pos )
14865 m_pos = m_arg.size();
14878 for (std::size_t i = 0; i < m_escapeChars.size(); ++i)
14912 if (token.size() > 1 && token[0] == '.') {
15043 std::string rawMemoryToString( const void *object, std::size_t size ) {
15045 int i = 0, end = static_cast<int>( size ), inc = 1;
15072 if( i != std::string::npos && i != d.size()-1 ) {
15133 s.reserve(wstr.size());
15415 m_pattern = m_pattern.substr( 0, m_pattern.size()-1 );
15516 for( std::size_t idx = 0; idx < m_str.size(); ++ idx ) {
15567 if (idx + encBytes - 1 >= m_str.size()) {
15678 m_indent = m_indent.substr(0, m_indent.size() - 2);
16157 if (_stats.infoMessages.size() == 1)
16159 if (_stats.infoMessages.size() > 1)
16170 if (_stats.infoMessages.size() == 1)
16172 if (_stats.infoMessages.size() > 1)
16179 if (_stats.infoMessages.size() == 1)
16181 if (_stats.infoMessages.size() > 1)
16203 if (_stats.infoMessages.size() == 1)
16205 if (_stats.infoMessages.size() > 1)
16421 const auto strSize = colStr.size();
16424 if (tp.m_currentColumn == static_cast<int>(tp.m_columnInfos.size() - 1)) {
16516 if (m_sectionStack.size() > 1)
16645 if (m_sectionStack.size() > 1) {
16696 while (oldRow.size() < row.size())
16698 while (oldRow.size() > row.size())
16958 assert( testCaseNode.children.size() == 1 );