This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.
struct wPoint{
int x,y;
bool active;
}
wPoint myWaypoints[100];
int i =0;
while (i<100) {
myWaypoints[i].x -=5;
myWaypoints[i].y -=5;
i++;
}
int i =0;
while (i<100) {
if (myWaypoints[i].active) {
myWaypoints[i].x -=5;
myWaypoints[i].y -=5;
}
i++;
}
//AGS 3.3 RC1
Tiles.asc(484): Error (line 484): export offset too high; script data size too large?
struct ctile_sprites {
DynamicSprite *spr;
int code;
short frm_speed[MAX_FRAME_TILE];
short frames_in_use;
short frame_counter;
short ani_delay;
short ani_delay_counter;
};
ctile_sprites tile_sprites[NUM_MAX_SPRITES];
// a few lines later ...
export tile_sprites;
int blargh;
export blargh;
String fs = "myimage.bmp";
if (File.Exists(fs)) {
DynamicSprite* sprite = DynamicSprite.CreateFromFile(fs);
DrawingSurface *surface = Room.GetDrawingSurfaceForBackground();
surface.DrawImage(100, 80, sprite.Graphic);
surface.Release();
sprite.Delete();
}
)
. Unfortunately that also increases loading times dramatically, so I wonder if anyone could help me out and put these functions into native C code.
int noloopcheck Readword(this File*) {
char c1 = this.ReadRawChar();
char c2 = this.ReadRawChar();
return c2*256+c1;
}
int noloopcheck ReadDoubleword(this File*) {
int i1 = this.Readword();
int i2 = this.Readword();
// cut 16th bit due to int being signed
i2 = i2%16;
return i2*65536+i1;
}
String noloopcheck BitString(int i, int bits) {
int p = bits - 1,are;
String s="";
int q;
while (p > -1) {
q = FloatToInt(Maths.RaiseToPower(2.0, IntToFloat(p)), eRoundNearest);
are = i/q;
i = i -are*q;
s = String.Format("%d%s",are, s);
p--;
}
return s;
}
int noloopcheck BitStringToInt(String s) {
int l = s.Length,are;
int i;
String ss;
int add = 1;
while (i < l) {
ss = s.Substring(i, 1);
if (ss == "1")are =are + add;
i++;
add = add * 2;
}
returnare;
}
i = 0;
k = 1; // please ignore ;)
while ( i < num_tiles_x )
{
j = 0;
while ( j < num_tiles_y )
{
int index = j * num_tiles_x + i;
if (tile[index].tileno[k] != 0) {
// and so on...
