void DisplayOptionWidget::updateUI()
{
PreferenceManager* prefs = editor()->preference();
SignalBlocker b( ui->thinLinesButton );
ui->thinLinesButton->setChecked( prefs->isOn( SETTING::INVISIBLE_LINES ) );
SignalBlocker b2( ui->outLinesButton );
ui->outLinesButton->setChecked( prefs->isOn( SETTING::OUTLINES ) );
SignalBlocker b3( ui->onionPrevButton );
ui->onionPrevButton->setChecked( prefs->isOn( SETTING::PREV_ONION ) );
SignalBlocker b4( ui->onionNextButton );
ui->onionNextButton->setChecked( prefs->isOn( SETTING::NEXT_ONION ) );
SignalBlocker b5( ui->onionBlueButton );
ui->onionBlueButton->setChecked( prefs->isOn( SETTING::ONION_BLUE ) );
SignalBlocker b6( ui->onionRedButton );
ui->onionRedButton->setChecked( prefs->isOn( SETTING::ONION_RED ) );
SignalBlocker b7( ui->mirrorButton );
ui->mirrorButton->setChecked( prefs->isOn( SETTING::MIRROR_H ) );
SignalBlocker b8( ui->mirrorVButton );
ui->mirrorVButton->setChecked( prefs->isOn( SETTING::MIRROR_V ) );
}
inline uint32_t rgba() const
{
return ((a8() << 24) |
(b8() << 16) |
(g8() << 8) |
(r8() << 0));
}
void display()
{
glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);
glMatrixMode(GL_PROJECTION);
glLoadIdentity();
GLint viewport[4];
glGetIntegerv(GL_VIEWPORT, viewport);
double aspect = (double)viewport[2] / (double)viewport[3];
gluPerspective(fovy, aspect, clipNear, clipFar);
glMatrixMode(GL_MODELVIEW);
glLoadIdentity();
gluLookAt(0, 0, z, x, y, 0, 0, 1, 0);
if (success) {
drawFaces();
if (drawAABB) {
Eigen::Vector3d max = boundingBox.max;
Eigen::Vector3d min = boundingBox.min;
Eigen::Vector3d extent = boundingBox.extent;
Eigen::Vector3d b2(min.x() + extent.x(), min.y(), min.z());
Eigen::Vector3d b3(min.x() + extent.x(), min.y() + extent.y(), min.z());
Eigen::Vector3d b4(min.x(), min.y() + extent.y(), min.z());
Eigen::Vector3d b5(max.x() - extent.x(), max.y() - extent.y(), max.z());
Eigen::Vector3d b6(max.x(), max.y() - extent.y(), max.z());
Eigen::Vector3d b8(max.x() - extent.x(), max.y(), max.z());
drawBox(min, b2, b3, b4, b5, b6, max, b8);
} else {
std::vector<Eigen::Vector3d> orientedPoints = boundingBox.orientedPoints;
Eigen::Vector3d b1 = orientedPoints[0] + orientedPoints[2] + orientedPoints[4];
Eigen::Vector3d b2 = orientedPoints[1] + orientedPoints[2] + orientedPoints[4];
Eigen::Vector3d b3 = orientedPoints[1] + orientedPoints[2] + orientedPoints[5];
Eigen::Vector3d b4 = orientedPoints[0] + orientedPoints[2] + orientedPoints[5];
Eigen::Vector3d b5 = orientedPoints[0] + orientedPoints[3] + orientedPoints[4];
Eigen::Vector3d b6 = orientedPoints[1] + orientedPoints[3] + orientedPoints[4];
Eigen::Vector3d b8 = orientedPoints[0] + orientedPoints[3] + orientedPoints[5];
Eigen::Vector3d b7 = orientedPoints[1] + orientedPoints[3] + orientedPoints[5];
drawBox(b1, b2, b3, b4, b5, b6, b7, b8);
}
}
glutSwapBuffers();
}
void level_three()
{
vector<DPipe> DirectPipes(13);
vector<DoublePipe> DoublePipes(13);
vector<CrossPipe> CrossPipes(2);
DPipe a0(50,SCREEN_HEIGHT-50,100,40);
DoublePipe b0(150,SCREEN_HEIGHT-50,70,40);
DPipe a1(150,SCREEN_HEIGHT-150,100,40);
DoublePipe b1(150,SCREEN_HEIGHT-250,70,40);
DPipe a2(250,SCREEN_HEIGHT-350,100,40);
DoublePipe b2(350,SCREEN_HEIGHT-250,70,40);
DPipe a3(350,SCREEN_HEIGHT-350,100,40);
DPipe a4(350,SCREEN_HEIGHT-150,100,40);
DoublePipe b3(250,SCREEN_HEIGHT-450,70,40);
DoublePipe b4(350,SCREEN_HEIGHT-450,70,40);
CrossPipe c0(250,SCREEN_HEIGHT-250,100,40);
DPipe a5(550,SCREEN_HEIGHT-50,100,40);
DoublePipe b5(250,SCREEN_HEIGHT-150,70,40);
DoublePipe b6(450,SCREEN_HEIGHT-50,70,40);
DoublePipe b7(650,SCREEN_HEIGHT-150,70,40);
DPipe a6(550,SCREEN_HEIGHT-50,100,40);
DPipe a7(550,SCREEN_HEIGHT-150,100,40);
DoublePipe b8(750,SCREEN_HEIGHT-50,70,40);
DPipe a8(550,SCREEN_HEIGHT-250,100,40);
DoublePipe b9(750,SCREEN_HEIGHT-350,70,40);
CrossPipe c1(450,SCREEN_HEIGHT-150,100,40);
DoublePipe b10(350,SCREEN_HEIGHT-450,70,40);
DPipe a9(750,SCREEN_HEIGHT-150,100,40);
DPipe a10(750,SCREEN_HEIGHT-250,100,40);
DoublePipe b11(450,SCREEN_HEIGHT-250,70,40);
DoublePipe b12(650,SCREEN_HEIGHT-250,70,40);
DPipe a11(650,SCREEN_HEIGHT-50,100,40);
DPipe a12(850,SCREEN_HEIGHT-350,100,40);
DirectPipes[0] = a0; DoublePipes[0] = b0;
DirectPipes[1] = a1; DoublePipes[1] = b1;
DirectPipes[2] = a2; DoublePipes[2] = b2;
DirectPipes[3] = a3; DoublePipes[3] = b3;
DirectPipes[4] = a4; DoublePipes[4] = b4;
DirectPipes[5] = a5; DoublePipes[5] = b5;
DirectPipes[6] = a6; DoublePipes[6] = b6;
DirectPipes[7] = a7; DoublePipes[7] = b7;
DirectPipes[8] = a8; DoublePipes[8] = b8;
DirectPipes[9] = a9; DoublePipes[9] = b9;
DirectPipes[10] = a10; DoublePipes[10] = b10;
DirectPipes[11] = a11; DoublePipes[11] = b11;
DirectPipes[12] = a12; DoublePipes[12] = b12;
CrossPipes[0] = c0; CrossPipes[1] = c1;
Water a(20,SCREEN_HEIGHT-50,40,40);
}
void test2()
{
BigData b1("");
BigData b2("-123");
BigData b3("-");
BigData b4("+");
BigData b5("+aa123");
BigData b6("-aa123");
BigData b7("aa123");
BigData b8("123");
BigData b9("+12aa3");
BigData b10("-12aa3");
BigData b11("12aa3");
BigData b13("-000123");
BigData b14("+000123");
BigData b15("9999999999999999999999999999999999999999999999999999999");
BigData b16(123);
BigData b17(1234);
cout<<b15;
cin>>b1;
}
void Test1()
{
BigData n1(123456);
BigData b2("12346678");
BigData b3("+12346678");
BigData b4("-123466");
BigData b5("+");
BigData b6(" ");
BigData b7("12346aaaa");
BigData b8("+asd12346678");
BigData b9("000012346678");
cout << "n1:" << n1 << endl;
cout << "b2:" << b2 << endl;
cout << "b3:" << b3 << endl;
cout << "b4:" << b4 << endl;
cout << "b5:" << b5 << endl;
cout << "b6:" << b6 << endl;
cout << "b7:" << b7 << endl;
cout << "b8:" << b8 << endl;
cout << "b9:" << b9 << endl;
}
int main()
{
// Några saker som ska fungera:
UIntVector a(10); // initiering med 7 element
std::cout << "a(10)"<< a.length << std::endl;
std::cout << "kopiering" << std::endl;
UIntVector b(a); // kopieringskonstruktor
std::cout << "kopiering" << std::endl;
a = a;
std::cout << "s**t" << std::endl;
UIntVector c = a; // kopieringskonstruktor
//Extra tester för alla Requirments
a = b; // tilldelning genom kopiering
a[5] = 7; // tilldelning till element
const UIntVector e(100000); // konstant objekt med 10 element
int i = e[5]; // const int oper[](int) const körs
i = a[0]; // vektorn är nollindexerad
i = a[5]; // int oper[](int) körs
a[5]++; // öka värdet till 8
//Extra tester för alla Requirments
std::cout << "(1)TEST" << std::endl;
int aa = e[9];
int ab = e[0];
std::cout << "(1)S**T" << aa << ab << std::endl;
std::cout << "(2)TEST" << std::endl;
for(long int i = 0; i < 100000; i++)
{
e[i];
}
std::cout << "(2)S**T" << std::endl;
std::cout << "(3)TEST" << std::endl;
UIntVector a3(10); UIntVector b3(0); UIntVector c3(0);
b3 = a3;
a3 = c3;
std::cout << "(3)S**T" << std::endl;
std::cout << "(4) START" << std::endl;
std::initializer_list<unsigned int> list = {1,2,3};
UIntVector a4(list); UIntVector b4(0);
a4 = b4;
std::cout << "length a" << a4.size() << "len b " << b4.size() << std::endl;
std::cout << "(4) S**T" << std::endl;
std::cout << "(5)TEST" << std::endl;
UIntVector b5(list);
UIntVector a5(std::move(b5));
std::cout << "(5)S**T" << std::endl;
std::cout << "(6)TEST" << std::endl;
UIntVector a6(30);
UIntVector b6(a6);
std::cout << "(6)S**T" << std::endl;
std::cout << "(7)TEST" << std::endl;
UIntVector a7(1);
std::cout << "a) len innan " <<a7.length << std::endl;
UIntVector b7(std::move(a7));
std::cout << "b) len " <<b7.length << std::endl;
std::cout << "a) len " <<a7.length << std::endl;
std::cout << "(7)S**T" << std::endl;
std::cout << "(8)TEST" << std::endl;
UIntVector a8(10);
a8.reset();
UIntVector b8(11);
std::cout << "a) INNAN len " <<a8.size() << "ptr " << a8.vector_ptr <<std::endl;
UIntVector c8(std::move(a8));
std::cout << "c) len " <<c8.size() << "ptr" << c8.vector_ptr <<std::endl;
std::cout << "a) len " <<a8.size() << "ptr " << a8.vector_ptr <<std::endl;
std::cout << "(8)S**T" << std::endl;
std::cout << "(9)TEST COPY TO SELF" << std::endl;
b8 = b8;
std::cout << "(9)S**T" << std::endl;
try {
i = e[10]; // försöker hämta element som ligger utanför e
} catch (std::out_of_range e) {
std::cout << e.what() << std::endl;
}
#if 0
// Diverse saker att testa
e[5] = 3; // fel: (kompilerar ej) tilldelning till const
b = b; // hmm: se till att inte minnet som skall behållas frigörs
#endif
return 0;
}
int main() {
/* test cases */
/*
* case 1: addition a>b and b>a and a=b
*/
BigInt a1("99");
BigInt b1("9131");
std::cout<<"\na = "<<a1.toString();
std::cout<<"\nb = "<<b1.toString();
std::cout<<"\nsum = "<<(a1+b1).toString();
std::cout<<"\na-b = "<<(a1-b1).toString();
BigInt a2("99");
BigInt b2("91");
std::cout<<"\na = "<<a2.toString();
std::cout<<"\nb = "<<b2.toString();
std::cout<<"\nsum = "<<(a2+b2).toString();
std::cout<<"\nproduct = "<<(a2*b2).toString();
std::cout<<"\na-b = "<<(a2-b2).toString();
/*
* case 2: a=b and one is negative
*/
BigInt a3("-99");
BigInt b3("91");
std::cout<<"\na = "<<a3.toString();
std::cout<<"\nb = "<<b3.toString();
std::cout<<"\nsum = "<<(a3+b3).toString();
std::cout<<"\nsum = "<<(b3+a3).toString();
std::cout<<"\nproduct = "<<(b3*a3).toString();
std::cout<<"\na-b = "<<(a3-b3).toString();
/*
* case 2: abs(a)>abs(b) and a is negative
*/
BigInt a4("-999");
BigInt b4("91");
std::cout<<"\na = "<<a4.toString();
std::cout<<"\nb = "<<b4.toString();
std::cout<<"\nsum = "<<(a4+b4).toString();
std::cout<<"\nsum = "<<(b4+a4).toString();
std::cout<<"\nproduct = "<<(b4*a4).toString();
std::cout<<"\na-b = "<<(a4-b4).toString();
/*
* case 3: abs(b)>abs(a) and b is negative
*/
BigInt a5("99");
BigInt b5("-991");
std::cout<<"\na = "<<a5.toString();
std::cout<<"\nb = "<<b5.toString();
std::cout<<"\nsum = "<<(a5+b5).toString();
std::cout<<"\nsum = "<<(b5+a5).toString();
std::cout<<"\nproduct = "<<(b5*a5).toString();
std::cout<<"\na-b = "<<(a5-b5).toString();
/*
* case 4: abs(b)>abs(a) and a,b is negative
*/
BigInt a6("-99");
BigInt b6("-991");
std::cout<<"\na = "<<a6.toString();
std::cout<<"\nb = "<<b6.toString();
std::cout<<"\nsum = "<<(a6+b6).toString();
std::cout<<"\nsum = "<<(b6+a6).toString();
std::cout<<"\na-b = "<<(a6-b6).toString();
/*
* case 4: abs(b)=abs(a) and a,b is negative
*/
BigInt a7("-999");
BigInt b7("-991");
std::cout<<"\na = "<<a7.toString();
std::cout<<"\nb = "<<b7.toString();
std::cout<<"\nsum = "<<(a7+b7).toString();
std::cout<<"\nsum = "<<(b7+a7).toString();
std::cout<<"\nproduct = "<<(b7*a7).toString();
std::cout<<"\na-b = "<<(a7-b7).toString();
/*
* case 5: a-b
*/
BigInt a8("-999");
BigInt b8("-991");
std::cout<<"\na = "<<a8.toString();
std::cout<<"\nb = "<<b8.toString();
std::cout<<"\na-b = "<<(a8-b8).toString();
std::cout<<"\na-b = "<<(a8-b8).toString();
BigInt fact("1");
clock_t time = clock();
fact = fact.factorial(1000);
time = clock() - time;
std::cout<<"\n\n10000 Factorial:\n"<<fact.toString()<<std::endl;
std::cout<<"\n\ntime taken to find 1000! = "<<time/CLOCKS_PER_SEC<<" seconds";
BigInt rd;
rd = rd.random();
std::cout<<"\n\n\nRandom number = "<<rd.toString()<<"\n\n";
rd = rd.random();
std::cout<<"\n\n\nRandom number = "<<rd.toString()<<"\n\n";
rd = rd.random();
std::cout<<"\n\n\nRandom number = "<<rd.toString()<<"\n\n";
return 0;
}
TEST(CollisionTest, CollisionTestAll)
{
int a_x = 10;
int a_y = 10;
int a_width = 10;
int a_height = 10;
int b1_x = 10;
int b1_y = 30;
int b1_width = 10;
int b1_height = 10;
int b2_x = 10;
int b2_y = 20;
int b2_width = 10;
int b2_height = 1;
int b3_x = 20;
int b3_y = 10;
int b3_width = 1;
int b3_height = 10;
int b4_x = 30;
int b4_y = 10;
int b4_width = 10;
int b4_height = 10;
int b5_x = 30;
int b5_y = 30;
int b5_width = 10;
int b5_height = 10;
int b6_x = 9;
int b6_y = 10;
int b6_width = 1;
int b6_height = 10;
int b7_x = 10;
int b7_y = 9;
int b7_width = 10;
int b7_height = 1;
int b8_x = 10;
int b8_y = 10;
int b8_width = 10;
int b8_height = 10;
int b9_x = 10;
int b9_y = 15;
int b9_width = 10;
int b9_height = 5;
int b10_x = 13;
int b10_y = 13;
int b10_width = 2;
int b10_height = 2;
int b11_x = 18;
int b11_y = 2;
int b11_width = 10;
int b11_height = 10;
int b12_x = 5;
int b12_y = 15;
int b12_width = 10;
int b12_height = 10;
BoxShape a(a_x, a_y, a_width, a_height);
BoxShape b1(b1_x, b1_y, b1_width, b1_height);
BoxShape b2(b2_x, b2_y, b2_width, b2_height);
BoxShape b3(b3_x, b3_y, b3_width, b3_height);
BoxShape b4(b4_x, b4_y, b4_width, b4_height);
BoxShape b5(b5_x, b5_y, b5_width, b5_height);
BoxShape b6(b6_x, b6_y, b6_width, b6_height);
BoxShape b7(b7_x, b7_y, b7_width, b7_height);
BoxShape b8(b8_x, b8_y, b8_width, b8_height);
BoxShape b9(b9_x, b9_y, b9_width, b9_height);
BoxShape b10(b10_x, b10_y, b10_width, b10_height);
BoxShape b11(b11_x, b11_y, b11_width, b11_height);
BoxShape b12(b12_x, b12_y, b12_width, b12_height);
ASSERT_FALSE(collision_detection(a, b1)) << "Should not return collision. They are apart";
ASSERT_FALSE(collision_detection(a, b2)) << "Should not return collision. They are adjacent";
ASSERT_FALSE(collision_detection(a, b3)) << "Should not return collision. They are adjacent";
ASSERT_FALSE(collision_detection(a, b4)) << "Should not return collision. They are apart";
ASSERT_FALSE(collision_detection(a, b5)) << "Should not return collision. They are apart";
ASSERT_FALSE(collision_detection(a, b6)) << "Should not return collision. They are adjacent";
ASSERT_FALSE(collision_detection(a, b7)) << "Should not return collision. They are adjacent";
ASSERT_TRUE(collision_detection(a, b8)) << "Should return collision. They are on top of each other";
ASSERT_TRUE(collision_detection(a, b9)) << "Should return collision. They intersect";
ASSERT_TRUE(collision_detection(a, b10)) << "Should return collision. One is inside the other";
ASSERT_TRUE(collision_detection(a, b11)) << "Should return collision. They intersect";
ASSERT_TRUE(collision_detection(a, b12)) << "Should return collision. They intersect";
}
SDL_Color to_sdl_color() const
{
return { r8(), g8(), b8(), a8() };
}
/**
@SYMTestCaseID SYSLIB-SQL-CT-1628
@SYMTestCaseDesc GetFirstSqlStmt() test
Tests the GetFirstSqlStmt() behaviour with a set of various SQL statements.
@SYMTestPriority High
@SYMTestActions GetFirstSqlStmt() test
@SYMTestExpectedResults Test must not fail
@SYMREQ REQ5792
REQ5793
*/
void TestGetFirstSqlStmt()
{
TPtrC res;
TBuf<1> b2; b2.Append(TChar(0));
TPtr p2(PTR_ARG(b2));
res.Set(GetFirstSqlStmt(p2));
//Expected result: res = "\x0", p2 is NULL
TEST(res == b2);
TEST(!p2.Ptr());
TBuf<2> b3; b3.Append(TChar(' ')); b3.Append(TChar(0));
TPtr p3(PTR_ARG(b3));
res.Set(GetFirstSqlStmt(p3));
//Expected result: res = " \x0", p3 is NULL
TEST(res == b3);
TEST(!p3.Ptr());
TBuf<7> b4(_L(";; ; ")); b4.Append(TChar(0));
TPtr p4(PTR_ARG(b4));
res.Set(GetFirstSqlStmt(p4));
//Expected result: res = "\x0", p4 = "; ; \x0"
TEST(res.Length() == 1 && (TInt)res[0] == 0);
TInt accLen = res.Length();
TEST(p4 == b4.Right(b4.Length() - accLen));
res.Set(GetFirstSqlStmt(p4));
//Expected result: res = "\x0", p4 = " ; \x0"
TEST(res.Length() == 1 && (TInt)res[0] == 0);
accLen += res.Length();
TEST(p4 == b4.Right(b4.Length() - accLen));
res.Set(GetFirstSqlStmt(p4));
//Expected result: res = " \x0", p4 = " \x0"
TEST((TInt)res[0] == (TInt)TChar(' ') && (TInt)res[1] == 0);
accLen += res.Length();
TEST(p4 == b4.Right(b4.Length() - accLen));
res.Set(GetFirstSqlStmt(p4));
//Expected result: res = " \x0", p4 is NULL
TEST((TInt)res[0] == (TInt)TChar(' ') && (TInt)res[1] == (TInt)TChar(' ') && (TInt)res[2] == 0);
TEST(!p4.Ptr());
TBuf<20> b5(_L("SELECT * FROM A")); b5.Append(TChar(0));
TPtr p5(PTR_ARG(b5));
res.Set(GetFirstSqlStmt(p5));
//Expected result: res = "SELECT * FROM A\x0", p5 is NULL
TEST(res == b5);
TEST(!p5.Ptr());
TBuf<20> b6(_L("SELECT * FROM A;")); b6.Append(TChar(0));
TPtr p6(PTR_ARG(b6));
res.Set(GetFirstSqlStmt(p6));
//Expected result: res = "SELECT * FROM A\x0", p6 = "\x0"
TEST(res == b6.Left(b6.Length() - 1));
TEST(p6.Length() == 1 && p6[0] == 0);
TBuf<40> b7(_L("/** Comment */ SELECT * FROM A;")); b7.Append(TChar(0));
TPtr p7(PTR_ARG(b7));
res.Set(GetFirstSqlStmt(p7));
//Expected result: res = "/** Comment */ SELECT * FROM A\x0", p7 = "\x0"
TEST(res == b7.Left(b7.Length() - 1));
TEST(p7.Length() == 1 && p7[0] == 0);
TBuf<40> b8(_L(" SELECT * FROM --Comment \r\n A;")); b8.Append(TChar(0));
TPtr p8(PTR_ARG(b8));
res.Set(GetFirstSqlStmt(p8));
//Expected result: res = " SELECT * FROM --Comment \r\n A\x0", p8 = "\x0"
TEST(res == b8.Left(b8.Length() - 1));
TEST(p8.Length() == 1 && p8[0] == 0);
TBuf<40> b9(_L("SELECT * FROM A; SELECT * FROM B")); b9.Append(TChar(0));
TPtr p9(PTR_ARG(b9));
res.Set(GetFirstSqlStmt(p9));
//Expected result: res = "SELECT * FROM A\x0", p9 = " SELECT * FROM B\x0"
TEST(res.Left(res.Length() - 1) == b9.Left(res.Length() - 1) && (TInt)res[res.Length() - 1] == 0);
accLen = res.Length();
TEST(p9 == b9.Right(b9.Length() - accLen));
res.Set(GetFirstSqlStmt(p9));
//Expected result: res = " SELECT * FROM B\x0", p9 is NULL
TEST(res == b9.Right(b9.Length() - accLen));
TEST(!p9.Ptr());
//Defect INC113060
TBuf<255> b10(_L("UPDATE Playlist SET Name=';',Time='2007-09-20 12:31:33' WHERE UniqueId=640397473"));
TPtr p10(PTR_ARG(b10));
res.Set(GetFirstSqlStmt(p10));
//Expected results: res= original string
TEST(res.Compare(b10)==0);
TEST(!p10.Ptr());
TBuf<255> firstStmt(_L("SELECT * FROM PlayList"));firstStmt.Append(TChar(0));
TBuf<255> b11(_L("SELECT * FROM PlayList;UPDATE Playlist SET Name=';',Time='2007-09-20 12:31:33' WHERE UniqueId=640397473"));
TPtr p11(PTR_ARG(b11));
res.Set(GetFirstSqlStmt(p11));
TEST(res.Compare(firstStmt)==0);
TEST(p11.Compare(b10)==0);
}
void level_two()
{
vector<DPipe> DPIPES(44);
vector<DoublePipe> DOUBPIPES(18);
vector<CrossPipe> CROSSPIPES(3);
DPipe background(600,400,1200,800);
DPipe a0(50,750,100,40);
DPipe a1(150,650,100,40);
DPipe a2(150,550,100,40);
DPipe a3(650,450,100,40);
DPipe a4(550,550,100,40);
DPipe a5(450,350,100,40);
DPipe a6(550,250,100,40);
DPipe a7(650,250,100,40);
DPipe a8(750,350,100,40);
DPipe a9(750,450,100,40);
DPipe a10(750,550,100,40);
DPipe a11(650,650,100,40);
DPipe a12(550,650,100,40);
DPipe a13(450,650,100,40);
DPipe a14(350,550,100,40);
DPipe a15(350,350,100,40);
DPipe a16(350,250,100,40);
DPipe a17(450,150,100,40);
DPipe a18(550,150,100,40);
DPipe a19(650,150,100,40);
DPipe a20(750,150,100,40);
DPipe a21(850,250,100,40);
DPipe a22(850,350,100,40);
DPipe a23(850,450,100,40);
DPipe a24(850,550,100,40);
DPipe a25(850,650,100,40);
DPipe a26(750,750,100,40);
DPipe a27(650,750,100,40);
DPipe a28(550,750,100,40);
DPipe a29(450,750,100,40);
DPipe a30(350,750,100,40);
DPipe a31(250,650,100,40);
DPipe a32(250,550,100,40);
DPipe a33(250,350,100,40);
DPipe a34(250,250,100,40);
DPipe a35(250,150,100,40);
DPipe a36(350,50,100,40);
DPipe a37(450,50,100,40);
DPipe a38(550,50,100,40);
DPipe a39(650,50,100,40);
DPipe a40(750,50,100,40);
DPipe a41(850,50,100,40);
DPipe a42(950,150,100,40);
DPipe a43(950,250,100,40);
DoublePipe b0(150,750,70,40);
DoublePipe b1(150,450,70,40);
DoublePipe b2(550,450,70,40);
DoublePipe b3(550,350,70,40);
DoublePipe b4(650,350,70,40);
DoublePipe b5(650,550,70,40);
DoublePipe b6(450,550,70,40);
DoublePipe b7(450,250,70,40);
DoublePipe b8(750,250,70,40);
DoublePipe b9(750,650,70,40);
DoublePipe b10(350,650,70,40);
DoublePipe b11(350,150,70,40);
DoublePipe b12(850,150,70,40);
DoublePipe b13(850,750,70,40);
DoublePipe b14(250,750,70,40);
DoublePipe b15(250,50,70,40);
DoublePipe b16(950,50,70,40);
DoublePipe b17(950,350,70,40);
CrossPipe c0(250,450,100,40);
CrossPipe c1(350,450,100,40);
CrossPipe c2(450,450,100,40);
DPIPES[0]=a0;
DPIPES[1]=a1;
DPIPES[2]=a2;
DPIPES[3]=a3;
DPIPES[4]=a4;
DPIPES[5]=a5;
DPIPES[6]=a6;
DPIPES[7]=a7;
DPIPES[8]=a8;
DPIPES[9]=a9;
DPIPES[10]=a10;
DPIPES[11]=a11;
DPIPES[12]=a12;
DPIPES[13]=a13;
DPIPES[14]=a14;
DPIPES[15]=a15;
DPIPES[16]=a16;
DPIPES[17]=a17;
DPIPES[18]=a18;
DPIPES[19]=a19;
DPIPES[20]=a20;
DPIPES[21]=a21;
DPIPES[22]=a22;
DPIPES[23]=a23;
DPIPES[24]=a24;
DPIPES[25]=a25;
DPIPES[26]=a26;
DPIPES[27]=a27;
DPIPES[28]=a28;
DPIPES[29]=a29;
DPIPES[30]=a30;
DPIPES[31]=a31;
DPIPES[32]=a32;
DPIPES[33]=a33;
DPIPES[34]=a34;
DPIPES[35]=a35;
DPIPES[36]=a36;
DPIPES[37]=a37;
DPIPES[38]=a38;
DPIPES[39]=a39;
DPIPES[40]=a40;
DPIPES[41]=a41;
DPIPES[42]=a42;
DPIPES[43]=a43;
DOUBPIPES[0]=b0;
DOUBPIPES[1]=b1;
DOUBPIPES[2]=b2;
DOUBPIPES[3]=b3;
DOUBPIPES[4]=b4;
DOUBPIPES[5]=b5;
DOUBPIPES[6]=b6;
DOUBPIPES[7]=b7;
DOUBPIPES[8]=b8;
DOUBPIPES[9]=b9;
DOUBPIPES[10]=b10;
DOUBPIPES[11]=b11;
DOUBPIPES[12]=b12;
DOUBPIPES[13]=b13;
DOUBPIPES[14]=b14;
DOUBPIPES[15]=b15;
DOUBPIPES[16]=b16;
DOUBPIPES[17]=b17;
CROSSPIPES[0]=c0;
CROSSPIPES[1]=c1;
CROSSPIPES[2]=c2;
}
void ColorInspector::setColor(QColor newColor)
{
// this is a UI update function, never emit any signals
// grab the color from color manager, and then update itself, that's it.
// compare under the same color spec
newColor = (isRgbColors) ? newColor.toRgb() : newColor.toHsv();
if (newColor == mCurrentColor)
{
return;
}
if(isRgbColors)
{
QSignalBlocker b1(ui->red_slider);
QSignalBlocker b2(ui->green_slider);
QSignalBlocker b3(ui->blue_slider);
QSignalBlocker b4(ui->alpha_slider);
ui->red_slider->setRgb(newColor);
ui->green_slider->setRgb(newColor);
ui->blue_slider->setRgb(newColor);
ui->alpha_slider->setRgb(newColor);
QSignalBlocker b5(ui->RedspinBox);
QSignalBlocker b6(ui->GreenspinBox);
QSignalBlocker b7(ui->BluespinBox);
QSignalBlocker b8(ui->AlphaspinBox);
ui->RedspinBox->setValue(newColor.red());
ui->GreenspinBox->setValue(newColor.green());
ui->BluespinBox->setValue(newColor.blue());
ui->AlphaspinBox->setValue(newColor.alpha());
}
else
{
QSignalBlocker b1(ui->red_slider);
QSignalBlocker b2(ui->green_slider);
QSignalBlocker b3(ui->blue_slider);
QSignalBlocker b4(ui->alpha_slider);
ui->red_slider->setHsv(newColor);
ui->green_slider->setHsv(newColor);
ui->blue_slider->setHsv(newColor);
ui->alpha_slider->setHsv(newColor);
QSignalBlocker b5(ui->RedspinBox);
QSignalBlocker b6(ui->GreenspinBox);
QSignalBlocker b7(ui->BluespinBox);
QSignalBlocker b8(ui->AlphaspinBox);
ui->RedspinBox->setValue(newColor.hsvHue());
ui->GreenspinBox->setValue(qRound(newColor.hsvSaturation() / 2.55));
ui->BluespinBox->setValue(qRound(newColor.value() / 2.55));
ui->AlphaspinBox->setValue(qRound(newColor.alpha() / 2.55));
}
mCurrentColor = newColor;
QPalette p1 = ui->colorWrapper->palette(), p2 = ui->color->palette();
p1.setBrush(QPalette::Background, QBrush(QImage(":/background/checkerboard.png")));
p2.setColor(QPalette::Background, mCurrentColor);
ui->colorWrapper->setPalette(p1);
ui->color->setPalette(p2);
update();
}
int main()
{
tQ4 a4( 1.1 );
tQ4 b4( 1 );
tQ12 a12( 3.3 );
tQ12 b12( 3 );
tQ18 a18;
double ad;
double bd;
tQ8 a8( -2.3 );
tQ8 b8( 2 );
tQ8 c8( Q8CONST( -2,3 ) );
tQ8 d8( a8 );
tQ8 e8( a4 );
// tQ8 f8( a12 ); // Warning: left shift count is negative
tQ8 g8( a12.roundedTo< tQ8 >() );
tQ8 h8( a12.roundedTo< 8 >() );
// a8 = a4.roundedTo( h8 ); //Warning: left/right shift is negative
a8 = 1;
a8 = -2;
a8 = 3;
a8 = Q8CONST( 3,001 );
a8 = tQ8( 3.001 );
a8 = tQ8::truncated( 3.001 );
a8 = tQ8::rounded( 3.001 );
a8.setTruncated( 3.2 );
a8.setRounded( 3.3 );
a8 = tQ8( 123, 8 );
a8 = tQ8::create( 123 << 8 );
a8 = a4;
a8 = a8;
// a8 = a12; // Warning: left shift count is negative
a8 = a12.roundedTo< tQ8 >();
a8 = a12.roundedTo( a8 );
a8.setRounded( a12 );
a8 = -a4;
a8 = -a8;
a8 += 3;
a8 += 4u;
a8 += 5l;
a8 += 6lu;
a8 += tQ8( 3.2 );
a8 += truncatedTo( a8, 3.3 );
a8 += roundedTo( a8, 3.4 );
a8 += a4;
// a8 += a12; // Warning: left shift count is negative
a8 += a12.roundedTo< tQ8 >();
a8 += a12.roundedTo( a8 );
a8 = a8 + 2;
a8 = 3 + a8;
a8 = a8 + a4;
// a8 = a4 + a8; // Warning: left shift count is negative
a8 -= 3;
a8 -= 4u;
a8 -= 5l;
a8 -= 6lu;
a8 -= roundedTo< tQ8::cQBits >( 3.2 );
a8 -= roundedTo( a8, 3.3 );
a8 -= a4;
// a8 -= a12; // Warning: left shift count is negative
a8 -= a12.roundedTo< tQ8 >();
a8 -= a12.roundedTo( a8 );
a8 = a8 - 2;
a8 = 3 - a8;
a8 = a8 - a4;
// a8 = a4 - a8; // Warning: left shift count is negative
a8 *= 3;
a8 *= 4u;
a8 *= 5l;
a8 *= 6lu;
// a8 *= 3.2; // Warning: converting to int from double
a8 *= a4;
a8 *= a12;
a8 = a8 * 2;
a8 = 3 * a8;
a12 = a8 * a4;
a12 = a4 * a8;
a8 /= 3;
a8 /= 4u;
a8 /= 5l;
a8 /= 6lu;
// a8 /= 3.2; // Warning: converting to int from double
a8 /= a4; // Note: possible overflow due to pre-shifting "(a8 << 4) / a4"
// a8 /= a12; // Warning: left shift count is negative
a8 = a8.increasedBy( a12 ) / a12;
a8 = a8 / 2;
// a8 = 3 / a8; // Error: no match for 'operator/'
a8 = tQ16( 3 ) / a8;
a12 = a8 / a4;
a12 = a4 / a8;
a8 == 3;
a8 == 4u;
a8 == 5l;
a8 == 6lu;
a8 == tQ8( 3.2 );
a8 == truncatedTo( a8, 3.3 );
a8 == roundedTo( a8, 3.4 );
a8 == a4;
// a8 == a12; // Warning: left shift count is negative
a8 == a12.roundedTo< tQ8 >();
a8 == a12.roundedTo( a8 );
3 == a8;
int(4u) == a8;
int(5l) == a8;
int(6lu) == a8;
a8 < 3;
a8 < 4u;
a8 < 5l;
a8 < 6lu;
a8 < tQ8( 3.2 );
a8 < a4;
// a8 < a12; // Warning: left shift count is negative
3 < a8;
int(4u) < a8;
int(5l) < a8;
int(6lu) < a8;
a8 > 3;
a8 > 4u;
a8 > 5l;
a8 > 6lu;
a8 > tQ8( 3.2 );
a8 > a4;
// a8 > a12; // Warning: left shift count is negative
3 > a8;
int(4u) > a8;
int(5l) > a8;
int(6lu) > a8;
!a8;
int intPart = a8.intPart();
int fracPart = a8.fracPart();
int fracPlaces = a8.fracPlaces( 3 );
unsigned abs = a8.absolute();
ad = a8.toDouble();
a8 = ad;
// a8.set( ad ); // Warning: conversion from int to double, possible loss of data
a8.setRounded( ad );
a8 = truncatedTo( a8, ad );
a8 = truncatedTo<8>( ad );
a8 = truncatedTo<tQ8>( ad );
// tBigQ36 aB36( 123567890 ); // Error: ambiguous
tBigQ36 aB36( 123567890ll );
tBigQ36 bB36( a8 );
aB36 = tBigQ18( a18 ) * a18;
}
