Talk:Map range: Difference between revisions

From Rosetta Code
Content added Content deleted
(Reasons for the task's creation.)
 
No edit summary
Line 1: Line 1:
This task was created for one simple reason: I was trying to remember how to do what the C++ example I wrote and provided does. The task description can probably use work. I also know that there are weird scenarios, such as in resampling, where that code doesn't quite work, but I think that's a different problem. (Possibly worth its own task. Given two arrays of N1 and N2 elements, find the corresponding element in N2 for N1.) --[[User:Short Circuit|Michael Mol]] 16:17, 25 November 2010 (UTC)
This task was created for one simple reason: I was trying to remember how to do what the C++ example I wrote and provided does. The task description can probably use work. I also know that there are weird scenarios, such as in resampling, where that code doesn't quite work, but I think that's a different problem. (Possibly worth its own task. Given two arrays of N1 and N2 elements, find the corresponding element in N2 for N1.) --[[User:Short Circuit|Michael Mol]] 16:17, 25 November 2010 (UTC)
: So we're talking about floating-point values? If we are, we can just ignore the nasties with sampling errors since they at least ''model'' reals. –[[User:Dkf|Donal Fellows]] 16:27, 25 November 2010 (UTC)

Revision as of 16:27, 25 November 2010

This task was created for one simple reason: I was trying to remember how to do what the C++ example I wrote and provided does. The task description can probably use work. I also know that there are weird scenarios, such as in resampling, where that code doesn't quite work, but I think that's a different problem. (Possibly worth its own task. Given two arrays of N1 and N2 elements, find the corresponding element in N2 for N1.) --Michael Mol 16:17, 25 November 2010 (UTC)

So we're talking about floating-point values? If we are, we can just ignore the nasties with sampling errors since they at least model reals. –Donal Fellows 16:27, 25 November 2010 (UTC)