void QuadLinearPass(double *r, double le, double kv, double *T1, double *T2, double *R1, double *R2, int num_particles)
{ int c;
double *r6;
bool useT1, useT2, useR1, useR2;
if(T1==NULL)
useT1=false;
else
useT1=true;
if(T2==NULL)
useT2=false;
else
useT2=true;
if(R1==NULL)
useR1=false;
else
useR1=true;
if(R2==NULL)
useR2=false;
else
useR2=true;
for(c = 0;c<num_particles;c++)
{ r6 = r+c*6;
if(!mxIsNaN(r6[0]) & mxIsFinite(r6[4]))
/*
function quad6 internally calculates the square root
of the energy deviation of the particle
To protect against DOMAIN and OVERFLOW error, check if the
fifth component of the phase spacevector r6[4] is finite
*/
{
/* Misalignment at entrance */
if(useT1)
ATaddvv(r6,T1);
if(useR1)
ATmultmv(r6,R1);
quad6(r6,le,kv);
/* Misalignment at exit */
if(useR2)
ATmultmv(r6,R2);
if(useT2)
ATaddvv(r6,T2);
}
}
}
Region& Region::Exclude(const Rect &excludeRect)
{
BeginOperation();
int index = 0;
int rectsToCheck = fNumRects;
while (index < rectsToCheck) {
Rect &clipRect = fRects[index];
if (!excludeRect.Intersects(clipRect)) {
index++;
continue;
}
// This clip rect intersects the excluded rect, and could be divided into
// as many as eight pieces. Test for each case. Note that none of these
// rectangles overlap!!!!
Rect quad1(clipRect.left, clipRect.top, excludeRect.left - 1, excludeRect.top - 1);
if (SPLIT_TEST(clipRect, quad1)) {
quad1.Intersect(clipRect);
AddRect(quad1);
}
Rect quad2(excludeRect.left, clipRect.top, excludeRect.right, excludeRect.top - 1);
if (SPLIT_TEST(clipRect, quad2)) {
quad2.Intersect(clipRect);
AddRect(quad2);
}
Rect quad3(excludeRect.right + 1, clipRect.top, clipRect.right, excludeRect.top - 1);
if (SPLIT_TEST(clipRect, quad3)) {
quad3.Intersect(clipRect);
AddRect(quad3);
}
Rect quad4(clipRect.left, excludeRect.top, excludeRect.left - 1, excludeRect.bottom);
if (SPLIT_TEST(clipRect, quad4)) {
quad4.Intersect(clipRect);
AddRect(quad4);
}
Rect quad5(excludeRect.right + 1, excludeRect.top, clipRect.right, excludeRect.bottom);
if (SPLIT_TEST(clipRect, quad5)) {
quad5.Intersect(clipRect);
AddRect(quad5);
}
Rect quad6(clipRect.left, excludeRect.bottom + 1, excludeRect.left - 1, clipRect.bottom);
if (SPLIT_TEST(clipRect, quad6)) {
quad6.Intersect(clipRect);
AddRect(quad6);
}
Rect quad7(excludeRect.left, excludeRect.bottom + 1, excludeRect.right, clipRect.bottom);
if (SPLIT_TEST(clipRect, quad7)) {
quad7.Intersect(clipRect);
AddRect(quad7);
}
Rect quad8(excludeRect.right + 1, excludeRect.bottom + 1, clipRect.right, clipRect.bottom);
if (SPLIT_TEST(clipRect, quad8)) {
quad8.Intersect(clipRect);
AddRect(quad8);
}
// This rect has been split, remove it. Note we don't
// change the index
RemoveRect(index);
rectsToCheck--;
}
EndOperation();
return *this;
}
