| 92 | } |
| 93 | |
| 94 | static void test_stdmap(int max) |
| 95 | { |
| 96 | std::map<std::string, bool> map; |
| 97 | |
| 98 | for (int i = 0; tokens[i] != NULL; i++) { |
| 99 | map[tokens[i]] = true; |
| 100 | } |
| 101 | |
| 102 | acl::meter_time(__FUNCTION__, __LINE__, "begin\t"); |
| 103 | |
| 104 | int j = 0; |
| 105 | for (int i = 0; i < max; i++) { |
| 106 | if (map.find(tokens[j]) == map.end()) { |
| 107 | printf("find error, key=%s\r\n", tokens[j]); |
| 108 | break; |
| 109 | } |
| 110 | if (tokens[++j] == NULL) { |
| 111 | j = 0; |
| 112 | } |
| 113 | } |
| 114 | |
| 115 | acl::meter_time(__FUNCTION__, __LINE__, "end\t"); |
| 116 | } |
| 117 | |
| 118 | static void usage(const char* procname) |
| 119 | { |
no test coverage detected
searching dependent graphs…