Related articles |
---|
Modulo n arithmetics fabre@gr.osf.org (Christian Fabre) (1992-11-06) |
Re: Modulo n arithmetics pardo@cs.washington.edu (1992-11-10) |
Re: Modulo n arithmetics drclark@daisy.uwaterloo.ca (David R. Clark) (1992-11-11) |
Re: Modulo n arithmetics dneedham@oucsace.cs.ohiou.edu (1992-11-11) |
Modulo n arithmetics wchsieh@beethoven.lcs.mit.edu (1992-11-11) |
Re: Modulo n arithmetics wendt@CS.ColoState.EDU (1992-11-15) |
Re: Modulo n arithmetics johnr@ee.uts.edu.au (1992-11-17) |
Re: Modulo n arithmetics chris@gargoyle.uchicago.edu (1992-11-19) |
Re: Modulo n arithmetics tve@crackle.CS.Berkeley.EDU (1992-11-20) |
Re: Modulo n arithmetics pcg@aber.ac.uk (1992-11-29) |
Newsgroups: | comp.compilers |
From: | chris@gargoyle.uchicago.edu (Chris Johnston) |
Organization: | University of Chicago Computing Organizations |
Date: | Thu, 19 Nov 1992 19:49:44 GMT |
References: | 92-11-029 |
Keywords: | arithmetic |
fabre@gr.osf.org (Christian Fabre) writes:
>I am wondering if any languages or application heavily rely on
>modulo arithmetics:
Some applications...
How about communication, TCP uses 32bit counters to sequence packets, the
packet following 32 ones is zero. Trading (stocks/futures) cards are
numbered 000 to 999. Database rows... Any counter that can wrap to zero.
You want to be able to sort items arriving out of order and detect missing
items. The TCP folk call this sequence space arithemtic. See
/usr/include/netinet/tcp_seq.h
cj
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.