https://gunkies.org/index.php?action=history&feed=atom&title=32v_1m_dc 2026-05-11T17:25:40Z Revision history for this page on the wiki MediaWiki 1.30.1 https://gunkies.org/w/index.php?title=32v_1m_dc&diff=6950&oldid=prev 2009-10-26T13:42:39Z

<p>New page: DC(1) UNIX Programmer&#039;s Manual DC(1) == NAME == dc - desk calculator == SYNOPSIS == dc [ file ] == DESCRIPTION == _D_c is an arbitrary prec...</p> <p><b>New page</b></p><div>DC(1) UNIX Programmer's Manual DC(1)<br /> <br /> <br /> <br /> == NAME ==<br /> dc - desk calculator<br /> <br /> == SYNOPSIS ==<br /> dc [ file ]<br /> <br /> == DESCRIPTION ==<br /> _D_c is an arbitrary precision arithmetic package. Ordinarily<br /> it operates on decimal integers, but one may specify an<br /> input base, output base, and a number of fractional digits<br /> to be maintained. The overall structure of _d_c is a stacking<br /> (reverse Polish) calculator. If an argument is given, input<br /> is taken from that file until its end, then from the stan-<br /> dard input. The following constructions are recognized:<br /> <br /> number<br /> The value of the number is pushed on the stack. A<br /> number is an unbroken string of the digits 0-9. It<br /> may be preceded by an underscore _ to input a negative<br /> number. Numbers may contain decimal points.<br /> <br /> + - / * % ^<br /> The top two values on the stack are added (+), sub-<br /> tracted (-), multiplied (*), divided (/), remaindered<br /> (%), or exponentiated (^). The two entries are popped<br /> off the stack; the result is pushed on the stack in<br /> their place. Any fractional part of an exponent is<br /> ignored.<br /> <br /> s_x The top of the stack is popped and stored into a<br /> register named _x, where _x may be any character. If<br /> the s is capitalized, _x is treated as a stack and the<br /> value is pushed on it.<br /> <br /> l_x The value in register _x is pushed on the stack. The<br /> register _x is not altered. All registers start with<br /> zero value. If the l is capitalized, register _x is<br /> treated as a stack and its top value is popped onto<br /> the main stack.<br /> <br /> d The top value on the stack is duplicated.<br /> <br /> p The top value on the stack is printed. The top value<br /> remains unchanged. P interprets the top of the stack<br /> as an ascii string, removes it, and prints it.<br /> <br /> f All values on the stack and in registers are printed.<br /> <br /> q exits the program. If executing a string, the recur-<br /> sion level is popped by two. If q is capitalized, the<br /> top value on the stack is popped and the string execu-<br /> tion level is popped by that value.<br /> <br /> x treats the top element of the stack as a character<br /> string and executes it as a string of dc commands.<br /> <br /> X replaces the number on the top of the stack with its<br /> scale factor.<br /> <br /> [ ... ]<br /> puts the bracketed ascii string onto the top of the<br /> stack.<br /> <br /> &lt;_x &gt;_x =_x<br /> The top two elements of the stack are popped and com-<br /> pared. Register _x is executed if they obey the stated<br /> relation.<br /> <br /> v replaces the top element on the stack by its square<br /> root. Any existing fractional part of the argument is<br /> taken into account, but otherwise the scale factor is<br /> ignored.<br /> <br /> ! interprets the rest of the line as a UNIX command.<br /> <br /> c All values on the stack are popped.<br /> <br /> i The top value on the stack is popped and used as the<br /> number radix for further input. I pushes the input<br /> base on the top of the stack.<br /> <br /> o The top value on the stack is popped and used as the<br /> number radix for further output.<br /> <br /> O pushes the output base on the top of the stack.<br /> <br /> k the top of the stack is popped, and that value is used<br /> as a non-negative scale factor: the appropriate number<br /> of places are printed on output, and maintained during<br /> multiplication, division, and exponentiation. The<br /> interaction of scale factor, input base, and output<br /> base will be reasonable if all are changed together.<br /> <br /> z The stack level is pushed onto the stack.<br /> <br /> Z replaces the number on the top of the stack with its<br /> length.<br /> <br /> ? A line of input is taken from the input source (usu-<br /> ally the terminal) and executed.<br /> <br /> ; : are used by _b_c for array operations.<br /> <br /> An example which prints the first ten values of n! is<br /> <br /> [la1+dsa*pla10&gt;y]sy<br /> 0sa1<br /> lyx<br /> <br /> == SEE ALSO ==<br /> [[32v 1m bc|bc(1)]], which is a preprocessor for _d_c providing infix nota-<br /> tion and a C-like syntax which implements functions and rea-<br /> sonable control structures for programs.<br /> <br /> == DIAGNOSTICS ==<br /> `x is unimplemented' where x is an octal number.<br /> `stack empty' for not enough elements on the stack to do<br /> what was asked.<br /> `Out of space' when the free list is exhausted (too many<br /> digits).<br /> `Out of headers' for too many numbers being kept around.<br /> `Out of pushdown' for too many items on the stack.<br /> `Nesting Depth' for too many levels of nested execution.<br /> <br /> [[Category:32v man section 1]]</div>

Neozeed