Artifact 1f753e524a0391d7addcacd1bb89c7747c85efc6652490ea936eefa6eb1843f6:
- Executable file
r37/lisp/csl/html/r37_0115.html
— part of check-in
[f2fda60abd]
at
2011-09-02 18:13:33
on branch master
— Some historical releases purely for archival purposes
git-svn-id: https://svn.code.sf.net/p/reduce-algebra/code/trunk/historical@1375 2bfe0521-f11c-4a00-b80e-6202646ff360 (user: arthurcnorman@users.sourceforge.net, size: 1213) [annotate] [blame] [check-ins using] [more...]
<A NAME=LESSP> <TITLE>LESSP</TITLE></A> <b><a href=r37_idx.html>INDEX</a></b><p><p> <B>LESSP</B> _ _ _ _ _ _ _ _ _ _ _ _ <B>operator</B><P> <P> The <em>lessp</em> operator is a binary infix or prefix logical operator. It returns <A HREF=r37_0122.html>true</A> if its first argument is strictly less than its s econd argument. As an infix operator it is identical with <em><</em>. <P> <H3> syntax: </H3> <P> <P> <em>lessp</em>(<expression>,<expression>) or <expression> <em>lessp</em> <expression> <P> <P> <P> <P> <expression> can be any valid REDUCE expression that evaluates to a number. <P> <P> <P> <H3> examples: </H3> <P><PRE><TT> a := 15; A := 15 if lessp(a,25) then write "yes" else write "no"; yes if lessp(a,15) then write "yes" else write "no"; no if lessp(a,5) then write "yes" else write "no"; no </TT></PRE><P>Logical operators can only be used in conditional statements such as <P> <P> <em>if</em>...<em>then</em>...<em>else</em> or <em>while</em>...<em>do</em>. <P> <P> <P>