In file included from /in/Compile/Map_compile_check.cpp:5:0:
/in/Map.h:118:3: error: invalid use of template-name 'BinarySearchTree' without an argument list
   BinarySearchTree BST;
   ^~~~~~~~~~~~~~~~
/in/Map.h: In member function 'size_t Map<Key_type, Value_type, Key_compare>::size() const':
/in/Map.h:71:24: error: no return statement in function returning non-void [-Werror=return-type]
   size_t size() const {}
                        ^
/in/Map.h: In instantiation of 'Map<Key_type, Value_type, Key_compare>::Iterator Map<Key_type, Value_type, Key_compare>::begin() const [with Key_type = std::__cxx11::basic_string<char>; Value_type = int; Key_compare = std::less<std::__cxx11::basic_string<char> >; Map<Key_type, Value_type, Key_compare>::Iterator = BinarySearchTree<std::pair<std::__cxx11::basic_string<char>, int>, Map<std::__cxx11::basic_string<char>, int>::PairComp>::Iterator]':
/in/Compile/Map_compile_check.cpp:68:24:   required from here
/in/Map.h:111:27: error: no return statement in function returning non-void [-Werror=return-type]
   Iterator begin() const {}
                           ^
/in/Map.h: In instantiation of 'Map<Key_type, Value_type, Key_compare>::Iterator Map<Key_type, Value_type, Key_compare>::begin() const [with Key_type = Duck; Value_type = std::__cxx11::basic_string<char>; Key_compare = DuckWealthLess; Map<Key_type, Value_type, Key_compare>::Iterator = BinarySearchTree<std::pair<Duck, std::__cxx11::basic_string<char> >, Map<Duck, std::__cxx11::basic_string<char>, DuckWealthLess>::PairComp>::Iterator]':
/in/Compile/Map_compile_check.cpp:69:34:   required from here
/in/Map.h:111:27: error: no return statement in function returning non-void [-Werror=return-type]
/in/Map.h: In instantiation of 'Map<Key_type, Value_type, Key_compare>::Iterator Map<Key_type, Value_type, Key_compare>::end() const [with Key_type = std::__cxx11::basic_string<char>; Value_type = int; Key_compare = std::less<std::__cxx11::basic_string<char> >; Map<Key_type, Value_type, Key_compare>::Iterator = BinarySearchTree<std::pair<std::__cxx11::basic_string<char>, int>, Map<std::__cxx11::basic_string<char>, int>::PairComp>::Iterator]':
/in/Compile/Map_compile_check.cpp:71:22:   required from here
/in/Map.h:114:25: error: no return statement in function returning non-void [-Werror=return-type]
   Iterator end() const {}
                         ^
/in/Map.h: In instantiation of 'Map<Key_type, Value_type, Key_compare>::Iterator Map<Key_type, Value_type, Key_compare>::end() const [with Key_type = Duck; Value_type = std::__cxx11::basic_string<char>; Key_compare = DuckWealthLess; Map<Key_type, Value_type, Key_compare>::Iterator = BinarySearchTree<std::pair<Duck, std::__cxx11::basic_string<char> >, Map<Duck, std::__cxx11::basic_string<char>, DuckWealthLess>::PairComp>::Iterator]':
/in/Compile/Map_compile_check.cpp:72:32:   required from here
/in/Map.h:114:25: error: no return statement in function returning non-void [-Werror=return-type]
/in/Map.h: In instantiation of 'Map<Key_type, Value_type, Key_compare>::Iterator Map<Key_type, Value_type, Key_compare>::find(const Key_type&) const [with Key_type = std::__cxx11::basic_string<char>; Value_type = int; Key_compare = std::less<std::__cxx11::basic_string<char> >; Map<Key_type, Value_type, Key_compare>::Iterator = BinarySearchTree<std::pair<std::__cxx11::basic_string<char>, int>, Map<std::__cxx11::basic_string<char>, int>::PairComp>::Iterator]':
/in/Compile/Map_compile_check.cpp:74:25:   required from here
/in/Map.h:80:43: error: no return statement in function returning non-void [-Werror=return-type]
   Iterator find(const Key_type& k) const {}
                                           ^
