The SingleInteger domain is intended to provide support in Axiom for machine integer arithmetic. It is generally much faster than (bignum) Integer arithmetic but suffers from a limited range of values. Since Axiom can be implemented on top of various dialects of Lisp, the actual representation of small integers may not correspond exactly to the host machines integer representation.
In the CCL implementation of AXIOM (Release 2.1 onwards) the underlying representation of SingleInteger is the same as Integer. The underlying Lisp primitives treat machine-word sized computations specially.
You can discover the minimum and maximum values in your implementation by using minminSingleInteger and maxmaxSingleInteger.
To avoid confusion with Integer, which is the default type for integers, you usually need to work with declared variables (ugTypesDeclarePage in Section ugTypesDeclareNumber ) ...
or use package calling (ugTypesPkgCallPage in Section ugTypesPkgCallNumber ).
You can add, multiply and subtract SingleInteger objects, and ask for the greatest common divisor (gcd).
The least common multiple (lcm) is also available.
Operations mulmodmulmodSingleInteger, addmodaddmodSingleInteger, submodsubmodSingleInteger, and invmodinvmodSingleInteger are similar---they provide arithmetic modulo a given small integer. Here is .
To reduce a small integer modulo a prime, use positiveRemainderpositiveRemainderSingleInteger.
Operations AndAndSingleInteger, OrOrSingleInteger, xorxorSingleInteger, and NotNotSingleInteger provide bit level operations on small integers.
Use shift(int,numToShift) to shift bits, where i is shifted left if numToShift is positive, right if negative.
Many other operations are available for small integers, including many of those provided for Integer. To see the other operations, use the Browse HyperDoc facility (ugBrowsePage in Section ugBrowseNumber ).