[BACK]Return to abstract_ring-domain.ads CVS log [TXT][DIR] Up to [local] / OpenXM_contrib / PHC / Ada / Math_Lib / Numbers

Annotation of OpenXM_contrib/PHC/Ada/Math_Lib/Numbers/abstract_ring-domain.ads, Revision 1.1

1.1     ! maekawa     1: generic
        !             2:
        !             3:   with function "<" ( a,b : number ) return boolean;
        !             4:   with function ">" ( a,b : number ) return boolean;
        !             5:
        !             6:   with function "/" ( a,b : number ) return number;
        !             7:
        !             8:   with function  Rmd ( a,b : number ) return number;            -- a mod b
        !             9:   with procedure Rmd ( a : in out number; b : in number );      -- a := a mod b
        !            10:
        !            11:   with procedure Div ( a : in out number; b : in number );      -- a := a/b
        !            12:   with procedure Div ( a,b : in number;                         -- a = b*q+r
        !            13:                        q : out number; r : out number );        -- q := a/b
        !            14:   with procedure Div ( a : in out number; b : in number;        -- a := a/b
        !            15:                        r : out number );                        -- r := a mod b
        !            16:
        !            17: package Abstract_Ring.Domain is end;
        !            18:
        !            19: -- DESCRIPTION :
        !            20: --   An Euclidean domain is a ring where for any pair (a,b), b /= 0,
        !            21: --   there exists a quotient q and a remainder r, such that a = b*q + r.
        !            22: --   Note that here we only have the remainder and division operations.
        !            23: --   Any package that makes usage of the full euclidean domain must as
        !            24: --   well have the ring, instantiated with the same number type.

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>