| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (c) 2017 The WebRTC project authors. All Rights Reserved. | 2 * Copyright (c) 2017 The WebRTC project authors. All Rights Reserved. |
| 3 * | 3 * |
| 4 * Use of this source code is governed by a BSD-style license | 4 * Use of this source code is governed by a BSD-style license |
| 5 * that can be found in the LICENSE file in the root of the source | 5 * that can be found in the LICENSE file in the root of the source |
| 6 * tree. An additional intellectual property rights grant can be found | 6 * tree. An additional intellectual property rights grant can be found |
| 7 * in the file PATENTS. All contributing project authors may | 7 * in the file PATENTS. All contributing project authors may |
| 8 * be found in the AUTHORS file in the root of the source tree. | 8 * be found in the AUTHORS file in the root of the source tree. |
| 9 */ | 9 */ |
| 10 | 10 |
| 11 #ifndef WEBRTC_CALL_RTP_RTCP_DEMUXER_HELPER_H_ | 11 #ifndef WEBRTC_CALL_RTP_RTCP_DEMUXER_HELPER_H_ |
| 12 #define WEBRTC_CALL_RTP_RTCP_DEMUXER_HELPER_H_ | 12 #define WEBRTC_CALL_RTP_RTCP_DEMUXER_HELPER_H_ |
| 13 | 13 |
| 14 #include <algorithm> | 14 #include <algorithm> |
| 15 #include <map> | 15 #include <map> |
| 16 #include <utility> | 16 #include <utility> |
| 17 | 17 |
| 18 #include "webrtc/rtc_base/array_view.h" | 18 #include "webrtc/rtc_base/array_view.h" |
| 19 #include "webrtc/rtc_base/basictypes.h" | 19 #include "webrtc/rtc_base/basictypes.h" |
| 20 #include "webrtc/rtc_base/optional.h" | 20 #include "webrtc/rtc_base/optional.h" |
| 21 | 21 |
| 22 namespace webrtc { | 22 namespace webrtc { |
| 23 | 23 |
| 24 // TODO(eladalon): Remove this in the next CL. | |
| 25 template <typename Container> | 24 template <typename Container> |
| 26 bool MultimapAssociationExists(const Container& multimap, | 25 bool MultimapAssociationExists(const Container& multimap, |
| 27 const typename Container::key_type& key, | 26 const typename Container::key_type& key, |
| 28 const typename Container::mapped_type& val) { | 27 const typename Container::mapped_type& val) { |
| 29 auto it_range = multimap.equal_range(key); | 28 auto it_range = multimap.equal_range(key); |
| 30 using Reference = typename Container::const_reference; | 29 using Reference = typename Container::const_reference; |
| 31 return std::any_of(it_range.first, it_range.second, | 30 return std::any_of(it_range.first, it_range.second, |
| 32 [val](Reference elem) { return elem.second == val; }); | 31 [val](Reference elem) { return elem.second == val; }); |
| 33 } | 32 } |
| 34 | 33 |
| 35 // TODO(eladalon): Remove this in the next CL. | |
| 36 template <typename Container, typename Value> | 34 template <typename Container, typename Value> |
| 37 size_t RemoveFromMultimapByValue(Container* multimap, const Value& value) { | 35 size_t RemoveFromMultimapByValue(Container* multimap, const Value& value) { |
| 38 size_t count = 0; | 36 size_t count = 0; |
| 39 for (auto it = multimap->begin(); it != multimap->end();) { | 37 for (auto it = multimap->begin(); it != multimap->end();) { |
| 40 if (it->second == value) { | 38 if (it->second == value) { |
| 41 it = multimap->erase(it); | 39 it = multimap->erase(it); |
| 42 ++count; | 40 ++count; |
| 43 } else { | 41 } else { |
| 44 ++it; | 42 ++it; |
| 45 } | 43 } |
| 46 } | 44 } |
| 47 return count; | 45 return count; |
| 48 } | 46 } |
| 49 | 47 |
| 50 template <typename Map, typename Value> | |
| 51 size_t RemoveFromMapByValue(Map* map, const Value& value) { | |
| 52 size_t count = 0; | |
| 53 for (auto it = map->begin(); it != map->end();) { | |
| 54 if (it->second == value) { | |
| 55 it = map->erase(it); | |
| 56 ++count; | |
| 57 } else { | |
| 58 ++it; | |
| 59 } | |
| 60 } | |
| 61 return count; | |
| 62 } | |
| 63 | |
| 64 template <typename Container, typename Key> | 48 template <typename Container, typename Key> |
| 65 bool ContainerHasKey(const Container& c, const Key& k) { | 49 bool ContainerHasKey(const Container& c, const Key& k) { |
| 66 return std::find(c.cbegin(), c.cend(), k) != c.cend(); | 50 return std::find(c.cbegin(), c.cend(), k) != c.cend(); |
| 67 } | 51 } |
| 68 | 52 |
| 69 // TODO(eladalon): Remove this in the next CL. | |
| 70 template <typename Container> | 53 template <typename Container> |
| 71 bool MultimapHasValue(const Container& c, | 54 bool MultimapHasValue(const Container& c, |
| 72 const typename Container::mapped_type& v) { | 55 const typename Container::mapped_type& v) { |
| 73 auto predicate = [v](const typename Container::value_type& it) { | 56 auto predicate = [v](const typename Container::value_type& it) { |
| 74 return it.second == v; | 57 return it.second == v; |
| 75 }; | 58 }; |
| 76 return std::any_of(c.cbegin(), c.cend(), predicate); | 59 return std::any_of(c.cbegin(), c.cend(), predicate); |
| 77 } | 60 } |
| 78 | 61 |
| 79 template <typename Map> | |
| 80 bool MapHasValue(const Map& map, const typename Map::mapped_type& value) { | |
| 81 auto predicate = [value](const typename Map::value_type& it) { | |
| 82 return it.second == value; | |
| 83 }; | |
| 84 return std::any_of(map.cbegin(), map.cend(), predicate); | |
| 85 } | |
| 86 | |
| 87 rtc::Optional<uint32_t> ParseRtcpPacketSenderSsrc( | 62 rtc::Optional<uint32_t> ParseRtcpPacketSenderSsrc( |
| 88 rtc::ArrayView<const uint8_t> packet); | 63 rtc::ArrayView<const uint8_t> packet); |
| 89 | 64 |
| 90 } // namespace webrtc | 65 } // namespace webrtc |
| 91 | 66 |
| 92 #endif // WEBRTC_CALL_RTP_RTCP_DEMUXER_HELPER_H_ | 67 #endif // WEBRTC_CALL_RTP_RTCP_DEMUXER_HELPER_H_ |
| OLD | NEW |