mirror of
https://github.com/love2d/love.git
synced 2026-08-20 04:30:09 +02:00
Clean up warnings in luasocket and box2d
This commit is contained in:
@@ -14,6 +14,9 @@
|
|||||||
* 2. Altered source versions must be plainly marked as such, and must not be
|
* 2. Altered source versions must be plainly marked as such, and must not be
|
||||||
* misrepresented as being the original software.
|
* misrepresented as being the original software.
|
||||||
* 3. This notice may not be removed or altered from any source distribution.
|
* 3. This notice may not be removed or altered from any source distribution.
|
||||||
|
*
|
||||||
|
*
|
||||||
|
* THIS FILE HAS BEEN MODIFIED BY THE LÖVE DEVELOPMENT TEAM
|
||||||
*/
|
*/
|
||||||
|
|
||||||
#ifndef B2_CHAIN_SHAPE_H
|
#ifndef B2_CHAIN_SHAPE_H
|
||||||
@@ -95,8 +98,8 @@ inline b2ChainShape::b2ChainShape()
|
|||||||
m_radius = b2_polygonRadius;
|
m_radius = b2_polygonRadius;
|
||||||
m_vertices = NULL;
|
m_vertices = NULL;
|
||||||
m_count = 0;
|
m_count = 0;
|
||||||
m_hasPrevVertex = NULL;
|
m_hasPrevVertex = false;
|
||||||
m_hasNextVertex = NULL;
|
m_hasNextVertex = false;
|
||||||
}
|
}
|
||||||
|
|
||||||
#endif
|
#endif
|
||||||
|
|||||||
@@ -0,0 +1 @@
|
|||||||
|
PLEASE NOTE, this version of Box2D is NOT original, it has been MODIFIED by the LÖVE Development Team.
|
||||||
@@ -110,7 +110,7 @@ static int base_open(lua_State *L) {
|
|||||||
/*-------------------------------------------------------------------------*\
|
/*-------------------------------------------------------------------------*\
|
||||||
* Initializes all library modules.
|
* Initializes all library modules.
|
||||||
\*-------------------------------------------------------------------------*/
|
\*-------------------------------------------------------------------------*/
|
||||||
LUASOCKET_API luaopen_socket_core(lua_State *L) {
|
int LUASOCKET_API luaopen_socket_core(lua_State *L) {
|
||||||
int i;
|
int i;
|
||||||
base_open(L);
|
base_open(L);
|
||||||
for (i = 0; mod[i].name; i++) mod[i].func(L);
|
for (i = 0; mod[i].name; i++) mod[i].func(L);
|
||||||
|
|||||||
Reference in New Issue
Block a user