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
133
134
135
136
137
138
139
|
/*
* 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.
*/
/* (C) Marcin Kwadrans <quarter@users.sourceforge.net> */
#include "include/support.h"
#include "include/paritycommand.h"
#include "include/message.h"
class LWCommandTo: public LWCommandSegment {
private:
gboolean has_step;
public:
LWCommandTo (): has_step(FALSE) {}
LWValue *execute1 (LWContext *context, guint argc, LWValue *args[])
{
g_return_val_if_fail ((has_step == FALSE && argc == 1) || (has_step == TRUE && argc == 2), NULL);
g_return_val_if_fail (context->instrPtr->next != NULL, NULL);
g_return_val_if_fail (FALSE == g_queue_is_empty (context->stack), NULL);
LWValue *iterVariable = (LWValue *) g_queue_peek_head (context->stack);
if (iterVariable->toInt() > args[0]->toInt())
{
g_queue_pop_head (context->stack);
context->instrPtr = context->instrPtr->next->next;
}
return NULL;
}
LWValue *resume1 (LWContext *context, guint argc, LWValue *args[])
{
g_return_val_if_fail ((has_step == FALSE && argc == 1) || (has_step == TRUE && argc == 2), NULL);
g_return_val_if_fail (context->instrPtr->next != NULL, NULL);
g_return_val_if_fail (FALSE == g_queue_is_empty (context->stack), NULL);
LWValue *iterVariable = (LWValue *) g_queue_peek_head (context->stack);
gint step = (has_step == TRUE) ? args[1]->toInt() : 1;
if (iterVariable->toInt() + step > args[0]->toInt())
{
g_queue_pop_head (context->stack);
context->instrPtr = context->instrPtr->next->next;
} else {
LWValue v(iterVariable->toInt() + step);
iterVariable->set (&v);
}
return NULL;
}
const gchar *getName ()
{
return "to";
}
gchar *getHint ()
{
return _("Count to");
}
void checkArgument (guint n, LWValue *value)
{
//For now checking step range is not implemented...
if (n == 0)
if (FALSE == value->isVariable() && FALSE == value->checkRange())
throw new LWMessage (LW_ERROR_NumberOutOfRange);
}
void checkArgc (guint n)
{
if (has_step == FALSE && n != 1)
throw new LWMessage (LW_ERROR_WrongNumberOfArguments);
if (has_step == TRUE && n != 2)
throw new LWMessage (LW_ERROR_PleaseSpecifyStep);
}
gboolean matchPrevCondition (LWCommand *cmd)
{
(void) cmd;
return TRUE;
}
gboolean matchNextCondition (LWCommand *cmd)
{
return ((!g_ascii_strcasecmp (cmd->getName(), "break")) ||
(!g_ascii_strcasecmp (cmd->getName(), "continue")) ||
(!g_ascii_strcasecmp (cmd->getName(), "step"))) ? TRUE : FALSE;
}
gboolean matchWith (LWCommand *cmd)
{
if (cmd == NULL)
throw new LWMessage (LW_ERROR_ToButWhereIsFor);
if (!g_ascii_strcasecmp (cmd->getName(), "step")) {
has_step = TRUE;
return TRUE;
}
if (g_ascii_strcasecmp (cmd->getName(), "for2"))
throw new LWMessage (LW_ERROR_ToButWhereIsFor);
match();
return TRUE;
}
gboolean isLoop ()
{
return TRUE;
}
void reset1 ()
{
has_step = FALSE;
LWCommandSegment::reset1();
}
};
LWSymbol *new_LWCommandTo()
{
return new LWCommandTo();
}
|
