/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/g++.dg/pch/ |
H A D | system-2.C | 5 std::cout << "hello world!" << std::endl; member in class:std
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/testsuite/g++.dg/pch/ |
H A D | system-2.C | 5 std::cout << "hello world!" << std::endl; member in class:std
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/27_io/objects/char/ |
H A D | 5280_xin.cc | 31 cerr << endl; local 32 cerr << "i == " << i << endl; local 33 cerr << "cin.rdstate() == " << cin.rdstate() << endl; 34 cerr << "cin.bad() == " << cin.bad() << endl; 35 cerr << "cin.fail() == " << cin.fail() << endl; 36 cerr << "cin.eof() == " << cin.eof() << endl; 39 cerr << "i == " << i << endl; local
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/27_io/objects/wchar_t/ |
H A D | 5280_xin.cc | 31 wcerr << endl; local 32 wcerr << L"i == " << i << endl; local 33 wcerr << L"wcin.rdstate() == " << wcin.rdstate() << endl; 34 wcerr << L"wcin.bad() == " << wcin.bad() << endl; 35 wcerr << L"wcin.fail() == " << wcin.fail() << endl; 36 wcerr << L"wcin.eof() == " << wcin.eof() << endl; 39 wcerr << L"i == " << i << endl; local
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/testsuite/27_io/objects/char/ |
H A D | 5280_xin.cc | 32 cerr << endl; local 33 cerr << "i == " << i << endl; local 34 cerr << "cin.rdstate() == " << cin.rdstate() << endl; 35 cerr << "cin.bad() == " << cin.bad() << endl; 36 cerr << "cin.fail() == " << cin.fail() << endl; 37 cerr << "cin.eof() == " << cin.eof() << endl; 40 cerr << "i == " << i << endl; local
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/testsuite/27_io/objects/wchar_t/ |
H A D | 5280_xin.cc | 32 wcerr << endl; local 33 wcerr << L"i == " << i << endl; local 34 wcerr << L"wcin.rdstate() == " << wcin.rdstate() << endl; 35 wcerr << L"wcin.bad() == " << wcin.bad() << endl; 36 wcerr << L"wcin.fail() == " << wcin.fail() << endl; 37 wcerr << L"wcin.eof() == " << wcin.eof() << endl; 40 wcerr << L"i == " << i << endl; local
|
/netbsd-6-1-5-RELEASE/common/dist/zlib/contrib/iostream/ |
H A D | test.cpp | 12 os << "Hello, Mommy" << endl; local 15 os << "hello, hello, hi, ho!" << endl; local 18 << "I'm compressing again" << endl;
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/zlib/contrib/iostream/ |
H A D | test.cpp | 12 os << "Hello, Mommy" << endl; local 15 os << "hello, hello, hi, ho!" << endl; local 18 << "I'm compressing again" << endl;
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/g++.old-deja/g++.benjamin/ |
H A D | 15071.C | 9 std::cout << "hi" << std::endl; member in class:std
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/ |
H A D | trace_fn_imps.hpp | 48 std::cerr << m_p_l << std::endl << std::endl; member in class:std 52 std::cerr << PB_DS_V2F(p_l->m_value) << std::endl; member in class:std 55 std::cerr << std::endl; member in class:std
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/testsuite/g++.old-deja/g++.benjamin/ |
H A D | 15071.C | 9 std::cout << "hi" << std::endl; member in class:std
|
/netbsd-6-1-5-RELEASE/external/bsd/openldap/dist/contrib/ldapc++/src/ |
H A D | LDAPRebindAuth.cpp | 15 DEBUG(LDAP_DEBUG_CONSTRUCT,"LDAPRebindAuth::LDAPRebindAuth()" << endl); 16 DEBUG(LDAP_DEBUG_CONSTRUCT | LDAP_DEBUG_PARAMETER," dn:" << dn << endl 17 << " pwd:" << pwd << endl); 23 DEBUG(LDAP_DEBUG_CONSTRUCT,"LDAPRebindAuth::LDAPRebindAuth(&)" << endl); 29 DEBUG(LDAP_DEBUG_DESTROY,"LDAPRebindAuth::~LDAPRebindAuth()" << endl); 33 DEBUG(LDAP_DEBUG_TRACE,"LDAPRebindAuth::getDN()" << endl); 38 DEBUG(LDAP_DEBUG_TRACE,"LDAPRebindAuth::getPassword()" << endl);
|
/netbsd-6-1-5-RELEASE/common/dist/zlib/contrib/iostream2/ |
H A D | zstream_test.cpp | 17 cout << x << endl << y << endl << z << endl; 20 out << setw(50) << setfill('#') << setprecision(20) << x << endl << y << endl << z << endl; 21 out << z << endl << y << endl << x << endl; 22 out << 1.1234567890123456789 << endl; [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/zlib/contrib/iostream2/ |
H A D | zstream_test.cpp | 17 cout << x << endl << y << endl << z << endl; 20 out << setw(50) << setfill('#') << setprecision(20) << x << endl << y << endl << z << endl; 21 out << z << endl << y << endl << x << endl; 22 out << 1.1234567890123456789 << endl; [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/performance/ext/pb_ds/ |
H A D | priority_queue_text_join_timing.cc | 52 cerr << endl << endl; local 55 "using their join method. " << endl; local 56 cerr << "Specifically, it does the following:" << endl; local 57 cerr << "* Creates a vector of text words " << endl; local 58 cerr << "* Pushes the elements into two containers" << endl; local 59 cerr << "* Joins the two containers (and measures this time)" << endl; local 60 cerr << "* Repeats the above test a number of times " << endl; local 61 cerr << endl << endl; local 64 "Each line should contain one word." << endl; local 65 cerr << "vn = minimum size of the vector" << endl; local 66 cerr << "vs = step size of the vector" << endl; local 67 cerr << "vm = maximum size of the vector" << endl; local [all...] |
H A D | tree_split_join_timing.cc | 79 std::cerr << "Test failed" << std::endl; 90 endl << endl; 93 "tree based containers. " << endl; local 94 cerr << "Specifically, it does the following:" << endl; local 95 cerr << "* Creates a tree " << endl; local 96 cerr << "* Inserts integers into the tree" << endl; local 97 cerr << "* Splits half the tree into a different tree" << endl; local 98 cerr << "* Joins the trees" << endl; local 100 << endl; local 102 cerr << endl << endl; local 104 cerr << "vn = minimum size of the tree" << endl; local 105 cerr << "vs = step size of the tree" << endl; local 106 cerr << "vm = maximum size of the tree" << endl; local [all...] |
H A D | tree_text_lor_find_timing.cc | 84 std::cerr << "Test failed" << std::endl; 95 << endl << endl; 99 "using their find method. " << endl; local 100 cerr << "Specifically, it does the following:" << endl; local 101 cerr << "* Creates a vector of text words " << endl; local 102 cerr << "* Inserts the elements into the container" << endl; local 105 "container, using the find method" << endl; local 106 cerr << "* Repeats the above test a number of times" << endl; local 108 cerr << endl << end local 111 "Each line should contain one word." << endl; local 112 cerr << "vn = minimum size of the vector" << endl; local 113 cerr << "vs = step size of the vector" << endl; local 114 cerr << "vm = maximum size of the vector" << endl; local [all...] |
H A D | priority_queue_text_push_pop_timing.cc | 88 std::cerr << "Test failed" << std::endl; 99 "<f_name> <vn> <vs> <vm>" << endl << endl; 102 "priority_queue containers using their push method. " << endl; local 103 cerr << "Specifically, it does the following:" << endl; local 104 cerr << "* Creates a vector of text words " << endl; local 105 cerr << "* Pushes the elements into the container, then pops until it's empty." << endl; local 107 << endl; local 109 cerr << endl << endl; local 112 "Each line should contain one word." << endl; local 113 cerr << "vn = minimum size of the vector" << endl; local 114 cerr << "vs = step size of the vector" << endl; local 115 cerr << "vm = maximum size of the vector" << endl; local [all...] |
H A D | priority_queue_text_push_timing.cc | 88 std::cerr << "Test failed" << std::endl; 99 << endl << endl; 103 "using their push method. " << endl; local 104 cerr << "Specifically, it does the following:" << endl; local 105 cerr << "* Creates a vector of text words " << endl; local 106 cerr << "* Pushes the elements into the container" << endl; local 108 << endl; local 110 cerr << endl << endl; local 113 "Each line should contain one word." << endl; local 114 cerr << "vn = minimum size of the vector" << endl; local 115 cerr << "vs = step size of the vector" << endl; local 116 cerr << "vm = maximum size of the vector" << endl; local [all...] |
H A D | tree_order_statistics_timing.cc | 78 std::cerr << "Test failed" << std::endl; 89 endl << endl; 92 " in tree based containers. " << endl; local 93 cerr << "Specifically, it does the following:" << endl; local 94 cerr << "* Creates a tree" << endl; local 95 cerr << "* Inserts integers into the tree" << endl; local 96 cerr << "* Checks the order-statistics of each entry in the tree" << endl; local 98 << endl; local 100 cerr << endl << end local 102 cerr << "vn = minimum size of the tree" << endl; local 103 cerr << "vs = step size of the tree" << endl; local 104 cerr << "vm = maximum size of the tree" << endl; local [all...] |
H A D | priority_queue_text_modify_timing.hpp | 95 std::cerr << "Test failed" << std::endl; 106 endl << endl; 110 "using their modify method. " << endl; local 111 cerr << "Specifically, it does the following:" << endl; local 112 cerr << "* Creates a vector of text words " << endl; local 113 cerr << "* Pushes the elements into the container" << endl; local 114 cerr << "* Modifies the words in the container. If modify_up == 't', then" << endl; local 115 cerr << "* it modifies them to the largest word. If modify_up == 'f', then" << endl; local 116 cerr << "* it modifies them to the smallest word." << endl; local 118 << endl; local 120 cerr << endl << endl; local 123 "Each line should contain one word." << endl; local 124 cerr << "vn = minimum size of the vector" << endl; local 125 cerr << "vs = step size of the vector" << endl; local 126 cerr << "vm = maximum size of the vector" << endl; local [all...] |
H A D | priority_queue_random_int_push_timing.cc | 89 std::cerr << "Test failed" << std::endl; 100 endl << endl; 104 "using their push method. " << endl; local 105 cerr << "Specifically, it does the following:" << endl; local 106 cerr << "* Creates a vector of random integers " << endl; local 107 cerr << "* Pushes the elements into the container" << endl; local 109 << endl; local 111 cerr << endl << endl; local 113 cerr << "vn = minimum size of the vector" << endl; local 114 cerr << "vs = step size of the vector" << endl; local 115 cerr << "vm = maximum size of the vector" << endl; local [all...] |
/netbsd-6-1-5-RELEASE/external/bsd/openldap/dist/contrib/ldapc++/examples/ |
H A D | urlTest.cpp | 14 std::cout << argc << std::endl; member in class:std 15 std::cout << "urlTest <ldap-URI>" << std::endl; member in class:std 21 std::cout << "Host: " << url.getHost() << std::endl; member in class:std 22 std::cout << "Port: " << url.getPort() << std::endl; member in class:std 23 std::cout << "BaseDN: " << url.getDN() << std::endl; member in class:std 24 std::cout << "Scope: " << url.getScope() << std::endl; member in class:std 26 std::cout << "Attrs: " << std::endl; member in class:std 29 std::cout << " " << *i << std::endl; member in class:std 31 std::cout << "Filter: " << url.getFilter() << std::endl; member in class:std 32 std::cout << "Setting new BaseDN" << std::endl; member in class:std 34 std::cout << "Url: " << url.getURLString() << std::endl; member in class:std [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gdb/dist/gdb/testsuite/gdb.cp/ |
H A D | bs15503.cc | 39 cout << "in StringTest" << endl; local 41 cout << s << endl; local 45 cout << s << endl; local 49 cout << s << endl; local 54 cout << s << endl; local 58 cout << s << endl; local
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/ext/pb_ds/example/ |
H A D | assoc_container_traits.cc | 60 cout << "Collision-chaining hash based associative-container:" << endl; local 67 cout << "Probing hash based associative-container:" << endl; local 74 cout << "Red-black tree associative-container:" << endl; local 81 cout << "Splay tree associative-container:" << endl; local 88 cout << "Ordered-vector tree associative-container:" << endl; local 95 cout << "List-based associative-container:" << endl; local 103 cout << "Erase can throw" << endl; local 106 cout << "Erase cannot throw" << endl; local 114 cout << "Preserves order" << endl; local 117 cout << "Does not preserve order" << endl; local 130 "modified" << endl; local 139 "is modified" << endl; local 147 "container object is modified" << endl; local 155 cout << "Supports reverse iteration" << endl; local 158 cout << "Does not support reverse iteration" << endl; local 174 cout << endl << endl; local [all...] |