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:534:13: 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,max_element_impl(node)->datum)){return nullptr;}//no element in this tree is larger than val
         ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/in/BinarySearchTree.h:536:30: 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>&)'
     else if(node->left&&!less(val,node->left->datum)&&less(val,node->datum)){return node;}//left exists, and node>val>=left, return node;
                          ~~~~^~~~~~~~~~~~~~~~~~~~~~~
/in/BinarySearchTree.h:536:59: 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>&)'
     else if(node->left&&!less(val,node->left->datum)&&less(val,node->datum)){return node;}//left exists, and node>val>=left, return node;
                                                       ~~~~^~~~~~~~~~~~~~~~~
/in/BinarySearchTree.h:537:31: error: no match for call to '(Map<std::__cxx11::basic_string<char>, int>::PairComp) (std::pair<std::__cxx11::basic_string<char>, int>&, const std::pair<std::__cxx11::basic_string<char>, int>&)'
     else if(node->right&&!less(node->datum,val)&&less(val,node->right->datum)){return node->right;}//right exists, and node<=val<right,return node->right;
                           ~~~~^~~~~~~~~~~~~~~~~
/in/BinarySearchTree.h:537:54: 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>&)'
     else if(node->right&&!less(node->datum,val)&&less(val,node->right->datum)){return node->right;}//right exists, and node<=val<right,return node->right;
                                                  ~~~~^~~~~~~~~~~~~~~~~~~~~~~~
/in/BinarySearchTree.h:538:18: error: no match for call to '(Map<std::__cxx11::basic_string<char>, int>::PairComp) (std::pair<std::__cxx11::basic_string<char>, int>&, const std::pair<std::__cxx11::basic_string<char>, int>&)'
     else if(!less(node->left->datum,val)){return min_greater_than_impl(node->left,val,less);}//node->left>=val, set resurse on node->left
              ~~~~^~~~~~~~~~~~~~~~~~~~~~~
/in/BinarySearchTree.h:539:17: error: no match for call to '(Map<std::__cxx11::basic_string<char>, int>::PairComp) (std::pair<std::__cxx11::basic_string<char>, int>&, const std::pair<std::__cxx11::basic_string<char>, int>&)'
     else if(less(node->datum,val)){return min_greater_than_impl(node->right,val,less);}//node<=val, set recurse on node->right;
             ~~~~^~~~~~~~~~~~~~~~~
/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:534:13: 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,max_element_impl(node)->datum)){return nullptr;}//no element in this tree is larger than val
         ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/in/BinarySearchTree.h:536:30: 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> >&)'
     else if(node->left&&!less(val,node->left->datum)&&less(val,node->datum)){return node;}//left exists, and node>val>=left, return node;
                          ~~~~^~~~~~~~~~~~~~~~~~~~~~~
/in/BinarySearchTree.h:536:59: 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> >&)'
     else if(node->left&&!less(val,node->left->datum)&&less(val,node->datum)){return node;}//left exists, and node>val>=left, return node;
                                                       ~~~~^~~~~~~~~~~~~~~~~
/in/BinarySearchTree.h:537:31: error: no match for call to '(Map<Duck, std::__cxx11::basic_string<char>, DuckWealthLess>::PairComp) (std::pair<Duck, std::__cxx11::basic_string<char> >&, const std::pair<Duck, std::__cxx11::basic_string<char> >&)'
     else if(node->right&&!less(node->datum,val)&&less(val,node->right->datum)){return node->right;}//right exists, and node<=val<right,return node->right;
                           ~~~~^~~~~~~~~~~~~~~~~
/in/BinarySearchTree.h:537:54: 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> >&)'
     else if(node->right&&!less(node->datum,val)&&less(val,node->right->datum)){return node->right;}//right exists, and node<=val<right,return node->right;
                                                  ~~~~^~~~~~~~~~~~~~~~~~~~~~~~
/in/BinarySearchTree.h:538:18: error: no match for call to '(Map<Duck, std::__cxx11::basic_string<char>, DuckWealthLess>::PairComp) (std::pair<Duck, std::__cxx11::basic_string<char> >&, const std::pair<Duck, std::__cxx11::basic_string<char> >&)'
     else if(!less(node->left->datum,val)){return min_greater_than_impl(node->left,val,less);}//node->left>=val, set resurse on node->left
              ~~~~^~~~~~~~~~~~~~~~~~~~~~~
/in/BinarySearchTree.h:539:17: error: no match for call to '(Map<Duck, std::__cxx11::basic_string<char>, DuckWealthLess>::PairComp) (std::pair<Duck, std::__cxx11::basic_string<char> >&, const std::pair<Duck, std::__cxx11::basic_string<char> >&)'
     else if(less(node->datum,val)){return min_greater_than_impl(node->right,val,less);}//node<=val, set recurse on node->right;
             ~~~~^~~~~~~~~~~~~~~~~
/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:541: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:541: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