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
|
/*!
* \file
* \brief Implementation of a class factory for fixed-point data types Fix
* and CFix
* \author Johan Bergman and Adam Piatyszek
*
* -------------------------------------------------------------------------
*
* IT++ - C++ library of mathematical, signal processing, speech processing,
* and communications classes and functions
*
* Copyright (C) 1995-2008 (see AUTHORS file for a list of contributors)
*
* This program 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.
*
* 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.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*
* -------------------------------------------------------------------------
*/
#include <itpp/fixed/fix_factory.h>
#include <itpp/fixed/cfix.h>
namespace itpp {
void Fix_Factory::create(Fix* &ptr, const int n) const
{
void *p = ::operator new(sizeof(Fix) * n);
ptr = reinterpret_cast<Fix*>(p);
// Set fixed-point restrictions
for (int i = 0; i < n; ++i) {
new (ptr + i) Fix(0.0, 0, wordlen, emode, omode, qmode, stat_ptr);
}
}
void Fix_Factory::create(CFix* &ptr, const int n) const
{
void *p = ::operator new(sizeof(CFix) * n);
ptr = reinterpret_cast<CFix*>(p);
// Set fixed-point restrictions
for (int i = 0; i < n; ++i) {
new (ptr + i) CFix(0.0, 0, wordlen, emode, omode, qmode, stat_ptr);
}
}
template<>
void create_elements<Fix>(Fix* &ptr, const int n, const Factory &f)
{
if (const Fix_Factory *fix_factory_ptr = dynamic_cast<const Fix_Factory*>(&f)) {
// Yes, f seems to be a Fix_Factory. Now call the Fix_Factory::create method
fix_factory_ptr->create(ptr, n);
}
else {
// No, f does not seem to be a Fix_Factory. As a fallback solution,
// assume that f is DEFAULT_FACTORY and use the default constructor
void *p = ::operator new(sizeof(Fix) * n);
ptr = reinterpret_cast<Fix*>(p);
for (int i = 0; i < n; i++) {
new (ptr + i) Fix();
}
}
}
template<>
void create_elements<CFix>(CFix* &ptr, const int n, const Factory &f)
{
if (const Fix_Factory *fix_factory_ptr = dynamic_cast<const Fix_Factory*>(&f)) {
// Yes, f seems to be a Fix_Factory. Now call the Fix_Factory::create method
fix_factory_ptr->create(ptr, n);
}
else {
// No, f does not seem to be a Fix_Factory. As a fallback solution,
// assume that f is DEFAULT_FACTORY and use the default constructor
void *p = ::operator new(sizeof(CFix) * n);
ptr = reinterpret_cast<CFix*>(p);
for (int i = 0; i < n; i++) {
new (ptr + i) CFix();
}
}
}
} // namespace itpp
|
