| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2006 Apple Computer, Inc. All rights reserved. | 2 * Copyright (C) 2006 Apple Computer, Inc. All rights reserved. |
| 3 * Copyright (C) 2009 Google Inc. All rights reserved. | 3 * Copyright (C) 2009 Google Inc. All rights reserved. |
| 4 * | 4 * |
| 5 * Redistribution and use in source and binary forms, with or without | 5 * Redistribution and use in source and binary forms, with or without |
| 6 * modification, are permitted provided that the following conditions | 6 * modification, are permitted provided that the following conditions |
| 7 * are met: | 7 * are met: |
| 8 * 1. Redistributions of source code must retain the above copyright | 8 * 1. 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 * 2. Redistributions in binary form must reproduce the above copyright | 10 * 2. Redistributions in binary form must reproduce the above copyright |
| (...skipping 54 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 65 const_iterator find(const AtomicString& k) const { return m_headers.find(k); } | 65 const_iterator find(const AtomicString& k) const { return m_headers.find(k); } |
| 66 void clear() { m_headers.clear(); } | 66 void clear() { m_headers.clear(); } |
| 67 bool contains(const AtomicString& k) const { return m_headers.contains(k); } | 67 bool contains(const AtomicString& k) const { return m_headers.contains(k); } |
| 68 const AtomicString& get(const AtomicString& k) const { | 68 const AtomicString& get(const AtomicString& k) const { |
| 69 return m_headers.get(k); | 69 return m_headers.get(k); |
| 70 } | 70 } |
| 71 AddResult set(const AtomicString& k, const AtomicString& v) { | 71 AddResult set(const AtomicString& k, const AtomicString& v) { |
| 72 return m_headers.set(k, v); | 72 return m_headers.set(k, v); |
| 73 } | 73 } |
| 74 AddResult add(const AtomicString& k, const AtomicString& v) { | 74 AddResult add(const AtomicString& k, const AtomicString& v) { |
| 75 return m_headers.add(k, v); | 75 return m_headers.insert(k, v); |
| 76 } | 76 } |
| 77 void remove(const AtomicString& k) { m_headers.erase(k); } | 77 void remove(const AtomicString& k) { m_headers.erase(k); } |
| 78 bool operator!=(const HTTPHeaderMap& rhs) const { | 78 bool operator!=(const HTTPHeaderMap& rhs) const { |
| 79 return m_headers != rhs.m_headers; | 79 return m_headers != rhs.m_headers; |
| 80 } | 80 } |
| 81 bool operator==(const HTTPHeaderMap& rhs) const { | 81 bool operator==(const HTTPHeaderMap& rhs) const { |
| 82 return m_headers == rhs.m_headers; | 82 return m_headers == rhs.m_headers; |
| 83 } | 83 } |
| 84 | 84 |
| 85 private: | 85 private: |
| 86 HashMap<AtomicString, AtomicString, CaseFoldingHash> m_headers; | 86 HashMap<AtomicString, AtomicString, CaseFoldingHash> m_headers; |
| 87 }; | 87 }; |
| 88 | 88 |
| 89 } // namespace blink | 89 } // namespace blink |
| 90 | 90 |
| 91 #endif // HTTPHeaderMap_h | 91 #endif // HTTPHeaderMap_h |
| OLD | NEW |