This is something that just came up today. I know that MUMPS isn't a
strongly typed language, but if X and Y represent (unsigned) decimal
integers, does GT.M provide an easy (and efficient) means of carrying
out bitwise operations on X and Y). For example, if X = 12 (binary
1100)and Y = 49 (binary 110001), I'd expect that
X bitwise-or Y = 61 (binary 111101)
1 1 0 0 0 1
1 1 0 0
------------
1 1 1 1 0 1
===
Gregory Woodhouse <[EMAIL PROTECTED]>
"Perfection is achieved, not when there is nothing more
to add, but when there is nothing left to take away."
-- Antoine de Saint-Exupery
-------------------------------------------------------
SF.Net email is Sponsored by the Better Software Conference & EXPO
September 19-22, 2005 * San Francisco, CA * Development Lifecycle Practices
Agile & Plan-Driven Development * Managing Projects & Teams * Testing & QA
Security * Process Improvement & Measurement * http://www.sqe.com/bsce5sf
_______________________________________________
Hardhats-members mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/hardhats-members
