Line 0
Link Here
|
|
|
1 |
--- ./src/serialize.h.orig 2013-09-24 01:50:35.661706153 +0000 |
2 |
+++ ./src/serialize.h 2013-09-24 01:50:52.913703572 +0000 |
3 |
@@ -895,19 +895,6 @@ |
4 |
iterator insert(iterator it, const char& x=char()) { return vch.insert(it, x); } |
5 |
void insert(iterator it, size_type n, const char& x) { vch.insert(it, n, x); } |
6 |
|
7 |
- void insert(iterator it, const_iterator first, const_iterator last) |
8 |
- { |
9 |
- assert(last - first >= 0); |
10 |
- if (it == vch.begin() + nReadPos && (unsigned int)(last - first) <= nReadPos) |
11 |
- { |
12 |
- // special case for inserting at the front when there's room |
13 |
- nReadPos -= (last - first); |
14 |
- memcpy(&vch[nReadPos], &first[0], last - first); |
15 |
- } |
16 |
- else |
17 |
- vch.insert(it, first, last); |
18 |
- } |
19 |
- |
20 |
void insert(iterator it, std::vector<char>::const_iterator first, std::vector<char>::const_iterator last) |
21 |
{ |
22 |
assert(last - first >= 0); |