...
|
...
|
@@ -321,13 +321,13 @@ class LearnerND(BaseLearner):
|
321
|
321
|
# simplex hasn't been deleted yet
|
322
|
322
|
while True:
|
323
|
323
|
loss, simplex, subsimplex = heapq.heappop(self._losses_combined)
|
324
|
|
- if (subsimplex is None and
|
325
|
|
- simplex in self.tri.simplices and
|
326
|
|
- simplex not in self._subtriangulations):
|
|
324
|
+ if (subsimplex is None
|
|
325
|
+ and simplex in self.tri.simplices
|
|
326
|
+ and simplex not in self._subtriangulations):
|
327
|
327
|
return abs(loss), simplex, subsimplex
|
328
|
|
- if (simplex in self._subtriangulations and
|
329
|
|
- simplex in self.tri.simplices and
|
330
|
|
- subsimplex in self._subtriangulations[simplex].simplices):
|
|
328
|
+ if (simplex in self._subtriangulations
|
|
329
|
+ and simplex in self.tri.simplices
|
|
330
|
+ and subsimplex in self._subtriangulations[simplex].simplices):
|
331
|
331
|
return abs(loss), simplex, subsimplex
|
332
|
332
|
|
333
|
333
|
def _ask_best_point(self):
|