Source code for gemseo.caches.memory_full_cache

# Copyright 2021 IRT Saint Exupéry,
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License version 3 as published by the Free Software Foundation.
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# Lesser General Public License for more details.
# You should have received a copy of the GNU Lesser General Public License
# along with this program; if not, write to the Free Software Foundation,
# Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
# Contributors:
#    INITIAL AUTHORS - initial API and implementation and/or initial
#                         documentation
#        :author: Francois Gallard, Matthias De Lozzo
"""Caching module to store all the entries in memory."""
from __future__ import annotations

import logging
from multiprocessing import RLock
from typing import Any

from gemseo.core.cache import AbstractFullCache
from gemseo.core.cache import Data
from gemseo.core.cache import JacobianData
from gemseo.utils.data_conversion import nest_flat_bilevel_dict
from gemseo.utils.locks import synchronized

LOGGER = logging.getLogger(__name__)

[docs]class MemoryFullCache(AbstractFullCache): """Cache using memory to cache all the data.""" def __init__( self, tolerance: float = 0.0, name: str | None = None, is_memory_shared: bool = True, ) -> None: """ Args: is_memory_shared : If ``True``, a shared memory dictionary is used to store the data, which makes the cache compatible with multiprocessing. Warnings: If ``is_memory_shared`` is ``False`` and multiple disciplines point to the same cache or the process is multi-processed, there may be duplicate computations because the cache will not be shared among the processes. This class relies on some multiprocessing features, it is therefore necessary to protect its execution with an ``if __name__ == '__main__':`` statement when working on Windows. """ super().__init__(tolerance, name) self.__is_memory_shared = is_memory_shared self.__initialize_data() def __initialize_data(self) -> None: """Initialize the dictionary storing the data.""" if self.__is_memory_shared: self.__data = self._manager.dict() else: self.__data = {} def _copy_empty_cache(self) -> MemoryFullCache: return MemoryFullCache(self.tolerance,, self.__is_memory_shared) def _initialize_entry( self, index: int, ) -> None: self.__data[index] = {} def _set_lock(self) -> RLock: return RLock() def _has_group( self, index: int, group: str, ) -> bool: return group in self.__data.get(index)
[docs] @synchronized def clear(self) -> None: super().clear() self.__initialize_data()
def _read_data( self, index: int, group: str, **options: Any, ) -> Data | JacobianData: data = self.__data[index].get(group) if group == self._JACOBIAN_GROUP and data is not None: return nest_flat_bilevel_dict(data, separator=self._JACOBIAN_SEPARATOR) return data def _write_data( self, values: Data, group: str, index: int, ) -> None: data = self.__data[index] data[group] = values.copy() self.__data[index] = data @property def copy(self) -> MemoryFullCache: """Copy the current cache. Returns: A copy of the current cache. """ cache = self._copy_empty_cache() cache.update(self) return cache