| 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 46 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 57 | 57 |
| 58 size_t size() const { return m_headers.size(); } | 58 size_t size() const { return m_headers.size(); } |
| 59 const_iterator begin() const { return m_headers.begin(); } | 59 const_iterator begin() const { return m_headers.begin(); } |
| 60 const_iterator end() const { return m_headers.end(); } | 60 const_iterator end() const { return m_headers.end(); } |
| 61 const_iterator find(const AtomicString &k) const { return m_headers.find(k);
} | 61 const_iterator find(const AtomicString &k) const { return m_headers.find(k);
} |
| 62 void clear() { m_headers.clear(); } | 62 void clear() { m_headers.clear(); } |
| 63 const AtomicString& get(const AtomicString& k) const { return m_headers.get(
k); } | 63 const AtomicString& get(const AtomicString& k) const { return m_headers.get(
k); } |
| 64 AddResult set(const AtomicString& k, const AtomicString& v) { return m_heade
rs.set(k, v); } | 64 AddResult set(const AtomicString& k, const AtomicString& v) { return m_heade
rs.set(k, v); } |
| 65 AddResult add(const AtomicString& k, const AtomicString& v) { return m_heade
rs.add(k, v); } | 65 AddResult add(const AtomicString& k, const AtomicString& v) { return m_heade
rs.add(k, v); } |
| 66 void remove(const AtomicString& k) { m_headers.remove(k); } | 66 void remove(const AtomicString& k) { m_headers.remove(k); } |
| 67 bool operator!=(const HTTPHeaderMap &rhs) const { return m_headers != rhs.m_
headers; } | 67 bool operator!=(const HTTPHeaderMap& rhs) const { return m_headers != rhs.m_
headers; } |
| 68 bool operator==(const HTTPHeaderMap& rhs) const { return m_headers == rhs.m_
headers; } |
| 68 | 69 |
| 69 // Alternate accessors that are faster than converting the char* to AtomicSt
ring first. | 70 // Alternate accessors that are faster than converting the char* to AtomicSt
ring first. |
| 70 bool contains(const char*) const; | 71 bool contains(const char*) const; |
| 71 const AtomicString& get(const char*) const; | 72 const AtomicString& get(const char*) const; |
| 72 AddResult add(const char* name, const AtomicString& value); | 73 AddResult add(const char* name, const AtomicString& value); |
| 73 | 74 |
| 74 private: | 75 private: |
| 75 HashMap<AtomicString, AtomicString, CaseFoldingHash> m_headers; | 76 HashMap<AtomicString, AtomicString, CaseFoldingHash> m_headers; |
| 76 }; | 77 }; |
| 77 | 78 |
| 78 } // namespace blink | 79 } // namespace blink |
| 79 | 80 |
| 80 #endif // HTTPHeaderMap_h | 81 #endif // HTTPHeaderMap_h |
| OLD | NEW |