From: ALTENBACH,CHRISTIAN <cal...@uc...> - 2004-04-05 07:32:58
|
Well, I made a rough draft of my test suggestion. www.bol.ucla.edu/~caltenba/backspace_testerA010.zip To run, just select a folder containing several VIs conforming to the connector pattern of the backspace VI. It tests 6 different input strings, including empty. It uses the following scoring algorithm: - For each test, divide all times by the fastest to get normalized values. - For each VI, take the average of the normalized values. - Score = 100/Average. (Best possible score is 100% if VI is fastest on all tests.) There are some sparse comments on the diagrams. Lots of loose ends in the code, some held together by duck tape, but it seems to run fine. I'll document it a bit better later. Cheers Christian |