fork download 
  1. #include <iostream>
  2. #include <map>
  3. #include <list>
  4. #include <algorithm>
  5. using namespace std;
  6.  
  7. //#define contains(x,a) (x).find(a)!=(x).end()
  8.  
  9. template <class T, class U> 
  10. bool contains (const T& x, U a) {
  11.     return x.find(a)!=x.end();
  12. }
  13.  
  14. template <class U>
  15. bool contains (const list<U>& x, U a) {
  16.     return std::find(x.begin(), x.end(), a)!=x.end();
  17. }
  18.  
  19. int main() {
  20. 	map<int,int> m{{12,1},{11,2}}; 
  21. 	list<int> l{3,12,5}; 
  22. 	if (contains(m,12)) 
  23. 	    cout <<"yes!"<<endl; 
  24. 	if (contains(l,12)) 
  25. 	    cout <<"yes!"<<endl; 
  26. 	return 0;
  27. }
Success #stdin #stdout 0s 4488KB
comments (?)
stdin 
Standard input is empty
stdout 
yes!
yes!
https://ideone.com/4DuVhc
language:
C++14 (gcc 8.3)
created:
7 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!