Artifact 0cacc890b7b1fb8c2e440d12d9519e5e0b5c38548686860ad81c50e1c79970f2:
- Executable file
r37/lisp/csl/html/r37_0036.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: 1132) [annotate] [blame] [check-ins using] [more...]
<A NAME=less> <TITLE>less</TITLE></A> <b><a href=r37_idx.html>INDEX</a></b><p><p> <B><</B> _ _ _ <B>LESS</B> _ _ _ _ _ _ _ _ _ _ _ _ <B>operator</B><P> <P> <em><</em> is an infix binary logical comparison operator that returns true if its first argument is strictly less than its second argument. <P> <P> <P> <H3> syntax: </H3> <expression> <em><</em> <expression> <P> <P> <P> <expression> must evaluate to a number, e.g., integer, rational or floating point number. <P> <P> <P> <H3> examples: </H3> <P><PRE><TT> f := -3; F := -3 if f < -3 then write "yes" else write "no"; no </TT></PRE><P>The binary comparison operators can only be used for comparisons b etween numbers or variables that evaluate to numbers. The truth values returned by such a comparison can only be used inside programming constructs, such as <A HREF=r37_0052.html>if</A>...<em>then</em>...<em>else</em> or <A HREF=r37_0056.html>repeat</A>...<em>until</em> or <A HREF=r37_0228.html>while</A>...<em>do</em>. <P> <P> <P>