Computer.cpp 25 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405
  1. // StringResolution.cpp: implementation of the CComputer class.
  2. #include "stdafx.h"
  3. #include "computer.h"
  4. #include <math.h>
  5. #include "kernel.h"
  6. #ifdef _DEBUG
  7. #undef THIS_FILE
  8. static char THIS_FILE[]=__FILE__;
  9. #define new DEBUG_NEW
  10. #endif
  11. extern int MyRound(double value);
  12. //////////////////////////////////////////////////////////////////////
  13. // Construction/Destruction
  14. //////////////////////////////////////////////////////////////////////
  15. CComputer::CComputer(char*formula)
  16. :m_oprandNum(0),m_oprandANum(0),m_operatorNum(0)
  17. {
  18. m_operator = 0;
  19. m_oprand = 0;
  20. m_oprandA = 0;
  21. if (formula)
  22. {
  23. m_formula = formula;
  24. Initialize();
  25. }
  26. }
  27. CComputer::~CComputer()
  28. {
  29. if (m_operator)
  30. {
  31. delete[]m_operator;
  32. }
  33. if(m_oprand)
  34. {
  35. delete[]m_oprand;
  36. }
  37. if(m_oprandA)
  38. {
  39. delete[]m_oprandA;
  40. }
  41. }
  42. void CComputer::SetFormula(CString formula)
  43. {
  44. if (!formula)
  45. {
  46. return;
  47. }
  48. m_formula = formula;
  49. if (m_operator)
  50. {
  51. delete[]m_operator;
  52. m_operator = 0;
  53. }
  54. if (m_oprand)
  55. {
  56. delete[]m_oprand;
  57. m_oprand = 0;
  58. }
  59. if (m_oprandA)
  60. {
  61. delete[]m_oprandA;
  62. m_oprandA = 0;
  63. }
  64. m_oprandNum = 0,m_oprandANum = 0,m_operatorNum = 0;
  65. Initialize();
  66. }
  67. int CComputer::IsFormula()
  68. {
  69. stack<char> charStack;
  70. int i,num = m_formula.GetLength();
  71. char notChar[] = {';','\'',':',' ','[',']','{','}','\\','|',',','\"','&','%','$','@','#','!','`','~','?'};
  72. int notNum = sizeof notChar;
  73. for (i=0;i<num;i++)
  74. {
  75. for (int j=0;j<notNum;j++)
  76. {
  77. if (m_formula[i]==notChar[j])
  78. {
  79. CString s;
  80. s.Format("The %dth character,\"%c\" is invalidated!",i+1,m_formula[i]);
  81. return -i-1;//the ith symbol is invalidating.
  82. }
  83. }
  84. }
  85. for (i=0;i<num;i++)
  86. {
  87. if (m_formula[i]=='(')
  88. {
  89. charStack.push('(');
  90. }
  91. if (m_formula[i]==')')
  92. {
  93. if (charStack.empty())
  94. {
  95. return 1;//right bracket if more.
  96. }
  97. else
  98. {
  99. charStack.pop();
  100. }
  101. }
  102. }
  103. if (!charStack.empty())
  104. {
  105. return 2;//left bracket is more.
  106. }
  107. return 0;
  108. }
  109. BOOL CComputer::GetStack(OperatorStack &Operator, OperandStack &Oprand)
  110. {
  111. if (IsFormula())
  112. {
  113. return FALSE;//illogicality return
  114. }
  115. BOOL bRet = TRUE;
  116. EmptyStack(Operator);
  117. EmptyStack(Oprand);
  118. CString string = m_formula;
  119. bRet = bRet&&GetOperatorStack(Operator,string);
  120. bRet = bRet&&GetOperandStack(Oprand,string);
  121. return bRet;
  122. }
  123. BOOL CComputer::Initialize()
  124. {
  125. BOOL bRet = FALSE;
  126. OperatorStack Op; OperandStack Od;
  127. bRet = GetStack(Op,Od);
  128. if (!bRet)
  129. {
  130. EmptyStack(Op);
  131. EmptyStack(Od);
  132. return FALSE;
  133. }
  134. m_oprandNum = (int)Od.size(),m_operatorNum = (int)Op.size();
  135. if (m_operatorNum)
  136. {
  137. m_operator = new COperator[m_operatorNum];
  138. }
  139. if (m_oprandNum)
  140. {
  141. m_oprand = new COperand[m_oprandNum];
  142. }
  143. int i;
  144. for (i=0;i<m_operatorNum;i++)
  145. {
  146. COperator*op = Op.top();
  147. m_operator[m_operatorNum-i-1] = *op;
  148. Op.pop();
  149. delete op;
  150. }
  151. for (i=0;i<m_oprandNum;i++)
  152. {
  153. COperand*od = Od.top();
  154. m_oprand[m_oprandNum-i-1] = *od;
  155. Od.pop();
  156. delete od;
  157. }
  158. m_oprandA = new COperand[m_oprandNum];
  159. BOOL IsIn = FALSE;
  160. for (i=0;i<m_oprandNum;i++)
  161. {
  162. for (int j=0;j<m_oprandANum;j++)
  163. {
  164. if (m_oprand[i]==m_oprandA[j])
  165. {
  166. IsIn = TRUE;
  167. break;
  168. }
  169. }
  170. if (!IsIn&&!m_oprand[i].m_IsConst)
  171. {
  172. m_oprandA[m_oprandANum] = m_oprand[i];
  173. m_oprandANum++;
  174. }
  175. IsIn = FALSE;
  176. }
  177. return TRUE;
  178. }
  179. double CComputer::Computer(OperatorStack &Operator, OperandStack &Oprand)
  180. {
  181. double value =0.0;
  182. if (Operator.empty())
  183. {
  184. if (Oprand.size()==1)
  185. {
  186. COperand* od = Oprand.top();
  187. value = atof(od->m_name);
  188. delete od;
  189. return value;
  190. }
  191. else
  192. {
  193. while (!Oprand.empty())
  194. {
  195. COperand*od = Oprand.top();
  196. Oprand.pop();
  197. delete od;
  198. }
  199. return BIGNUMBER;
  200. }
  201. }
  202. OperatorStack tmpOO;
  203. OperandStack tmpOD;
  204. COperator* op = 0,*op1 = 0;
  205. COperand *oprand = 0,*oprand1 = 0;
  206. op = Operator.top();
  207. Operator.pop();
  208. if (!Operator.empty())
  209. {
  210. op1 = Operator.top();
  211. }
  212. while (op1&&(op1->m_level>op->m_level))
  213. {
  214. tmpOO.push(op);
  215. if (op->m_type==BINARY)
  216. {
  217. if (!Oprand.empty())
  218. {
  219. oprand = Oprand.top();
  220. Oprand.pop();
  221. tmpOD.push(oprand);
  222. }
  223. }
  224. op = op1;
  225. Operator.pop();
  226. if (!Operator.empty())
  227. {
  228. op1 = Operator.top();
  229. }
  230. else
  231. {
  232. op1 = 0;
  233. }
  234. }
  235. if (op->m_type==UNARY)
  236. {
  237. if (Oprand.empty())
  238. {
  239. return BIGNUMBER;
  240. }
  241. oprand = Oprand.top();
  242. double x = computing(op,oprand);
  243. oprand->m_name.Format("%g",x);
  244. }
  245. else
  246. {
  247. if (Oprand.empty())
  248. {
  249. return BIGNUMBER;
  250. }
  251. oprand1 = Oprand.top();
  252. Oprand.pop();
  253. if (Oprand.empty())
  254. {
  255. return BIGNUMBER;
  256. }
  257. oprand = Oprand.top();
  258. double x = computing(op,oprand1,oprand);
  259. oprand->m_name.Format("%g",x);
  260. delete oprand1;
  261. }
  262. delete op;
  263. while (!tmpOO.empty())
  264. {
  265. op = tmpOO.top();
  266. tmpOO.pop();
  267. Operator.push(op);
  268. }
  269. while (!tmpOD.empty())
  270. {
  271. oprand = tmpOD.top();
  272. tmpOD.pop();
  273. Oprand.push(oprand);
  274. }
  275. return Computer(Operator,Oprand);
  276. }
  277. double CComputer::computer(double variantValue[], int num)
  278. {
  279. double value = 0.0;
  280. int i;
  281. if (num<m_oprandANum)
  282. {
  283. //LOG4C((LOG_NOTICE, "computer error"));
  284. return BIGNUMBER;
  285. }
  286. OperatorStack Operator;
  287. OperandStack Oprand;
  288. for (i=0;i<m_operatorNum;i++)
  289. {
  290. COperator*op = new COperator;
  291. *op = m_operator[m_operatorNum-i-1];
  292. Operator.push(op);
  293. }
  294. for (i=0;i<m_oprandNum;i++)
  295. {
  296. COperand*od = new COperand;
  297. *od = m_oprand[m_oprandNum-i-1];
  298. for(int j=0;j<m_oprandANum;j++)
  299. {
  300. if (*od==m_oprandA[j])
  301. {
  302. od->m_name.Format("%g",variantValue[j]);
  303. }
  304. }
  305. Oprand.push(od);
  306. }
  307. value = Computer(Operator,Oprand);
  308. return value;
  309. }
  310. CString CComputer::GetErrorInformation()
  311. {
  312. CString value;
  313. return value;
  314. }
  315. BOOL CComputer::EmptyStack(OperatorStack Op)
  316. {
  317. while(!Op.empty())
  318. {
  319. COperator*op = Op.top();
  320. Op.pop();
  321. delete op;
  322. }
  323. return TRUE;
  324. }
  325. BOOL CComputer::EmptyStack(OperandStack Od)
  326. {
  327. while (!Od.empty())
  328. {
  329. COperand*od = Od.top();
  330. Od.pop();
  331. delete od;
  332. }
  333. return TRUE;
  334. }
  335. BOOL CComputer::GetOperatorStack(OperatorStack &Operator, CString &string)
  336. {
  337. BOOL bRet = TRUE;
  338. int num = string.GetLength();
  339. int i = 0;
  340. int level = 0;
  341. while (i<num)
  342. {
  343. if (string[i]=='(')
  344. {
  345. level+=LEVELS;
  346. string.SetAt(i,'#');
  347. i++;
  348. }
  349. else if (string[i]==')')
  350. {
  351. level-=LEVELS;
  352. string.SetAt(i,'@');
  353. i++;
  354. }
  355. else if (string[i]=='+'||string[i]=='-')
  356. {
  357. COperator* op=new COperator;
  358. op->m_level = level;
  359. op->m_operator = string.Mid(i,1);
  360. op->m_startIndex = i;
  361. if(i==0||string[i-1]=='#')
  362. {
  363. op->m_type = UNARY;
  364. }
  365. else
  366. {
  367. op->m_type = BINARY;
  368. }
  369. Operator.push(op);
  370. string.SetAt(i,'@');
  371. i++;
  372. }
  373. else if (string[i]=='*'||string[i]=='/')
  374. {
  375. COperator* op = new COperator;
  376. op->m_level = level+1;
  377. op->m_operator = string.Mid(i,1);
  378. op->m_startIndex = i;
  379. op->m_type = BINARY;
  380. Operator.push(op);
  381. string.SetAt(i,'@');
  382. i++;
  383. }
  384. else if (string[i]=='^')
  385. {
  386. COperator* op=new COperator;
  387. op->m_level = level+2;
  388. op->m_operator = string.Mid(i,1);
  389. op->m_startIndex = i;
  390. op->m_type = BINARY;
  391. Operator.push(op);
  392. string.SetAt(i,'@');
  393. i++;
  394. }
  395. else if (string.Mid(i,4)=="SQRT")
  396. {
  397. COperator* op=new COperator;
  398. op->m_level = 3+level;
  399. op->m_operator = "SQRT";
  400. op->m_startIndex = i;
  401. op->m_type = UNARY;
  402. Operator.push(op);
  403. string.SetAt(i,'@');string.SetAt(i+1,'@');string.SetAt(i+2,'@');string.SetAt(i+3,'@');
  404. i+=3;
  405. }
  406. else if (string.Mid(i,3)=="LOG")
  407. {
  408. COperator* op = new COperator;
  409. op->m_level = 3+level;
  410. op->m_operator = "LOG";
  411. op->m_startIndex = i;
  412. op->m_type = UNARY;
  413. Operator.push(op);
  414. string.SetAt(i,'@');string.SetAt(i+1,'@');string.SetAt(i+2,'@');
  415. i+=3;
  416. }
  417. else if (string.Mid(i,3)=="SIN")
  418. {
  419. COperator* op = new COperator;
  420. op->m_level = 3+level;
  421. op->m_operator = "SIN";
  422. op->m_startIndex = i;
  423. op->m_type = UNARY;
  424. Operator.push(op);
  425. string.SetAt(i,'@');string.SetAt(i+1,'@');string.SetAt(i+2,'@');
  426. i+=3;
  427. }
  428. else if (string.Mid(i,3)=="COS")
  429. {
  430. COperator* op = new COperator;
  431. op->m_level = 3+level;
  432. op->m_operator = "COS";
  433. op->m_startIndex = i;
  434. op->m_type = UNARY;
  435. Operator.push(op);
  436. string.SetAt(i,'@');string.SetAt(i+1,'@');string.SetAt(i+2,'@');
  437. i+=3;
  438. }
  439. else if (string.Mid(i,3)=="TAN")
  440. {
  441. COperator* op=new COperator;
  442. op->m_level = 3+level;
  443. op->m_operator = "TAN";
  444. op->m_startIndex = i;
  445. op->m_type = UNARY;
  446. Operator.push(op);
  447. string.SetAt(i,'@');string.SetAt(i+1,'@');string.SetAt(i+2,'@');
  448. i+=3;
  449. }
  450. else if (string.Mid(i,3)=="COT")
  451. {
  452. COperator* op = new COperator;
  453. op->m_level = 3+level;
  454. op->m_operator = "COT";
  455. op->m_startIndex = i;
  456. op->m_type = UNARY;
  457. Operator.push(op);
  458. string.SetAt(i,'@');string.SetAt(i+1,'@');string.SetAt(i+2,'@');
  459. i+=3;
  460. }
  461. else if (string.Mid(i,4)=="ASIN")
  462. {
  463. COperator* op = new COperator;
  464. op->m_level = 3+level;
  465. op->m_operator = "ASIN";
  466. op->m_startIndex = i;
  467. op->m_type = UNARY;
  468. Operator.push(op);
  469. string.SetAt(i,'@');string.SetAt(i+1,'@');string.SetAt(i+2,'@');string.SetAt(i+3,'@');
  470. i+=3;
  471. }
  472. else if (string.Mid(i,4)=="ACOS")
  473. {
  474. COperator* op = new COperator;
  475. op->m_level = 3+level;
  476. op->m_operator = "ACOS";
  477. op->m_startIndex = i;
  478. op->m_type = UNARY;
  479. Operator.push(op);
  480. string.SetAt(i,'@');string.SetAt(i+1,'@');string.SetAt(i+2,'@');string.SetAt(i+3,'@');
  481. i+=3;
  482. }
  483. else if (string.Mid(i,4)=="ATAN")
  484. {
  485. COperator* op = new COperator;
  486. op->m_level = 3+level;
  487. op->m_operator = "ATAN";
  488. op->m_startIndex = i;
  489. op->m_type = UNARY;
  490. Operator.push(op);
  491. string.SetAt(i,'@');string.SetAt(i+1,'@');string.SetAt(i+2,'@');string.SetAt(i+3,'@');
  492. i+=3;
  493. }
  494. else
  495. {
  496. i++;
  497. }
  498. }
  499. return bRet;
  500. }
  501. BOOL CComputer::GetOperandStack(OperandStack &Oprand, CString &string)
  502. {
  503. int i = 0;
  504. int num = string.GetLength();
  505. while (i<num)
  506. {
  507. if (string[i]=='#'||string[i]=='@')
  508. {
  509. i++;
  510. }
  511. else
  512. {
  513. COperand * oprand=new COperand;
  514. if(isdigit(string[i]))
  515. {
  516. oprand->m_IsConst = TRUE;
  517. }
  518. oprand->m_startIndex = i;
  519. BOOL HasPoint = FALSE;
  520. while (i<num&&string[i]!='#'&&string[i]!='@')
  521. {
  522. if (string[i]=='.')
  523. {
  524. if (HasPoint)
  525. {
  526. if( oprand )
  527. delete oprand;
  528. return FALSE;
  529. }
  530. else
  531. {
  532. HasPoint=TRUE;
  533. }
  534. }
  535. if (oprand->m_IsConst&&!isdigit(string[i])&&(string[i]!='.'))
  536. {
  537. CString s;
  538. s.Format("Variant cann't start with digital (%d in expression)!",i+1-oprand->m_name.GetLength());
  539. if( oprand )
  540. delete oprand;
  541. return FALSE;
  542. }
  543. oprand->m_name+=string.Mid(i,1);
  544. i++;
  545. }
  546. Oprand.push(oprand);
  547. }
  548. }
  549. return TRUE;
  550. }
  551. int CComputer::GetErrorNumber()
  552. {
  553. return 0;
  554. }
  555. double CComputer::computing(const COperator*op,const COperand*oprand)
  556. {
  557. double x = atof(oprand->m_name);
  558. if (op->m_operator=="-")
  559. {
  560. x = -x;
  561. }
  562. else if (op->m_operator=="LOG")
  563. {
  564. if(x>0)
  565. {
  566. x = log(x);
  567. }
  568. else
  569. {
  570. x = BIGNUMBER;
  571. }
  572. }
  573. else if (op->m_operator=="SQRT")
  574. {
  575. if ( x>=0 )
  576. {
  577. x = sqrt(x);
  578. }
  579. else
  580. {
  581. x = BIGNUMBER;
  582. }
  583. }
  584. else if (op->m_operator=="SIN")
  585. {
  586. x = sin(x);
  587. }
  588. else if (op->m_operator=="COS")
  589. {
  590. x = cos(x);
  591. }
  592. else if (op->m_operator=="TAN")
  593. {
  594. x = tan(x);
  595. }
  596. else if (op->m_operator=="COT")
  597. {
  598. if(fabs(sin(x))>DERROR)
  599. {
  600. x = cos(x)/sin(x);
  601. }
  602. else
  603. {
  604. x = BIGNUMBER;
  605. }
  606. }
  607. else if (op->m_operator=="ASIN")
  608. {
  609. x = asin(x);
  610. }
  611. else if (op->m_operator=="ACOS")
  612. {
  613. x = acos(x);
  614. }
  615. else if (op->m_operator=="ATAN")
  616. {
  617. x = atan(x);
  618. }
  619. return x;
  620. }
  621. double CComputer::computing(const COperator*op,const COperand*Loprand,const COperand*Roprand)
  622. {
  623. double x = BIGNUMBER;
  624. switch(op->m_operator[0])
  625. {
  626. case '+':
  627. x = atof(Loprand->m_name)+atof(Roprand->m_name);
  628. break;
  629. case '-':
  630. x = atof(Loprand->m_name)-atof(Roprand->m_name);
  631. break;
  632. case '*':
  633. x = atof(Loprand->m_name)*atof(Roprand->m_name);
  634. break;
  635. case '/':
  636. {
  637. double y = atof(Roprand->m_name);
  638. x = atof(Loprand->m_name);
  639. if (fabs(y)>DERROR)
  640. {
  641. x = x/y;
  642. }
  643. else
  644. {
  645. x = BIGNUMBER;
  646. }
  647. }
  648. break;
  649. case '^':
  650. {
  651. double y = atof(Roprand->m_name);
  652. x = atof(Loprand->m_name);
  653. x = pow(x,y);
  654. }
  655. break;
  656. }
  657. return x;
  658. }
  659. CString CComputer::GetDigitalString(double* variantValue,int num)
  660. {
  661. CString value=m_formula;
  662. if (num>=m_oprandANum)
  663. {
  664. int i,j;
  665. CString* ppchar;
  666. ppchar=new CString[m_oprandNum+1];
  667. for (i=0;i<=m_oprandNum;i++)
  668. {
  669. if (i==0)
  670. {
  671. ppchar[0]=m_formula.Left(m_oprand[0].m_startIndex);
  672. }
  673. else if (i<m_oprandNum)
  674. {
  675. WORD start=m_oprand[i-1].m_startIndex+m_oprand[i-1].m_name.GetLength();
  676. WORD length=m_oprand[i].m_startIndex-start;
  677. ppchar[i]=m_formula.Mid(start,length);
  678. }
  679. else
  680. {
  681. WORD start=m_oprand[i-1].m_startIndex+m_oprand[i-1].m_name.GetLength();
  682. ppchar[i]=m_formula.Mid(start);
  683. }
  684. }
  685. CString* digitchar = new CString[m_oprandNum];
  686. for (i=0;i<m_oprandNum;i++)
  687. {
  688. if (m_oprand[i].m_IsConst)
  689. {
  690. digitchar[i]=m_oprand[i].m_name;
  691. }
  692. else
  693. {
  694. for (j=0;j<m_oprandANum;j++)
  695. {
  696. if (m_oprand[i]==m_oprandA[j])
  697. {
  698. if (variantValue[j]<0)
  699. {
  700. digitchar[i].Format("(%g)",variantValue[j]);
  701. }
  702. else
  703. {
  704. digitchar[i].Format("%g",variantValue[j]);
  705. }
  706. } // end if
  707. } // end for
  708. } // end else
  709. }
  710. value = ppchar[0];
  711. for (i=0;i<m_oprandNum;i++)
  712. {
  713. value += digitchar[i]+ppchar[i+1];
  714. }
  715. delete[]ppchar;
  716. delete[]digitchar;
  717. }
  718. return value;
  719. }
  720. BOOL CComputer::ExpressionIsError()
  721. {
  722. #ifndef _ERROR_INFO_H_
  723. return 0;
  724. #else
  725. GET_EXPRESSION_ERROR
  726. #endif
  727. }
  728. const COperand* CComputer::GetVariantTable()
  729. {
  730. return m_oprandA;
  731. }
  732. COperator::COperator():m_startIndex(0),m_level(0),m_type(BINARY)
  733. {
  734. }
  735. COperator::~COperator()
  736. {
  737. }
  738. COperand::COperand():m_startIndex(0)
  739. {
  740. m_IsConst = FALSE;
  741. }
  742. COperand::~COperand()
  743. {
  744. }
  745. BOOL COperand::operator ==(const COperand & od)
  746. {
  747. BOOL bRet=TRUE;
  748. bRet = (m_IsConst==od.m_IsConst);
  749. bRet = (bRet&&(m_name==od.m_name));
  750. return bRet;
  751. }
  752. void CComputer::Destroy()
  753. {
  754. if (m_operator)
  755. {
  756. delete[]m_operator;
  757. m_operator = 0;
  758. }
  759. if (m_oprand)
  760. {
  761. delete[]m_oprand;
  762. m_oprand = 0 ;
  763. }
  764. if (m_oprandA)
  765. {
  766. delete[]m_oprandA;
  767. m_oprandA = 0;
  768. }
  769. m_oprandNum=0;
  770. m_oprandANum=0;
  771. m_operatorNum=0;
  772. }
  773. BOOL CRealComputer::GetOperatorStack(OperatorStack&Operator,CString &string)
  774. {
  775. BOOL bRet = TRUE;
  776. int num = string.GetLength();
  777. int i = 0;
  778. int level = 0;
  779. while (i<num)
  780. {
  781. if (string[i]=='(')
  782. {
  783. level+=LEVELS;
  784. string.SetAt(i,'#');
  785. i++;
  786. }
  787. else if (string[i]==')')
  788. {
  789. level-=LEVELS;
  790. string.SetAt(i,'@');
  791. i++;
  792. }
  793. else if (string[i]=='+'||string[i]=='-')
  794. {
  795. COperator* op = new COperator;
  796. op->m_level = level;
  797. op->m_operator = string.Mid(i,1);
  798. op->m_startIndex = i;
  799. if(i==0||string[i-1]=='#')
  800. {
  801. op->m_type=UNARY;
  802. }
  803. else
  804. {
  805. op->m_type = BINARY;
  806. }
  807. Operator.push(op);
  808. string.SetAt(i,'@');
  809. i++;
  810. }
  811. else if (string[i]=='*'||string[i]=='/')
  812. {
  813. COperator* op = new COperator;
  814. op->m_level = level+1;
  815. op->m_operator = string.Mid(i,1);
  816. op->m_startIndex = i;
  817. op->m_type = BINARY;
  818. Operator.push(op);
  819. string.SetAt(i,'@');
  820. i++;
  821. }
  822. else if (string[i]=='^')
  823. {
  824. COperator* op = new COperator;
  825. op->m_level = level+2;
  826. op->m_operator = string.Mid(i,1);
  827. op->m_startIndex = i;
  828. op->m_type = BINARY;
  829. Operator.push(op);
  830. string.SetAt(i,'@');
  831. i++;
  832. }
  833. else if (string.Mid(i,4)=="SQRT")
  834. {
  835. COperator* op = new COperator;
  836. op->m_level = 3+level;
  837. op->m_operator = "SQRT";
  838. op->m_startIndex = i;
  839. op->m_type = UNARY;
  840. Operator.push(op);
  841. string.SetAt(i,'@');string.SetAt(i+1,'@');string.SetAt(i+2,'@');string.SetAt(i+3,'@');
  842. i+=4;
  843. }
  844. else if (string.Mid(i,3)=="LOG")
  845. {
  846. COperator* op = new COperator;
  847. op->m_level = 3+level;
  848. op->m_operator = "LOG";
  849. op->m_startIndex = i;
  850. op->m_type = UNARY;
  851. Operator.push(op);
  852. string.SetAt(i,'@');string.SetAt(i+1,'@');string.SetAt(i+2,'@');
  853. i+=3;
  854. }
  855. else if (string.Mid(i,3)=="SIN")
  856. {
  857. COperator* op = new COperator;
  858. op->m_level = 3+level;
  859. op->m_operator = "SIN";
  860. op->m_startIndex = i;
  861. op->m_type = UNARY;
  862. Operator.push(op);
  863. string.SetAt(i,'@');string.SetAt(i+1,'@');string.SetAt(i+2,'@');
  864. i+=3;
  865. }
  866. else if (string.Mid(i,3)=="COS")
  867. {
  868. COperator* op = new COperator;
  869. op->m_level = 3+level;
  870. op->m_operator = "COS";
  871. op->m_startIndex = i;
  872. op->m_type = UNARY;
  873. Operator.push(op);
  874. string.SetAt(i,'@');string.SetAt(i+1,'@');string.SetAt(i+2,'@');
  875. i+=3;
  876. }
  877. else if (string.Mid(i,3)=="TAN")
  878. {
  879. COperator* op = new COperator;
  880. op->m_level = 3+level;
  881. op->m_operator = "TAN";
  882. op->m_startIndex = i;
  883. op->m_type = UNARY;
  884. Operator.push(op);
  885. string.SetAt(i,'@');string.SetAt(i+1,'@');string.SetAt(i+2,'@');
  886. i+=3;
  887. }
  888. else if (string.Mid(i,3)=="COT")
  889. {
  890. COperator* op = new COperator;
  891. op->m_level = 3+level;
  892. op->m_operator = "COT";
  893. op->m_startIndex = i;
  894. op->m_type = UNARY;
  895. Operator.push(op);
  896. string.SetAt(i,'@');string.SetAt(i+1,'@');string.SetAt(i+2,'@');
  897. i+=3;
  898. }
  899. else if (string.Mid(i,4)=="ASIN")
  900. {
  901. COperator* op = new COperator;
  902. op->m_level = 3+level;
  903. op->m_operator = "ASIN";
  904. op->m_startIndex = i;
  905. op->m_type = UNARY;
  906. Operator.push(op);
  907. string.SetAt(i,'@');string.SetAt(i+1,'@');string.SetAt(i+2,'@');string.SetAt(i+3,'@');
  908. i+=4;
  909. }
  910. else if (string.Mid(i,4)=="ACOS")
  911. {
  912. COperator* op = new COperator;
  913. op->m_level = 3+level;
  914. op->m_operator = "ACOS";
  915. op->m_startIndex = i;
  916. op->m_type = UNARY;
  917. Operator.push(op);
  918. string.SetAt(i,'@');string.SetAt(i+1,'@');string.SetAt(i+2,'@');string.SetAt(i+3,'@');
  919. i+=4;
  920. }
  921. else if (string.Mid(i,4)=="ATAN")
  922. {
  923. COperator* op = new COperator;
  924. op->m_level = 3+level;
  925. op->m_operator = "ATAN";
  926. op->m_startIndex = i;
  927. op->m_type = UNARY;
  928. Operator.push(op);
  929. string.SetAt(i,'@');string.SetAt(i+1,'@');string.SetAt(i+2,'@');string.SetAt(i+3,'@');
  930. i+=4;
  931. }
  932. else if (string.Mid(i,3)=="ABS")
  933. {
  934. COperator* op = new COperator;
  935. op->m_level = 3+level;
  936. op->m_operator = "ABS";
  937. op->m_startIndex = i;
  938. op->m_type = UNARY;
  939. Operator.push(op);
  940. string.SetAt(i,'@');string.SetAt(i+1,'@');string.SetAt(i+2,'@');
  941. i+=3;
  942. }
  943. else if (string.Mid(i,3)=="MOD")
  944. {
  945. COperator* op = new COperator;
  946. op->m_level = 3+level;
  947. op->m_operator = "MOD";
  948. op->m_startIndex = i;
  949. op->m_type = BINARY;
  950. Operator.push(op);
  951. string.SetAt(i,'@');string.SetAt(i+1,'@');string.SetAt(i+2,'@');
  952. i+=3;
  953. }
  954. else if (string.Mid(i,3)=="RND")
  955. {
  956. COperator* op = new COperator;
  957. op->m_level = 3+level;
  958. op->m_operator = "RND";
  959. op->m_startIndex = i;
  960. op->m_type = UNARY;
  961. Operator.push(op);
  962. string.SetAt(i,'@');string.SetAt(i+1,'@');string.SetAt(i+2,'@');
  963. i+=3;
  964. }
  965. else if (string.Mid(i,2)=="==")
  966. {
  967. COperator* op = new COperator;
  968. op->m_level=3+level;
  969. op->m_operator = "==";
  970. op->m_startIndex = i;
  971. op->m_type = BINARY;
  972. Operator.push(op);
  973. string.SetAt(i,'@');string.SetAt(i+1,'@');
  974. i+=2;
  975. }
  976. else if (string.Mid(i,2)==">=")
  977. {
  978. COperator* op = new COperator;
  979. op->m_level = 3+level;
  980. op->m_operator = ">=";
  981. op->m_startIndex = i;
  982. op->m_type = BINARY;
  983. Operator.push(op);
  984. string.SetAt(i,'@');string.SetAt(i+1,'@');
  985. i+=2;
  986. }
  987. else if (string.Mid(i,2)=="<=")
  988. {
  989. COperator* op = new COperator;
  990. op->m_level = 3+level;
  991. op->m_operator = "<=";
  992. op->m_startIndex = i;
  993. op->m_type = BINARY;
  994. Operator.push(op);
  995. string.SetAt(i,'@');string.SetAt(i+1,'@');
  996. i+=2;
  997. }
  998. else if (string.Mid(i,2)=="<>")
  999. {
  1000. COperator* op = new COperator;
  1001. op->m_level = 3+level;
  1002. op->m_operator = "<>";
  1003. op->m_startIndex = i;
  1004. op->m_type = BINARY;
  1005. Operator.push(op);
  1006. string.SetAt(i,'@');string.SetAt(i+1,'@');
  1007. i+=2;
  1008. }
  1009. else if (string[i]=='>')
  1010. {
  1011. COperator* op = new COperator;
  1012. op->m_level = 3+level;
  1013. op->m_operator = ">";
  1014. op->m_startIndex = i;
  1015. op->m_type = BINARY;
  1016. Operator.push(op);
  1017. string.SetAt(i,'@');
  1018. i++;
  1019. }
  1020. else if (string[i]=='<')
  1021. {
  1022. COperator* op = new COperator;
  1023. op->m_level = 3+level;
  1024. op->m_operator = "<";
  1025. op->m_startIndex = i;
  1026. op->m_type = BINARY;
  1027. Operator.push(op);
  1028. string.SetAt(i,'@');
  1029. i++;
  1030. }
  1031. else if (string.Mid(i,3)=="NOT")
  1032. {
  1033. COperator* op = new COperator;
  1034. op->m_level = 3+level;
  1035. op->m_operator = "NOT";
  1036. op->m_startIndex = i;
  1037. op->m_type = UNARY;
  1038. Operator.push(op);
  1039. string.SetAt(i,'@');string.SetAt(i+1,'@');string.SetAt(i+2,'@');
  1040. i+=3;
  1041. }
  1042. else if (string.Mid(i,3)=="AND")
  1043. {
  1044. COperator* op = new COperator;
  1045. op->m_level = 3+level;
  1046. op->m_operator = "AND";
  1047. op->m_startIndex = i;
  1048. op->m_type = BINARY;
  1049. Operator.push(op);
  1050. string.SetAt(i,'@');string.SetAt(i+1,'@');string.SetAt(i+2,'@');
  1051. i+=3;
  1052. }
  1053. else if (string.Mid(i,2)=="OR")
  1054. {
  1055. COperator* op = new COperator;
  1056. op->m_level = 3+level;
  1057. op->m_operator = "OR";
  1058. op->m_startIndex = i;
  1059. op->m_type = BINARY;
  1060. Operator.push(op);
  1061. string.SetAt(i,'@');string.SetAt(i+1,'@');
  1062. i+=2;
  1063. }
  1064. else if (string.Mid(i,3)=="XOR")
  1065. {
  1066. COperator* op = new COperator;
  1067. op->m_level = 3+level;
  1068. op->m_operator = "XOR";
  1069. op->m_startIndex = i;
  1070. op->m_type = BINARY;
  1071. Operator.push(op);
  1072. string.SetAt(i,'@');string.SetAt(i+1,'@');string.SetAt(i+2,'@');
  1073. i+=3;
  1074. }
  1075. else
  1076. {
  1077. i++;
  1078. }
  1079. }
  1080. return bRet;
  1081. }
  1082. double CRealComputer::computing(const COperator*op,const COperand*oprand)
  1083. {
  1084. double x = atof(oprand->m_name);
  1085. if (op->m_operator=="-")
  1086. {
  1087. x = -x;
  1088. }
  1089. else if (op->m_operator=="SQRT")
  1090. {
  1091. if (x>=0)
  1092. {
  1093. x = sqrt(x);
  1094. }
  1095. else
  1096. {
  1097. x = BIGNUMBER;
  1098. }
  1099. }
  1100. else if (op->m_operator=="SIN")
  1101. {
  1102. x = sin(x);
  1103. }
  1104. else if (op->m_operator=="COS")
  1105. {
  1106. x = cos(x);
  1107. }
  1108. else if (op->m_operator=="TAN")
  1109. {
  1110. x = tan(x);
  1111. }
  1112. else if (op->m_operator=="COT")
  1113. {
  1114. if (fabs(sin(x))>DERROR)
  1115. {
  1116. x = cos(x)/sin(x);
  1117. }
  1118. else
  1119. {
  1120. x = BIGNUMBER;
  1121. }
  1122. }
  1123. else if (op->m_operator=="NOT")
  1124. {
  1125. if (x!=0)
  1126. {
  1127. x = 0;
  1128. }
  1129. else
  1130. {
  1131. x = 1;
  1132. }
  1133. }
  1134. else if (op->m_operator=="RND")
  1135. {
  1136. x = (int)x;
  1137. }
  1138. return x;
  1139. }
  1140. double CRealComputer::computing(const COperator*op,const COperand*Loprand,const COperand*Roprand)
  1141. {
  1142. double x = BIGNUMBER;
  1143. switch (op->m_operator[0])
  1144. {
  1145. case '+':
  1146. x = atof(Loprand->m_name)+atof(Roprand->m_name);
  1147. break;
  1148. case '-':
  1149. x = atof(Loprand->m_name)-atof(Roprand->m_name);
  1150. break;
  1151. case '*':
  1152. x = atof(Loprand->m_name)*atof(Roprand->m_name);
  1153. break;
  1154. case '/':
  1155. {
  1156. double y = atof(Roprand->m_name);
  1157. x = atof(Loprand->m_name);
  1158. if (fabs(y)>DERROR)
  1159. {
  1160. x = x/y;
  1161. }
  1162. else
  1163. {
  1164. x = BIGNUMBER;
  1165. }
  1166. }
  1167. break;
  1168. case '^':
  1169. {
  1170. double y = atof(Roprand->m_name);
  1171. x = atof(Loprand->m_name);
  1172. x = pow(x,y);
  1173. }
  1174. break;
  1175. }
  1176. if (op->m_operator=="==")
  1177. {
  1178. if (MyRound(atof(Loprand->m_name)) == MyRound(atof(Roprand->m_name)) )
  1179. {
  1180. x = 1;
  1181. }
  1182. else
  1183. {
  1184. x = 0;
  1185. }
  1186. }
  1187. else if (op->m_operator==">=")
  1188. {
  1189. if (atof(Loprand->m_name)>=atof(Roprand->m_name))
  1190. {
  1191. x = 1;
  1192. }
  1193. else
  1194. {
  1195. x = 0;
  1196. }
  1197. }
  1198. else if (op->m_operator=="<=")
  1199. {
  1200. if (atof(Loprand->m_name)<=atof(Roprand->m_name))
  1201. {
  1202. x = 1;
  1203. }
  1204. else
  1205. {
  1206. x = 0;
  1207. }
  1208. }
  1209. else if (op->m_operator=="<>")
  1210. {
  1211. if (atof(Loprand->m_name)!=atof(Roprand->m_name))
  1212. {
  1213. x = 1;
  1214. }
  1215. else
  1216. {
  1217. x = 0;
  1218. }
  1219. }
  1220. else if (op->m_operator==">")
  1221. {
  1222. if (atof(Loprand->m_name)>atof(Roprand->m_name))
  1223. {
  1224. x = 1;
  1225. }
  1226. else
  1227. {
  1228. x = 0;
  1229. }
  1230. }
  1231. else if (op->m_operator=="<")
  1232. {
  1233. if (atof(Loprand->m_name)<atof(Roprand->m_name))
  1234. {
  1235. x = 1;
  1236. }
  1237. else
  1238. {
  1239. x = 0;
  1240. }
  1241. }
  1242. else if (op->m_operator=="AND")
  1243. {
  1244. if (MyRound(atof(Loprand->m_name)) && MyRound(atof(Roprand->m_name)))
  1245. {
  1246. x = 1;
  1247. }
  1248. else
  1249. {
  1250. x = 0;
  1251. }
  1252. }
  1253. else if (op->m_operator=="OR")
  1254. {
  1255. if (MyRound(atof(Loprand->m_name)) || MyRound(atof(Roprand->m_name)))
  1256. {
  1257. x = 1;
  1258. }
  1259. else
  1260. {
  1261. x = 0;
  1262. }
  1263. }
  1264. else if(op->m_operator=="XOR")
  1265. {
  1266. if (MyRound(atof(Loprand->m_name))&&MyRound(atof(Roprand->m_name)))
  1267. {
  1268. x = 0;
  1269. }
  1270. else if ((!MyRound(atof(Loprand->m_name))) && (!MyRound(atof(Roprand->m_name))))
  1271. {
  1272. x = 0;
  1273. }
  1274. else
  1275. {
  1276. x = 1;
  1277. }
  1278. }
  1279. else if (op->m_operator=="MOD")
  1280. {
  1281. x =MyRound(atof(Loprand->m_name)) % MyRound(atof(Roprand->m_name));
  1282. }
  1283. return x;
  1284. }
  1285. int CRealComputer::IsFormula()
  1286. {
  1287. stack<char> charStack;
  1288. int i,num=m_formula.GetLength();
  1289. char notChar[] = {';','\'',':',' ','[',']','{','}','\\','|',',','&','%','$','@','#','!','`','~','?'};
  1290. int notNum = sizeof notChar;
  1291. for (i=0;i<num;i++)
  1292. {
  1293. for (int j=0;j<notNum;j++)
  1294. {
  1295. if (m_formula[i]==notChar[j])
  1296. {
  1297. CString s;
  1298. s.Format("The %dth character,\"%c\" is invalidated!",i+1,m_formula[i]);
  1299. return -i-1;//the ith symbol is invalidating.
  1300. }
  1301. }
  1302. }
  1303. for (i=0;i<num;i++)
  1304. {
  1305. if (m_formula[i]=='(')
  1306. {
  1307. charStack.push('(');
  1308. }
  1309. if (m_formula[i]==')')
  1310. {
  1311. if (charStack.empty())
  1312. {
  1313. return 1;//right bracket if more.
  1314. }
  1315. else
  1316. {
  1317. charStack.pop();
  1318. }
  1319. }
  1320. }
  1321. if (!charStack.empty())
  1322. {
  1323. return 2; //left bracket is more.
  1324. }
  1325. return 0;
  1326. }
  1327. double CRealComputer::GetResult()
  1328. {
  1329. double data[100] = {0.0};
  1330. for (int i=0;i<m_oprandANum;i++)
  1331. {
  1332. float tmp = pVariantsManager->GetAnalogValue(m_oprandA[i].m_name);
  1333. if ( tmp!=VARIANT_NOTFOUND )
  1334. {
  1335. data[i] = tmp;
  1336. }
  1337. else
  1338. {
  1339. }
  1340. }
  1341. double result = computer(data, m_oprandANum);
  1342. return result;
  1343. }