Table.C 3.77 KB
Newer Older
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
/*---------------------------------------------------------------------------*\
  =========                 |
  \\      /  F ield         | OpenFOAM: The Open Source CFD Toolbox
   \\    /   O peration     |
    \\  /    A nd           | Copyright (C) 1991-2007 OpenCFD Ltd.
     \\/     M anipulation  |
-------------------------------------------------------------------------------
License
    This file is part of OpenFOAM.

    OpenFOAM is free software; you can redistribute it and/or modify it
    under the terms of the GNU General Public License as published by the
    Free Software Foundation; either version 2 of the License, or (at your
    option) any later version.

    OpenFOAM 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.

    You should have received a copy of the GNU General Public License
    along with OpenFOAM; if not, write to the Free Software Foundation,
    Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA

\*---------------------------------------------------------------------------*/

#include "Table.H"

// * * * * * * * * * * * * * * * * Constructors  * * * * * * * * * * * * * * //

template<class Type>
Foam::Table<Type>::Table
(
    const word& entryName,
    const dictionary& dict
)
:
    DataEntry<Type>(typeName, entryName, dict),
    table_(this->dict_.lookup("table"))
{
    if (!table_.size())
    {
        FatalErrorIn
        (
             "Foam::Table<Type>::Table"
             "("
                 "const word& entryName,"
                 "const dictionary& dict"
             ")"
        ) << "Table is invalid (empty)" << nl
          << exit(FatalError);
    }
}


// * * * * * * * * * * * * * * * * Destructor  * * * * * * * * * * * * * * * //

template<class Type>
Foam::Table<Type>::~Table()
{}


// * * * * * * * * * * * * * * * Member Functions  * * * * * * * * * * * * * //

template<class Type>
Type Foam::Table<Type>::value(const scalar x) const
{
    // Return zero if out of bounds
    if ((x > table_[table_.size()-1].first()) || (x < table_[0].first()))
    {
        return pTraits<Type>::zero;
    }

74
    // Find i such that x(i) < x < x(i+1)
75
    label i = 0;
76
    while ((table_[i+1].first() < x) && (i+1 < table_.size()))
77
78
79
80
    {
        i++;
    }

81
82
83
84
85
    // Linear interpolation to find value
    return
        (x - table_[i].first())/(table_[i+1].first() - table_[i].first())
      * (table_[i+1].second() - table_[i].second())
      + table_[i].second();
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
}


template<class Type>
Type Foam::Table<Type>::integrate(const scalar x1, const scalar x2) const
{
    // Initialise return value
    Type sum = pTraits<Type>::zero;

    // Return zero if out of bounds
    if ((x1 > table_[table_.size()-1].first()) || (x2 < table_[0].first()))
    {
        return sum;
    }

    // Find start index
    label id1 = 0;
    while ((table_[id1].first() < x1) && (id1 < table_.size()))
    {
        id1++;
    }

    // Find end index
    label id2 = table_.size() - 1;
    while ((table_[id2].first() > x2) && (id2 >= 1))
    {
        id2--;
    }

    // Integrate table body
    for (label i=id1; i<id2; i++)
    {
        sum +=
            (table_[i].second() + table_[i+1].second())
120
          * (table_[i+1].first() - table_[i].first());
121
122
123
    }
    sum *= 0.5;

124
    // Add table ends (partial segments)
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
    if (id1 > 0)
    {
        sum += 0.5
          * (value(x1) + table_[id1].second())
          * (table_[id1].first() - x1);
    }
    if (id2 < table_.size() - 1)
    {
        sum += 0.5
          * (table_[id2].second() + value(x2))
          * (x2 - table_[id2].first());
    }

    return sum;
}

141

142
// ************************************************************************* //