| /external/bluetooth/glib/tests/ |
| scannerapi.c | 77 check_keys (gpointer key, function
98 g_scanner_scope_foreach_symbol (fix->scanner, 1, check_keys, NULL);
|
| /external/stlport/test/unit/ |
| hash_test.cpp | 67 void check_keys( hashType& h, mapType& m );
181 // After each insertion we call check_keys(...) to assure validity of these two containers.
184 // check_keys() works as follows:
199 void HashTest::check_keys( HashTest::hashType& h, HashTest::mapType& m ) function in class:HashTest
267 // generate many entries with key 3, fill up with unique keys. Data is unique (needed in check_keys())
275 check_keys( h, m );
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| hash_test.cpp | 67 void check_keys( hashType& h, mapType& m );
181 // After each insertion we call check_keys(...) to assure validity of these two containers.
184 // check_keys() works as follows:
199 void HashTest::check_keys( HashTest::hashType& h, HashTest::mapType& m ) function in class:HashTest
267 // generate many entries with key 3, fill up with unique keys. Data is unique (needed in check_keys())
275 check_keys( h, m );
|
| /ndk/tests/device/test-stlport/unit/ |
| hash_test.cpp | 67 void check_keys( hashType& h, mapType& m );
181 // After each insertion we call check_keys(...) to assure validity of these two containers.
184 // check_keys() works as follows:
199 void HashTest::check_keys( HashTest::hashType& h, HashTest::mapType& m ) function in class:HashTest
267 // generate many entries with key 3, fill up with unique keys. Data is unique (needed in check_keys())
275 check_keys( h, m );
|
