Domino Code Fragment

Code Name*
Set Subtraction		Date*
04/28/2024		Source (or email address if you prefer)*
Rlatulippe@romac.com
IP address:.3.12.107.29
Description*
Scenario: You have set A {1,2,3,4,5,6,7,8} and you have set B {1,2,3}, and you need to know what members of set A are NOT in set B. Follow this tip: Application: Very often people need to fill out timesheets or some other form on a regular basis. It's very easy to see who has filled out the required form for the required date. Just build a view. But how do you show who hasn't filled out the required form for the required date. You can't do it in a view since there are no documents to show. The solution is to calculate the names and show them in a special document created just for this purpose. Using DBLookups you can create your SetA and SetB list. SetA is a list of all the people that have ever filled out the form. The assumption is that if a person has filled out a form in the past, they must still be filling out forms (actually you can put in code to account for terminated people). Set B is created by looking up the names of people that have filled out the form for the date in question. You have an editable field for the date in question. Just enter the date, press F9. You've got your list of delinquents. You can also have a button to mail memos to the unlucky winners, to prompt them to get the required documents in on time.		Type*
Formula		Categories*
(Misc)
Implementation:
Required Client:
Server:
Limitations:
Comments:
Files/Graphics attachments (if applicable): Code:
SetA := "1":"2":"3":"4":"5":"6":"7":"8";
SetB := "1":"2":"3";
REM "Create a text list of nulls equal in number to SetA";
NullList := @Explode(@Repeat(";"; @Elements(SetA)); ";");
REM "Replace SetA members that match members in setB with nulls";
NewList := @Replace(SetA; SetB; NullList);
REM "Remove the null entries";
@Trim(NewList)