aboutsummaryrefslogtreecommitdiff
path: root/chaos/src/standard_map.hpp
blob: 5f77af9b10fff80e3c4519e50373b54999b26844 (plain)
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
// 
//  
//  chaos~
//  Copyright (C) 2004  Tim Blechmann
//  
//  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; see the file COPYING.  If not, write to
//  the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
//  Boston, MA 02111-1307, USA.

#include "map_base.hpp"
#include <cmath>

//  standard map: I[n+1] = I[n] + k * sin(theta[n])
//                theta[n+1] = theta[n] + I[n] + k * sin(theta[n])
//                0 <= theta <= 2*pi
//  taken from Willi-Hans Steeb: Chaos and Fractals

class standard:
	protected map_base
{
public:
	standard()
		: m_k(0.8)
	{
		m_num_eq = 2;
		m_data = new data_t[2];
		set_I(0.1);
		set_theta(0.2);
	}

	~standard()
	{
		delete m_data;
	}

	virtual void m_step()
	{
		data_t I = m_data[0];
		data_t theta = m_data[1];
		
		m_data[0] = I + m_k * sin(theta);
		theta = theta + I + k * sin(theta);

		if (y > 2 * M_PI)
		{
			do
			{
				y -= 2*M_PI;
			}
			while (y > 2 * M_PI);
			goto put_data;
		}
		
		if (y < 0)
		{
			do
			{
				y += 2*M_PI;
			}
			while (y < 0);
		}
		
	put_data:
		m_data[1] = theta;
	}


	void set_I(t_float f)
	{
		m_data[0] = (data_t) f;
	}

	t_float get_I()
	{
		return (t_float)m_data[0];
	}


	void set_theta(t_float f)
	{
		if ( (f >= 0) && (f < 2*M_PI))
			m_data[1] = (data_t) f;
		else
			post("value for theta %f out of range", f);
	}

	t_float get_theta()
	{
		return (t_float)m_data[1];
	}


	void set_k(t_float f)
	{
		m_k = (data_t) f;
	}

	t_float get_k()
	{
		return (t_float)m_k;
	}

private:	
	data_t m_k;
};


#define STANDARD_CALLBACKS									\
MAP_CALLBACKS;												\
FLEXT_CALLVAR_F(m_system->get_I, m_system->set_I);			\
FLEXT_CALLVAR_F(m_system->get_theta, m_system->set_theta);	\
FLEXT_CALLVAR_F(m_system->get_k, m_system->set_k);


#define STANDARD_ATTRIBUTES												\
MAP_ATTRIBUTES;															\
FLEXT_ADDATTR_VAR("I",m_system->get_I, m_system->set_I);				\
FLEXT_ADDATTR_VAR("theta",m_system->get_theta, m_system->set_theta);	\
FLEXT_ADDATTR_VAR("k",m_system->get_k, m_system->set_k);