From 8327390ccc27853c5bee794029a9ab2cc54df335 Mon Sep 17 00:00:00 2001 From: Gil Date: Tue, 24 Apr 2018 08:59:38 -0700 Subject: Implement erase in C++ immutable maps (#1158) * Add SortedMap::min * Add SortedMap::erase --- .../core/src/firebase/firestore/immutable/llrb_node_iterator.h | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) (limited to 'Firestore/core/src/firebase/firestore/immutable/llrb_node_iterator.h') diff --git a/Firestore/core/src/firebase/firestore/immutable/llrb_node_iterator.h b/Firestore/core/src/firebase/firestore/immutable/llrb_node_iterator.h index f1377a2..5011947 100644 --- a/Firestore/core/src/firebase/firestore/immutable/llrb_node_iterator.h +++ b/Firestore/core/src/firebase/firestore/immutable/llrb_node_iterator.h @@ -76,6 +76,9 @@ class LlrbNodeIterator { using reference = typename node_type::value_type const&; using difference_type = std::ptrdiff_t; + explicit LlrbNodeIterator(stack_type&& stack) : stack_(std::move(stack)) { + } + /** * Constructs an iterator starting at the first node in the iteration * sequence of the tree represented by the given root node (i.e. it points at @@ -196,9 +199,6 @@ class LlrbNodeIterator { } private: - explicit LlrbNodeIterator(stack_type&& stack) : stack_(std::move(stack)) { - } - static void AccumulateLeft(const node_type* node, stack_type* stack) { for (; !node->empty(); node = &node->left()) { stack->push(node); -- cgit v1.2.3