32 |
import java.util.Iterator; |
import java.util.Iterator; |
33 |
|
|
34 |
public class Graphs { |
public class Graphs { |
35 |
|
public static boolean dbg = true; |
36 |
|
public static void p(String s) { System.out.println("swamp.Graphs:: "+s); } |
37 |
|
|
38 |
public static Model toModel(ConstGraph g) { |
public static Model toModel(ConstGraph g) { |
39 |
try { |
try { |
40 |
Model m = new ModelMem(); |
Model m = new ModelMem(); |
41 |
Iterator i=g.findN_XAA_Iter(); |
for (Iterator i=g.findN_XAA_Iter(); i.hasNext();) { |
|
while(i.hasNext()) { |
|
42 |
Object o = i.next(); |
Object o = i.next(); |
43 |
Resource sub = m.createResource(Nodes.toString(o)); |
Resource sub = m.createResource(Nodes.toString(o)); |
44 |
Iterator j=g.findN_1XA_Iter(o); |
|
45 |
while(j.hasNext()) { |
for (Iterator j=g.findN_1XA_Iter(o); j.hasNext();) { |
46 |
Object p = j.next(); |
Object p = j.next(); |
47 |
Property prop = m.createProperty("", Nodes.toString(p)); |
Property prop = m.createProperty("", Nodes.toString(p)); |
48 |
Iterator k=g.findN_11X_Iter(o,p); |
|
49 |
while(k.hasNext()) { |
for (Iterator k=g.findN_11X_Iter(o,p); k.hasNext();) { |
50 |
Object q = k.next(); |
Object q = k.next(); |
51 |
if(q instanceof Literal) { |
if(q instanceof Literal) { |
52 |
String s = ((Literal)q).getTextString(); |
p("Literal! : "+ q); |
53 |
sub.addProperty(prop, s); |
String s = ((Literal)q).getTextString(); |
54 |
|
sub.addProperty(prop, s); |
55 |
} else { |
} else { |
56 |
|
p("Resource! : "+ q); |
57 |
Resource ob = m.createResource(Nodes.toString(q)); |
Resource ob = m.createResource(Nodes.toString(q)); |
58 |
sub.addProperty(prop, o); |
sub.addProperty(prop, o); |
59 |
} |
} |
68 |
|
|
69 |
public static Graph toGraph(Model m) { |
public static Graph toGraph(Model m) { |
70 |
try { |
try { |
71 |
|
if (dbg) { |
72 |
|
p("toGraph!"); |
73 |
|
StmtIterator j=m.listStatements(); |
74 |
|
while(j.hasNext()) { |
75 |
|
p("And there are: "+ |
76 |
|
((Statement)j.next()).getString() ); |
77 |
|
} |
78 |
|
} |
79 |
|
|
80 |
Graph g = new HashGraph(); |
Graph g = new HashGraph(); |
81 |
StmtIterator i=m.listStatements(); |
StmtIterator i=m.listStatements(); |
82 |
while (i.hasNext()) { |
while (i.hasNext()) { |