Click here to Skip to main content
15,897,371 members
Articles / Database Development / SQL Server

A scripted SQL query generation framework with IDE: SQLpp (v1.4)

Rate me:
Please Sign up or sign in to vote.
4.98/5 (47 votes)
12 Sep 200311 min read 416.4K   5.4K   133  
A helper framework for generation of SQL queries in C++ and Lua
// 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_IMPLICIT_CAST_HPP_INCLUDED
#define LUABIND_IMPLICIT_CAST_HPP_INCLUDED

#include <luabind/config.hpp>
#include <luabind/detail/class_rep.hpp>

namespace luabind { namespace detail
{
	// returns -1 if there exists no implicit cast from the given class_rep
	// to T. If there exists an implicit cast to T, the number of steps times 2
	// is returned and pointer_offset is filled with the number of bytes
	// the pointer have to be offseted to perform the cast
	// the reason why we return the number of cast-steps times two, instead of
	// just the number of steps is to be consistent with the function matchers. They
	// have to give one matching-point extra to match const functions. There may be
	// two functions that match their parameters exactly, but there is one const
	// function and one non-const function, then (if the this-pointer is non-const)
	// both functions will match. To avoid amiguaties, the const version will get
	// one penalty point to make the match-selector select the non-const version. It
	// the this-pointer is const, there's no problem, since the non-const function
	// will not match at all.

	LUABIND_API int implicit_cast(const class_rep*, LUABIND_TYPE_INFO const&, int&);

}}

#endif // LUABIND_IMPLICIT_CAST_HPP_INCLUDED

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article has no explicit license attached to it but may contain usage terms in the article text or the download files themselves. If in doubt please contact the author via the discussion board below.

A list of licenses authors might use can be found here


Written By
Engineer
United States United States
Jonathan de Halleux is Civil Engineer in Applied Mathematics. He finished his PhD in 2004 in the rainy country of Belgium. After 2 years in the Common Language Runtime (i.e. .net), he is now working at Microsoft Research on Pex (http://research.microsoft.com/pex).

Comments and Discussions