LSST Applications  21.0.0+04719a4bac,21.0.0-1-ga51b5d4+f5e6047307,21.0.0-11-g2b59f77+a9c1acf22d,21.0.0-11-ga42c5b2+86977b0b17,21.0.0-12-gf4ce030+76814010d2,21.0.0-13-g1721dae+760e7a6536,21.0.0-13-g3a573fe+768d78a30a,21.0.0-15-g5a7caf0+f21cbc5713,21.0.0-16-g0fb55c1+b60e2d390c,21.0.0-19-g4cded4ca+71a93a33c0,21.0.0-2-g103fe59+bb20972958,21.0.0-2-g45278ab+04719a4bac,21.0.0-2-g5242d73+3ad5d60fb1,21.0.0-2-g7f82c8f+8babb168e8,21.0.0-2-g8f08a60+06509c8b61,21.0.0-2-g8faa9b5+616205b9df,21.0.0-2-ga326454+8babb168e8,21.0.0-2-gde069b7+5e4aea9c2f,21.0.0-2-gecfae73+1d3a86e577,21.0.0-2-gfc62afb+3ad5d60fb1,21.0.0-25-g1d57be3cd+e73869a214,21.0.0-3-g357aad2+ed88757d29,21.0.0-3-g4a4ce7f+3ad5d60fb1,21.0.0-3-g4be5c26+3ad5d60fb1,21.0.0-3-g65f322c+e0b24896a3,21.0.0-3-g7d9da8d+616205b9df,21.0.0-3-ge02ed75+a9c1acf22d,21.0.0-4-g591bb35+a9c1acf22d,21.0.0-4-g65b4814+b60e2d390c,21.0.0-4-gccdca77+0de219a2bc,21.0.0-4-ge8a399c+6c55c39e83,21.0.0-5-gd00fb1e+05fce91b99,21.0.0-6-gc675373+3ad5d60fb1,21.0.0-64-g1122c245+4fb2b8f86e,21.0.0-7-g04766d7+cd19d05db2,21.0.0-7-gdf92d54+04719a4bac,21.0.0-8-g5674e7b+d1bd76f71f,master-gac4afde19b+a9c1acf22d,w.2021.13
LSST Data Management Base Package
_implDetails.py
Go to the documentation of this file.
1 # This file is part of pipe_base.
2 #
3 # Developed for the LSST Data Management System.
4 # This product includes software developed by the LSST Project
5 # (http://www.lsst.org).
6 # See the COPYRIGHT file at the top-level directory of this distribution
7 # for details of code ownership.
8 #
9 # This program is free software: you can redistribute it and/or modify
10 # it under the terms of the GNU General Public License as published by
11 # the Free Software Foundation, either version 3 of the License, or
12 # (at your option) any later version.
13 #
14 # This program is distributed in the hope that it will be useful,
15 # but WITHOUT ANY WARRANTY; without even the implied warranty of
16 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 # GNU General Public License for more details.
18 #
19 # You should have received a copy of the GNU General Public License
20 # along with this program. If not, see <http://www.gnu.org/licenses/>.
21 from __future__ import annotations
22 from collections import defaultdict
23 
24 __all__ = ("_DatasetTracker", "DatasetTypeName")
25 
26 from dataclasses import dataclass, field
27 import networkx as nx
28 from typing import (DefaultDict, Generic, Optional, Set, TypeVar, Generator, Tuple, NewType,)
29 
30 from lsst.daf.butler import DatasetRef
31 
32 from .quantumNode import QuantumNode
33 from ..pipeline import TaskDef
34 
35 # NewTypes
36 DatasetTypeName = NewType("DatasetTypeName", str)
37 
38 # Generic type parameters
39 _T = TypeVar("_T", DatasetTypeName, DatasetRef)
40 _U = TypeVar("_U", TaskDef, QuantumNode)
41 
42 
43 @dataclass
44 class _DatasetTrackerElement(Generic[_U]):
45  inputs: Set[_U] = field(default_factory=set)
46  output: Optional[_U] = None
47 
48 
49 class _DatasetTracker(Generic[_T, _U]):
50  def __init__(self):
51  self._container: DefaultDict[_T, _DatasetTrackerElement[_U]] = defaultdict(_DatasetTrackerElement)
52 
53  def addInput(self, key: _T, value: _U):
54  self._container[key].inputs.add(value)
55 
56  def addOutput(self, key: _T, value: _U):
57  element = self._container[key]
58  if element.output is not None:
59  raise ValueError(f"Only one output for key {key} is allowed, "
60  f"the current output is set to {element.output}")
61  element.output = value
62 
63  def getInputs(self, key: _T) -> Set[_U]:
64  return self._container[key].inputs
65 
66  def getOutput(self, key: _T) -> Optional[_U]:
67  return self._container[key].output
68 
69  def getAll(self, key: _T) -> Set[_U]:
70  output = self._container[key].output
71  if output is not None:
72  return self._container[key].inputs.union((output,))
73  return set(self._container[key].inputs)
74 
75  def makeNetworkXGraph(self) -> nx.DiGraph:
76  graph = nx.DiGraph()
77  graph.add_edges_from(self._datasetDictToEdgeIterator_datasetDictToEdgeIterator())
78  if None in graph.nodes():
79  graph.remove_node(None)
80  return graph
81 
82  def _datasetDictToEdgeIterator(self) -> Generator[Tuple[Optional[_U], Optional[_U]], None, None]:
83  """Helper function designed to be used in conjunction with
84  `networkx.DiGraph.add_edges_from`. This takes a mapping of keys to
85  `_DatasetTrackers` and yields successive pairs of elements that are to
86  be considered connected by the graph.
87  """
88  for entry in self._container.values():
89  # If there is no inputs and only outputs (likely in test cases or
90  # building inits or something) use None as a Node, that will then
91  # be removed later
92  inputs = entry.inputs or (None,)
93  for inpt in inputs:
94  yield (entry.output, inpt)
95 
96  def keys(self) -> Set[_T]:
97  return set(self._container.keys())
Generator[Tuple[Optional[_U], Optional[_U]], None, None] _datasetDictToEdgeIterator(self)
Definition: _implDetails.py:82
daf::base::PropertySet * set
Definition: fits.cc:912