Qilan Recursion demo
[Qilan Demo's home]
This project shows how Qilan's recursion and assignment features can be used to accomplish some rather fancy data manipulations. The 'Text to Evaluate' is scanned, one character at a time to determine whether the text contains ANY of the invalid characters. This is more complicated than a simple 'contains' search, as each invalid character is tested, not the invalid string in its entirety. The search stops as soon as the first invalid character is located. A sincere appreciation to Larry Atkin for his thoughtful design.
This is a useful "pre-processing" construct to integrate in Qilan projects that process input from the web or from text documents on disc prior to transfer to database environments (i.e. medical billing) that restrict certain characters.
There are a number of pieces to this demo. The abacii are mind-bending :) This project is heavily commented to help you understand recursion. You can download the Qilan project and take it apart.
RecursiveTest_bonsai.qprj.sit