binary B+ tree - first attempt, compiles and runs
[svn/Cll1h/.git] / demos / boolean.c
1 #include "cll1.h"
2
3 program
4 {
5 const bool t = TRUE, f = FALSE;
6 bool l, m = MAYBE;
7 str s;
8
9 print("TRUE and FALSE =", btoa(t and f) );
10 print("TRUE or FALSE =", btoa(t or f) );
11 print("TRUE and MAYBE =", btoa(t and m) );
12 print("FALSE or MAYBE =", btoa(t or m) );
13 print("not FALSE =", btoa(not f) );
14 print("not TRUE =", btoa(not t) );
15 print("not MAYBE =", btoa(not m) );
16
17 for_strs(s, "TRUE","false","yes","NO","True","FALSE","YES","no","Yes","No","1","0","abc","xyz","Eyes","Ears","rue","alse","oui","no","ano","ne"," ","NULL",NULL,EOL,"","ano","ne")
18 {
19 l = atob(s);
20 echo("\"", s, "\"\tmeans ", btoa(l), EOL);
21 }
22 }
This page took 0.240713 seconds and 4 git commands to generate.