Multiplying element in array if the value is under a certain threshold

[RavensFan]

Ha Ha.

Well, the math itself wouldn't be a hack.

But the -1 and +1 to work back and forth to jockey around the 0 and 1 you get out of the boolean to comparison.  It took me a couple minutes to figure how the math was manipulating the gain to get the result.  It starts to feel a little Rube-ish.

I like to be able to look at the code and quickly see what it is doing.

[JÞB]

---

@RavensFan wrote:

Ha Ha.

Well, the math itself wouldn't be a hack.

But the -1 and +1 to work back and forth to jockey around the 0 and 1 you get out of the boolean to comparison.  It took me a couple minutes to figure how the math was manipulating the gain to get the result.  It starts to feel a little Rube-ish.

I like to be able to look at the code and quickly see what it is doing.

---

Honestly the correct thing to do to make it easier to understand is to replace the increment and decriment functions with add and subtract using the integer array.  But, since the int there is certain to be either 0 or 1....

You do the math....:D

[ben64]

Another way:

Ben64

[JÞB]

What impact does the IR&C have compared to GT?

I agree that it will work but, did you benchmark the code and find an advantage?

[JÞB]

---

@JÞB wrote:

What impact does the IR&C have compared to GT?

I agree that it will work but, did you benchmark the code and find an advantage?

---

I take back my earlier agreement.  Toss a NaN in there.

And how did you actually scale the inputs by a factor of x?

[ben64]

---

Jeff·Þ·Bohrer a écrit :

---

And how did you actually scale the inputs by a factor of x?

---

This is the disadvantage here, it is fixed to 2 but in this case this is what the OP wanted.