|
bool | Mantid::MDAlgorithms::appearsInCurrentData (const std::string &data_source, std::vector< std::string > ¤t_data) |
| Check if the named data source is in the vector of data currently in the workspace. More...
|
|
bool MANTID_MDALGORITHMS_DLL | Mantid::MDAlgorithms::dataExists (const std::string &data_name) |
| Check if the named data source is an existing workspace or file. More...
|
|
bool | Mantid::MDAlgorithms::fileExists (const std::string &filename) |
| Test if a file with the given full path name exists. More...
|
|
std::string MANTID_MDALGORITHMS_DLL | Mantid::MDAlgorithms::filterToExistingSources (std::vector< std::string > &input_data, std::vector< double > &psi, std::vector< double > &gl, std::vector< double > &gs, std::vector< double > &efix) |
| Reduce the vector of input data to only data files and workspaces which can be found. More...
|
|
std::string MANTID_MDALGORITHMS_DLL | Mantid::MDAlgorithms::filterToNew (std::vector< std::string > &input_data, std::vector< std::string > ¤t_data, std::vector< double > &psi, std::vector< double > &gl, std::vector< double > &gs, std::vector< double > &efix) |
| Reduce the vector of input data to only data files and workspaces which are not found in the vector of data currently in the workspace. More...
|
|
std::vector< std::string > | Mantid::MDAlgorithms::getHistoricalDataSources (const API::WorkspaceHistory &ws_history, const std::string &create_alg_name, const std::string &accumulate_alg_name) |
| Return a vector of the names of files and workspaces which have been previously added to the workspace. More...
|
|
void MANTID_MDALGORITHMS_DLL | Mantid::MDAlgorithms::insertDataSources (const std::string &data_sources, std::unordered_set< std::string > &historical_data_sources) |
| Extract names of data sources from workspace history and form a set of historical data sources. More...
|
|
void MANTID_MDALGORITHMS_DLL | Mantid::MDAlgorithms::padParameterVector (std::vector< double > ¶m_vector, const size_t grow_to_size) |
| Pad vector of parameters to given length. More...
|
|