# HG changeset patch
# User Jaroslav Hajek <highegg@gmail.com>
# Date 1246343925 -7200
# Node ID 2ad67ccd09fd9103b75624d8550892b3bac31a95
# Parent  ed392e13c117249d3e1d80eb3628e34f4ebcaacf
fix typo in octave_sort::lookupb

diff -r ed392e13c117 -r 2ad67ccd09fd liboctave/ChangeLog
--- a/liboctave/ChangeLog	Tue Jun 30 08:18:26 2009 +0200
+++ b/liboctave/ChangeLog	Tue Jun 30 08:38:45 2009 +0200
@@ -1,3 +1,7 @@
+2009-06-30  Jaroslav Hajek  <highegg@gmail.com>
+
+	* oct-sort.cc (octave_sort<T>::lookupb<Comp>): Fix typo.
+
 2009-06-29  Jaroslav Hajek  <highegg@gmail.com>
 
 	* oct-sort.cc (octave_sort<T>::lookup_merge): Delete.
diff -r ed392e13c117 -r 2ad67ccd09fd liboctave/oct-sort.cc
--- a/liboctave/oct-sort.cc	Tue Jun 30 08:18:26 2009 +0200
+++ b/liboctave/oct-sort.cc	Tue Jun 30 08:38:45 2009 +0200
@@ -1919,6 +1919,7 @@
       lookupm (data, nel, values, nvalues, idx, std::ptr_fun (compare));
 }
 
+#include <iostream>
 template <class T> template <class Comp>
 void 
 octave_sort<T>::lookupb (const T *data, octave_idx_type nel,
@@ -1957,7 +1958,7 @@
       for (octave_idx_type j = 0; j < nvalues; j++)
         {
           octave_idx_type i = lookup_binary (data, nel, values[j], comp);
-          match[j] = (j != 0 && ! comp (data[i-1], values[j]));
+          match[j] = (i != 0 && ! comp (data[i-1], values[j]));
         }
     }
 }