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
quantumNode.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 
23 __all__ = ("QuantumNode", "NodeId", "BuildId")
24 
25 from dataclasses import dataclass
26 from typing import NewType
27 
28 from ..pipeline import TaskDef
29 from lsst.daf.butler import Quantum, DatasetRef
30 
31 BuildId = NewType("BuildId", str)
32 
33 
34 def _hashDsRef(ref: DatasetRef) -> int:
35  return hash((ref.datasetType, ref.dataId))
36 
37 
38 @dataclass(frozen=True, eq=True)
39 class NodeId:
40  """This represents an unique identifier of a node within an individual
41  construction of a `QuantumGraph`. This identifier will stay constant
42  through a pickle, and any `QuantumGraph` methods that return a new
43  `QuantumGraph`.
44 
45  A `NodeId` will not be the same if a new graph is built containing the same
46  information in a `QuantumNode`, or even built from exactly the same inputs.
47 
48  `NodeId`s do not play any role in deciding the equality or identity (hash)
49  of a `QuantumNode`, and are mainly useful in debugging or working with
50  various subsets of the same graph.
51 
52  This interface is a convenance only, and no guarantees on long term
53  stability are made. New implementations might change the `NodeId`, or
54  provide more or less guarantees.
55  """
56  number: int
57  """The unique position of the node within the graph assigned at graph
58  creation.
59  """
60  buildId: BuildId
61  """Unique identifier created at the time the originating graph was created
62  """
63 
64 
65 @dataclass(frozen=True)
67  """This class represents a node in the quantum graph.
68 
69  The quantum attribute represents the data that is to be processed at this
70  node.
71  """
72  quantum: Quantum
73  """The unit of data that is to be processed by this graph node"""
74  taskDef: TaskDef
75  """Definition of the task that will process the `Quantum` associated with
76  this node.
77  """
78  nodeId: NodeId
79  """The unique position of the node within the graph assigned at graph
80  creation.
81  """
82 
83  def __eq__(self, other: object) -> bool:
84  if not isinstance(other, QuantumNode):
85  return False
86  if self.quantum != other.quantum:
87  return False
88  return self.taskDeftaskDef == other.taskDef
89 
90  def __hash__(self) -> int:
91  """For graphs it is useful to have a more robust hash than provided
92  by the default quantum id based hashing
93  """
94  return hash((self.taskDeftaskDef, self.quantum))