-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathDflatPredicateHandler.py
More file actions
187 lines (162 loc) · 5.24 KB
/
Copy pathDflatPredicateHandler.py
File metadata and controls
187 lines (162 loc) · 5.24 KB
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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
#!/bin/python
#hecher markus 7/2013
#helping stuff for grounded extension
from PredicateHandler import *
from DflatDecomposition import *
class DflatPredicateReader(PredicateReader):
BAGINPUT = 0
INTRO = False #remove for -introduced
def __init__(self):
BI = DflatPredicateReader.BAGINPUT
super(DflatPredicateReader, self).__init__({
"currentNode" : BI, "childNode" : BI, "final" : BI, "current" : BI, "introduced" : BI, "-introduced" : BI } )
#, "childItem" : CT, "childCost" : CT, "sub" : CT,
#"childAnd" : CT, "childOr" : CT, "childAccept" : CT, "childReject" : CT, "childAuxItem" : CT,
#"itemTreeNodeHasAddress" : MD, "itemTreeNodeExtends" : MD })
self._decompByID = {} #whole decomposition
self._decelem = None #current node/element of the decomp
#self._decroot = None
#self._node = None
#self._bag = [] #bag contents
#self._notintro = [] #bag contents
#self._intro = [] #bag contents
#self._childnodes = [] #child nodes
self._root = False
#self._superroot = None
@staticmethod
def unList(lst):
if type(lst) is not list:
return str(lst)
indx = 0
res = ""
for i in lst:
if indx == 1:
res += "("
elif indx > 1:
res += ","
# if type(i) is list:
res += DflatPredicateReader.unList(i)
# else:
# res += i
indx += 1
if indx > 1:
res += ")"
return res
#print res
def onMatch(self, inpt):
#print inpt
for i in inpt:
if type(i) is list:
typ = self._preds.get(i[0])
if typ == DflatPredicateReader.BAGINPUT:
#if not self._decelem is None: #clear
# self._decelem = None
if i[0] == "currentNode":
#if not self._node is None:
# self._makeDecompNode()
# self._decelem = None
#print "CURRENT: ", i[1]
#self._node = i[1]
self._decelem = self.getElemById(i[1])
if self._root:
self._superroot = self._decelem
self._root = False
elif i[0] == "current":
#self._bag.append(DflatPredicateReader.unList(i[1]))
self._decelem.keys().append(DflatPredicateReader.unList(i[1]))
elif i[0] == "introduced":
#print "notintro ", i[1]
DflatPredicateReader.INTRO = True
self._decelem.setIntroPositive(DflatPredicateReader.INTRO)
assert(DflatPredicateReader.INTRO)
self._decelem.addIntro(DflatPredicateReader.unList(i[1]))
#self._intro.append(DflatPredicateReader.unList(i[1]))
elif i[0] == "-introduced":
DflatPredicateReader.INTRO = False
self._decelem.setIntroPositive(DflatPredicateReader.INTRO)
assert(not DflatPredicateReader.INTRO)
#print "notintro ", i[1]
self._decelem.addIntro(DflatPredicateReader.unList(i[1]))
# self._notintro.append(DflatPredicateReader.unList(i[1]))
elif i[0] == "childNode":
elem = self.getElemById(i[1])
#elem = self._decompByID.get(i[1])
#print i[1]
#assert (not elem is None)
#if elem is None:
# elem = DflatDecomposition([])
# self._decompByID[i[1]] = elem
self._decelem.addNext(elem)
elem.addPrev(self._decelem)
#self._childnodes.append(elem)
#elif typ >= DflatPredicateReader.CHILDTAB:
# self._makeDecompNode()
elif type(i) is str:
typ = self._preds.get(i)
if typ == DflatPredicateReader.BAGINPUT and i == "final":
# self._makeDecompNode()
# self._decroot = self._decelem
# print "ROOT!", self._decroot
#if self._decelem is not None:
# self._superroot = self._decelem
#else:
if self._decelem is not None:
self._superroot = self._decelem
else:
self._root = True
def getElemById(self, eid):
decelem = self._decompByID.get(eid)
if decelem is None:
decelem = DflatDecomposition([], DflatPredicateReader.INTRO)
self._decompByID[eid] = decelem
decelem.setNr(eid)
return decelem
#decelem.keys().append(content)
#def _makeDecompNode(self):
#if self._decelem is None:
#assert(not self._node is None)
#decelem = self.getElemById(self._node)
#decelem.keys().append(self._bag)
#print self._node
#decelem = self._decompByID.get(self._node)
#if decelem is None:
# decelem = DflatDecomposition(self._bag)
#else:
#decelem.keys().append(self._bag)
#if self._root:
# self._superroot = decelem
#print "ROOT", self._decroot
# self._root = False
#assert(self._node != decelem.nr()) #already done
#self._decelem.setIntro(set(self._bag) - set(self._notintro))
#decelem.setIntro(self._intro)
#decelem.setNr(self._node)
#self._decompByID[self._node] = decelem
#decelem.setNext(self._childnodes)
#for k in self._childnodes:
# k.addPrev(decelem)
#if not self._decompByID.get(k.nr()) is None:
# del self._decompByID[k.nr()]
#clear
#self._childnodes = []
#self._bag = []
#self._notintro = []
#self._intro = []
#self._node = None
#if self._superroot is None:
# self._superroot = self._decelem
def onFinish(self):
pass
#self._makeDecompNode()
#assert(len(self._decompByID) == 1)
#for k in self._decompByID:
# i = self._decompByID[k]
# self._childnodes.append(i) #for non-root tree case
#if len(self._decompByID) > 1: #non-root tree
# self._node = -1
# self._bag.append("...")
# self._decelem = None
# self._makeDecompNode() #make inofficial super-root
def getRoot(self):
#return self._decroot #elem
return self._superroot