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 #include <luabind/luabind.hpp>
  26
  27 using namespace luabind::detail;
  28
  29 bool luabind::detail::find_best_match(
  30     lua_State* L
  31   , const overload_rep_base* start
  32   , int num_overloads
  33   , size_t orep_size
  34   , bool& ambiguous
  35   , int& min_match
  36   , int& match_index
  37   , int num_params)
  38 {
  39     int min_but_one_match = std::numeric_limits<int>::max();
  40     bool found = false;
  41
  42     for (int index = 0; index < num_overloads; ++index)
  43     {
  44         int match_value = start->match(L, num_params);
  45         reinterpret_cast<const char*&>(start) += orep_size;
  46
  47         if (match_value < 0) continue;
  48         if (match_value < min_match)
  49         {
  50             found = true;
  51             match_index = index;
  52             min_but_one_match = min_match;
  53             min_match = match_value;
  54         }
  55         else if (match_value < min_but_one_match)
  56         {
  57             min_but_one_match = match_value;
  58         }
  59     }
  60
  61     ambiguous = min_match == min_but_one_match && min_match < std::numeric_limits<int>::max();
  62     return found;
  63 }
  64
  65 void luabind::detail::find_exact_match(
  66     lua_State* L
  67   , const overload_rep_base* start
  68   , int num_overloads
  69   , size_t orep_size
  70   , int cmp_match
  71   , int num_params
  72   , std::vector<const overload_rep_base*>& dest)
  73 {
  74     for (int i = 0; i < num_overloads; ++i)
  75     {
  76         int match_value = start->match(L, num_params);
  77         if (match_value == cmp_match) dest.push_back(start);
  78         reinterpret_cast<const char*&>(start) += orep_size;
  79     }
  80 }
  81