Merge pull request #281 from lsst/tickets/DM-46145

DM-46145: Sort keys after deduplicating via set(...) to make order deterministic.

Author: TallJimbo

python/lsst/analysis/tools/interfaces/_stages.py

@@ -62,15 +62,15 @@ class BasePrep(KeyedDataAction):
     def getInputSchema(self) -> KeyedDataSchema:
         yield from (
             (column, Vector | Scalar | HealSparseMap | Tensor)
-            for column in set(self.keysToLoad).union(self.vectorKeys)
+            for column in sorted(set(self.keysToLoad).union(self.vectorKeys))
         )
         for action in self.selectors:
             yield from action.getInputSchema()
 
     def getOutputSchema(self) -> KeyedDataSchema:
         return (
             (column, Vector | Scalar | HealSparseMap | Tensor)
-            for column in set(self.keysToLoad).union(self.vectorKeys)
+            for column in sorted(set(self.keysToLoad).union(self.vectorKeys))
         )
 
     def __call__(self, data: KeyedData, **kwargs) -> KeyedData:
@@ -82,7 +82,7 @@ def __call__(self, data: KeyedData, **kwargs) -> KeyedData:
             else:
                 mask *= subMask  # type: ignore
         result: dict[str, Any] = {}
-        for key in set(self.keysToLoad).union(self.vectorKeys):
+        for key in sorted(set(self.keysToLoad).union(self.vectorKeys)):
             formattedKey = key.format_map(kwargs)
             result[formattedKey] = cast(Vector, data[formattedKey])
         if mask is not None:
@@ -101,8 +101,8 @@ def addInputSchema(self, inputSchema: KeyedDataSchema) -> None:
             existing.append(name)
             if typ == Vector:
                 existingVectors.append(name)
-        self.keysToLoad = set(existing)
-        self.vectorKeys = set(existingVectors)
+        self.keysToLoad = sorted(set(existing))
+        self.vectorKeys = sorted(set(existingVectors))
 
 
 class BaseProcess(KeyedDataAction):