OPALX (Object Oriented Parallel Accelerator Library for Exascal) master (dc2a29eed580)
OPALX
Loading...
Searching...
No Matches
EndFieldModel.cpp
Go to the documentation of this file.
1/*
2 * Copyright (c) 2017, Chris Rogers
3 * All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are met:
6 * 1. Redistributions of source code must retain the above copyright notice,
7 * this list of conditions and the following disclaimer.
8 * 2. Redistributions in binary form must reproduce the above copyright notice,
9 * this list of conditions and the following disclaimer in the documentation
10 * and/or other materials provided with the distribution.
11 * 3. Neither the name of STFC nor the names of its contributors may be used to
12 * endorse or promote products derived from this software without specific
13 * prior written permission.
14 *
15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
25 * POSSIBILITY OF SUCH DAMAGE.
26 */
27
29#include <algorithm>
30#include <map>
31#include <sstream>
33
34namespace endfieldmodel {
35
36 bool GreaterThan(std::vector<int> v1, std::vector<int> v2) {
37 size_t n1(v1.size()), n2(v2.size());
38 for (size_t i = 0; i < n1 && i < n2; ++i) {
39 if (v1[n1 - 1 - i] > v2[n2 - 1 - i]) return true;
40 if (v1[n1 - 1 - i] < v2[n2 - 1 - i]) return false;
41 }
42 return false;
43 }
44
45 std::vector<std::vector<int> > CompactVector(std::vector<std::vector<int> > vec) {
46 // first sort the list
47 std::sort(vec.begin(), vec.end(), GreaterThan);
48 // now look for n = n+1
49 for (size_t j = 0; j < vec.size() - 1; ++j) {
50 while (j < vec.size() - 1
52 vec[j].begin() + 1, vec[j].end(), vec[j + 1].begin() + 1,
53 vec[j + 1].end())) {
54 vec[j][0] += vec[j + 1][0];
55 vec.erase(vec.begin() + j + 1);
56 }
57 }
58 return vec;
59 }
60
61 std::map<std::string, std::shared_ptr<EndFieldModel> > EndFieldModel::efm_map;
62
63 std::shared_ptr<EndFieldModel> EndFieldModel::getEndFieldModel(std::string name) {
64 try {
65 return efm_map.at(name);
66 } catch (std::exception& exc) {
68 "EndFieldModel::getEndFieldModel",
69 "Could not find EndFieldModel with name '" + name + "'");
70 }
71 }
72
73 void EndFieldModel::setEndFieldModel(std::string name, std::shared_ptr<EndFieldModel> efm) {
74 efm_map[name] = efm;
75 }
76
77 std::string EndFieldModel::getName(std::shared_ptr<EndFieldModel> efm) {
78 typedef std::map<std::string, std::shared_ptr<EndFieldModel> > EfmMap;
79 for (EfmMap::iterator it = efm_map.begin(); it != efm_map.end(); ++it) {
80 if (it->second == efm) {
81 return it->first;
82 }
83 }
84 std::stringstream ss;
85 ss << efm;
87 "EndFieldModel::getName", "Could not find EndFieldModel with address " + ss.str());
88 }
89
90} // namespace endfieldmodel
static std::shared_ptr< EndFieldModel > getEndFieldModel(std::string name)
static std::string getName(std::shared_ptr< EndFieldModel > efm)
static std::map< std::string, std::shared_ptr< EndFieldModel > > efm_map
static void setEndFieldModel(std::string name, std::shared_ptr< EndFieldModel > efm)
std::vector< std::vector< int > > CompactVector(std::vector< std::vector< int > > vec)
bool IterableEquality(TEMP_ITER a_begin, TEMP_ITER a_end, TEMP_ITER b_begin, TEMP_ITER b_end)
bool GreaterThan(std::vector< int > v1, std::vector< int > v2)
CompactVector helper function, used for sorting.