Implement tracking of BUILD.gn files used to define target, toolchain or

base/containers/flat_tree.h

 // Copyright 2017 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #ifndef BASE_CONTAINERS_FLAT_TREE_H_
 #define BASE_CONTAINERS_FLAT_TREE_H_
 
 #include <algorithm>
 #include <iterator>
 #include <vector>
@@ skipping 106 matching lines @@
   //
   // The constructors that take ranges, lists, and vectors do not require that
   // the input be sorted.
 
   flat_tree();
   explicit flat_tree(const key_compare& comp);
 
   template <class InputIterator>
   flat_tree(InputIterator first,
             InputIterator last,
-            FlatContainerDupes dupe_handling,
+            FlatContainerDupes dupe_handling = KEEP_FIRST_OF_DUPES,
             const key_compare& comp = key_compare());
 
   flat_tree(const flat_tree&);
   flat_tree(flat_tree&&);
 
   flat_tree(std::vector<value_type> items,
-            FlatContainerDupes dupe_handling,
+            FlatContainerDupes dupe_handling = KEEP_FIRST_OF_DUPES,
             const key_compare& comp = key_compare());
 
   flat_tree(std::initializer_list<value_type> ilist,
-            FlatContainerDupes dupe_handling,
+            FlatContainerDupes dupe_handling = KEEP_FIRST_OF_DUPES,
             const key_compare& comp = key_compare());
 
   ~flat_tree();
 
   // --------------------------------------------------------------------------
   // Assignments.
   //
   // Assume that move assignment invalidates iterators and references.
 
   flat_tree& operator=(const flat_tree&);
@@ skipping 59 matching lines @@
 
   iterator insert(const_iterator position_hint, const value_type& x);
   iterator insert(const_iterator position_hint, value_type&& x);
 
   // This method inserts the values from the range [first, last) into the
   // current tree. In case of KEEP_LAST_OF_DUPES newly added elements can
   // overwrite existing values.
   template <class InputIterator>
   void insert(InputIterator first,
               InputIterator last,
-              FlatContainerDupes dupes);
+              FlatContainerDupes dupes = KEEP_FIRST_OF_DUPES);
 
   template <class... Args>
   std::pair<iterator, bool> emplace(Args&&... args);
 
   template <class... Args>
   iterator emplace_hint(const_iterator position_hint, Args&&... args);
 
   // --------------------------------------------------------------------------
   // Erase operations.
   //
@@ skipping 684 matching lines @@
 void EraseIf(base::internal::flat_tree<Key, Value, GetKeyFromValue, KeyCompare>&
                  container,
              Predicate pred) {
   container.erase(std::remove_if(container.begin(), container.end(), pred),
                   container.end());
 }
 
 }  // namespace base
 
 #endif  // BASE_CONTAINERS_FLAT_TREE_H_