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
|
/* ========================================================================
* PlantUML : a free UML diagram generator
* ========================================================================
*
* (C) Copyright 2009-2014, Arnaud Roques
*
* Project Info: http://plantuml.sourceforge.net
*
* This file is part of PlantUML.
*
* Licensed under The MIT License (Massachusetts Institute of Technology License)
*
* See http://opensource.org/licenses/MIT
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
* IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*
* Original Author: Arnaud Roques
*/
package net.sourceforge.plantuml.project2;
import java.util.HashMap;
import java.util.Map;
public class Knowledge {
private final TaskContainer taskContainer;
private final TimeLine timeline;
private final Map<String, Value> variables = new HashMap<String, Value>();
public Knowledge(TaskContainer taskContainer, TimeLine timeline) {
this.taskContainer = taskContainer;
this.timeline = timeline;
}
public Value evaluate(String exp) {
exp = exp.trim();
int idx = exp.indexOf('$');
if (idx != -1) {
return evaluate(exp.substring(0, idx), exp.substring(idx + 1));
}
if (exp.matches("\\d+")) {
return new ValueInt(Integer.parseInt(exp));
}
if (Day.isValidDesc(exp)) {
final Day day = new Day(exp);
return new ValueTime(day);
}
if (exp.startsWith("^")) {
exp = exp.substring(1);
}
if (variables.containsKey(exp)) {
return variables.get(exp);
}
idx = exp.indexOf("+");
if (idx != -1) {
return plus(exp.substring(0, idx), exp.substring(idx + 1));
}
throw new UnsupportedOperationException(exp);
}
private Value plus(String arg1, String arg2) {
final Value v1 = evaluate(arg1);
final Value v2 = evaluate(arg2);
if (v1 instanceof ValueInt && v2 instanceof ValueInt) {
return new ValueInt(((ValueInt) v1).getValue() + ((ValueInt) v2).getValue());
}
if (v1 instanceof ValueTime && v2 instanceof ValueInt) {
final int nb = ((ValueInt) v2).getValue();
TimeElement t = ((ValueTime) v1).getValue();
if (nb > 0) {
for (int i = 0; i < nb; i++) {
t = timeline.next(t);
}
}
if (nb < 0) {
for (int i = 0; i < -nb; i++) {
t = timeline.previous(t);
}
}
return new ValueTime(t);
}
throw new UnsupportedOperationException();
}
private Value evaluate(String task, String attribute) {
final Task t = taskContainer.getTask(task);
final TaskAttribute att = TaskAttribute.fromString(attribute);
if (att == TaskAttribute.COMPLETED) {
return new ValueTime(t.getCompleted());
}
throw new UnsupportedOperationException();
}
public void set(String var, Value exp) {
variables.put(var, exp);
}
}
|