/in/Map.h: In instantiation of 'Map<Key_type, Value_type, Key_compare>::Iterator Map<Key_type, Value_type, Key_compare>::find(const Key_type&) const [with Key_type = Duck; Value_type = std::__cxx11::basic_string<char>; Key_compare = DuckWealthLess; Map<Key_type, Value_type, Key_compare>::Iterator = BinarySearchTree<std::pair<Duck, std::__cxx11::basic_string<char> >, Map<Duck, std::__cxx11::basic_string<char>, DuckWealthLess>::PairComp>::Iterator]':
/in/Compile/Map_compile_check.cpp:75:39:   required from here
/in/Map.h:80:43: error: no return statement in function returning non-void [-Werror=return-type]
/in/Map.h: In instantiation of 'std::pair<typename BinarySearchTree<std::pair<_T1, _T2>, Map<Key_type, Value_type, Key_compare>::PairComp>::Iterator, bool> Map<Key_type, Value_type, Key_compare>::insert(const Pair_type&) [with Key_type = std::__cxx11::basic_string<char>; Value_type = int; Key_compare = std::less<std::__cxx11::basic_string<char> >; typename BinarySearchTree<std::pair<_T1, _T2>, Map<Key_type, Value_type, Key_compare>::PairComp>::Iterator = BinarySearchTree<std::pair<std::__cxx11::basic_string<char>, int>, Map<std::__cxx11::basic_string<char>, int>::PairComp>::Iterator; Map<Key_type, Value_type, Key_compare>::Pair_type = std::pair<std::__cxx11::basic_string<char>, int>]':
/in/Compile/Map_compile_check.cpp:80:26:   required from here
/in/Map.h:108:59: error: no return statement in function returning non-void [-Werror=return-type]
   std::pair<Iterator, bool> insert(const Pair_type &val) {}
                                                           ^
/in/Map.h: In instantiation of 'std::pair<typename BinarySearchTree<std::pair<_T1, _T2>, Map<Key_type, Value_type, Key_compare>::PairComp>::Iterator, bool> Map<Key_type, Value_type, Key_compare>::insert(const Pair_type&) [with Key_type = Duck; Value_type = std::__cxx11::basic_string<char>; Key_compare = DuckWealthLess; typename BinarySearchTree<std::pair<_T1, _T2>, Map<Key_type, Value_type, Key_compare>::PairComp>::Iterator = BinarySearchTree<std::pair<Duck, std::__cxx11::basic_string<char> >, Map<Duck, std::__cxx11::basic_string<char>, DuckWealthLess>::PairComp>::Iterator; Map<Key_type, Value_type, Key_compare>::Pair_type = std::pair<Duck, std::__cxx11::basic_string<char> >]':
/in/Compile/Map_compile_check.cpp:82:47:   required from here
/in/Map.h:108:59: error: no return statement in function returning non-void [-Werror=return-type]
/in/Map.h: In instantiation of 'Value_type& Map<Key_type, Value_type, Key_compare>::operator[](const Key_type&) [with Key_type = std::__cxx11::basic_string<char>; Value_type = int; Key_compare = std::less<std::__cxx11::basic_string<char> >]':
/in/Compile/Map_compile_check.cpp:85:21:   required from here
/in/Map.h:98:46: error: no return statement in function returning non-void [-Werror=return-type]
   Value_type& operator[](const Key_type& k) {}
                                              ^
/in/Map.h: In instantiation of 'Value_type& Map<Key_type, Value_type, Key_compare>::operator[](const Key_type&) [with Key_type = Duck; Value_type = std::__cxx11::basic_string<char>; Key_compare = DuckWealthLess]':
/in/Compile/Map_compile_check.cpp:87:35:   required from here
/in/Map.h:98:46: error: no return statement in function returning non-void [-Werror=return-type]
In file included from /in/Map.h:19:0,
                 from /in/Compile/Map_compile_check.cpp:5:
