2011-09-07 23:06:51 +02:00
|
|
|
// A piece object in the LeoCAD world.
|
|
|
|
//
|
|
|
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <math.h>
|
|
|
|
#include "opengl.h"
|
|
|
|
#include "matrix.h"
|
|
|
|
#include "pieceinf.h"
|
|
|
|
#include "texture.h"
|
|
|
|
#include "piece.h"
|
|
|
|
#include "group.h"
|
|
|
|
#include "project.h"
|
|
|
|
#include "algebra.h"
|
|
|
|
#include "lc_application.h"
|
|
|
|
|
|
|
|
#define LC_PIECE_SAVE_VERSION 10 // LeoCAD 0.75.2
|
|
|
|
|
|
|
|
static LC_OBJECT_KEY_INFO piece_key_info[LC_PK_COUNT] =
|
|
|
|
{
|
|
|
|
{ "Position", 3, LC_PK_POSITION },
|
|
|
|
{ "Rotation", 4, LC_PK_ROTATION }
|
|
|
|
};
|
|
|
|
|
|
|
|
/////////////////////////////////////////////////////////////////////////////
|
|
|
|
// Static functions
|
|
|
|
|
|
|
|
inline static void SetCurrentColor(unsigned char nColor, bool* bTrans, bool bLighting)
|
|
|
|
{
|
|
|
|
bool Transparent = (nColor > 13 && nColor < 22);
|
|
|
|
|
|
|
|
if (bLighting || Transparent)
|
|
|
|
glColor4ubv(ColorArray[nColor]);
|
|
|
|
else
|
|
|
|
glColor3ubv(FlatColorArray[nColor]);
|
|
|
|
|
|
|
|
if (nColor > 27)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (Transparent)
|
|
|
|
{
|
|
|
|
if (!*bTrans)
|
|
|
|
{
|
|
|
|
*bTrans = true;
|
|
|
|
glEnable(GL_BLEND);
|
|
|
|
glDepthMask(GL_FALSE);
|
|
|
|
glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (*bTrans)
|
|
|
|
{
|
|
|
|
*bTrans = false;
|
|
|
|
glDepthMask(GL_TRUE);
|
|
|
|
glDisable(GL_BLEND);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/////////////////////////////////////////////////////////////////////////////
|
|
|
|
// Piece construction/destruction
|
|
|
|
|
|
|
|
static bool lockarrays = false;
|
|
|
|
|
|
|
|
Piece::Piece(PieceInfo* pPieceInfo)
|
|
|
|
: Object (LC_OBJECT_PIECE)
|
|
|
|
{
|
|
|
|
static bool first_time = true;
|
|
|
|
|
|
|
|
if (first_time)
|
|
|
|
{
|
|
|
|
first_time = false;
|
|
|
|
lockarrays = GL_HasCompiledVertexArrays ();
|
|
|
|
}
|
|
|
|
|
|
|
|
m_pNext = NULL;
|
|
|
|
m_pPieceInfo = pPieceInfo;
|
|
|
|
m_nState = 0;
|
|
|
|
m_nColor = 0;
|
|
|
|
m_nStepShow = 1;
|
|
|
|
m_nStepHide = 255;
|
|
|
|
m_nFrameHide = 65535;
|
|
|
|
memset(m_strName, 0, sizeof(m_strName));
|
|
|
|
m_pGroup = NULL;
|
|
|
|
m_pDrawInfo = NULL;
|
|
|
|
m_pConnections = NULL;
|
|
|
|
|
|
|
|
if (m_pPieceInfo != NULL)
|
|
|
|
{
|
|
|
|
m_pPieceInfo->AddRef();
|
|
|
|
|
|
|
|
if (m_pPieceInfo->m_nConnectionCount > 0)
|
|
|
|
{
|
|
|
|
m_pConnections = (CONNECTION*)malloc(sizeof(CONNECTION)*(m_pPieceInfo->m_nConnectionCount));
|
|
|
|
|
|
|
|
for (int i = 0; i < m_pPieceInfo->m_nConnectionCount; i++)
|
|
|
|
{
|
|
|
|
m_pConnections[i].type = m_pPieceInfo->m_pConnections[i].type;
|
|
|
|
m_pConnections[i].link = NULL;
|
|
|
|
m_pConnections[i].owner = this;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
float *values[] = { m_fPosition, m_fRotation };
|
|
|
|
RegisterKeys (values, piece_key_info, LC_PK_COUNT);
|
|
|
|
|
|
|
|
float pos[3] = { 0, 0, 0 }, rot[4] = { 0, 0, 1, 0 };
|
|
|
|
ChangeKey (1, false, true, pos, LC_PK_POSITION);
|
|
|
|
ChangeKey (1, false, true, rot, LC_PK_ROTATION);
|
|
|
|
ChangeKey (1, true, true, pos, LC_PK_POSITION);
|
|
|
|
ChangeKey (1, true, true, rot, LC_PK_ROTATION);
|
|
|
|
}
|
|
|
|
|
|
|
|
Piece::~Piece()
|
|
|
|
{
|
|
|
|
if (m_pPieceInfo != NULL)
|
|
|
|
m_pPieceInfo->DeRef ();
|
|
|
|
|
|
|
|
if (m_pDrawInfo != NULL)
|
|
|
|
free (m_pDrawInfo);
|
|
|
|
|
|
|
|
if (m_pConnections != NULL)
|
|
|
|
free (m_pConnections);
|
|
|
|
}
|
|
|
|
|
|
|
|
/////////////////////////////////////////////////////////////////////////////
|
|
|
|
// Piece save/load
|
|
|
|
|
|
|
|
// Use only when loading from a file
|
|
|
|
void Piece::SetPieceInfo(PieceInfo* pPieceInfo)
|
|
|
|
{
|
|
|
|
m_pPieceInfo = pPieceInfo;
|
|
|
|
m_pPieceInfo->AddRef();
|
|
|
|
|
|
|
|
if (m_pPieceInfo->m_nConnectionCount > 0)
|
|
|
|
{
|
|
|
|
m_pConnections = (CONNECTION*)malloc(sizeof(CONNECTION)*(m_pPieceInfo->m_nConnectionCount));
|
|
|
|
|
|
|
|
for (int i = 0; i < m_pPieceInfo->m_nConnectionCount; i++)
|
|
|
|
{
|
|
|
|
m_pConnections[i].type = m_pPieceInfo->m_pConnections[i].type;
|
|
|
|
m_pConnections[i].link = NULL;
|
|
|
|
m_pConnections[i].owner = this;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bool Piece::FileLoad (File& file, char* name)
|
|
|
|
{
|
|
|
|
unsigned char version, ch;
|
|
|
|
|
|
|
|
file.ReadByte (&version, 1);
|
|
|
|
|
|
|
|
if (version > LC_PIECE_SAVE_VERSION)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (version > 8)
|
|
|
|
if (!Object::FileLoad (file))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (version < 9)
|
|
|
|
{
|
|
|
|
lcuint16 time;
|
|
|
|
float param[4];
|
|
|
|
unsigned char type;
|
|
|
|
|
|
|
|
if (version > 5)
|
|
|
|
{
|
|
|
|
lcuint32 keys;
|
|
|
|
|
|
|
|
file.ReadLong (&keys, 1);
|
|
|
|
while (keys--)
|
|
|
|
{
|
|
|
|
file.ReadFloat (param, 4);
|
|
|
|
file.ReadShort (&time, 1);
|
|
|
|
file.ReadByte (&type, 1);
|
|
|
|
|
|
|
|
ChangeKey (time, false, true, param, type);
|
|
|
|
}
|
|
|
|
|
|
|
|
file.ReadLong (&keys, 1);
|
|
|
|
while (keys--)
|
|
|
|
{
|
|
|
|
file.ReadFloat (param, 4);
|
|
|
|
file.ReadShort (&time, 1);
|
|
|
|
file.ReadByte (&type, 1);
|
|
|
|
|
|
|
|
ChangeKey (time, true, true, param, type);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (version > 2)
|
|
|
|
{
|
|
|
|
file.Read (&ch, 1);
|
|
|
|
|
|
|
|
while (ch--)
|
|
|
|
{
|
|
|
|
Matrix mat;
|
|
|
|
if (version > 3)
|
|
|
|
{
|
|
|
|
float m[16];
|
|
|
|
file.ReadFloat (m, 16);
|
|
|
|
mat.FromFloat (m);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
float move[3], rotate[3];
|
|
|
|
file.ReadFloat (move, 3);
|
|
|
|
file.ReadFloat (rotate, 3);
|
|
|
|
mat.CreateOld (move[0], move[1], move[2], rotate[0], rotate[1], rotate[2]);
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned char b;
|
|
|
|
file.ReadByte(&b, 1);
|
|
|
|
time = b;
|
|
|
|
|
|
|
|
mat.GetTranslation(¶m[0], ¶m[1], ¶m[2]);
|
|
|
|
param[3] = 0;
|
|
|
|
ChangeKey (time, false, true, param, LC_PK_POSITION);
|
|
|
|
ChangeKey (time, true, true, param, LC_PK_POSITION);
|
|
|
|
|
|
|
|
mat.ToAxisAngle (param);
|
|
|
|
ChangeKey (time, false, true, param, LC_PK_ROTATION);
|
|
|
|
ChangeKey (time, true, true, param, LC_PK_ROTATION);
|
|
|
|
|
|
|
|
int bl;
|
|
|
|
file.ReadLong (&bl, 1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
Matrix mat;
|
|
|
|
float move[3], rotate[3];
|
|
|
|
file.ReadFloat (move, 3);
|
|
|
|
file.ReadFloat (rotate, 3);
|
|
|
|
mat.CreateOld (move[0], move[1], move[2], rotate[0], rotate[1], rotate[2]);
|
|
|
|
|
|
|
|
mat.GetTranslation(¶m[0], ¶m[1], ¶m[2]);
|
|
|
|
param[3] = 0;
|
|
|
|
ChangeKey (1, false, true, param, LC_PK_POSITION);
|
|
|
|
ChangeKey (1, true, true, param, LC_PK_POSITION);
|
|
|
|
|
|
|
|
mat.ToAxisAngle (param);
|
|
|
|
ChangeKey (1, false, true, param, LC_PK_ROTATION);
|
|
|
|
ChangeKey (1, true, true, param, LC_PK_ROTATION);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Common to all versions.
|
|
|
|
if (version < 10)
|
|
|
|
{
|
|
|
|
memset(name, 0, LC_PIECE_NAME_LEN);
|
|
|
|
file.Read(name, 9);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
file.Read(name, LC_PIECE_NAME_LEN);
|
|
|
|
file.ReadByte(&m_nColor, 1);
|
|
|
|
|
|
|
|
if (version < 5)
|
|
|
|
{
|
|
|
|
const unsigned char conv[20] = { 0,2,4,9,7,6,22,8,10,11,14,16,18,9,21,20,22,8,10,11 };
|
|
|
|
m_nColor = conv[m_nColor];
|
|
|
|
}
|
|
|
|
|
|
|
|
file.ReadByte(&m_nStepShow, 1);
|
|
|
|
if (version > 1)
|
|
|
|
file.ReadByte(&m_nStepHide, 1);
|
|
|
|
else
|
|
|
|
m_nStepHide = 255;
|
|
|
|
|
|
|
|
if (version > 5)
|
|
|
|
{
|
|
|
|
file.ReadShort(&m_nFrameShow, 1);
|
|
|
|
file.ReadShort(&m_nFrameHide, 1);
|
|
|
|
|
|
|
|
if (version > 7)
|
|
|
|
{
|
|
|
|
file.ReadByte(&m_nState, 1);
|
|
|
|
Select (false, false, false);
|
|
|
|
file.ReadByte(&ch, 1);
|
|
|
|
file.Read(m_strName, ch);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
int hide;
|
|
|
|
file.ReadLong(&hide, 1);
|
|
|
|
if (hide != 0)
|
|
|
|
m_nState |= LC_PIECE_HIDDEN;
|
|
|
|
file.Read(m_strName, 81);
|
|
|
|
}
|
|
|
|
|
|
|
|
// 7 (0.64)
|
|
|
|
int i = -1;
|
|
|
|
if (version > 6)
|
|
|
|
file.ReadLong(&i, 1);
|
|
|
|
m_pGroup = (Group*)i;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
m_nFrameShow = 1;
|
|
|
|
m_nFrameHide = 65535;
|
|
|
|
|
|
|
|
file.ReadByte(&ch, 1);
|
|
|
|
if (ch == 0)
|
|
|
|
m_pGroup = (Group*)-1;
|
|
|
|
else
|
|
|
|
m_pGroup = (Group*)(lcuint32)ch;
|
|
|
|
|
|
|
|
file.ReadByte(&ch, 1);
|
|
|
|
if (ch & 0x01)
|
|
|
|
m_nState |= LC_PIECE_HIDDEN;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Piece::FileSave (File& file, Group* pGroups)
|
|
|
|
{
|
|
|
|
unsigned char ch = LC_PIECE_SAVE_VERSION;
|
|
|
|
|
|
|
|
file.WriteByte (&ch, 1);
|
|
|
|
|
|
|
|
Object::FileSave (file);
|
|
|
|
|
|
|
|
file.Write(m_pPieceInfo->m_strName, LC_PIECE_NAME_LEN);
|
|
|
|
file.WriteByte(&m_nColor, 1);
|
|
|
|
file.WriteByte(&m_nStepShow, 1);
|
|
|
|
file.WriteByte(&m_nStepHide, 1);
|
|
|
|
file.WriteShort(&m_nFrameShow, 1);
|
|
|
|
file.WriteShort(&m_nFrameHide, 1);
|
|
|
|
|
|
|
|
// version 8
|
|
|
|
file.WriteByte(&m_nState, 1);
|
|
|
|
ch = strlen(m_strName);
|
|
|
|
file.WriteByte(&ch, 1);
|
|
|
|
file.Write(m_strName, ch);
|
|
|
|
|
|
|
|
// version 7
|
|
|
|
int i;
|
|
|
|
if (m_pGroup != NULL)
|
|
|
|
{
|
|
|
|
for (i = 0; pGroups; pGroups = pGroups->m_pNext)
|
|
|
|
{
|
|
|
|
if (m_pGroup == pGroups)
|
|
|
|
break;
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
i = -1;
|
|
|
|
file.WriteLong(&i, 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Piece::Initialize(float x, float y, float z, unsigned char nStep, unsigned short nFrame, unsigned char nColor)
|
|
|
|
{
|
|
|
|
m_nFrameShow = nFrame;
|
|
|
|
m_nStepShow = nStep;
|
|
|
|
|
|
|
|
float pos[3] = { x, y, z }, rot[4] = { 0, 0, 1, 0 };
|
|
|
|
ChangeKey (1, false, true, pos, LC_PK_POSITION);
|
|
|
|
ChangeKey (1, false, true, rot, LC_PK_ROTATION);
|
|
|
|
ChangeKey (1, true, true, pos, LC_PK_POSITION);
|
|
|
|
ChangeKey (1, true, true, rot, LC_PK_ROTATION);
|
|
|
|
|
|
|
|
UpdatePosition (1, false);
|
|
|
|
|
|
|
|
m_nColor = nColor;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Piece::CreateName(Piece* pPiece)
|
|
|
|
{
|
|
|
|
int i, max = 0;
|
|
|
|
|
|
|
|
for (; pPiece; pPiece = pPiece->m_pNext)
|
|
|
|
if (strncmp (pPiece->m_strName, m_pPieceInfo->m_strDescription, strlen(m_pPieceInfo->m_strDescription)) == 0)
|
|
|
|
if (sscanf(pPiece->m_strName + strlen(m_pPieceInfo->m_strDescription), " #%d", &i) == 1)
|
|
|
|
if (i > max)
|
|
|
|
max = i;
|
|
|
|
|
|
|
|
sprintf (m_strName, "%s #%.2d", m_pPieceInfo->m_strDescription, max+1);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Piece::Select (bool bSelecting, bool bFocus, bool bMultiple)
|
|
|
|
{
|
|
|
|
if (bSelecting == true)
|
|
|
|
{
|
|
|
|
if (bFocus == true)
|
|
|
|
m_nState |= (LC_PIECE_FOCUSED|LC_PIECE_SELECTED);
|
|
|
|
else
|
|
|
|
m_nState |= LC_PIECE_SELECTED;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (bFocus == true)
|
|
|
|
m_nState &= ~(LC_PIECE_FOCUSED);
|
|
|
|
else
|
|
|
|
m_nState &= ~(LC_PIECE_SELECTED|LC_PIECE_FOCUSED);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void Piece::InsertTime (unsigned short start, bool animation, unsigned short time)
|
|
|
|
{
|
|
|
|
if (animation)
|
|
|
|
{
|
|
|
|
if (m_nFrameShow >= start)
|
|
|
|
m_nFrameShow = min(m_nFrameShow + time, lcGetActiveProject()->GetTotalFrames());
|
|
|
|
|
|
|
|
if (m_nFrameHide >= start)
|
|
|
|
m_nFrameHide = min(m_nFrameHide + time, lcGetActiveProject()->GetTotalFrames());
|
|
|
|
|
|
|
|
if (m_nFrameShow > lcGetActiveProject()->GetCurrentTime())
|
|
|
|
Select (false, false, false);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (m_nStepShow >= start)
|
|
|
|
m_nStepShow = min(m_nStepShow + time, 255);
|
|
|
|
|
|
|
|
if (m_nStepHide >= start)
|
|
|
|
m_nStepHide = min(m_nStepHide + time, 255);
|
|
|
|
|
|
|
|
if (m_nStepShow > lcGetActiveProject()->GetCurrentTime ())
|
|
|
|
Select (false, false, false);
|
|
|
|
}
|
|
|
|
|
|
|
|
Object::InsertTime (start, animation, time);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Piece::RemoveTime (unsigned short start, bool animation, unsigned short time)
|
|
|
|
{
|
|
|
|
if (animation)
|
|
|
|
{
|
|
|
|
if (m_nFrameShow >= start)
|
|
|
|
m_nFrameShow = max(m_nFrameShow - time, 1);
|
|
|
|
|
|
|
|
if (m_nFrameHide == lcGetActiveProject()->GetTotalFrames())
|
|
|
|
m_nFrameHide = lcGetActiveProject()->GetTotalFrames();
|
|
|
|
else
|
|
|
|
m_nFrameHide = max(m_nFrameHide - time, 1);
|
|
|
|
|
|
|
|
if (m_nFrameHide < lcGetActiveProject()->GetCurrentTime())
|
|
|
|
Select (false, false, false);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (m_nStepShow >= start)
|
|
|
|
m_nStepShow = max (m_nStepShow - time, 1);
|
|
|
|
|
|
|
|
if (m_nStepHide != 255)
|
|
|
|
m_nStepHide = max (m_nStepHide - time, 1);
|
|
|
|
|
|
|
|
if (m_nStepHide < lcGetActiveProject()->GetCurrentTime())
|
|
|
|
Select (false, false, false);
|
|
|
|
}
|
|
|
|
|
|
|
|
Object::RemoveTime (start, animation, time);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Piece::MinIntersectDist(LC_CLICKLINE* pLine)
|
|
|
|
{
|
|
|
|
double dist;
|
|
|
|
|
|
|
|
dist = BoundingBoxIntersectDist(pLine);
|
|
|
|
if (dist >= pLine->mindist)
|
|
|
|
return;
|
|
|
|
|
|
|
|
Matrix44 WorldToLocal;
|
|
|
|
WorldToLocal.CreateFromAxisAngle(Vector3(m_fRotation[0], m_fRotation[1], m_fRotation[2]), -m_fRotation[3] * LC_DTOR);
|
|
|
|
WorldToLocal.SetTranslation(Mul31(Vector3(-m_fPosition[0], -m_fPosition[1], -m_fPosition[2]), WorldToLocal));
|
|
|
|
|
|
|
|
Vector3 Start = Mul31(Vector3(pLine->a1, pLine->b1, pLine->c1), WorldToLocal);
|
|
|
|
Vector3 End = Mul31(Vector3(pLine->a1 + pLine->a2, pLine->b1 + pLine->b2, pLine->c1 + pLine->c2), WorldToLocal);
|
|
|
|
Vector3 Intersection;
|
|
|
|
|
|
|
|
float* verts = m_pPieceInfo->m_fVertexArray;
|
|
|
|
|
2012-01-24 03:38:04 +01:00
|
|
|
if (m_pPieceInfo->m_nFlags & LC_PIECE_LONGDATA_INDICES)
|
2011-09-07 23:06:51 +02:00
|
|
|
{
|
|
|
|
lcuint32* info = (lcuint32*)m_pDrawInfo, colors, i;
|
|
|
|
colors = *info;
|
|
|
|
info++;
|
|
|
|
|
|
|
|
while (colors--)
|
|
|
|
{
|
|
|
|
info++;
|
|
|
|
|
|
|
|
for (i = 0; i < *info; i += 4)
|
|
|
|
{
|
|
|
|
Vector3 v1(verts[info[i+1]*3], verts[info[i+1]*3+1], verts[info[i+1]*3+2]);
|
|
|
|
Vector3 v2(verts[info[i+2]*3], verts[info[i+2]*3+1], verts[info[i+2]*3+2]);
|
|
|
|
Vector3 v3(verts[info[i+3]*3], verts[info[i+3]*3+1], verts[info[i+3]*3+2]);
|
|
|
|
Vector3 v4(verts[info[i+4]*3], verts[info[i+4]*3+1], verts[info[i+4]*3+2]);
|
|
|
|
|
|
|
|
if (LineQuadMinIntersection(v1, v2, v3, v4, Start, End, pLine->mindist, Intersection))
|
|
|
|
{
|
|
|
|
pLine->pClosest = this;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
info += *info + 1;
|
|
|
|
|
|
|
|
for (i = 0; i < *info; i += 3)
|
|
|
|
{
|
|
|
|
Vector3 v1(verts[info[i+1]*3], verts[info[i+1]*3+1], verts[info[i+1]*3+2]);
|
|
|
|
Vector3 v2(verts[info[i+2]*3], verts[info[i+2]*3+1], verts[info[i+2]*3+2]);
|
|
|
|
Vector3 v3(verts[info[i+3]*3], verts[info[i+3]*3+1], verts[info[i+3]*3+2]);
|
|
|
|
|
|
|
|
if (LineTriangleMinIntersection(v1, v2, v3, Start, End, pLine->mindist, Intersection))
|
|
|
|
{
|
|
|
|
pLine->pClosest = this;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
info += *info + 1;
|
|
|
|
info += *info + 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
lcuint16* info = (lcuint16*)m_pDrawInfo, colors, i;
|
|
|
|
colors = *info;
|
|
|
|
info++;
|
|
|
|
|
|
|
|
while (colors--)
|
|
|
|
{
|
|
|
|
info++;
|
|
|
|
|
|
|
|
for (i = 0; i < *info; i += 4)
|
|
|
|
{
|
|
|
|
Vector3 v1(verts[info[i+1]*3], verts[info[i+1]*3+1], verts[info[i+1]*3+2]);
|
|
|
|
Vector3 v2(verts[info[i+2]*3], verts[info[i+2]*3+1], verts[info[i+2]*3+2]);
|
|
|
|
Vector3 v3(verts[info[i+3]*3], verts[info[i+3]*3+1], verts[info[i+3]*3+2]);
|
|
|
|
Vector3 v4(verts[info[i+4]*3], verts[info[i+4]*3+1], verts[info[i+4]*3+2]);
|
|
|
|
|
|
|
|
if (LineQuadMinIntersection(v1, v2, v3, v4, Start, End, pLine->mindist, Intersection))
|
|
|
|
{
|
|
|
|
pLine->pClosest = this;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
info += *info + 1;
|
|
|
|
|
|
|
|
for (i = 0; i < *info; i += 3)
|
|
|
|
{
|
|
|
|
Vector3 v1(verts[info[i+1]*3], verts[info[i+1]*3+1], verts[info[i+1]*3+2]);
|
|
|
|
Vector3 v2(verts[info[i+2]*3], verts[info[i+2]*3+1], verts[info[i+2]*3+2]);
|
|
|
|
Vector3 v3(verts[info[i+3]*3], verts[info[i+3]*3+1], verts[info[i+3]*3+2]);
|
|
|
|
|
|
|
|
if (LineTriangleMinIntersection(v1, v2, v3, Start, End, pLine->mindist, Intersection))
|
|
|
|
{
|
|
|
|
pLine->pClosest = this;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
info += *info + 1;
|
|
|
|
info += *info + 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Return true if a polygon intersects a set of planes.
|
|
|
|
bool PolygonIntersectsPlanes(float* p1, float* p2, float* p3, float* p4, const Vector4* Planes, int NumPlanes)
|
|
|
|
{
|
|
|
|
float* Points[4] = { p1, p2, p3, p4 };
|
|
|
|
int Outcodes[4] = { 0, 0, 0, 0 }, i;
|
|
|
|
int NumPoints = (p4 != NULL) ? 4 : 3;
|
|
|
|
|
|
|
|
// First do the Cohen-Sutherland out code test for trivial rejects/accepts.
|
|
|
|
for (i = 0; i < NumPoints; i++)
|
|
|
|
{
|
|
|
|
Vector3 Pt(Points[i][0], Points[i][1], Points[i][2]);
|
|
|
|
|
|
|
|
for (int j = 0; j < NumPlanes; j++)
|
|
|
|
{
|
|
|
|
if (Dot3(Pt, Planes[j]) + Planes[j][3] > 0)
|
|
|
|
Outcodes[i] |= 1 << j;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (p4 != NULL)
|
|
|
|
{
|
|
|
|
// Polygon completely outside a plane.
|
|
|
|
if ((Outcodes[0] & Outcodes[1] & Outcodes[2] & Outcodes[3]) != 0)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// If any vertex has an out code of all zeros then we intersect the volume.
|
|
|
|
if (!Outcodes[0] || !Outcodes[1] || !Outcodes[2] || !Outcodes[3])
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
// Polygon completely outside a plane.
|
|
|
|
if ((Outcodes[0] & Outcodes[1] & Outcodes[2]) != 0)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// If any vertex has an out code of all zeros then we intersect the volume.
|
|
|
|
if (!Outcodes[0] || !Outcodes[1] || !Outcodes[2])
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Buffers for clipping the polygon.
|
|
|
|
Vector3 ClipPoints[2][8];
|
|
|
|
int NumClipPoints[2];
|
|
|
|
int ClipBuffer = 0;
|
|
|
|
|
|
|
|
NumClipPoints[0] = NumPoints;
|
|
|
|
ClipPoints[0][0] = Vector3(p1[0], p1[1], p1[2]);
|
|
|
|
ClipPoints[0][1] = Vector3(p2[0], p2[1], p2[2]);
|
|
|
|
ClipPoints[0][2] = Vector3(p3[0], p3[1], p3[2]);
|
|
|
|
|
|
|
|
if (NumPoints == 4)
|
|
|
|
ClipPoints[0][3] = Vector3(p4[0], p4[1], p4[2]);
|
|
|
|
|
|
|
|
// Now clip the polygon against the planes.
|
|
|
|
for (i = 0; i < NumPlanes; i++)
|
|
|
|
{
|
|
|
|
PolygonPlaneClip(ClipPoints[ClipBuffer], NumClipPoints[ClipBuffer], ClipPoints[ClipBuffer^1], &NumClipPoints[ClipBuffer^1], Planes[i]);
|
|
|
|
ClipBuffer ^= 1;
|
|
|
|
|
|
|
|
if (!NumClipPoints[ClipBuffer])
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool Piece::IntersectsVolume(const Vector4* Planes, int NumPlanes)
|
|
|
|
{
|
|
|
|
// First check the bounding box for quick rejection.
|
|
|
|
Vector3 Box[8] =
|
|
|
|
{
|
|
|
|
Vector3(m_pPieceInfo->m_fDimensions[0], m_pPieceInfo->m_fDimensions[1], m_pPieceInfo->m_fDimensions[5]),
|
|
|
|
Vector3(m_pPieceInfo->m_fDimensions[3], m_pPieceInfo->m_fDimensions[1], m_pPieceInfo->m_fDimensions[5]),
|
|
|
|
Vector3(m_pPieceInfo->m_fDimensions[0], m_pPieceInfo->m_fDimensions[1], m_pPieceInfo->m_fDimensions[2]),
|
|
|
|
Vector3(m_pPieceInfo->m_fDimensions[3], m_pPieceInfo->m_fDimensions[4], m_pPieceInfo->m_fDimensions[5]),
|
|
|
|
Vector3(m_pPieceInfo->m_fDimensions[3], m_pPieceInfo->m_fDimensions[4], m_pPieceInfo->m_fDimensions[2]),
|
|
|
|
Vector3(m_pPieceInfo->m_fDimensions[0], m_pPieceInfo->m_fDimensions[4], m_pPieceInfo->m_fDimensions[2]),
|
|
|
|
Vector3(m_pPieceInfo->m_fDimensions[0], m_pPieceInfo->m_fDimensions[4], m_pPieceInfo->m_fDimensions[5]),
|
|
|
|
Vector3(m_pPieceInfo->m_fDimensions[3], m_pPieceInfo->m_fDimensions[1], m_pPieceInfo->m_fDimensions[2])
|
|
|
|
};
|
|
|
|
|
|
|
|
// Transform the planes to local space.
|
|
|
|
Matrix44 WorldToLocal;
|
|
|
|
WorldToLocal.CreateFromAxisAngle(Vector3(m_fRotation[0], m_fRotation[1], m_fRotation[2]), -m_fRotation[3] * LC_DTOR);
|
|
|
|
WorldToLocal.SetTranslation(Mul31(Vector3(-m_fPosition[0], -m_fPosition[1], -m_fPosition[2]), WorldToLocal));
|
|
|
|
|
|
|
|
Vector4* LocalPlanes = new Vector4[NumPlanes];
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < NumPlanes; i++)
|
|
|
|
{
|
|
|
|
LocalPlanes[i] = Mul30(Vector3(Planes[i]), WorldToLocal);
|
|
|
|
LocalPlanes[i][3] = Planes[i][3] - Dot3(Vector3(WorldToLocal[3]), Vector3(LocalPlanes[i]));
|
|
|
|
}
|
|
|
|
|
|
|
|
// Start by testing trivial reject/accept cases.
|
|
|
|
int Outcodes[8];
|
|
|
|
|
|
|
|
for (i = 0; i < 8; i++)
|
|
|
|
{
|
|
|
|
Outcodes[i] = 0;
|
|
|
|
|
|
|
|
for (int j = 0; j < NumPlanes; j++)
|
|
|
|
{
|
|
|
|
if (Dot3(Box[i], LocalPlanes[j]) + LocalPlanes[j][3] > 0)
|
|
|
|
Outcodes[i] |= 1 << j;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int OutcodesOR = 0, OutcodesAND = 0x3f;
|
|
|
|
|
|
|
|
for (i = 0; i < 8; i++)
|
|
|
|
{
|
|
|
|
OutcodesAND &= Outcodes[i];
|
|
|
|
OutcodesOR |= Outcodes[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
// All corners outside the same plane.
|
|
|
|
if (OutcodesAND != 0)
|
|
|
|
{
|
|
|
|
delete[] LocalPlanes;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// All corners inside the volume.
|
|
|
|
if (OutcodesOR == 0)
|
|
|
|
{
|
|
|
|
delete[] LocalPlanes;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Partial intersection, so check if any triangles are inside.
|
|
|
|
float* verts = m_pPieceInfo->m_fVertexArray;
|
|
|
|
bool ret = false;
|
|
|
|
|
2012-01-24 03:38:04 +01:00
|
|
|
if (m_pPieceInfo->m_nFlags & LC_PIECE_LONGDATA_INDICES)
|
2011-09-07 23:06:51 +02:00
|
|
|
{
|
|
|
|
lcuint32* info = (lcuint32*)m_pDrawInfo, colors, i;
|
|
|
|
colors = *info;
|
|
|
|
info++;
|
|
|
|
|
|
|
|
while (colors--)
|
|
|
|
{
|
|
|
|
info++;
|
|
|
|
|
|
|
|
for (i = 0; i < *info; i += 4)
|
|
|
|
{
|
|
|
|
if (PolygonIntersectsPlanes(&verts[info[i+1]*3], &verts[info[i+2]*3],
|
|
|
|
&verts[info[i+3]*3], &verts[info[i+4]*3], LocalPlanes, NumPlanes))
|
|
|
|
{
|
|
|
|
ret = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
info += *info + 1;
|
|
|
|
|
|
|
|
for (i = 0; i < *info; i += 3)
|
|
|
|
{
|
|
|
|
if (PolygonIntersectsPlanes(&verts[info[i+1]*3], &verts[info[i+2]*3],
|
|
|
|
&verts[info[i+3]*3], NULL, LocalPlanes, NumPlanes))
|
|
|
|
{
|
|
|
|
ret = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
info += *info + 1;
|
|
|
|
info += *info + 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
lcuint16* info = (lcuint16*)m_pDrawInfo, colors, i;
|
|
|
|
colors = *info;
|
|
|
|
info++;
|
|
|
|
|
|
|
|
while (colors--)
|
|
|
|
{
|
|
|
|
info++;
|
|
|
|
|
|
|
|
for (i = 0; i < *info; i += 4)
|
|
|
|
{
|
|
|
|
if (PolygonIntersectsPlanes(&verts[info[i+1]*3], &verts[info[i+2]*3],
|
|
|
|
&verts[info[i+3]*3], &verts[info[i+4]*3], LocalPlanes, NumPlanes))
|
|
|
|
{
|
|
|
|
ret = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
info += *info + 1;
|
|
|
|
|
|
|
|
for (i = 0; i < *info; i += 3)
|
|
|
|
{
|
|
|
|
if (PolygonIntersectsPlanes(&verts[info[i+1]*3], &verts[info[i+2]*3],
|
|
|
|
&verts[info[i+3]*3], NULL, LocalPlanes, NumPlanes))
|
|
|
|
{
|
|
|
|
ret = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
info += *info + 1;
|
|
|
|
info += *info + 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
delete[] LocalPlanes;
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Piece::Move (unsigned short nTime, bool bAnimation, bool bAddKey, float dx, float dy, float dz)
|
|
|
|
{
|
|
|
|
m_fPosition[0] += dx;
|
|
|
|
m_fPosition[1] += dy;
|
|
|
|
m_fPosition[2] += dz;
|
|
|
|
|
|
|
|
ChangeKey (nTime, bAnimation, bAddKey, m_fPosition, LC_PK_POSITION);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool Piece::IsVisible(unsigned short nTime, bool bAnimation)
|
|
|
|
{
|
|
|
|
if (m_nState & LC_PIECE_HIDDEN)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (bAnimation)
|
|
|
|
{
|
|
|
|
if (m_nFrameShow > nTime) return false;
|
|
|
|
if (m_nFrameHide < nTime) return false;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (m_nStepShow > nTime) return false;
|
|
|
|
if ((m_nStepHide == 255) || (m_nStepHide > nTime))
|
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void Piece::CompareBoundingBox(float box[6])
|
|
|
|
{
|
|
|
|
float v[24] = {
|
|
|
|
m_pPieceInfo->m_fDimensions[0], m_pPieceInfo->m_fDimensions[1], m_pPieceInfo->m_fDimensions[5],
|
|
|
|
m_pPieceInfo->m_fDimensions[3], m_pPieceInfo->m_fDimensions[1], m_pPieceInfo->m_fDimensions[5],
|
|
|
|
m_pPieceInfo->m_fDimensions[0], m_pPieceInfo->m_fDimensions[1], m_pPieceInfo->m_fDimensions[2],
|
|
|
|
m_pPieceInfo->m_fDimensions[3], m_pPieceInfo->m_fDimensions[4], m_pPieceInfo->m_fDimensions[5],
|
|
|
|
m_pPieceInfo->m_fDimensions[3], m_pPieceInfo->m_fDimensions[4], m_pPieceInfo->m_fDimensions[2],
|
|
|
|
m_pPieceInfo->m_fDimensions[0], m_pPieceInfo->m_fDimensions[4], m_pPieceInfo->m_fDimensions[2],
|
|
|
|
m_pPieceInfo->m_fDimensions[0], m_pPieceInfo->m_fDimensions[4], m_pPieceInfo->m_fDimensions[5],
|
|
|
|
m_pPieceInfo->m_fDimensions[3], m_pPieceInfo->m_fDimensions[1], m_pPieceInfo->m_fDimensions[2] };
|
|
|
|
|
|
|
|
Matrix m(m_fRotation, m_fPosition);
|
|
|
|
m.TransformPoints(v, 8);
|
|
|
|
|
|
|
|
for (int i = 0; i < 24; i += 3)
|
|
|
|
{
|
|
|
|
if (v[i] < box[0]) box[0] = v[i];
|
|
|
|
if (v[i+1] < box[1]) box[1] = v[i+1];
|
|
|
|
if (v[i+2] < box[2]) box[2] = v[i+2];
|
|
|
|
if (v[i] > box[3]) box[3] = v[i];
|
|
|
|
if (v[i+1] > box[4]) box[4] = v[i+1];
|
|
|
|
if (v[i+2] > box[5]) box[5] = v[i+2];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
Group* Piece::GetTopGroup()
|
|
|
|
{
|
|
|
|
return m_pGroup ? m_pGroup->GetTopGroup() : NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Piece::DoGroup(Group* pGroup)
|
|
|
|
{
|
|
|
|
if (m_pGroup != NULL && m_pGroup != (Group*)-1 && m_pGroup > (Group*)0xFFFF)
|
|
|
|
m_pGroup->SetGroup(pGroup);
|
|
|
|
else
|
|
|
|
m_pGroup = pGroup;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Piece::UnGroup(Group* pGroup)
|
|
|
|
{
|
|
|
|
if ((m_pGroup == pGroup) || (pGroup == NULL))
|
|
|
|
m_pGroup = NULL;
|
|
|
|
else
|
|
|
|
if (m_pGroup != NULL)
|
|
|
|
m_pGroup->UnGroup(pGroup);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Recalculates current position and connections
|
|
|
|
void Piece::UpdatePosition(unsigned short nTime, bool bAnimation)
|
|
|
|
{
|
|
|
|
if (!IsVisible(nTime, bAnimation))
|
|
|
|
m_nState &= ~(LC_PIECE_SELECTED|LC_PIECE_FOCUSED);
|
|
|
|
|
|
|
|
CalculateKeys (nTime, bAnimation);
|
|
|
|
// if (CalculatePositionRotation(nTime, bAnimation, m_fPosition, m_fRotation))
|
|
|
|
{
|
|
|
|
Matrix mat(m_fRotation, m_fPosition);
|
|
|
|
BoundingBoxCalculate(&mat, m_pPieceInfo->m_fDimensions);
|
|
|
|
for (int i = 0; i < m_pPieceInfo->m_nConnectionCount; i++)
|
|
|
|
{
|
|
|
|
mat.TransformPoint(m_pConnections[i].center, m_pPieceInfo->m_pConnections[i].center);
|
|
|
|
|
|
|
|
// TODO: rotate normal
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void Piece::BuildDrawInfo()
|
|
|
|
{
|
|
|
|
if (m_pDrawInfo != NULL)
|
|
|
|
{
|
|
|
|
free(m_pDrawInfo);
|
|
|
|
m_pDrawInfo = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
DRAWGROUP* dg;
|
|
|
|
bool add;
|
|
|
|
unsigned short group, colcount, i, j;
|
|
|
|
unsigned long count[LC_COL_DEFAULT+1][3], vert;
|
|
|
|
memset (count, 0, sizeof(count));
|
|
|
|
|
|
|
|
// Get the vertex count
|
|
|
|
for (group = m_pPieceInfo->m_nGroupCount, dg = m_pPieceInfo->m_pGroups; group--; dg++)
|
|
|
|
{
|
|
|
|
lcuint16* sh = dg->connections;
|
|
|
|
add = IsTransparent() || *sh == 0xFFFF;
|
|
|
|
|
|
|
|
if (!add)
|
|
|
|
for (; *sh != 0xFFFF; sh++)
|
|
|
|
if ((m_pConnections[*sh].link == NULL) ||
|
|
|
|
(m_pConnections[*sh].link->owner->IsTransparent()))
|
|
|
|
{
|
|
|
|
add = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (add)
|
|
|
|
{
|
2012-01-24 03:38:04 +01:00
|
|
|
if (m_pPieceInfo->m_nFlags & LC_PIECE_LONGDATA_INDICES)
|
2011-09-07 23:06:51 +02:00
|
|
|
{
|
|
|
|
lcuint32* p, curcol, colors;
|
|
|
|
p = (lcuint32*)dg->drawinfo;
|
|
|
|
colors = *p;
|
|
|
|
p++;
|
|
|
|
|
|
|
|
while (colors--)
|
|
|
|
{
|
|
|
|
curcol = *p;
|
|
|
|
p++;
|
|
|
|
count[curcol][0] += *p;
|
|
|
|
p += *p + 1;
|
|
|
|
count[curcol][1] += *p;
|
|
|
|
p += *p + 1;
|
|
|
|
count[curcol][2] += *p;
|
|
|
|
p += *p + 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
lcuint16* p, curcol, colors;
|
|
|
|
p = (lcuint16*)dg->drawinfo;
|
|
|
|
colors = *p;
|
|
|
|
p++;
|
|
|
|
|
|
|
|
while (colors--)
|
|
|
|
{
|
|
|
|
curcol = *p;
|
|
|
|
p++;
|
|
|
|
count[curcol][0] += *p;
|
|
|
|
p += *p + 1;
|
|
|
|
count[curcol][1] += *p;
|
|
|
|
p += *p + 1;
|
|
|
|
count[curcol][2] += *p;
|
|
|
|
p += *p + 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
colcount = 0;
|
|
|
|
vert = 0;
|
|
|
|
for (i = 0; i < LC_COL_DEFAULT+1; i++)
|
|
|
|
if (count[i][0] || count[i][1] || count[i][2])
|
|
|
|
{
|
|
|
|
colcount++;
|
|
|
|
vert += count[i][0] + count[i][1] + count[i][2];
|
|
|
|
}
|
|
|
|
vert += (colcount*4)+1;
|
|
|
|
|
|
|
|
// Build the info
|
2012-01-24 03:38:04 +01:00
|
|
|
if (m_pPieceInfo->m_nFlags & LC_PIECE_LONGDATA_INDICES)
|
2011-09-07 23:06:51 +02:00
|
|
|
{
|
|
|
|
m_pDrawInfo = malloc(vert*sizeof(lcuint32));
|
|
|
|
lcuint32* drawinfo = (lcuint32*)m_pDrawInfo;
|
|
|
|
*drawinfo = colcount;
|
|
|
|
drawinfo++;
|
|
|
|
i = LC_COL_DEFAULT;
|
|
|
|
|
|
|
|
for (i = LC_COL_DEFAULT; i != LC_COL_EDGES+1;)
|
|
|
|
{
|
|
|
|
if (count[i][0] || count[i][1] || count[i][2])
|
|
|
|
{
|
|
|
|
*drawinfo = i;
|
|
|
|
drawinfo++;
|
|
|
|
|
|
|
|
for (j = 0; j < 3; j++)
|
|
|
|
{
|
|
|
|
*drawinfo = count[i][j];
|
|
|
|
drawinfo++;
|
|
|
|
|
|
|
|
if (count[i][j] == 0)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
for (group = m_pPieceInfo->m_nGroupCount, dg = m_pPieceInfo->m_pGroups; group--; dg++)
|
|
|
|
{
|
|
|
|
lcuint16* sh = dg->connections;
|
|
|
|
add = IsTransparent() || *sh == 0xFFFF;
|
|
|
|
|
|
|
|
if (!add)
|
|
|
|
for (; *sh != 0xFFFF; sh++)
|
|
|
|
if ((m_pConnections[*sh].link == NULL) ||
|
|
|
|
(m_pConnections[*sh].link->owner->IsTransparent()))
|
|
|
|
{
|
|
|
|
add = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!add)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
lcuint32* p, colors;
|
|
|
|
p = (lcuint32*)dg->drawinfo;
|
|
|
|
colors = *p;
|
|
|
|
p++;
|
|
|
|
|
|
|
|
while (colors--)
|
|
|
|
{
|
|
|
|
if (*p == i)
|
|
|
|
{
|
|
|
|
p++;
|
|
|
|
|
|
|
|
if (j == 0)
|
|
|
|
{
|
|
|
|
memcpy(drawinfo, p+1, (*p)*sizeof(lcuint32));
|
|
|
|
drawinfo += *p;
|
|
|
|
}
|
|
|
|
p += *p + 1;
|
|
|
|
|
|
|
|
if (j == 1)
|
|
|
|
{
|
|
|
|
memcpy(drawinfo, p+1, (*p)*sizeof(lcuint32));
|
|
|
|
drawinfo += *p;
|
|
|
|
}
|
|
|
|
p += *p + 1;
|
|
|
|
|
|
|
|
if (j == 2)
|
|
|
|
{
|
|
|
|
memcpy(drawinfo, p+1, (*p)*sizeof(lcuint32));
|
|
|
|
drawinfo += *p;
|
|
|
|
}
|
|
|
|
p += *p + 1;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
p++;
|
|
|
|
p += *p + 1;
|
|
|
|
p += *p + 1;
|
|
|
|
p += *p + 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (i == LC_COL_DEFAULT)
|
|
|
|
i = 0;
|
|
|
|
else
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
m_pDrawInfo = malloc(vert*sizeof(lcuint16));
|
|
|
|
lcuint16* drawinfo = (lcuint16*)m_pDrawInfo;
|
|
|
|
*drawinfo = colcount;
|
|
|
|
drawinfo++;
|
|
|
|
|
|
|
|
for (i = LC_COL_DEFAULT; i != LC_COL_EDGES+1;)
|
|
|
|
{
|
|
|
|
if (count[i][0] || count[i][1] || count[i][2])
|
|
|
|
{
|
|
|
|
*drawinfo = i;
|
|
|
|
drawinfo++;
|
|
|
|
|
|
|
|
for (j = 0; j < 3; j++)
|
|
|
|
{
|
|
|
|
*drawinfo = (lcuint16)count[i][j];
|
|
|
|
drawinfo++;
|
|
|
|
|
|
|
|
if (count[i][j] == 0)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
for (group = m_pPieceInfo->m_nGroupCount, dg = m_pPieceInfo->m_pGroups; group--; dg++)
|
|
|
|
{
|
|
|
|
lcuint16* sh = dg->connections;
|
|
|
|
add = IsTransparent() || *sh == 0xFFFF;
|
|
|
|
|
|
|
|
if (!add)
|
|
|
|
for (; *sh != 0xFFFF; sh++)
|
|
|
|
if ((m_pConnections[*sh].link == NULL) ||
|
|
|
|
(m_pConnections[*sh].link->owner->IsTransparent()))
|
|
|
|
{
|
|
|
|
add = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!add)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
lcuint16* p, colors;
|
|
|
|
p = (lcuint16*)dg->drawinfo;
|
|
|
|
colors = *p;
|
|
|
|
p++;
|
|
|
|
|
|
|
|
while (colors--)
|
|
|
|
{
|
|
|
|
if (*p == i)
|
|
|
|
{
|
|
|
|
p++;
|
|
|
|
|
|
|
|
if (j == 0)
|
|
|
|
{
|
|
|
|
memcpy(drawinfo, p+1, (*p)*sizeof(lcuint16));
|
|
|
|
drawinfo += *p;
|
|
|
|
}
|
|
|
|
p += *p + 1;
|
|
|
|
|
|
|
|
if (j == 1)
|
|
|
|
{
|
|
|
|
memcpy(drawinfo, p+1, (*p)*sizeof(lcuint16));
|
|
|
|
drawinfo += *p;
|
|
|
|
}
|
|
|
|
p += *p + 1;
|
|
|
|
|
|
|
|
if (j == 2)
|
|
|
|
{
|
|
|
|
memcpy(drawinfo, p+1, (*p)*sizeof(lcuint16));
|
|
|
|
drawinfo += *p;
|
|
|
|
}
|
|
|
|
p += *p + 1;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
p++;
|
|
|
|
p += *p + 1;
|
|
|
|
p += *p + 1;
|
|
|
|
p += *p + 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (i == LC_COL_DEFAULT)
|
|
|
|
i = 0;
|
|
|
|
else
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void Piece::RenderBox(bool bHilite, float fLineWidth)
|
|
|
|
{
|
|
|
|
glPushMatrix();
|
|
|
|
glTranslatef(m_fPosition[0], m_fPosition[1], m_fPosition[2]);
|
|
|
|
glRotatef(m_fRotation[3], m_fRotation[0], m_fRotation[1], m_fRotation[2]);
|
|
|
|
|
|
|
|
if (bHilite && ((m_nState & LC_PIECE_SELECTED) != 0))
|
|
|
|
{
|
|
|
|
glColor3ubv(FlatColorArray[m_nState & LC_PIECE_FOCUSED ? LC_COL_FOCUSED : LC_COL_SELECTED]);
|
|
|
|
glLineWidth(2*fLineWidth);
|
|
|
|
glPushAttrib(GL_POLYGON_BIT);
|
|
|
|
glPolygonMode(GL_FRONT_AND_BACK, GL_LINE);
|
|
|
|
glCallList(m_pPieceInfo->GetBoxDisplayList());
|
|
|
|
glPopAttrib();
|
|
|
|
glLineWidth(fLineWidth);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
glColor3ubv(FlatColorArray[m_nColor]);
|
|
|
|
glCallList(m_pPieceInfo->GetBoxDisplayList());
|
|
|
|
}
|
|
|
|
glPopMatrix();
|
|
|
|
}
|
|
|
|
|
|
|
|
void Piece::Render(bool bLighting, bool bEdges, unsigned char* nLastColor, bool* bTrans)
|
|
|
|
{
|
|
|
|
glPushMatrix();
|
|
|
|
glTranslatef(m_fPosition[0], m_fPosition[1], m_fPosition[2]);
|
|
|
|
glRotatef(m_fRotation[3], m_fRotation[0], m_fRotation[1], m_fRotation[2]);
|
|
|
|
glVertexPointer (3, GL_FLOAT, 0, m_pPieceInfo->m_fVertexArray);
|
|
|
|
|
|
|
|
for (int sh = 0; sh < m_pPieceInfo->m_nTextureCount; sh++)
|
|
|
|
{
|
|
|
|
glTexEnvi(GL_TEXTURE_ENV, GL_TEXTURE_ENV_MODE, GL_DECAL);
|
|
|
|
m_pPieceInfo->m_pTextures[sh].texture->MakeCurrent();
|
|
|
|
|
|
|
|
if (m_pPieceInfo->m_pTextures[sh].color == LC_COL_DEFAULT)
|
|
|
|
{
|
|
|
|
SetCurrentColor(m_nColor, bTrans, bLighting);
|
|
|
|
*nLastColor = m_nColor;
|
|
|
|
}
|
|
|
|
|
|
|
|
glEnable(GL_TEXTURE_2D);
|
|
|
|
glBegin(GL_QUADS);
|
|
|
|
glTexCoord2fv(m_pPieceInfo->m_pTextures[sh].coords[0]);
|
|
|
|
glVertex3fv(m_pPieceInfo->m_pTextures[sh].vertex[0]);
|
|
|
|
glTexCoord2fv(m_pPieceInfo->m_pTextures[sh].coords[1]);
|
|
|
|
glVertex3fv(m_pPieceInfo->m_pTextures[sh].vertex[1]);
|
|
|
|
glTexCoord2fv(m_pPieceInfo->m_pTextures[sh].coords[2]);
|
|
|
|
glVertex3fv(m_pPieceInfo->m_pTextures[sh].vertex[2]);
|
|
|
|
glTexCoord2fv(m_pPieceInfo->m_pTextures[sh].coords[3]);
|
|
|
|
glVertex3fv(m_pPieceInfo->m_pTextures[sh].vertex[3]);
|
|
|
|
glEnd();
|
|
|
|
glDisable(GL_TEXTURE_2D);
|
|
|
|
}
|
|
|
|
|
2012-01-24 03:38:04 +01:00
|
|
|
if (m_pPieceInfo->m_nFlags & LC_PIECE_LONGDATA_INDICES)
|
2011-09-07 23:06:51 +02:00
|
|
|
{
|
|
|
|
lcuint32 colors, *info = (lcuint32*)m_pDrawInfo;
|
|
|
|
colors = *info;
|
|
|
|
info++;
|
|
|
|
|
|
|
|
while (colors--)
|
|
|
|
{
|
|
|
|
bool lock = lockarrays && (*info == LC_COL_DEFAULT || *info == LC_COL_EDGES);
|
|
|
|
|
|
|
|
if (*info != *nLastColor)
|
|
|
|
{
|
|
|
|
if (*info == LC_COL_DEFAULT)
|
|
|
|
{
|
|
|
|
SetCurrentColor(m_nColor, bTrans, bLighting);
|
|
|
|
*nLastColor = m_nColor;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
SetCurrentColor((unsigned char)*info, bTrans, bLighting);
|
|
|
|
*nLastColor = (unsigned char)*info;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
info++;
|
|
|
|
|
|
|
|
if (lock)
|
|
|
|
glLockArraysEXT(0, m_pPieceInfo->m_nVertexCount);
|
|
|
|
|
|
|
|
if (*info)
|
|
|
|
{
|
|
|
|
glDrawElements(GL_QUADS, *info, GL_UNSIGNED_INT, info+1);
|
|
|
|
info += *info + 1;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
info++;
|
|
|
|
|
|
|
|
if (*info)
|
|
|
|
{
|
|
|
|
glDrawElements(GL_TRIANGLES, *info, GL_UNSIGNED_INT, info+1);
|
|
|
|
info += *info + 1;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
info++;
|
|
|
|
|
|
|
|
if (*info)
|
|
|
|
{
|
|
|
|
if (m_nState & LC_PIECE_SELECTED)
|
|
|
|
{
|
|
|
|
if (lock)
|
|
|
|
glUnlockArraysEXT();
|
|
|
|
|
|
|
|
SetCurrentColor(m_nState & LC_PIECE_FOCUSED ? LC_COL_FOCUSED : LC_COL_SELECTED, bTrans, bLighting);
|
|
|
|
*nLastColor = m_nState & LC_PIECE_FOCUSED ? LC_COL_FOCUSED : LC_COL_SELECTED;
|
|
|
|
|
|
|
|
if (lock)
|
|
|
|
glLockArraysEXT(0, m_pPieceInfo->m_nVertexCount);
|
|
|
|
|
|
|
|
glDrawElements(GL_LINES, *info, GL_UNSIGNED_INT, info+1);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
if (bEdges)
|
|
|
|
glDrawElements(GL_LINES, *info, GL_UNSIGNED_INT, info+1);
|
|
|
|
|
|
|
|
info += *info + 1;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
info++;
|
|
|
|
|
|
|
|
if (lock)
|
|
|
|
glUnlockArraysEXT();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
lcuint16 colors, *info = (lcuint16*)m_pDrawInfo;
|
|
|
|
colors = *info;
|
|
|
|
info++;
|
|
|
|
|
|
|
|
while (colors--)
|
|
|
|
{
|
|
|
|
bool lock = lockarrays && (*info == LC_COL_DEFAULT || *info == LC_COL_EDGES);
|
|
|
|
|
|
|
|
if (*info != *nLastColor)
|
|
|
|
{
|
|
|
|
if (*info == LC_COL_DEFAULT)
|
|
|
|
{
|
|
|
|
SetCurrentColor(m_nColor, bTrans, bLighting);
|
|
|
|
*nLastColor = m_nColor;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
SetCurrentColor((unsigned char)*info, bTrans, bLighting);
|
|
|
|
*nLastColor = (unsigned char)*info;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
info++;
|
|
|
|
|
|
|
|
if (lock)
|
|
|
|
glLockArraysEXT(0, m_pPieceInfo->m_nVertexCount);
|
|
|
|
|
|
|
|
if (*info)
|
|
|
|
{
|
|
|
|
glDrawElements(GL_QUADS, *info, GL_UNSIGNED_SHORT, info+1);
|
|
|
|
info += *info + 1;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
info++;
|
|
|
|
|
|
|
|
if (*info)
|
|
|
|
{
|
|
|
|
glDrawElements(GL_TRIANGLES, *info, GL_UNSIGNED_SHORT, info+1);
|
|
|
|
info += *info + 1;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
info++;
|
|
|
|
|
|
|
|
if (*info)
|
|
|
|
{
|
|
|
|
if (m_nState & LC_PIECE_SELECTED)
|
|
|
|
{
|
|
|
|
if (lock)
|
|
|
|
glUnlockArraysEXT();
|
|
|
|
SetCurrentColor((m_nState & LC_PIECE_FOCUSED) ? LC_COL_FOCUSED : LC_COL_SELECTED, bTrans, bLighting);
|
|
|
|
*nLastColor = m_nState & LC_PIECE_FOCUSED ? LC_COL_FOCUSED : LC_COL_SELECTED;
|
|
|
|
|
|
|
|
if (lock)
|
|
|
|
glLockArraysEXT(0, m_pPieceInfo->m_nVertexCount);
|
|
|
|
|
|
|
|
glDrawElements(GL_LINES, *info, GL_UNSIGNED_SHORT, info+1);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
if (bEdges)
|
|
|
|
glDrawElements(GL_LINES, *info, GL_UNSIGNED_SHORT, info+1);
|
|
|
|
|
|
|
|
info += *info + 1;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
info++;
|
|
|
|
|
|
|
|
if (lock)
|
|
|
|
glUnlockArraysEXT();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
glPopMatrix();
|
|
|
|
}
|
|
|
|
|
|
|
|
void Piece::CalculateConnections(CONNECTION_TYPE* pConnections, unsigned short nTime, bool bAnimation, bool bForceRebuild, bool bFixOthers)
|
|
|
|
{
|
|
|
|
if (m_pConnections == NULL)
|
|
|
|
{
|
|
|
|
if (m_pDrawInfo == NULL)
|
|
|
|
BuildDrawInfo();
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool rebuild = bForceRebuild || (m_pDrawInfo == NULL);
|
|
|
|
Piece* pPiece;
|
|
|
|
CONNECTION_ENTRY* entry;
|
|
|
|
int i, j, c;
|
|
|
|
|
|
|
|
if (bFixOthers)
|
|
|
|
m_pLink = NULL;
|
|
|
|
|
|
|
|
for (j = 0; j < m_pPieceInfo->m_nConnectionCount; j++)
|
|
|
|
{
|
|
|
|
CONNECTION* new_link = NULL;
|
|
|
|
|
|
|
|
// studs
|
|
|
|
if (m_pConnections[j].type == 0)
|
|
|
|
{
|
|
|
|
i = pConnections[1].numentries;
|
|
|
|
entry = pConnections[1].entries;
|
|
|
|
|
|
|
|
for (; i--; entry++)
|
|
|
|
{
|
|
|
|
if ((entry->owner == this) ||
|
|
|
|
(!entry->owner->IsVisible(nTime, bAnimation)))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
for (c = 0; c < entry->numcons; c++)
|
|
|
|
{
|
|
|
|
CONNECTION* con = entry->cons[c];
|
|
|
|
|
|
|
|
if (((m_pConnections[j].center[0] - con->center[0]) < 0.1f) &&
|
|
|
|
((m_pConnections[j].center[1] - con->center[1]) < 0.1f) &&
|
|
|
|
((m_pConnections[j].center[2] - con->center[2]) < 0.1f) &&
|
|
|
|
((m_pConnections[j].center[0] - con->center[0]) > -0.1f) &&
|
|
|
|
((m_pConnections[j].center[1] - con->center[1]) > -0.1f) &&
|
|
|
|
((m_pConnections[j].center[2] - con->center[2]) > -0.1f))
|
|
|
|
{
|
|
|
|
new_link = con;
|
|
|
|
i = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (new_link != m_pConnections[j].link)
|
|
|
|
{
|
|
|
|
if ((m_pConnections[j].link != NULL) != (new_link != NULL))
|
|
|
|
rebuild = true;
|
|
|
|
|
|
|
|
if (bFixOthers)
|
|
|
|
{
|
|
|
|
// Update old connection
|
|
|
|
if (m_pConnections[j].link != NULL)
|
|
|
|
{
|
|
|
|
Piece* pOwner = m_pConnections[j].link->owner;
|
|
|
|
|
|
|
|
if (pOwner != this)
|
|
|
|
{
|
|
|
|
if (m_pLink == NULL)
|
|
|
|
{
|
|
|
|
m_pLink = pOwner;
|
|
|
|
pOwner->m_pLink = NULL;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
for (pPiece = m_pLink; pPiece; pPiece = pPiece->m_pLink)
|
|
|
|
{
|
|
|
|
if (pPiece == pOwner)
|
|
|
|
break;
|
|
|
|
|
|
|
|
if (pPiece->m_pLink == NULL)
|
|
|
|
{
|
|
|
|
pPiece->m_pLink = pOwner;
|
|
|
|
pOwner->m_pLink = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (new_link)
|
|
|
|
{
|
|
|
|
pOwner = new_link->owner;
|
|
|
|
|
|
|
|
if (m_pLink == NULL)
|
|
|
|
{
|
|
|
|
m_pLink = pOwner;
|
|
|
|
pOwner->m_pLink = NULL;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
for (pPiece = m_pLink; pPiece; pPiece = pPiece->m_pLink)
|
|
|
|
{
|
|
|
|
if (pPiece == pOwner)
|
|
|
|
break;
|
|
|
|
|
|
|
|
if (pPiece->m_pLink == NULL)
|
|
|
|
{
|
|
|
|
pPiece->m_pLink = pOwner;
|
|
|
|
pOwner->m_pLink = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
m_pConnections[j].link = new_link;
|
|
|
|
}
|
|
|
|
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// invert studs
|
|
|
|
if (m_pConnections[j].type == 1)
|
|
|
|
{
|
|
|
|
i = pConnections[0].numentries;
|
|
|
|
entry = pConnections[0].entries;
|
|
|
|
|
|
|
|
for (; i--; entry++)
|
|
|
|
{
|
|
|
|
if ((entry->owner == this) ||
|
|
|
|
(!entry->owner->IsVisible(nTime, bAnimation)))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
for (c = 0; c < entry->numcons; c++)
|
|
|
|
{
|
|
|
|
CONNECTION* con = entry->cons[c];
|
|
|
|
|
|
|
|
if (((m_pConnections[j].center[0] - con->center[0]) < 0.1f) &&
|
|
|
|
((m_pConnections[j].center[1] - con->center[1]) < 0.1f) &&
|
|
|
|
((m_pConnections[j].center[2] - con->center[2]) < 0.1f) &&
|
|
|
|
((m_pConnections[j].center[0] - con->center[0]) > -0.1f) &&
|
|
|
|
((m_pConnections[j].center[1] - con->center[1]) > -0.1f) &&
|
|
|
|
((m_pConnections[j].center[2] - con->center[2]) > -0.1f))
|
|
|
|
{
|
|
|
|
new_link = con;
|
|
|
|
i = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (new_link != m_pConnections[j].link)
|
|
|
|
{
|
|
|
|
if ((m_pConnections[j].link != NULL) != (new_link != NULL))
|
|
|
|
rebuild = true;
|
|
|
|
|
|
|
|
if (bFixOthers)
|
|
|
|
{
|
|
|
|
Piece* pOwner;
|
|
|
|
|
|
|
|
// Update old connection
|
|
|
|
if (m_pConnections[j].link != NULL)
|
|
|
|
{
|
|
|
|
pOwner = m_pConnections[j].link->owner;
|
|
|
|
|
|
|
|
if (pOwner != this)
|
|
|
|
{
|
|
|
|
if (m_pLink == NULL)
|
|
|
|
{
|
|
|
|
m_pLink = pOwner;
|
|
|
|
pOwner->m_pLink = NULL;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
for (pPiece = m_pLink; pPiece; pPiece = pPiece->m_pLink)
|
|
|
|
{
|
|
|
|
if (pPiece == pOwner)
|
|
|
|
break;
|
|
|
|
|
|
|
|
if (pPiece->m_pLink == NULL)
|
|
|
|
{
|
|
|
|
pPiece->m_pLink = pOwner;
|
|
|
|
pOwner->m_pLink = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (new_link)
|
|
|
|
{
|
|
|
|
pOwner = new_link->owner;
|
|
|
|
|
|
|
|
if (m_pLink == NULL)
|
|
|
|
{
|
|
|
|
m_pLink = pOwner;
|
|
|
|
pOwner->m_pLink = NULL;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
for (pPiece = m_pLink; pPiece; pPiece = pPiece->m_pLink)
|
|
|
|
{
|
|
|
|
if (pPiece == pOwner)
|
|
|
|
break;
|
|
|
|
|
|
|
|
if (pPiece->m_pLink == NULL)
|
|
|
|
{
|
|
|
|
pPiece->m_pLink = pOwner;
|
|
|
|
pOwner->m_pLink = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
m_pConnections[j].link = new_link;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (bFixOthers && bForceRebuild)
|
|
|
|
{
|
|
|
|
if (!m_pConnections[j].link)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
Piece* pOwner = m_pConnections[j].link->owner;
|
|
|
|
|
|
|
|
if (m_pLink == NULL)
|
|
|
|
{
|
|
|
|
m_pLink = pOwner;
|
|
|
|
pOwner->m_pLink = NULL;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
for (pPiece = m_pLink; pPiece; pPiece = pPiece->m_pLink)
|
|
|
|
{
|
|
|
|
if (pPiece == pOwner)
|
|
|
|
break;
|
|
|
|
|
|
|
|
if (pPiece->m_pLink == NULL)
|
|
|
|
{
|
|
|
|
pPiece->m_pLink = pOwner;
|
|
|
|
pOwner->m_pLink = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (bFixOthers)
|
|
|
|
for (pPiece = m_pLink; pPiece; pPiece = pPiece->m_pLink)
|
|
|
|
pPiece->CalculateConnections(pConnections, nTime, bAnimation, true, false);
|
|
|
|
|
|
|
|
/*
|
|
|
|
BOOL bRebuild = FALSE;
|
|
|
|
CONNECTION *c1, *c2;
|
|
|
|
int sz = sizeof(CPiece*)*(m_pInfo->m_nConnectionCount-1);
|
|
|
|
CPiece** pConnections = (CPiece**)malloc(sz);
|
|
|
|
memset(pConnections, 0, sz);
|
|
|
|
|
|
|
|
for (POSITION pos = pDoc->m_Pieces.GetHeadPosition(); pos != NULL;)
|
|
|
|
{
|
|
|
|
CPiece* pPiece = pDoc->m_Pieces.GetNext(pos);
|
|
|
|
if ((pPiece == this) || (pPiece->m_pInfo->m_nConnectionCount == 1) ||
|
|
|
|
(!pPiece->IsVisible(nTime, bAnimator)))
|
|
|
|
continue;
|
|
|
|
pPiece->m_bUpdated = FALSE;
|
|
|
|
|
|
|
|
for (i = 0; i < m_pInfo->m_nConnectionCount-1; i++)
|
|
|
|
{
|
|
|
|
c1 = &m_pInfo->m_pConnections[i+1];
|
|
|
|
|
|
|
|
for (j = 0; j < pPiece->m_pInfo->m_nConnectionCount-1; j++)
|
|
|
|
{
|
|
|
|
c2 = &pPiece->m_pInfo->m_pConnections[j+1];
|
|
|
|
|
|
|
|
if (ConnectionsMatch(c1->type, c2->type))
|
|
|
|
{
|
|
|
|
// normal
|
|
|
|
if ((fabs(m_pConnections[i].pos[0]-pPiece->m_pConnections[j].pos[0]) < 0.1) &&
|
|
|
|
(fabs(m_pConnections[i].pos[1]-pPiece->m_pConnections[j].pos[1]) < 0.1) &&
|
|
|
|
(fabs(m_pConnections[i].pos[2]-pPiece->m_pConnections[j].pos[2]) < 0.1))
|
|
|
|
{
|
|
|
|
pConnections[i] = pPiece;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < m_pInfo->m_nConnectionCount-1; i++)
|
|
|
|
if (m_pConnections[i].pPiece != pConnections[i])
|
|
|
|
{
|
|
|
|
if (bOthers)
|
|
|
|
{
|
|
|
|
if ((m_pConnections[i].pPiece != NULL) &&
|
|
|
|
(m_pConnections[i].pPiece->IsVisible(nTime, bAnimator)))
|
|
|
|
m_pConnections[i].pPiece->UpdateConnections(this);
|
|
|
|
if ((pConnections[i] != NULL) &&
|
|
|
|
(pConnections[i]->IsVisible(nTime, bAnimator)))
|
|
|
|
pConnections[i]->UpdateConnections(this);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (m_pConnections[i].pPiece == NULL)
|
|
|
|
{
|
|
|
|
if (m_pInfo->m_pConnections[i].info != NULL)
|
|
|
|
bRebuild = TRUE;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (pConnections[i] == NULL)
|
|
|
|
if (m_pInfo->m_pConnections[i].info != NULL)
|
|
|
|
bRebuild = TRUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
m_pConnections[i].pPiece = pConnections[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
free(pConnections);
|
|
|
|
*/
|
|
|
|
if (rebuild)
|
|
|
|
BuildDrawInfo();
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
inline static BOOL ConnectionsMatch(BYTE c1, BYTE c2)
|
|
|
|
{
|
|
|
|
if (c1 == 1)
|
|
|
|
{
|
|
|
|
if (c2 == 2)
|
|
|
|
return TRUE;
|
|
|
|
else
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (c2 == 1)
|
|
|
|
{
|
|
|
|
if (c1 == 2)
|
|
|
|
return TRUE;
|
|
|
|
else
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
// 1: STUD
|
|
|
|
// 2: STUD CONNECTION
|
|
|
|
// int i = __min (c1, c2);
|
|
|
|
// int j = __max (c1, c2);
|
|
|
|
// switch (i)
|
|
|
|
// {
|
|
|
|
// case 1: if (j == 2) return TRUE;
|
|
|
|
// }
|
|
|
|
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
void CPiece::UpdateConnections(CPiece* pPiece)
|
|
|
|
{
|
|
|
|
if (m_bUpdated || m_pInfo->m_nConnectionCount == 1)
|
|
|
|
return;
|
|
|
|
BOOL bRebuild = FALSE;
|
|
|
|
int sz = sizeof(CPiece*)*(m_pInfo->m_nConnectionCount-1), i, j;
|
|
|
|
CONNECTION *c1, *c2;
|
|
|
|
CPiece** pConnections = (CPiece**)malloc(sz);
|
|
|
|
memset(pConnections, 0, sz);
|
|
|
|
|
|
|
|
for (i = 0; i < m_pInfo->m_nConnectionCount-1; i++)
|
|
|
|
{
|
|
|
|
c1 = &m_pInfo->m_pConnections[i+1];
|
|
|
|
|
|
|
|
for (j = 0; j < pPiece->m_pInfo->m_nConnectionCount-1; j++)
|
|
|
|
{
|
|
|
|
c2 = &pPiece->m_pInfo->m_pConnections[j+1];
|
|
|
|
|
|
|
|
if (ConnectionsMatch(c1->type, c2->type))
|
|
|
|
{
|
|
|
|
// normal
|
|
|
|
if ((fabs(m_pConnections[i].pos[0]-pPiece->m_pConnections[j].pos[0]) < 0.1) &&
|
|
|
|
(fabs(m_pConnections[i].pos[1]-pPiece->m_pConnections[j].pos[1]) < 0.1) &&
|
|
|
|
(fabs(m_pConnections[i].pos[2]-pPiece->m_pConnections[j].pos[2]) < 0.1))
|
|
|
|
{
|
|
|
|
pConnections[i] = pPiece;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < m_pInfo->m_nConnectionCount-1; i++)
|
|
|
|
{
|
|
|
|
if (m_pConnections[i].pPiece == pPiece && pConnections[i] == NULL)
|
|
|
|
{
|
|
|
|
m_pConnections[i].pPiece = NULL;
|
|
|
|
bRebuild = TRUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (pConnections[i] == pPiece && m_pConnections[i].pPiece == NULL)
|
|
|
|
{
|
|
|
|
m_pConnections[i].pPiece = pPiece;
|
|
|
|
bRebuild = TRUE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (bRebuild)
|
|
|
|
BuildDrawInfo();
|
|
|
|
free(pConnections);
|
|
|
|
m_bUpdated = TRUE;
|
|
|
|
}
|
|
|
|
*/
|
|
|
|
|
|
|
|
void Piece::AddConnections(CONNECTION_TYPE* pConnections)
|
|
|
|
{
|
|
|
|
int i, j, c;
|
|
|
|
|
|
|
|
for (i = 0; i < LC_CONNECTIONS; i++)
|
|
|
|
{
|
|
|
|
c = 0;
|
|
|
|
|
|
|
|
for (j = 0; j < m_pPieceInfo->m_nConnectionCount; j++)
|
|
|
|
if (m_pConnections[j].type == i)
|
|
|
|
c++;
|
|
|
|
|
|
|
|
if (c > 0)
|
|
|
|
{
|
|
|
|
// check if we need to realloc
|
|
|
|
if (pConnections[i].numentries % 5 == 0)
|
|
|
|
{
|
|
|
|
if (pConnections[i].numentries > 0)
|
|
|
|
pConnections[i].entries = (CONNECTION_ENTRY*)realloc(pConnections[i].entries, sizeof(CONNECTION_ENTRY)*(pConnections[i].numentries+5));
|
|
|
|
else
|
|
|
|
pConnections[i].entries = (CONNECTION_ENTRY*)realloc(pConnections[i].entries, sizeof(CONNECTION_ENTRY)*5);
|
|
|
|
}
|
|
|
|
|
|
|
|
CONNECTION_ENTRY* entry = &pConnections[i].entries[pConnections[i].numentries];
|
|
|
|
pConnections[i].numentries++;
|
|
|
|
|
|
|
|
entry->owner = this;
|
|
|
|
entry->numcons = c;
|
|
|
|
entry->cons = (CONNECTION**)malloc(c*sizeof(CONNECTION*));
|
|
|
|
|
|
|
|
c = 0;
|
|
|
|
for (j = 0; j < m_pPieceInfo->m_nConnectionCount; j++)
|
|
|
|
if (m_pConnections[j].type == i)
|
|
|
|
{
|
|
|
|
entry->cons[c] = &m_pConnections[j];
|
|
|
|
c++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void Piece::RemoveConnections(CONNECTION_TYPE* pConnections)
|
|
|
|
{
|
|
|
|
PtrArray<Piece> RebuildList;
|
|
|
|
int i, j;
|
|
|
|
|
|
|
|
for (i = 0; i < LC_CONNECTIONS; i++)
|
|
|
|
{
|
|
|
|
CONNECTION_TYPE* Type = &pConnections[i];
|
|
|
|
|
|
|
|
for (j = 0; j < Type->numentries; j++)
|
|
|
|
{
|
|
|
|
CONNECTION_ENTRY* Entry = &Type->entries[j];
|
|
|
|
|
|
|
|
if (Entry->owner == this)
|
|
|
|
{
|
|
|
|
// Save a list of pieces that their lost connection to this one.
|
|
|
|
for (int k = 0; k < Entry->numcons; k++)
|
|
|
|
{
|
|
|
|
if (Entry->cons[k]->link != NULL)
|
|
|
|
{
|
|
|
|
if (RebuildList.FindIndex(Entry->cons[k]->link->owner) == -1)
|
|
|
|
RebuildList.Add(Entry->cons[k]->link->owner);
|
|
|
|
Entry->cons[k]->link->link = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
free(Entry->cons);
|
|
|
|
Type->numentries--;
|
|
|
|
|
|
|
|
// Shrink array.
|
|
|
|
for (; j < Type->numentries; j++)
|
|
|
|
Type->entries[j] = Type->entries[j+1];
|
|
|
|
|
|
|
|
// Realloc to save memory.
|
|
|
|
if (Type->numentries % 5 == 0)
|
|
|
|
{
|
|
|
|
if (Type->numentries > 0)
|
|
|
|
Type->entries = (CONNECTION_ENTRY*)realloc(Type->entries, sizeof(CONNECTION_ENTRY)*Type->numentries);
|
|
|
|
else
|
|
|
|
{
|
|
|
|
free(Type->entries);
|
|
|
|
Type->entries = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Fix pieces that lost their connection to this one.
|
|
|
|
for (i = 0; i < RebuildList.GetSize(); i++)
|
|
|
|
RebuildList[i]->BuildDrawInfo();
|
|
|
|
}
|