x
Yes
No
Do you want to visit DriveHQ English website?
Inicio
Características
Precios
Prueba gratuita
Software cliente
Acerca de nosotros
Servidor de archivos
|
Solución de copias de seguridad
|
Servidor FTP
|
Servidor de correo electrónico
|
Alojamiento web
|
Software cliente
Servidor de archivos
Solución de copia de seguridad
Servidor FTP
Servidor de correo electrónico
Alojamiento web
Software cliente
find_best_match.hpp - Hosted on DriveHQ Cloud IT Platform
Arriba
Subir
Descargar
Compartir
Publicar
Nueva carpeta
Nuevo archivo
Copiar
Cortar
Eliminar
Pegar
Clasificación
Actualizar
Ruta de la carpeta: \\game3dprogramming\materials\GameFactory\GameFactoryDemo\references\luabind\luabind\detail\find_best_match.hpp
Girar
Efecto
Propiedad
Historial
// Copyright (c) 2003 Daniel Wallin and Arvid Norberg // Permission is hereby granted, free of charge, to any person obtaining a // copy of this software and associated documentation files (the "Software"), // to deal in the Software without restriction, including without limitation // the rights to use, copy, modify, merge, publish, distribute, sublicense, // and/or sell copies of the Software, and to permit persons to whom the // Software is furnished to do so, subject to the following conditions: // The above copyright notice and this permission notice shall be included // in all copies or substantial portions of the Software. // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF // ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED // TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A // PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT // SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR // ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN // ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE // OR OTHER DEALINGS IN THE SOFTWARE. #ifndef LUABIND_FIND_BEST_MATCH_HPP_INCLUDED #define LUABIND_FIND_BEST_MATCH_HPP_INCLUDED #include
#include
namespace luabind { namespace detail { // expects that a match function can be accesed through the iterator // as int match_fun(lua_State*) // returns true if it found a match better than the given. If it finds a // better match match_index is updated to contain the new index to the best // match (this index now refers to the list given to this call). // orep_size is supposed to tell the size of the actual structures that // start and end points to ambiguous is set to true if the match was // ambiguous min_match should be initialized to the currently best match // value (the number of implicit casts to get a perfect match). If there // are no previous matches, set min_match to // std::numeric_limits
::max() LUABIND_API bool find_best_match(lua_State* L , detail::overload_rep_base const* start, int num_overloads , size_t orep_size, bool& ambiguous, int& min_match, int& match_index , int num_params); LUABIND_API void find_exact_match(lua_State* L , detail::overload_rep_base const* start, int num_overloads , size_t orep_size, int cmp_match, int num_params , std::vector
& dest); }} #endif // LUABIND_FIND_BEST_MATCH_HPP_INCLUDED
find_best_match.hpp
Dirección de la página
Dirección del archivo
Anterior
15/43
Siguiente
Descargar
( 2 KB )
Comments
Total ratings:
0
Average rating:
No clasificado
of 10
Would you like to comment?
Join now
, or
Logon
if you are already a member.