Artifact 4b61c191fe0e13b0bafbc7036d20e0f61159ebf28b5a3a34538a194946272742:
- Executable file
r37/lisp/csl/html/r37_0164.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: 1404) [annotate] [blame] [check-ins using] [more...]
<A NAME=MKID> <TITLE>MKID</TITLE></A> <b><a href=r37_idx.html>INDEX</a></b><p><p> <B>MKID</B> _ _ _ _ _ _ _ _ _ _ _ _ <B>command</B><P> <P> <P> <P> The <em>mkid</em> command constructs an identifier, given a stem and an identifi er or an integer. <P> <H3> syntax: </H3> <P> <P> <em>mkid</em>(<stem>,<leaf>) <P> <P> <P> <stem> can be any valid REDUCE identifier that does not include escaped special characters. <leaf> may be an integer, including one given by a local variable in a <A HREF=r37_0047.html>for</A> loop, or any other legal group of characters. <P> <P> <P> <H3> examples: </H3> <P><PRE><TT> mkid(x,3); X3 factorize(x^15 - 1); {X - 1, 2 X + X + 1, 4 3 2 X + X + X + X + 1, 8 7 5 4 3 X - X + X - X + X - X + 1} for i := 1:length ws do write set(mkid(f,i),part(ws,i)); 8 7 5 4 3 X - X + X - X + X - X + 1 4 3 2 X + X + X + X + 1 2 X + X + 1 X - 1 </TT></PRE><P>You can use <em>mkid</em> to construct identifiers from inside pro cedures. This allows you to handle an unknown number of factors, or deal with variable amounts of data. It is particularly helpful to attach identifiers to the answers returned by <em>factorize</em> and <em>solve</em>. <P> <P> <P>