[Numpy-svn] r3107 - trunk/numpy

[numpy-svn at scipy.org]

Author: charris
Date: 2006-09-03 14:01:47 -0500 (Sun, 03 Sep 2006)
New Revision: 3107

Modified:
   trunk/numpy/add_newdocs.py
Log:
More document tweaks for searchsorted.


Modified: trunk/numpy/add_newdocs.py
===================================================================
--- trunk/numpy/add_newdocs.py	2006-09-03 18:51:51 UTC (rev 3106)
+++ trunk/numpy/add_newdocs.py	2006-09-03 19:01:47 UTC (rev 3107)
@@ -877,10 +877,10 @@
 
            a[j] < key <= a[i] for all j < i,
 
-    If such an index does not exist, a.size() is used. The result is such that
-    if the key were to be inserted into a in the slot before the index i, then
-    the order of a would be preserved and i would be the smallest index with
-    that property.
+    If such an index does not exist, a.size() is used. Consequently, i is the
+    index of the first item in a that is >= key. If the key were to be inserted
+    into a in the slot before the index i, then the order of a would be
+    preserved and i would be the smallest index with that property.
 
     The method call
 
@@ -891,10 +891,10 @@
 
            a[j] <= key < a[i] for all j < i,
 
-    If such an index does not exist, a.size() is used. The result is such that
-    if the key were to be inserted into a in the slot before the index i, then
-    the order of a would be preserved and i would be the largest index with
-    that property.
+    If such an index does not exist, a.size() is used. Consequently, i is the
+    index of the first item in a that is > key. If the key were to be inserted
+    into a in the slot before the index i, then the order of a would be
+    preserved and i would be the largest index with that property.
 
     """))