| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2009 Google Inc. All rights reserved. | 2 * Copyright (C) 2009 Google Inc. All rights reserved. |
| 3 * | 3 * |
| 4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
| 6 * met: | 6 * met: |
| 7 * | 7 * |
| 8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
| 10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
| (...skipping 12 matching lines...) Expand all Loading... |
| 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 29 */ | 29 */ |
| 30 | 30 |
| 31 #include "platform/network/HTTPHeaderMap.h" | 31 #include "platform/network/HTTPHeaderMap.h" |
| 32 | 32 |
| 33 #include <memory> |
| 33 #include "wtf/PtrUtil.h" | 34 #include "wtf/PtrUtil.h" |
| 34 #include <memory> | |
| 35 | 35 |
| 36 namespace blink { | 36 namespace blink { |
| 37 | 37 |
| 38 HTTPHeaderMap::HTTPHeaderMap() {} | 38 HTTPHeaderMap::HTTPHeaderMap() {} |
| 39 | 39 |
| 40 HTTPHeaderMap::~HTTPHeaderMap() {} | 40 HTTPHeaderMap::~HTTPHeaderMap() {} |
| 41 | 41 |
| 42 std::unique_ptr<CrossThreadHTTPHeaderMapData> HTTPHeaderMap::copyData() const { | 42 std::unique_ptr<CrossThreadHTTPHeaderMapData> HTTPHeaderMap::copyData() const { |
| 43 std::unique_ptr<CrossThreadHTTPHeaderMapData> data = | 43 std::unique_ptr<CrossThreadHTTPHeaderMapData> data = |
| 44 WTF::makeUnique<CrossThreadHTTPHeaderMapData>(); | 44 WTF::makeUnique<CrossThreadHTTPHeaderMapData>(); |
| (...skipping 10 matching lines...) Expand all Loading... |
| 55 void HTTPHeaderMap::adopt(std::unique_ptr<CrossThreadHTTPHeaderMapData> data) { | 55 void HTTPHeaderMap::adopt(std::unique_ptr<CrossThreadHTTPHeaderMapData> data) { |
| 56 clear(); | 56 clear(); |
| 57 size_t dataSize = data->size(); | 57 size_t dataSize = data->size(); |
| 58 for (size_t index = 0; index < dataSize; ++index) { | 58 for (size_t index = 0; index < dataSize; ++index) { |
| 59 std::pair<String, String>& header = (*data)[index]; | 59 std::pair<String, String>& header = (*data)[index]; |
| 60 set(AtomicString(header.first), AtomicString(header.second)); | 60 set(AtomicString(header.first), AtomicString(header.second)); |
| 61 } | 61 } |
| 62 } | 62 } |
| 63 | 63 |
| 64 } // namespace blink | 64 } // namespace blink |
| OLD | NEW |