-
Notifications
You must be signed in to change notification settings - Fork 122
/
ChopData.h
64 lines (53 loc) · 2.11 KB
/
ChopData.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#ifndef MANTID_ALGORITHMS_CHOPDATA
#define MANTID_ALGORITHMS_CHOPDATA
#include "MantidAPI/Algorithm.h"
namespace Mantid {
namespace Algorithms {
/**
For use in TOSCA reduction. Splits a 0-100k microsecond workspace into either
five 20k or
three 20k and a 40k workspaces
@author Michael Whitty
@date 03/02/2011
Copyright © 2010 ISIS Rutherford Appleton Laboratory, NScD Oak Ridge
National Laboratory & European Spallation Source
This file is part of Mantid.
Mantid is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
Mantid is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
File change history is stored at: <https://github.com/mantidproject/mantid>
Code Documentation is available at: <http://doxygen.mantidproject.org>
*/
class DLLExport ChopData : public API::Algorithm {
public:
const std::string name() const override {
return "ChopData";
} ///< @return the algorithms name
const std::string category() const override {
return "Transforms\\Splitting";
} ///< @return the algorithms category
int version() const override {
return (1);
} ///< @return version number of algorithm
/// Algorithm's summary
const std::string summary() const override {
return "Splits an input workspace into a grouped workspace, where each "
"spectra "
"if 'chopped' at a certain point (given in 'Step' input value) "
"and the X values adjusted to give all the workspace in the group "
"the same binning.";
}
private:
void init() override; ///< Initialise the algorithm. Declare properties, etc.
void exec() override; ///< Executes the algorithm.
};
}
}
#endif