HomeSort by relevance Sort by last modified time
    Searched full:not1 (Results 1 - 25 of 64) sorted by null

1 2 3

  /external/libcxx/test/utilities/function.objects/negators/
not1.pass.cpp 12 // not1
20 assert(std::not1(F())(36));
21 assert(!std::not1(F())(0));
Android.mk 19 test_name := utilities/function.objects/negators/not1
20 test_src := not1.pass.cpp
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/function.objects/negators/
not1.pass.cpp 12 // not1
20 assert(std::not1(F())(36));
21 assert(!std::not1(F())(0));
  /external/chromium_org/cc/debug/
micro_benchmark_controller_impl.cc 55 benchmarks_.partition(std::not1(IsDonePredicate())),
micro_benchmark_controller.cc 130 benchmarks_.partition(std::not1(IsDonePredicate())),
  /external/stlport/test/unit/
unary_test.cpp 55 int* p = find_if((int*)array, (int*)array + 3, not1(odd()));
67 int* p = find_if((int*)array, (int*)array + 3, not1(ptr_fun(test_func)));
  /ndk/tests/device/test-gnustl-full/unit/
unary_test.cpp 55 int* p = find_if((int*)array, (int*)array + 3, not1(odd()));
67 int* p = find_if((int*)array, (int*)array + 3, not1(ptr_fun(test_func)));
  /ndk/tests/device/test-stlport/unit/
unary_test.cpp 55 int* p = find_if((int*)array, (int*)array + 3, not1(odd()));
67 int* p = find_if((int*)array, (int*)array + 3, not1(ptr_fun(test_func)));
  /external/chromium_org/chrome/browser/spellchecker/
spellcheck_message_filter.cc 122 std::not1(SpellCheckMarker::IsValidPredicate(text.length()))),
spellcheck_message_filter_mac.cc 284 std::not1(SpellCheckMarker::IsValidPredicate(text.length()))),
  /external/chromium_org/third_party/libaddressinput/src/cpp/src/
address_data.cc 80 std::not1(std::ptr_fun(&IsStringEmpty))) ==
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/bits/
stl_function.h 325 * The functions @c not1 and @c not2 each take a predicate functor
339 * std::find_if (v.begin(), v.end(), not1(IntGreaterThanThree()));
344 * The not1/unary_negate combination works on predicates taking a single
370 not1(const _Predicate& __pred) function
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/
stl_function.h 324 * The functions @c not1 and @c not2 each take a predicate functor
338 * std::find_if (v.begin(), v.end(), not1(IntGreaterThanThree()));
343 * The not1/unary_negate combination works on predicates taking a single
369 not1(const _Predicate& __pred) function
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/
stl_function.h 324 * The functions @c not1 and @c not2 each take a predicate functor
338 * std::find_if (v.begin(), v.end(), not1(IntGreaterThanThree()));
343 * The not1/unary_negate combination works on predicates taking a single
369 not1(const _Predicate& __pred) function
  /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_function.h 319 * The functions @c not1 and @c not2 each take a predicate functor
333 * std::find_if (v.begin(), v.end(), not1(IntGreaterThanThree()));
338 * The not1/unary_negate combination works on predicates taking a single
364 not1(const _Predicate& __pred) function
  /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_function.h 319 * The functions @c not1 and @c not2 each take a predicate functor
333 * std::find_if (v.begin(), v.end(), not1(IntGreaterThanThree()));
338 * The not1/unary_negate combination works on predicates taking a single
364 not1(const _Predicate& __pred) function
  /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_function.h 319 * The functions @c not1 and @c not2 each take a predicate functor
333 * std::find_if (v.begin(), v.end(), not1(IntGreaterThanThree()));
338 * The not1/unary_negate combination works on predicates taking a single
364 not1(const _Predicate& __pred) function
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/
stl_function.h 319 * The functions @c not1 and @c not2 each take a predicate functor
333 * std::find_if (v.begin(), v.end(), not1(IntGreaterThanThree()));
338 * The not1/unary_negate combination works on predicates taking a single
364 not1(const _Predicate& __pred) function
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
stl_function.h 325 * The functions @c not1 and @c not2 each take a predicate functor
339 * std::find_if (v.begin(), v.end(), not1(IntGreaterThanThree()));
344 * The not1/unary_negate combination works on predicates taking a single
370 not1(const _Predicate& __pred) function
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
stl_function.h 326 * The functions @c not1 and @c not2 each take a predicate functor
340 * std::find_if (v.begin(), v.end(), not1(IntGreaterThanThree()));
345 * The not1/unary_negate combination works on predicates taking a single
371 not1(const _Predicate& __pred) function
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
stl_function.h 325 * The functions @c not1 and @c not2 each take a predicate functor
339 * std::find_if (v.begin(), v.end(), not1(IntGreaterThanThree()));
344 * The not1/unary_negate combination works on predicates taking a single
370 not1(const _Predicate& __pred) function
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
stl_function.h 326 * The functions @c not1 and @c not2 each take a predicate functor
340 * std::find_if (v.begin(), v.end(), not1(IntGreaterThanThree()));
345 * The not1/unary_negate combination works on predicates taking a single
371 not1(const _Predicate& __pred) function
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/
stl_function.h 324 * The functions @c not1 and @c not2 each take a predicate functor
338 * std::find_if (v.begin(), v.end(), not1(IntGreaterThanThree()));
343 * The not1/unary_negate combination works on predicates taking a single
369 not1(const _Predicate& __pred) function
  /external/eigen/Eigen/src/Core/arch/SSE/
MathFunctions.h 265 _EIGEN_DECLARE_CONST_Packet4i(not1, ~1);
366 _EIGEN_DECLARE_CONST_Packet4i(not1, ~1);
  /external/chromium_org/ash/wm/
mru_window_tracker.cc 88 std::not1(std::ptr_fun(ash::wm::CanActivateWindow)));

Completed in 1993 milliseconds

1 2 3