| Index: appengine/findit/libs/math/vectors.py
|
| diff --git a/appengine/findit/libs/math/vectors.py b/appengine/findit/libs/math/vectors.py
|
| index 2d97d35a554ac3f3a2e9d1d238cb6a375ed2d00e..e2ac81f7ed9250516b25731882dd603a585fe2fa 100644
|
| --- a/appengine/findit/libs/math/vectors.py
|
| +++ b/appengine/findit/libs/math/vectors.py
|
| @@ -31,7 +31,7 @@ def vsum(vs, shape=None):
|
|
|
| # It'd be better to vectorize the implementation of Shewchuk's
|
| # algorithm directly, so we can avoid needing to traverse ``vs``
|
| - # repeatedly. However, this is deemed to have too high a maintinence
|
| + # repeatedly. However, this is deemed to have too high a maintenance
|
| # cost for the performance benefit.
|
| total = np.zeros(shape)
|
| it = np.nditer(total, flags=['multi_index'], op_flags=['writeonly'])
|
|
|