Artifact 7687055e47f160ace4872e50338a965fc4d5eb6a7a6691572d12960c515af55f:
- Executable file
r37/lisp/csl/html/r37_0033.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: 1128) [annotate] [blame] [check-ins using] [more...]
<A NAME=geqsign> <TITLE>geqsign</TITLE></A> <b><a href=r37_idx.html>INDEX</a></b><p><p> <B>>=</B> _ _ _ <B>GEQSIGN</B> _ _ _ _ _ _ _ _ _ _ _ _ <B>operator</B><P> <P> <em>>=</em> is an infix binary comparison operator, which returns true if its first argument is greater than or equal to its second argument. <P> <P> <P> <H3> syntax: </H3> <expression> <em>>=</em> <expression> <P> <P> <P> <expression> must evaluate to an integer or floating-point number. <P> <P> <P> <H3> examples: </H3> <P><PRE><TT> if (3 >= 2) then yes; yes a := 15; A := 15 if a >= 20 then big else small; small </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>