Cliff - just so you aren't left hanging out there too long on this one, the answer to your question is "no".
On 4/3/08, Cliff Reiter <[EMAIL PROTECTED]> wrote: > > I have been fairly routinely using Interval Index x I. y with > "almost ordered" lists x. These are lists of a few thousand > scalars where 98% of the steps are increasing and the > deceases are tiny. I only need an index near the value y > and have no need of a particular choice of index. I > get visual feedback on all the results and have never > felt the need to chose anything other than x I. y. > > Am I a foolish old man? > > Roger Hui wrote: > > > Interval Index is just finding the index of an item in > > a sorted list. Not really all that novel (binary search, > > etc.) In 1987 I did not have it as a primitive and solved the problem > > with one application of the monad /: . > > > > ... > > -- > Clifford A. Reiter > Mathematics Department, Lafayette College > Easton, PA 18042 USA, 610-330-5277 > http://www.lafayette.edu/~reiterc > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm > -- Devon McCormick, CFA ^me^ at acm. org is my preferred e-mail ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
