src/find_best_match.cpp

   1 // Copyright (c) 2003 Daniel Wallin and Arvid Norberg
   2
   3 // Permission is hereby granted, free of charge, to any person obtaining a
   4 // copy of this software and associated documentation files (the "Software"),
   5 // to deal in the Software without restriction, including without limitation
   6 // the rights to use, copy, modify, merge, publish, distribute, sublicense,
   7 // and/or sell copies of the Software, and to permit persons to whom the
   8 // Software is furnished to do so, subject to the following conditions:
   9
  10 // The above copyright notice and this permission notice shall be included
  11 // in all copies or substantial portions of the Software.
  12
  13 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
  14 // ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
  15 // TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
  16 // PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
  17 // SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR
  18 // ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  19 // ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  20 // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE
  21 // OR OTHER DEALINGS IN THE SOFTWARE.
  22
  23 #include <luabind/lua_include.hpp>
  24
  25 #define LUABIND_BUILDING
  26
  27 #include <luabind/luabind.hpp>
  28
  29 using namespace luabind::detail;
  30
  31 bool luabind::detail::find_best_match(lua_State* L, const overload_rep_base* start, int num_overloads, size_t orep_size, bool& ambiguous, int& min_match, int& match_index, int num_params)
  32 {
  33         int min_but_one_match = std::numeric_limits<int>::max();
  34         bool found = false;
  35
  36         for (int index = 0; index < num_overloads; ++index)
  37         {
  38                 int match_value = start->match(L, num_params);
  39                 reinterpret_cast<const char*&>(start) += orep_size;
  40
  41                 if (match_value < 0) continue;
  42                 if (match_value < min_match)
  43                 {
  44                         found = true;
  45                         match_index = index;
  46                         min_but_one_match = min_match;
  47                         min_match = match_value;
  48                 }
  49                 else if (match_value < min_but_one_match)
  50                 {
  51                         min_but_one_match = match_value;
  52                 }
  53         }
  54
  55         ambiguous = min_match == min_but_one_match && min_match < std::numeric_limits<int>::max();
  56         return found;
  57 }
  58
  59 void luabind::detail::find_exact_match(lua_State* L, const overload_rep_base* start, int num_overloads, size_t orep_size, int cmp_match, int num_params, std::vector<const overload_rep_base*>& dest)
  60 {
  61         for (int i = 0; i < num_overloads; ++i)
  62         {
  63                 int match_value = start->match(L, num_params);
  64                 if (match_value == cmp_match) dest.push_back(start);
  65                 reinterpret_cast<const char*&>(start) += orep_size;
  66         }
  67 }