| 489 | } |
| 490 | |
| 491 | T *insert(int i, const T *e, int n) |
| 492 | { |
| 493 | if(ulen+n>alen) growbuf(ulen+n); |
| 494 | loopj(n) add(T()); |
| 495 | for(int p = ulen-1; p>=i+n; p--) buf[p] = buf[p-n]; |
| 496 | loopj(n) buf[i+j] = e[j]; |
| 497 | return &buf[i]; |
| 498 | } |
| 499 | }; |
| 500 | |
| 501 | static inline uint hthash(const char *key) |
no test coverage detected