diff options
Diffstat (limited to 'Firestore/core/src/firebase/firestore/immutable/array_sorted_map.h')
-rw-r--r-- | Firestore/core/src/firebase/firestore/immutable/array_sorted_map.h | 7 |
1 files changed, 6 insertions, 1 deletions
diff --git a/Firestore/core/src/firebase/firestore/immutable/array_sorted_map.h b/Firestore/core/src/firebase/firestore/immutable/array_sorted_map.h index 92fd823..adba962 100644 --- a/Firestore/core/src/firebase/firestore/immutable/array_sorted_map.h +++ b/Firestore/core/src/firebase/firestore/immutable/array_sorted_map.h @@ -26,6 +26,7 @@ #include "Firestore/core/src/firebase/firestore/immutable/map_entry.h" #include "Firestore/core/src/firebase/firestore/immutable/sorted_map_base.h" +#include "Firestore/core/src/firebase/firestore/util/comparison.h" #include "Firestore/core/src/firebase/firestore/util/firebase_assert.h" namespace firebase { @@ -118,7 +119,7 @@ class FixedArray { * ArraySortedMap is a value type containing a map. It is immutable, but has * methods to efficiently create new maps that are mutations of it. */ -template <typename K, typename V, typename C = std::less<K>> +template <typename K, typename V, typename C = util::Comparator<K>> class ArraySortedMap : public SortedMapBase { public: using key_comparator_type = KeyComparator<K, V, C>; @@ -229,6 +230,10 @@ class ArraySortedMap : public SortedMapBase { } } + const key_comparator_type& comparator() const { + return key_comparator_; + } + /** Returns true if the map contains no elements. */ bool empty() const { return size() == 0; |