RayleighChebyshev/RCarray2d.h at master · apmcollab/RayleighChebyshev · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
#include <vector>

#ifndef RC_ARRAY_2D_
#define RC_ARRAY_2D_

//
// Class RCarray2d is a templated container class for storing a 2D array
// of specified data type by columns. This class is used by the
// RayleighChebeyshev eigensystem procedures.
//
// Since minimal functionality is required for the 2D array in the
// RayleighChebyshev procedure, this class is used to avoid
// external dependencies if a  "full-bodied' two dimensional array class
// were used.
//
// No bounds checking is performed.
//
// Author Chris Anderson March, 7, 2012
//
/*
#############################################################################
#
# Copyright 2012-2023 Chris Anderson
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the Lesser GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
# GNU General Public License for more details.
#
# For a copy of the GNU General Public License see
# <http://www.gnu.org/licenses/>.
#
#############################################################################
*/
template <typename Dtype > class RCarray2d
{
public:
	RCarray2d()
	{
	arrayData.clear();
	rowSize = 0;
	colSize = 0;
	};

    RCarray2d(const RCarray2d& A)
	{
    if(arrayData.size() == 0) {initialize(); return;}
	initialize(A);
	}


    RCarray2d(long rowSize, long colSize)
	{
	initialize(rowSize,colSize);
	}

	virtual ~RCarray2d()
	{}

	void initialize()
	{
	arrayData.clear();
	rowSize = 0;
    colSize = 0;
	}

    void initialize(long rowSize, long colSize)
    {
    arrayData.resize(rowSize*colSize,0.0);
    this->rowSize = rowSize;
    this->colSize = colSize;
    }

    void initialize(const RCarray2d& A)
    {
    rowSize   = A.rowSize;
    colSize   = A.colSize;
    arrayData.clear();
    arrayData = A.arrayData;
    }

    long getRowSize() const
    {
    return rowSize;
    }

    long getColSize() const
    {
    return colSize;
    }

    inline Dtype&  operator()(long i1, long i2)
    {
    return arrayData[i1  + i2*rowSize];
    };

    const inline Dtype&  operator()(long i1, long i2) const
    {
    return arrayData[i1 + i2*rowSize];
    };

    void operator=(const RCarray2d& A)
    {
    if((rowSize != A.rowSize)||(colSize != A.colSize)){initialize(A);}
    else{arrayData = A.arrayData;}
    }

    void setToValue(Dtype val)
    {
    	for(size_t i = 0; i < arrayData.size(); i++)
    	{
    		arrayData[i] = val;
    	}
    }

    Dtype* getDataPointer(){return arrayData.data();};

    const Dtype* getDataPointer() const {return arrayData.data();};


	std::vector<Dtype> arrayData;
	long                  rowSize;
	long                  colSize;
};


#endif