HomeSort by relevance Sort by last modified time
    Searched defs:rlen (Results 1 - 25 of 142) sorted by null

1 2 3 4 5 6

  /external/libcxx/test/std/strings/basic.string/string.ops/string_substr/
substr.pass.cpp 30 typename S::size_type rlen = std::min(n, s.size() - pos); local
31 assert(str.size() == rlen);
32 assert(S::traits_type::compare(s.data()+pos, str.data(), rlen) == 0);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.ops/string_substr/
substr.pass.cpp 30 typename S::size_type rlen = std::min(n, s.size() - pos); local
31 assert(str.size() == rlen);
32 assert(S::traits_type::compare(s.data()+pos, str.data(), rlen) == 0);
  /external/libcxx/test/std/experimental/string.view/string.view.ops/
copy.pass.cpp 16 // Remarks: Let rlen be the smaller of n and size() - pos.
17 // Requires: [s, s+rlen) is a valid range.
18 // Effects: Equivalent to std::copy_n(begin() + pos, rlen, s).
19 // Returns: rlen.
27 const size_t rlen = std::min ( n, sv.size() - pos ); local
29 CharT *dest1 = new CharT [rlen + 1]; dest1[rlen] = 0;
30 CharT *dest2 = new CharT [rlen + 1]; dest2[rlen] = 0;
34 std::copy_n(sv.begin() + pos, rlen, dest2)
    [all...]
substr.pass.cpp 16 // Effects: Determines the effective length rlen of the string to reference as the smaller of n and size() - pos.
17 // Returns: basic_string_view(data()+pos, rlen).
26 const size_t rlen = std::min ( n, sv.size() - pos ); local
27 assert ( sv1.size() == rlen );
28 for ( size_t i = 0; i <= rlen; ++i )
  /external/libcxx/test/std/strings/basic.string/string.cons/
substr.pass.cpp 35 unsigned rlen = str.size() - pos; local
36 assert(s2.size() == rlen);
37 assert(T::compare(s2.data(), str.data() + pos, rlen) == 0);
58 unsigned rlen = std::min<unsigned>(str.size() - pos, n); local
59 assert(s2.size() == rlen);
60 assert(T::compare(s2.data(), str.data() + pos, rlen) == 0);
81 unsigned rlen = std::min<unsigned>(str.size() - pos, n); local
82 assert(s2.size() == rlen);
83 assert(T::compare(s2.data(), str.data() + pos, rlen) == 0);
  /external/libcxx/test/std/strings/basic.string/string.modifiers/string_copy/
copy.pass.cpp 31 typename S::size_type rlen = std::min(n, cs.size() - pos); local
32 assert(r == rlen);
33 for (r = 0; r < rlen; ++r)
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.cons/
substr.pass.cpp 35 unsigned rlen = str.size() - pos; local
36 assert(s2.size() == rlen);
37 assert(T::compare(s2.data(), str.data() + pos, rlen) == 0);
58 unsigned rlen = std::min<unsigned>(str.size() - pos, n); local
59 assert(s2.size() == rlen);
60 assert(T::compare(s2.data(), str.data() + pos, rlen) == 0);
81 unsigned rlen = std::min<unsigned>(str.size() - pos, n); local
82 assert(s2.size() == rlen);
83 assert(T::compare(s2.data(), str.data() + pos, rlen) == 0);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.modifiers/string_copy/
copy.pass.cpp 31 typename S::size_type rlen = std::min(n, cs.size() - pos); local
32 assert(r == rlen);
33 for (r = 0; r < rlen; ++r)
  /external/libcxx/test/std/strings/basic.string/string.modifiers/string_replace/
size_size_pointer.pass.cpp 38 typename S::size_type rlen = S::traits_type::length(str); local
39 assert(s.size() == old_size - xlen + rlen);
size_size_size_char.pass.cpp 37 typename S::size_type rlen = n2; local
38 assert(s.size() == old_size - xlen + rlen);
size_size_string.pass.cpp 35 typename S::size_type rlen = str.size(); local
36 assert(s.size() == old_size - xlen + rlen);
iter_iter_pointer.pass.cpp 34 typename S::size_type rlen = S::traits_type::length(str); local
35 assert(s.size() == old_size - xlen + rlen);
iter_iter_size_char.pass.cpp 35 typename S::size_type rlen = n2; local
36 assert(s.size() == old_size - xlen + rlen);
iter_iter_string.pass.cpp 34 typename S::size_type rlen = str.size(); local
35 assert(s.size() == old_size - xlen + rlen);
iter_iter_iter_iter.pass.cpp 33 typename S::size_type rlen = std::distance(f, l); local
34 assert(s.size() == old_size - xlen + rlen);
    [all...]
iter_iter_pointer_size.pass.cpp 35 typename S::size_type rlen = n2; local
36 assert(s.size() == old_size - xlen + rlen);
    [all...]
size_size_pointer_size.pass.cpp 39 typename S::size_type rlen = n2; local
40 assert(s.size() == old_size - xlen + rlen);
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.modifiers/string_replace/
size_size_pointer.pass.cpp 38 typename S::size_type rlen = S::traits_type::length(str); local
39 assert(s.size() == old_size - xlen + rlen);
size_size_size_char.pass.cpp 37 typename S::size_type rlen = n2; local
38 assert(s.size() == old_size - xlen + rlen);
size_size_string.pass.cpp 35 typename S::size_type rlen = str.size(); local
36 assert(s.size() == old_size - xlen + rlen);
iter_iter_pointer.pass.cpp 34 typename S::size_type rlen = S::traits_type::length(str); local
35 assert(s.size() == old_size - xlen + rlen);
iter_iter_size_char.pass.cpp 35 typename S::size_type rlen = n2; local
36 assert(s.size() == old_size - xlen + rlen);
iter_iter_string.pass.cpp 34 typename S::size_type rlen = str.size(); local
35 assert(s.size() == old_size - xlen + rlen);
  /external/libxml2/doc/examples/
io1.c 24 static int rlen; variable
55 rlen = strlen(result);
71 rlen = 0;
92 if (len > rlen) len = rlen;
94 rlen -= len;
  /external/webrtc/webrtc/modules/audio_coding/codecs/isac/main/util/
utility.c 24 short k, rlen, status = 0; local
28 rlen = (short)fread(data, sizeof(short), length, inp);
29 if (rlen < length) {
30 for (k = rlen; k < length; k++)

Completed in 389 milliseconds

1 2 3 4 5 6