Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jens changes for IMV3D 4.0.0 #5

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
The table of contents is too big for display.
Diff view
Diff view
  •  
  •  
  •  
33,944 changes: 16,972 additions & 16,972 deletions 3rdParty/GLEW/GL/glew.c

Large diffs are not rendered by default.

34,268 changes: 17,134 additions & 17,134 deletions 3rdParty/GLEW/GL/glew.h

Large diffs are not rendered by default.

3,274 changes: 1,637 additions & 1,637 deletions 3rdParty/GLEW/GL/glxew.h

Large diffs are not rendered by default.

2,794 changes: 1,397 additions & 1,397 deletions 3rdParty/GLEW/GL/wglew.h

Large diffs are not rendered by default.

2,562 changes: 1,281 additions & 1,281 deletions 3rdParty/LUA/lapi.cpp

Large diffs are not rendered by default.

48 changes: 24 additions & 24 deletions 3rdParty/LUA/lapi.h
Original file line number Diff line number Diff line change
@@ -1,24 +1,24 @@
/*
** $Id: lapi.h,v 2.7 2009/11/27 15:37:59 roberto Exp $
** Auxiliary functions from Lua API
** See Copyright Notice in lua.h
*/

#ifndef lapi_h
#define lapi_h


#include "llimits.h"
#include "lstate.h"

#define api_incr_top(L) {L->top++; api_check(L, L->top <= L->ci->top, \
"stack overflow");}

#define adjustresults(L,nres) \
{ if ((nres) == LUA_MULTRET && L->ci->top < L->top) L->ci->top = L->top; }

#define api_checknelems(L,n) api_check(L, (n) < (L->top - L->ci->func), \
"not enough elements in the stack")


#endif
/*
** $Id: lapi.h,v 2.7 2009/11/27 15:37:59 roberto Exp $
** Auxiliary functions from Lua API
** See Copyright Notice in lua.h
*/
#ifndef lapi_h
#define lapi_h
#include "llimits.h"
#include "lstate.h"
#define api_incr_top(L) {L->top++; api_check(L, L->top <= L->ci->top, \
"stack overflow");}
#define adjustresults(L,nres) \
{ if ((nres) == LUA_MULTRET && L->ci->top < L->top) L->ci->top = L->top; }
#define api_checknelems(L,n) api_check(L, (n) < (L->top - L->ci->func), \
"not enough elements in the stack")
#endif
Loading