summaryrefslogtreecommitdiff
path: root/numpy/lib/arraysetops.py
diff options
context:
space:
mode:
authorJarrod Millman <millman@berkeley.edu>2008-02-08 10:54:01 +0000
committerJarrod Millman <millman@berkeley.edu>2008-02-08 10:54:01 +0000
commitc66da19ab8bd6ad7f035b77026bbd703eab199d4 (patch)
tree55136b4e38d5991dbd68d4e0984c645f11cefce7 /numpy/lib/arraysetops.py
parent0b7800b455b3aaf50cb83a224f283e72f1dea951 (diff)
downloadnumpy-c66da19ab8bd6ad7f035b77026bbd703eab199d4.tar.gz
ran reindent
Diffstat (limited to 'numpy/lib/arraysetops.py')
-rw-r--r--numpy/lib/arraysetops.py2
1 files changed, 1 insertions, 1 deletions
diff --git a/numpy/lib/arraysetops.py b/numpy/lib/arraysetops.py
index 1d99f7a97..f8304cced 100644
--- a/numpy/lib/arraysetops.py
+++ b/numpy/lib/arraysetops.py
@@ -207,7 +207,7 @@ def setmember1d( ar1, ar2 ):
b1 = nm.zeros( ar1.shape, dtype = nm.int8 )
b2 = nm.ones( ar2.shape, dtype = nm.int8 )
tt = nm.concatenate( (b1, b2) )
-
+
# We need this to be a stable sort, so always use 'mergesort' here. The
# values from the first array should always come before the values from the
# second array.