Just had a look at Julia and it defines * rem(x,y) remainder; satisfies x == div(x,y)*y + rem(x,y), implying that sign matches x.
This violates the standard. * mod(x,y) modulus; satisfies x == fld(x,y)*y + mod(x,y), implying that sign matches y. This agrees with Chapel's current implementation. Regards - Damian Pacific Engineering Systems International, 277-279 Broadway, Glebe NSW 2037 Ph:+61-2-8571-0847 .. Fx:+61-2-9692-9623 | unsolicited email not wanted here Views & opinions here are mine and not those of any past or present employer ------------------------------------------------------------------------------ _______________________________________________ Chapel-users mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/chapel-users
