Table of Contents
Name | Direction | Type | Default | Description |
---|---|---|---|---|
LHSWorkspace | Input | PeaksWorkspace | Mandatory | The first of peaks. |
RHSWorkspace | Input | PeaksWorkspace | Mandatory | The second set of peaks. |
OutputWorkspace | Output | PeaksWorkspace | The set of peaks that are in the first, but not the second, workspace. | |
Tolerance | Input | number | 0 | Maximum difference in each component of Q for which peaks are considered identical |
This algorithm takes an input workspace (the LHSWorkspace) and removes from it’s list of peaks any that are also found in a second workspace (the RHSWorkspace) in the same position in Q space within the specified tolerance. Each peak in the RHSWorkspace is taken in turn and compared to each peak in the LHSWorkspace in turn. The first match encountered is used, and the matching peak removed from the output before moving onto the next RHSWorkspace peak.
Categories: Algorithms | Crystal\Peaks
C++ source: DiffPeaksWorkspaces.cpp (last modified: 2017-10-03)
C++ header: DiffPeaksWorkspaces.h (last modified: 2016-06-15)