/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
stl_uninitialized.h | 206 { std::fill_n(__first, __n, __x); } 216 * Like fill_n(), but does not require an initialized output range. 501 std::fill_n(__first, __n, _ValueType());
|
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
stl_uninitialized.h | 206 { std::fill_n(__first, __n, __x); } 216 * Like fill_n(), but does not require an initialized output range. 517 std::fill_n(__first, __n, _ValueType());
|
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
stl_uninitialized.h | 204 { std::fill_n(__first, __n, __x); } 214 * Like fill_n(), but does not require an initialized output range. 515 std::fill_n(__first, __n, _ValueType());
|
/external/chromium/net/socket/ |
socks5_client_socket_unittest.cc | 210 std::fill_n(std::back_inserter(large_host_name), 256, 'x');
|
/external/chromium_org/net/socket/ |
socks5_client_socket_unittest.cc | 215 std::fill_n(std::back_inserter(large_host_name), 256, 'x');
|
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/ |
array.hpp | 188 std::fill_n(begin(),size(),value);
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
stl_uninitialized.h | 204 { std::fill_n(__first, __n, __x); } 214 * Like fill_n(), but does not require an initialized output range.
|
algorithmfwd.h | 56 fill_n 243 fill_n(_OIter, _Size, const _Tp&); 248 fill_n(_OIter, _Size, const _Tp&);
|
char_traits.h | 41 #include <bits/stl_algobase.h> // std::copy, std::fill_n 208 // NB: Inline std::fill_n so no recursive dependencies. 209 std::fill_n(__s, __n, __a);
|
/prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
stl_uninitialized.h | 204 { std::fill_n(__first, __n, __x); } 214 * Like fill_n(), but does not require an initialized output range.
|
algorithmfwd.h | 56 fill_n 243 fill_n(_OIter, _Size, const _Tp&); 248 fill_n(_OIter, _Size, const _Tp&);
|
char_traits.h | 41 #include <bits/stl_algobase.h> // std::copy, std::fill_n 208 // NB: Inline std::fill_n so no recursive dependencies. 209 std::fill_n(__s, __n, __a);
|
/prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
stl_uninitialized.h | 204 { std::fill_n(__first, __n, __x); } 214 * Like fill_n(), but does not require an initialized output range.
|
algorithmfwd.h | 56 fill_n 243 fill_n(_OIter, _Size, const _Tp&); 248 fill_n(_OIter, _Size, const _Tp&);
|
char_traits.h | 41 #include <bits/stl_algobase.h> // std::copy, std::fill_n 208 // NB: Inline std::fill_n so no recursive dependencies. 209 std::fill_n(__s, __n, __a);
|
/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
stl_uninitialized.h | 204 { std::fill_n(__first, __n, __x); } 214 * Like fill_n(), but does not require an initialized output range.
|
algorithmfwd.h | 56 fill_n 243 fill_n(_OIter, _Size, const _Tp&); 248 fill_n(_OIter, _Size, const _Tp&);
|
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/ |
stl_uninitialized.h | 204 { std::fill_n(__first, __n, __x); } 214 * Like fill_n(), but does not require an initialized output range.
|
/external/chromium/testing/gmock/test/ |
gmock-more-actions_test.cc | 639 std::fill_n(n, 4, 0); 640 std::fill_n(ch, 4, '\0');
|
/external/chromium_org/net/base/ |
upload_data_stream_unittest.cc | 266 std::fill_n(buf->data(), kTestBufferSize, -1); 303 std::fill_n(buf->data(), kTestBufferSize, -1);
|
/external/llvm/include/llvm/ADT/ |
SmallVector.h | 597 std::fill_n(I, NumToInsert, Elt); 611 std::fill_n(I, NumOverwritten, Elt);
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
algorithmfwd.h | 58 fill_n 244 fill_n(_OIter, _Size, const _Tp&);
|
char_traits.h | 41 #include <bits/stl_algobase.h> // std::copy, std::fill_n 203 // NB: Inline std::fill_n so no recursive dependencies. 204 std::fill_n(__s, __n, __a);
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
algorithmfwd.h | 58 fill_n 244 fill_n(_OIter, _Size, const _Tp&);
|
char_traits.h | 41 #include <bits/stl_algobase.h> // std::copy, std::fill_n 203 // NB: Inline std::fill_n so no recursive dependencies. 204 std::fill_n(__s, __n, __a);
|