1 | /*
|
---|
2 | * Project: MoleCuilder
|
---|
3 | * Description: creates and alters molecular systems
|
---|
4 | * Copyright (C) 2010-2012 University of Bonn. All rights reserved.
|
---|
5 | * Please see the LICENSE file or "Copyright notice" in builder.cpp for details.
|
---|
6 | */
|
---|
7 |
|
---|
8 | /*
|
---|
9 | * KeySet.cpp
|
---|
10 | *
|
---|
11 | * Created on: Oct 20, 2011
|
---|
12 | * Author: heber
|
---|
13 | */
|
---|
14 |
|
---|
15 | #ifdef HAVE_CONFIG_H
|
---|
16 | #include <config.h>
|
---|
17 | #endif
|
---|
18 |
|
---|
19 | #include "CodePatterns/MemDebug.hpp"
|
---|
20 |
|
---|
21 | #include <sstream>
|
---|
22 |
|
---|
23 | #include "CodePatterns/Log.hpp"
|
---|
24 |
|
---|
25 | #include "KeySet.hpp"
|
---|
26 |
|
---|
27 | /** Constructor of class KeySet.
|
---|
28 | *
|
---|
29 | * This class contains a set of indices for the atoms contained in a fragment.
|
---|
30 | *
|
---|
31 | */
|
---|
32 | KeySet::KeySet()
|
---|
33 | {}
|
---|
34 |
|
---|
35 | /** Destructor of class KeySet.
|
---|
36 | *
|
---|
37 | */
|
---|
38 | KeySet::~KeySet()
|
---|
39 | {}
|
---|
40 |
|
---|
41 |
|
---|
42 | /** Comparator to allow for placing in a map.
|
---|
43 | *
|
---|
44 | * @param a instance to compare to
|
---|
45 | * @return true - this instance has less items or the first different item itself is less,
|
---|
46 | * false - else
|
---|
47 | */
|
---|
48 | bool KeySet::operator<(const KeySet &a) const
|
---|
49 | {
|
---|
50 | //LOG(0, "my check is used.");
|
---|
51 | if (size() < a.size()) {
|
---|
52 | return true;
|
---|
53 | } else {
|
---|
54 | if (size() > a.size()) {
|
---|
55 | return false;
|
---|
56 | } else {
|
---|
57 | KeySet::iterator IteratorA = begin();
|
---|
58 | KeySet::iterator IteratorB = a.begin();
|
---|
59 | while ((IteratorA != end()) && (IteratorB != a.end())) {
|
---|
60 | if ((*IteratorA) < (*IteratorB))
|
---|
61 | return true;
|
---|
62 | else if ((*IteratorA) > (*IteratorB)) {
|
---|
63 | return false;
|
---|
64 | } // else, go on to next index
|
---|
65 | IteratorA++;
|
---|
66 | IteratorB++;
|
---|
67 | } // end of while loop
|
---|
68 | }// end of check in case of equal sizes
|
---|
69 | }
|
---|
70 | return false; // if we reach this point, they are equal
|
---|
71 | }
|
---|
72 |
|
---|
73 | /** Scans a single line for number and puts them into \a KeySet.
|
---|
74 | * \param *buffer buffer to scan
|
---|
75 | * \return true - at least one valid atom id parsed, false - CurrentSet is empty
|
---|
76 | */
|
---|
77 | bool KeySet::ScanBufferIntoKeySet(char *buffer)
|
---|
78 | {
|
---|
79 | std::stringstream line;
|
---|
80 | int AtomNr;
|
---|
81 | int status = 0;
|
---|
82 |
|
---|
83 | line.str(buffer);
|
---|
84 | while (!line.eof()) {
|
---|
85 | line >> AtomNr;
|
---|
86 | if (AtomNr >= 0) {
|
---|
87 | insert(AtomNr); // insert at end, hence in same order as in file!
|
---|
88 | status++;
|
---|
89 | } // else it's "-1" or else and thus must not be added
|
---|
90 | }
|
---|
91 | std::stringstream output;
|
---|
92 | for(KeySet::iterator runner = begin(); runner != end(); runner++)
|
---|
93 | output << (runner == begin() ? "" : " " ) << (*runner);
|
---|
94 | LOG(2, "INFO: The scanned KeySet is " << output.str());
|
---|
95 | return (status != 0);
|
---|
96 | }
|
---|