| 336 | } |
| 337 | |
| 338 | void BreakFinder::Insert(int val) { |
| 339 | if (val >= nextBreak) { |
| 340 | for (std::vector<int>::iterator it = selAndEdge.begin(); it != selAndEdge.end(); ++it) { |
| 341 | if (val == *it) { |
| 342 | return; |
| 343 | } |
| 344 | if (val <*it) { |
| 345 | selAndEdge.insert(it, 1, val); |
| 346 | return; |
| 347 | } |
| 348 | } |
| 349 | // Not less than any so append |
| 350 | selAndEdge.push_back(val); |
| 351 | } |
| 352 | } |
| 353 | |
| 354 | extern bool BadUTF(const char *s, int len, int &trailBytes); |
| 355 |
no outgoing calls
no test coverage detected