File r37/lisp/csl/html/r37_0049.html artifact a546aa9f7b part of check-in 3c4d7b69af

<A NAME=GEQ>

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



<B>GEQ</B> _ _ _  _ _ _  _ _ _  _ _ _ <B>operator</B><P>
<P>
 
The <em>geq</em> operator is a binary infix or prefix logical operator. It 
returns true if its first argument is greater than or equal to its second 
argument. As an infix operator it is identical with <em>&gt;=</em>. 
 <P> <H3> 
syntax: </H3>
<P>
<P>
<em>geq</em>(&lt;expression&gt;,&lt;expression&gt;) or &lt;expression&gt; 
<em>geq</em> &lt;expression&gt; 
<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 := 20; 

  A := 20 


if geq(a,25) then write &quot;big&quot; else write &quot;small&quot;;
			 


  small 


if a geq 20 then write &quot;big&quot; else write &quot;small&quot;;
			 


  big  


if (a geq 18) then write &quot;big&quot; else write &quot;small&quot;;
			 


  big

</TT></PRE><P>Logical operators can only be used in conditional statements such 
as 
<P>
<P>

<A HREF=r37_0052.html>if</A>...<em>then</em>...<em>else</em> or 

<A HREF=r37_0056.html>repeat</A>...<em>until</em>. 
<P>
<P>
<P>