Re: Circular buffer
From: The_Sage (theeSage_at_azrmci.net)
Date: 10/17/03
- Next message: Randall Hyde: "HLA v1.58 is now available"
- Previous message: The_Sage: "Re: The Microsoft Way (OT)"
- In reply to: Alex McDonald: "Re: Circular buffer"
- Next in thread: R.Wieser: "Re: Circular buffer"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Thu, 16 Oct 2003 19:19:38 -0700
>Reply to article by: "Alex McDonald" <alex_mcd@btopenworld.com>
>Date written: Thu, 16 Oct 2003 10:05:42 +0000 (UTC)
>MsgID:<bmlqhl$485$1@titan.btinternet.com>
>>>How would you propose using the FPU to calculate a modulo integer?
>>Simple. FPREM.
>Interesting. Could you perhaps outline the advantages of the FPU for this
>calculation, and provide some sample code?
Nope. I wouldn't recommend using the FPU since it is too inefficient.
The Sage
=============================================================
My Home Page : http://members.cox.net/the.sage
"The biggest problem in the world, could have been solved
when it was small..." -- Lao Tzu
=============================================================
- Next message: Randall Hyde: "HLA v1.58 is now available"
- Previous message: The_Sage: "Re: The Microsoft Way (OT)"
- In reply to: Alex McDonald: "Re: Circular buffer"
- Next in thread: R.Wieser: "Re: Circular buffer"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|
