mirror of https://gitlab.com/pamhyr/pamhyr2
114 lines
3.4 KiB
Python
114 lines
3.4 KiB
Python
# LateralContributionsAdisTSList.py -- Pamhyr
|
|
# Copyright (C) 2023-2026 INRAE
|
|
#
|
|
# This program is free software: you can redistribute it and/or modify
|
|
# it under the terms of the GNU General Public License as published by
|
|
# the Free Software Foundation, either version 3 of the License, or
|
|
# (at your option) any later version.
|
|
#
|
|
# This program is distributed in the hope that it will be useful,
|
|
# but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
# GNU General Public License for more details.
|
|
#
|
|
# You should have received a copy of the GNU General Public License
|
|
# along with this program. If not, see <https://www.gnu.org/licenses/>.
|
|
|
|
# -*- coding: utf-8 -*-
|
|
|
|
from copy import copy
|
|
from tools import trace, timer
|
|
|
|
from Model.Tools.PamhyrListExt import PamhyrModelList
|
|
from Model.Except import NotImplementedMethodeError
|
|
|
|
from Model.LateralContributionsAdisTS.LateralContributionAdisTS \
|
|
import LateralContributionAdisTS
|
|
|
|
|
|
class LateralContributionsAdisTSList(PamhyrModelList):
|
|
_sub_classes = [
|
|
LateralContributionAdisTS,
|
|
]
|
|
|
|
@classmethod
|
|
def _db_load(cls, execute, data=None):
|
|
new = cls(status=data['status'])
|
|
|
|
if data is None:
|
|
data = {}
|
|
|
|
new._lst = LateralContributionAdisTS._db_load(
|
|
execute, data
|
|
)
|
|
|
|
return new
|
|
|
|
def _db_save(self, execute, data=None):
|
|
execute(
|
|
"DELETE FROM lateral_contribution_adists " +
|
|
f"WHERE scenario = {self._status.scenario_id}"
|
|
)
|
|
execute(
|
|
"DELETE FROM lateral_contribution_data_adists " +
|
|
f"WHERE scenario = {self._status.scenario_id}"
|
|
)
|
|
|
|
if data is None:
|
|
data = {}
|
|
|
|
for lc in self._lst:
|
|
lc._db_save(execute, data=data)
|
|
|
|
return True
|
|
|
|
def new(self, index, pollutant):
|
|
n = LateralContributionAdisTS(pollutant=pollutant, status=self._status)
|
|
self._lst.insert(index, n)
|
|
self._status.modified()
|
|
return n
|
|
|
|
def split_reach(self, reach, profile, reach1, reach2):
|
|
parts = []
|
|
for new_reach in (reach1, reach2):
|
|
rks = new_reach.reach.get_rk()
|
|
if len(rks) == 0:
|
|
continue
|
|
parts.append((new_reach.id, min(rks), max(rks)))
|
|
|
|
contributions = [
|
|
contribution
|
|
for contribution in self.lst
|
|
if contribution.reach == reach.id
|
|
]
|
|
clones = []
|
|
|
|
for contribution in contributions:
|
|
begin = contribution.begin_rk
|
|
end = contribution.end_rk
|
|
if begin is None or end is None:
|
|
continue
|
|
|
|
lower, upper = sorted((begin, end))
|
|
reverse = begin > end
|
|
|
|
for new_reach, part_lower, part_upper in parts:
|
|
clipped_lower = max(lower, part_lower)
|
|
clipped_upper = min(upper, part_upper)
|
|
if clipped_lower > clipped_upper:
|
|
continue
|
|
|
|
begin_rk = clipped_upper if reverse else clipped_lower
|
|
end_rk = clipped_lower if reverse else clipped_upper
|
|
clones.append(contribution.cloned_for(
|
|
new_reach, begin_rk, end_rk
|
|
))
|
|
|
|
if len(clones) != 0:
|
|
self._lst.extend(clones)
|
|
self._status.modified()
|
|
|
|
@property
|
|
def Lat_Cont_List(self):
|
|
return self.lst
|