Re: Fast fmodf(..., 1.0f)
- From: "christian.bau" <christian.bau@xxxxxxxxxxxxxxxxxx>
- Date: Mon, 30 Jun 2008 10:19:47 -0700 (PDT)
On Jun 30, 12:44 am, "jason.cipri...@xxxxxxxxx"
<jason.cipri...@xxxxxxxxx> wrote:
Because it's a measured bottleneck in a performance-critical inner
loop... nothing premature about that...
I know the relative range of the values, I should have mentioned that.
I don't know exactly what it can be but I can guarantee it won't
exceed INT_MAX. And I'm not using this method anyways.
It is unlikely that your real problem is "calculate x mod 1 for a
gazillion different values of x". It is highly likely that looking at
the problem from a higher level will produce a faster solution by
looking at things from a completely different angle. So you should
post what you _really_ want to achieve.
.
- Follow-Ups:
- Re: Fast fmodf(..., 1.0f)
- From: jason.cipriani@xxxxxxxxx
- Re: Fast fmodf(..., 1.0f)
- References:
- Fast fmodf(..., 1.0f)
- From: jason.cipriani@xxxxxxxxx
- Re: Fast fmodf(..., 1.0f)
- From: Barry Schwarz
- Re: Fast fmodf(..., 1.0f)
- From: jason.cipriani@xxxxxxxxx
- Fast fmodf(..., 1.0f)
- Prev by Date: Re: problem passing pointer array
- Next by Date: Re: OOP
- Previous by thread: Re: Fast fmodf(..., 1.0f)
- Next by thread: Re: Fast fmodf(..., 1.0f)
- Index(es):
Relevant Pages
|