File r37/lisp/csl/html/r37_0114.html artifact 191a807b13 part of check-in trunk

<A NAME=LEQ>

<TITLE>LEQ</TITLE></A>
<b><a href=r37_idx.html>INDEX</a></b><p><p>



<B>LEQ</B> _ _ _  _ _ _  _ _ _  _ _ _ <B>operator</B><P>
<P>
 
The <em>leq</em> operator is a binary infix or prefix logical operator. It 
returns 
<A HREF=r37_0122.html>true</A> if its first argument is less than or equal to it
s second 
argument. As an infix operator it is identical with <em>&lt;=</em>. 
 <P> <H3> 
syntax: </H3>
<P>
<P>
<em>leq</em>(&lt;expression&gt;,&lt;expression&gt;) or &lt;expression&gt; 
<em>leq</em> &lt;expression&gt; 
<P>
<P>
<P>
<P>
&lt;expression&gt; 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 leq(a,25) then write &quot;yes&quot; else write &quot;no&quot;;
			 


  yes 


if leq(a,15) then write &quot;yes&quot; else write &quot;no&quot;;
			 


  yes 


if leq(a,5) then write &quot;yes&quot; else write &quot;no&quot;;
			 


  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>