Chaste Commit::baa90ac2819b962188b7562f2326be23c47859a7
CellEdgeData.cpp
1/*
2
3Copyright (c) 2005-2024, University of Oxford.
4All rights reserved.
5
6University of Oxford means the Chancellor, Masters and Scholars of the
7University of Oxford, having an administrative office at Wellington
8Square, Oxford OX1 2JD, UK.
9
10This file is part of Chaste.
11
12Redistribution and use in source and binary forms, with or without
13modification, are permitted provided that the following conditions are met:
14 * Redistributions of source code must retain the above copyright notice,
15 this list of conditions and the following disclaimer.
16 * Redistributions in binary form must reproduce the above copyright notice,
17 this list of conditions and the following disclaimer in the documentation
18 and/or other materials provided with the distribution.
19 * Neither the name of the University of Oxford nor the names of its
20 contributors may be used to endorse or promote products derived from this
21 software without specific prior written permission.
22
23THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
24AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
27LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
28CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
29GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
32OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33
34*/
35
36#include "CellEdgeData.hpp"
37
41
42void CellEdgeData::SetItem(const std::string& rVariableName, const std::vector<double>& rData)
43{
44 this->mCellEdgeData[rVariableName] = rData;
45}
46
47std::vector<double> CellEdgeData::GetItem(const std::string& rVariableName) const
48{
49 /*
50 * Note that mCellData[rVariableName] is not const. If rVariableName is not
51 * a key, then mCellData[rVariableName] will create a new item in the map
52 * and increase the size by one. Using a const_iterator ensures that the
53 * map remains const.
54 */
55 std::map<std::string, std::vector<double> >::const_iterator it = mCellEdgeData.find(rVariableName);
56 if (it == mCellEdgeData.end())
57 {
58 EXCEPTION("The item " << rVariableName << " is not stored");
59 }
60 return(it->second);
61}
62
63double CellEdgeData::GetItemAtIndex(const std::string& rVariableName, const unsigned int index)
64{
65 /*
66 * Note that mCellData[rVariableName] is not const. If rVariableName is not
67 * a key, then mCellData[rVariableName] will create a new item in the map
68 * and increase the size by one. Using a const_iterator ensures that the
69 * map remains const.
70 */
71 std::map<std::string, std::vector<double> >::const_iterator it = mCellEdgeData.find(rVariableName);
72 if (it == mCellEdgeData.end())
73 {
74 EXCEPTION("The item " << rVariableName << " is not stored");
75 }
76 if (it->second.size() <= index)
77 {
78 EXCEPTION("The item " << rVariableName << " does not have index " << index);
79 }
80
81 return(it->second[index]);
82}
83
85{
86 return mCellEdgeData.size();
87}
88
89std::vector<std::string> CellEdgeData::GetKeys() const
90{
91 std::vector<std::string> keys;
92 for (auto& kv : mCellEdgeData)
93 {
94 keys.push_back(kv.first);
95 }
96 return keys;
97}
98
100// Declare identifier for the serializer
#define EXCEPTION(message)
#define CHASTE_CLASS_EXPORT(T)
std::map< std::string, std::vector< double > > mCellEdgeData
std::vector< double > GetItem(const std::string &rVariableName) const
std::vector< std::string > GetKeys() const
unsigned GetNumItems() const
void SetItem(const std::string &rVariableName, const std::vector< double > &rData)
double GetItemAtIndex(const std::string &rVariableName, const unsigned index)
virtual ~CellEdgeData()