Artifact a546aa9f7bcfd3e049821405b8d7eeecb14a70236cfdc1aba548f19efb9cf500:
- Executable file
r37/lisp/csl/html/r37_0049.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: 1226) [annotate] [blame] [check-ins using] [more...]
<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>>=</em>. <P> <H3> syntax: </H3> <P> <P> <em>geq</em>(<expression>,<expression>) or <expression> <em>geq</em> <expression> <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 := 20; A := 20 if geq(a,25) then write "big" else write "small"; small if a geq 20 then write "big" else write "small"; big if (a geq 18) then write "big" else write "small"; 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>