test_lib_size.h 1.5 KB
Newer Older
L
liuruilong 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94
//
// Created by liuRuiLong on 2018/6/6.
//

#ifndef PADDLE_MOBILE_TEST_LIB_SIZE_H
#define PADDLE_MOBILE_TEST_LIB_SIZE_H

#include <vector>
//#include <list>
//#include <tuple>
//#include <typeinfo>
//#include <mutex>
//#include <initializer_list>
//#include <map>
//#include <string>
//#include <unordered_map>
//#include <unordered_set>
//#include <algorithm>

//#include <iostream>
//#include <sstream>
#include <memory>
//#include <stdio.h>
//#include <cstring>

void foo(){

//  char *str = "1234";
//  char dst[10];
//  strcpy(dst, str);




//  std::cout << "12345" << std::endl;
  std::vector<int> vec = {1, 2, 3, 4, 5};

//  std::find(vec.begin(), vec.end(), 1);
//  std::find(vec.begin(), vec.end(), 1);


//  std::list<int> l;
//  std::mutex mutex_;

//  std::map<int, float> m;
//  std::unordered_map<int, float> u_m;
//  std::unordered_set<int> u_s;
//  std::string ss = "12345";
//  printf("%f", ss.c_str());

//  std::initializer_list<int> init_list = {1, 2};
//  std::tuple<int, int> t = {1, 2};

  //  std::tuple_element<I, std::tuple<ARGS...>>::type

//  std::tuple<>

//  int i;
//  int j;
//  if (typeid(i) == typeid(j)){
//    int z = 10;
//  }


  std::shared_ptr<int> s1 = std::make_shared<int>();


//  std::stringstream ss;
//  ss << "12345";

}


class test_lib_size {
 public:
  test_lib_size(){

  }
//  std::shared_ptr<int> Test(){
//    std::vector<int> vec = {1, 2, 3};
//    std::shared_ptr<int> si = std::make_shared<int>();
//    return si;
//  }




//  void test(){
//    int i = 9;
//  }
};


#endif //PADDLE_MOBILE_TEST_LIB_SIZE_H