/in/BinarySearchTree.h: In instantiation of 'static BinarySearchTree<T, Compare>::Node* BinarySearchTree<T, Compare>::min_greater_than_impl(BinarySearchTree<T, Compare>::Node*, const T&, Compare) [with T = std::pair<std::__cxx11::basic_string<char>, int>; Compare = Map<std::__cxx11::basic_string<char>, int>::PairComp]':
/in/BinarySearchTree.h:198:45:   required from 'BinarySearchTree<T, Compare>::Iterator& BinarySearchTree<T, Compare>::Iterator::operator++() [with T = std::pair<std::__cxx11::basic_string<char>, int>; Compare = Map<std::__cxx11::basic_string<char>, int>::PairComp]'
/in/Compile/Map_compile_check.cpp:98:7:   required from here
/in/BinarySearchTree.h:545:21: error: no match for call to '(Map<std::__cxx11::basic_string<char>, int>::PairComp) (const std::pair<std::__cxx11::basic_string<char>, int>&, std::pair<std::__cxx11::basic_string<char>, int>&)'
     if (!node||!less(val,max_element_impl(node)->datum)) return nullptr;
                 ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/in/BinarySearchTree.h:547:15: error: no match for call to '(Map<std::__cxx11::basic_string<char>, int>::PairComp) (const std::pair<std::__cxx11::basic_string<char>, int>&, std::pair<std::__cxx11::basic_string<char>, int>&)'
       if (less(val,node->datum)){
           ~~~~^~~~~~~~~~~~~~~~~
/in/BinarySearchTree.h: In instantiation of 'static BinarySearchTree<T, Compare>::Node* BinarySearchTree<T, Compare>::min_greater_than_impl(BinarySearchTree<T, Compare>::Node*, const T&, Compare) [with T = std::pair<Duck, std::__cxx11::basic_string<char> >; Compare = Map<Duck, std::__cxx11::basic_string<char>, DuckWealthLess>::PairComp]':
/in/BinarySearchTree.h:198:45:   required from 'BinarySearchTree<T, Compare>::Iterator& BinarySearchTree<T, Compare>::Iterator::operator++() [with T = std::pair<Duck, std::__cxx11::basic_string<char> >; Compare = Map<Duck, std::__cxx11::basic_string<char>, DuckWealthLess>::PairComp]'
/in/Compile/Map_compile_check.cpp:99:7:   required from here
/in/BinarySearchTree.h:545:21: error: no match for call to '(Map<Duck, std::__cxx11::basic_string<char>, DuckWealthLess>::PairComp) (const std::pair<Duck, std::__cxx11::basic_string<char> >&, std::pair<Duck, std::__cxx11::basic_string<char> >&)'
     if (!node||!less(val,max_element_impl(node)->datum)) return nullptr;
                 ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/in/BinarySearchTree.h:547:15: error: no match for call to '(Map<Duck, std::__cxx11::basic_string<char>, DuckWealthLess>::PairComp) (const std::pair<Duck, std::__cxx11::basic_string<char> >&, std::pair<Duck, std::__cxx11::basic_string<char> >&)'
       if (less(val,node->datum)){
           ~~~~^~~~~~~~~~~~~~~~~
/in/BinarySearchTree.h: In static member function 'static BinarySearchTree<T, Compare>::Node* BinarySearchTree<T, Compare>::min_greater_than_impl(BinarySearchTree<T, Compare>::Node*, const T&, Compare) [with T = std::pair<std::__cxx11::basic_string<char>, int>; Compare = Map<std::__cxx11::basic_string<char>, int>::PairComp]':
/in/BinarySearchTree.h:556:3: error: control reaches end of non-void function [-Werror=return-type]
   }
   ^
/in/BinarySearchTree.h: In static member function 'static BinarySearchTree<T, Compare>::Node* BinarySearchTree<T, Compare>::min_greater_than_impl(BinarySearchTree<T, Compare>::Node*, const T&, Compare) [with T = std::pair<Duck, std::__cxx11::basic_string<char> >; Compare = Map<Duck, std::__cxx11::basic_string<char>, DuckWealthLess>::PairComp]':
/in/BinarySearchTree.h:556:3: error: control reaches end of non-void function [-Werror=return-type]
   }
   ^
cc1plus: all warnings being treated as errors
/in/Compile/Makefile:32: recipe for target 'Map_compile_check.exe' failed
make: *** [Map_compile_check.exe] Error 1