|
1 | 1 | import math |
2 | 2 | from collections import deque |
3 | 3 |
|
4 | | -from larray.core.array import LArray, aslarray, ones, any |
| 4 | +from larray.core.array import Array, aslarray, ones, any |
5 | 5 | import numpy as np |
6 | 6 |
|
7 | 7 |
|
@@ -81,23 +81,23 @@ def ipfp(target_sums, a=None, axes=None, maxiter=1000, threshold=0.5, stepstoabo |
81 | 81 |
|
82 | 82 | Returns |
83 | 83 | ------- |
84 | | - LArray |
| 84 | + Array |
85 | 85 |
|
86 | 86 | Examples |
87 | 87 | -------- |
88 | 88 | >>> from larray import * |
89 | 89 | >>> a = Axis('a=a0,a1') |
90 | 90 | >>> b = Axis('b=b0,b1') |
91 | | - >>> initial = LArray([[2, 1], [1, 2]], [a, b]) |
| 91 | + >>> initial = Array([[2, 1], [1, 2]], [a, b]) |
92 | 92 | >>> initial |
93 | 93 | a\b b0 b1 |
94 | 94 | a0 2 1 |
95 | 95 | a1 1 2 |
96 | | - >>> target_sum_along_a = LArray([2, 1], b) |
| 96 | + >>> target_sum_along_a = Array([2, 1], b) |
97 | 97 | >>> target_sum_along_a |
98 | 98 | b b0 b1 |
99 | 99 | 2 1 |
100 | | - >>> target_sum_along_b = LArray([1, 2], a) |
| 100 | + >>> target_sum_along_b = Array([1, 2], a) |
101 | 101 | >>> target_sum_along_b |
102 | 102 | a a0 a1 |
103 | 103 | 1 2 |
@@ -186,7 +186,7 @@ def has_anonymous_axes(a): |
186 | 186 | else: |
187 | 187 | # TODO: only make a copy if there are actually any bad values, but I am unsure we should make a copy at all. |
188 | 188 | # Either way, this should be documented. |
189 | | - if nzvzs in {'warn', 'fix'} and isinstance(a, LArray): |
| 189 | + if nzvzs in {'warn', 'fix'} and isinstance(a, Array): |
190 | 190 | a = a.copy() |
191 | 191 | else: |
192 | 192 | a = aslarray(a) |
|
0 commit comments