How to find high and low order bytes of a word?

Article View: comp.lang.modula2

Article #3511

#3511

From: Arcadio A. Sincero Jr.
Date: Sun, 21 Apr 1996 20:32

17 lines
1082 bytes

	How are the "Hi" and "Lo" functions of Borland Pascal implemented? 
For those not familiar with those functions, Hi returns the high-order byte
of a Word (which, I guess, the Modula-2 equivalent would be CARDINAL), and
Lo returns the low-order byte.  I'm trying to implement Modula-2
equivalents, and I can't seem to figure it out.

	Thanks!

-- 
===============================================================================
Arcadio Alivio Sincero, Jr.
Sophomore, Computer Science Major at the University of Maryland at College Park
Amateur competitive bodybuilder
Email: lotu@wam.umd.edu, WWW: http://www.wam.umd.edu/~lotu

"D.A.R.E. .... to keep cops of donuts."

Technical Details

Message-ID: <slrn4nl6pu.3o.cabal@sager.umd.edu>

Path: arc1-ca.pugleaf.net!cville-srv.wam.umd.edu!cabal

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!cville-srv.wam.umd.edu!cabal
From: cabal@sager.umd.edu (Arcadio A. Sincero Jr.)
Newsgroups: comp.lang.modula2
Subject: How to find high and low order bytes of a word?
Date: 21 Apr 1996 20:32:09 GMT
Organization: Sager Computer System
Message-ID: <slrn4nl6pu.3o.cabal@sager.umd.edu>
Reply-To: lotu@wam.umd.edu
NNTP-Posting-Host: annex11-7.dial.umd.edu
X-Newsreader: slrn (0.8.4)