0
|
1 |
/* OGDL Microedition.
|
|
2 |
* (C) Rolf Veen, 2006.
|
|
3 |
* License: see http://ogdl.org.
|
|
4 |
*/
|
|
5 |
|
|
6 |
package ogdl;
|
|
7 |
|
|
8 |
import ogdl.parser.ParserHandlerBase;
|
|
9 |
|
|
10 |
|
|
11 |
public class Ogdl2Graph extends ParserHandlerBase {
|
|
12 |
Graph[] g;
|
|
13 |
int index;
|
|
14 |
String edge;
|
|
15 |
int level;
|
|
16 |
|
|
17 |
public Ogdl2Graph(Graph g) {
|
|
18 |
this.g = new Graph[50];
|
|
19 |
index = 0;
|
|
20 |
level = 0;
|
|
21 |
edge = null;
|
|
22 |
this.g[0] = g;
|
|
23 |
}
|
|
24 |
|
12
|
25 |
public boolean event(int i, int j, String s)
|
0
|
26 |
{
|
12
|
27 |
if (i != OgdlParser.CONTENT)
|
|
28 |
return true;
|
0
|
29 |
|
12
|
30 |
if (s == null) return true;
|
0
|
31 |
|
|
32 |
edge = s;
|
|
33 |
level = j;
|
|
34 |
|
|
35 |
Graph node = new Graph();
|
|
36 |
node.setName(s);
|
|
37 |
g[level].add(node);
|
|
38 |
level++;
|
|
39 |
g[level] = node;
|
12
|
40 |
return true;
|
0
|
41 |
}
|
|
42 |
|
12
|
43 |
/*
|
|
44 |
public boolean event(int i, int j, Object s)
|
0
|
45 |
{
|
12
|
46 |
if (i != OgdlParser.CONTENT && i != OgdlParser.BINARY)
|
|
47 |
return true;
|
0
|
48 |
|
12
|
49 |
if (s == null) return true;
|
0
|
50 |
|
|
51 |
if (i == OgdlBinaryParser.BINARY) {
|
|
52 |
g[level].setValue(s);
|
|
53 |
}
|
|
54 |
else {
|
|
55 |
Graph node = new Graph();
|
|
56 |
level = j;
|
|
57 |
node.setName(s.toString());
|
|
58 |
g[level].add(node);
|
|
59 |
level++;
|
|
60 |
g[level] = node;
|
|
61 |
}
|
12
|
62 |
return true;
|
0
|
63 |
}
|
12
|
64 |
*/
|
0
|
65 |
}
|