diff options
| author | dos-reis <gdr@axiomatics.org> | 2011-02-05 03:52:54 +0000 |
|---|---|---|
| committer | dos-reis <gdr@axiomatics.org> | 2011-02-05 03:52:54 +0000 |
| commit | 5eebd42bedc639efb11826fcc56520afbb4637ca (patch) | |
| tree | c692329216ca44718ddb41e58679d5c334187a4f /src/algebra/si.spad.pamphlet | |
| parent | dd16b47e4904b1839b2918cf5b38c352979a6141 (diff) | |
| download | open-axiom-5eebd42bedc639efb11826fcc56520afbb4637ca.tar.gz | |
* interp/g-opt.boot ($VMsideEffectFreeOperators): Remove CGREATERP
and GGREATERP. Add VM-level complex number operators.
* interp/lisp-backend.boot: Expand them.
* algebra/gaussian.spad.pamphlet (ComplexCategory): Use VM form
instead of Lisp level forms.
* algebra/pfr.spad.pamphlet (PartialFraction): Likewise.
* algebra/si.spad.pamphlet (SingleInteger): Likewise.
* algebra/symbol.spad.pamphlet (Symbol): Likewise.
Diffstat (limited to 'src/algebra/si.spad.pamphlet')
| -rw-r--r-- | src/algebra/si.spad.pamphlet | 24 |
1 files changed, 14 insertions, 10 deletions
diff --git a/src/algebra/si.spad.pamphlet b/src/algebra/si.spad.pamphlet index dffa5e46..49fb6830 100644 --- a/src/algebra/si.spad.pamphlet +++ b/src/algebra/si.spad.pamphlet @@ -232,6 +232,10 @@ SingleInteger(): Join(IntegerNumberSystem,OrderedFinite,BooleanLogic,Logic,OpenM import %ile: (%,%) -> Boolean from Foreign Builtin import %igt: (%,%) -> Boolean from Foreign Builtin import %ige: (%,%) -> Boolean from Foreign Builtin + import %bitnot: % -> % from Foreign Builtin + import %bitand: (%,%) -> % from Foreign Builtin + import %bitior: (%,%) -> % from Foreign Builtin + import %bitxor: (%,%) -> % from Foreign Builtin seed : % := %icst1 -- for random() MAXINT ==> _$ShortMaximum$Lisp @@ -295,16 +299,16 @@ SingleInteger(): Join(IntegerNumberSystem,OrderedFinite,BooleanLogic,Logic,OpenM max() == MAXINT min() == MININT x = y == %ieq(x,y) - ~ x == LOGNOT(x)$Lisp - not(x) == LOGNOT(x)$Lisp - x /\ y == LOGAND(x,y)$Lisp - x \/ y == LOGIOR(x,y)$Lisp - Not(x) == LOGNOT(x)$Lisp - And(x,y) == LOGAND(x,y)$Lisp - x and y == And(x,y) - Or(x,y) == LOGIOR(x,y)$Lisp - x or y == Or(x,y) - xor(x,y) == LOGXOR(x,y)$Lisp + ~ x == %bitnot x + not(x) == %bitnot x + x /\ y == %bitand(x,y) + x \/ y == %bitior(x,y) + Not(x) == %bitnot x + And(x,y) == %bitand(x,y) + x and y == %bitand(x,y) + Or(x,y) == %bitior(x,y) + x or y == %bitior(x,y) + xor(x,y) == %bitxor(x,y) x < y == %ilt(x,y) x > y == %igt(x,y) x <= y == %ile(x,y) |