| 1 | /*
|
|---|
| 2 | * Project: MoleCuilder
|
|---|
| 3 | * Description: creates and alters molecular systems
|
|---|
| 4 | * Copyright (C) 2010-2012 University of Bonn. All rights reserved.
|
|---|
| 5 | *
|
|---|
| 6 | *
|
|---|
| 7 | * This file is part of MoleCuilder.
|
|---|
| 8 | *
|
|---|
| 9 | * MoleCuilder 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 2 of the License, or
|
|---|
| 12 | * (at your option) any later version.
|
|---|
| 13 | *
|
|---|
| 14 | * MoleCuilder 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 MoleCuilder. If not, see <http://www.gnu.org/licenses/>.
|
|---|
| 21 | */
|
|---|
| 22 |
|
|---|
| 23 | /** \file parsing.cpp
|
|---|
| 24 | *
|
|---|
| 25 | * Declarations of various class functions for the parsing of value files.
|
|---|
| 26 | *
|
|---|
| 27 | */
|
|---|
| 28 |
|
|---|
| 29 | // ======================================= INCLUDES ==========================================
|
|---|
| 30 |
|
|---|
| 31 | // include config.h
|
|---|
| 32 | #ifdef HAVE_CONFIG_H
|
|---|
| 33 | #include <config.h>
|
|---|
| 34 | #endif
|
|---|
| 35 |
|
|---|
| 36 | //#include "CodePatterns/MemDebug.hpp"
|
|---|
| 37 |
|
|---|
| 38 | #include <fstream>
|
|---|
| 39 | #include <cmath>
|
|---|
| 40 |
|
|---|
| 41 | #include "CodePatterns/Log.hpp"
|
|---|
| 42 |
|
|---|
| 43 | #include "Helpers/defs.hpp"
|
|---|
| 44 |
|
|---|
| 45 | #include "Fragmentation/helpers.hpp"
|
|---|
| 46 |
|
|---|
| 47 | // ======================================= FUNCTIONS ==========================================
|
|---|
| 48 |
|
|---|
| 49 | /** Test if given filename can be opened.
|
|---|
| 50 | * \param filename name of file
|
|---|
| 51 | * \param test true - no error message, false - print error
|
|---|
| 52 | * \return given file exists
|
|---|
| 53 | */
|
|---|
| 54 | bool FilePresent(const char *filename, bool test)
|
|---|
| 55 | {
|
|---|
| 56 | std::ifstream input;
|
|---|
| 57 |
|
|---|
| 58 | input.open(filename, ios::in);
|
|---|
| 59 | if (input.fail()) {
|
|---|
| 60 | if (!test)
|
|---|
| 61 | LOG(0, endl << "FilePresent: Unable to open " << filename << ", is the directory correct?");
|
|---|
| 62 | return false;
|
|---|
| 63 | }
|
|---|
| 64 | input.close();
|
|---|
| 65 | return true;
|
|---|
| 66 | };
|
|---|
| 67 |
|
|---|
| 68 | /** Test the given parameters.
|
|---|
| 69 | * \param argc argument count
|
|---|
| 70 | * \param **argv arguments array
|
|---|
| 71 | * \return given inputdir is valid
|
|---|
| 72 | */
|
|---|
| 73 | bool TestParams(int argc, char **argv)
|
|---|
| 74 | {
|
|---|
| 75 | std::ifstream input;
|
|---|
| 76 | stringstream line;
|
|---|
| 77 |
|
|---|
| 78 | line << argv[1] << FRAGMENTPREFIX << KEYSETFILE;
|
|---|
| 79 | return FilePresent(line.str().c_str(), false);
|
|---|
| 80 | };
|
|---|
| 81 |
|
|---|
| 82 | /** Returns a string with \a i prefixed with 0s to match order of total number of molecules in digits.
|
|---|
| 83 | * \param FragmentNumber total number of fragments to determine necessary number of digits
|
|---|
| 84 | * \param digits number to create with 0 prefixed
|
|---|
| 85 | * \return allocated(!) char array with number in digits, ten base.
|
|---|
| 86 | */
|
|---|
| 87 | char *FixedDigitNumber(const int FragmentNumber, const int digits)
|
|---|
| 88 | {
|
|---|
| 89 | char *returnstring;
|
|---|
| 90 | int number = FragmentNumber;
|
|---|
| 91 | int order = 0;
|
|---|
| 92 | while (number != 0) { // determine number of digits needed
|
|---|
| 93 | number = (int)floor(((double)number / 10.));
|
|---|
| 94 | order++;
|
|---|
| 95 | //LOG(0, "Number is " << number << ", order is " << order << ".");
|
|---|
| 96 | }
|
|---|
| 97 | // allocate string
|
|---|
| 98 | returnstring = new char[order + 2];
|
|---|
| 99 | // terminate and fill string array from end backward
|
|---|
| 100 | returnstring[order] = '\0';
|
|---|
| 101 | number = digits;
|
|---|
| 102 | for (int i=order;i--;) {
|
|---|
| 103 | returnstring[i] = '0' + (char)(number % 10);
|
|---|
| 104 | number = (int)floor(((double)number / 10.));
|
|---|
| 105 | }
|
|---|
| 106 | //LOG(0, returnstring);
|
|---|
| 107 | return returnstring;
|
|---|
| 108 | };
|
|---|