diff options
| author | Mattias Andrée <maandree@operamail.com> | 2014-04-03 15:29:11 +0200 |
|---|---|---|
| committer | Mattias Andrée <maandree@operamail.com> | 2014-04-03 15:29:11 +0200 |
| commit | 0bb7dfc0bbd1954c00afa39d70d077fe7b76a2c3 (patch) | |
| tree | 9e1b1a701fa3ef69f6926fe63018fd96182096df /src/aux.py | |
| parent | add polynomial interpolation with linear fallback, not tested or documented (diff) | |
| download | blueshift-0bb7dfc0bbd1954c00afa39d70d077fe7b76a2c3.tar.gz blueshift-0bb7dfc0bbd1954c00afa39d70d077fe7b76a2c3.tar.bz2 blueshift-0bb7dfc0bbd1954c00afa39d70d077fe7b76a2c3.tar.xz | |
typo
Signed-off-by: Mattias Andrée <maandree@operamail.com>
Diffstat (limited to 'src/aux.py')
| -rw-r--r-- | src/aux.py | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -110,7 +110,7 @@ def polynomially_interpolate_ramp(r, g, b): # TODO test, demo and document this A[i] -= A[k] * m # Eliminiate upper right for k in reversed(range(n)): - A[:k] = [A[i] - A[k] * M[i][k] / M[k][k] for i in range(k]] + A[:k] = [A[i] - A[k] * M[i][k] / M[k][k] for i in range(k)] # Eliminiate diagonal A = [A[k] / M[k][k] for k in range(n)] ## Construct interpolation function |