compiled.py 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408
  1. import time
  2. def get_superclasses(a, b, **remainder):
  3. if 'value' not in b:
  4. b['value'], = yield [("RV", [b['id']])]
  5. model_dict, tm_dict = yield [("RD", [a['id'], "model"]),
  6. ("RD", [a['id'], "type_mapping"])]
  7. worklist = set([b['value']])
  8. found = set([])
  9. cache_value = {}
  10. while worklist:
  11. name = worklist.pop()
  12. if name in found:
  13. continue
  14. elem, = yield [("RD", [model_dict, name])]
  15. found.add(name)
  16. # Iterate over all outgoing links
  17. if elem is None:
  18. print("ERROR: " + str(locals()))
  19. outgoing, = yield [("RO", [elem])]
  20. outgoing = set(outgoing)
  21. while (outgoing):
  22. link = outgoing.pop()
  23. # If the link is typed by "Inheritance", we add its destination
  24. link_name_node, = yield [("CALL_ARGS", [reverseKeyLookup, [{'id': model_dict}, {'id': link}]])]
  25. if "value" not in link_name_node:
  26. link_name_node['value'], = yield [("RV", [link_name_node['id']])]
  27. t_edge, = yield [("RD", [tm_dict, link_name_node['value']])]
  28. t_edge, = yield [("RV", [t_edge])]
  29. if t_edge == "Inheritance":
  30. edge, = yield [("RE", [link])]
  31. src, dst = edge
  32. # Look up dst's name and add it
  33. if dst not in cache_value:
  34. dst_name, = yield [("CALL_ARGS", [reverseKeyLookup, [{'id': model_dict}, {'id': dst}]])]
  35. if 'value' not in dst_name:
  36. dst_name['value'], = yield [("RV", [dst_name['id']])]
  37. cache_value[dst] = dst_name['value']
  38. dst_name_value = cache_value[dst]
  39. worklist.add(dst_name_value)
  40. result, = yield [("CN", [])]
  41. yield [("CD", [result, i, result]) for i in found]
  42. yield [("RETURN", [{'id': result}])]
  43. def reverseKeyLookupMultiID(a, b, **remainder):
  44. edges, result = yield [("RO", [a['id']]), ("CN", [])]
  45. expanded_edges = yield [("RE", [i]) for i in edges]
  46. values = [i[1] for i in expanded_edges]
  47. # Keep results in a local Python set, as we want to bundle as many requests as possible
  48. todo = set()
  49. for i, edge in enumerate(values):
  50. if b['id'] == edge:
  51. todo.add(i)
  52. outgoings = yield [("RO", [edges[i]]) for i in todo]
  53. values = yield [("RE", [outgoing[0]]) for outgoing in outgoings]
  54. edges = yield [("CE", [result, result]) for value in values]
  55. yield [("CE", [edge, value[1]]) for edge, value in zip(edges, values)]
  56. yield [("RETURN", [{'id': result}])]
  57. def reverseKeyLookupMultiValue(a, b, **remainder):
  58. if "value" not in b:
  59. b['value'], = yield [("RV", [b['id']])]
  60. edges, result = yield [("RO", [a['id']]), ("CN", [])]
  61. expanded_edges = yield [("RE", [i]) for i in edges]
  62. values = yield [("RV", [i[1]]) for i in expanded_edges]
  63. # Keep results in a local Python set, as we want to bundle as many requests as possible
  64. todo = set()
  65. for i, edge in enumerate(values):
  66. if b['value'] == edge:
  67. todo.add(i)
  68. outgoings = yield [("RO", [edges[i]]) for i in todo]
  69. values = yield [("RE", [outgoing[0]]) for outgoing in outgoings]
  70. edges = yield [("CE", [result, result]) for value in values]
  71. yield [("CE", [edge, value[1]]) for edge, value in zip(edges, values)]
  72. yield [("RETURN", [{'id': result}])]
  73. def reverseKeyLookup(a, b, **remainder):
  74. edges_out, edges_in = yield [("RO", [a['id']]), ("RI", [b['id']])]
  75. if edges_out is None or edges_in is None:
  76. yield [("RETURN", [{'value': ""}])]
  77. options = set(edges_out) & set(edges_in)
  78. if options:
  79. # Select one option randomly
  80. edge = options.pop()
  81. out_edges, = yield [("RO", [edge])]
  82. # Select one option randomly
  83. out_edge = out_edges.pop()
  84. e, = yield [("RE", [out_edge])]
  85. yield [("RETURN", [{'id': e[1]}])]
  86. else:
  87. yield [("RETURN", [{'value': ""}])]
  88. def instantiated_name(a, b, **remainder):
  89. if "id" not in a:
  90. a['id'], = yield [("CNV", [a['value']])]
  91. if "value" not in b:
  92. b['value'], = yield [("RV", [b["id"]])]
  93. if b['value'] == "":
  94. yield [("RETURN", [{'value': "__" + str(a['id'])}])]
  95. else:
  96. yield [("RETURN", [b])]
  97. def set_merge(a, b, **remainder):
  98. keys, = yield [("RDK", [b['id']])]
  99. edges = yield [("CE", [a['id'], a['id']]) for key in keys]
  100. _ = yield [("CE", [edge, key]) for edge, key in zip(edges, keys)]
  101. yield [("RETURN", [a])]
  102. def has_value(a, **remainder):
  103. if "value" not in a:
  104. a['value'], = yield [("RV", [a['id']])]
  105. if a['value'] is None:
  106. yield [("RETURN", [{'value': False}])]
  107. else:
  108. yield [("RETURN", [{'value': True}])]
  109. def make_reverse_dictionary(a, **remainder):
  110. reverse, = yield [("CN", [])]
  111. key_nodes, = yield [("RDK", [a['id']])]
  112. values = yield [("RDN", [a['id'], i]) for i in key_nodes]
  113. yield [("CD", [reverse, str(v), k]) for k, v in zip(key_nodes, values)]
  114. yield [("RETURN", [{'id': reverse}])]
  115. def dict_eq(a, b, **remainder):
  116. key_nodes, = yield [("RDK", [a['id']])]
  117. key_values = yield [("RV", [i]) for i in key_nodes]
  118. values = yield [("RD", [a['id'], i]) for i in key_values]
  119. values = yield [("RV", [i]) for i in values]
  120. a_dict = dict(list(zip(key_values, values)))
  121. key_nodes, = yield [("RDK", [b['id']])]
  122. key_values = yield [("RV", [i]) for i in key_nodes]
  123. values = yield [("RD", [b['id'], i]) for i in key_values]
  124. values = yield [("RV", [i]) for i in values]
  125. b_dict = dict(list(zip(key_values, values)))
  126. yield [("RETURN", [{'value': a_dict == b_dict}])]
  127. def string_substr(a, b, c, **remainder):
  128. if "value" not in a:
  129. a['value'], = yield [("RV", [a['id']])]
  130. if "value" not in b:
  131. b['value'], = yield [("RV", [b['id']])]
  132. if "value" not in c:
  133. c['value'], = yield [("RV", [c['id']])]
  134. try:
  135. new_value = a['value'][b['value']:c['value']]
  136. except:
  137. new_value = ""
  138. yield [("RETURN", [{'value': new_value}])]
  139. def integer_gt(a, b, **remainder):
  140. if 'value' not in a:
  141. a['value'], = yield [("RV", [a['id']])]
  142. if 'value' not in b:
  143. b['value'], = yield [("RV", [b['id']])]
  144. yield [("RETURN", [{'value': a['value'] > b['value']}])]
  145. def integer_neg(a, **remainder):
  146. if 'value' not in a:
  147. a['value'], = yield [("RV", [a['id']])]
  148. yield [("RETURN", [{'value': -a['value']}])]
  149. def float_gt(a, b, **remainder):
  150. if 'value' not in a:
  151. a['value'], = yield [("RV", [a['id']])]
  152. if 'value' not in b:
  153. b['value'], = yield [("RV", [b['id']])]
  154. yield [("RETURN", [{'value': a['value'] > b['value']}])]
  155. def float_neg(a, **remainder):
  156. if 'value' not in a:
  157. a['value'], = yield [("RV", [a['id']])]
  158. yield [("RETURN", [{'value': -a['value']}])]
  159. def value_neq(a, b, **remainder):
  160. if 'value' not in a:
  161. a['value'], = yield [("RV", [a['id']])]
  162. if 'value' not in b:
  163. b['value'], = yield [("RV", [b['id']])]
  164. yield [("RETURN", [{'value': a['value'] != b['value']}])]
  165. def element_neq(a, b, **remainder):
  166. if 'id' not in a or 'id' not in b:
  167. yield [("RETURN", [{'value': False}])]
  168. else:
  169. yield [("RETURN", [{'value': a['id'] != b['id']}])]
  170. def list_append(a, b, **remainder):
  171. if "id" not in b:
  172. b['id'], = yield [("CNV", [b['value']])]
  173. a_outgoing, = yield [("RO", [a['id']])]
  174. _ = yield [("CD", [a['id'], len(a_outgoing), b['id']])]
  175. yield [("RETURN", [a])]
  176. def list_read(a, b, **remainder):
  177. if 'value' not in b:
  178. b['value'], = yield [("RV", [b['id']])]
  179. result, = yield [("RD", [a['id'], b['value']])]
  180. if result is None:
  181. raise Exception("List read out of bounds: %s" % b['value'])
  182. yield [("RETURN", [{'id': result}])]
  183. def list_len(a, **remainder):
  184. outgoings, = yield [("RO", [a['id']])]
  185. result, = yield [("CNV", [len(outgoings)])]
  186. yield [("RETURN", [{'id': result}])]
  187. def dict_add(a, b, c, **remainder):
  188. if 'id' not in b:
  189. b['id'], = yield [("CNV", [b['value']])]
  190. if 'id' not in c:
  191. c['id'], = yield [("CNV", [c['value']])]
  192. new_edge, = yield [("CE", [a['id'], c['id']])]
  193. yield [("CE", [new_edge, b['id']])]
  194. yield [("RETURN", [a])]
  195. def dict_len(a, **remainder):
  196. outgoings, = yield [("RO", [a['id']])]
  197. yield [("RETURN", [{'value': len(outgoings)}])]
  198. def set_add(a, b, **remainder):
  199. if 'value' not in b:
  200. b['value'], = yield [("RV", [b['id']])]
  201. is_in, = yield [("RD", [a['id'], b['value']])]
  202. if not is_in:
  203. _, = yield [("CD", [a['id'], b['value'], a['id']])]
  204. yield [("RETURN", [a])]
  205. def set_add_node(a, b, **remainder):
  206. if 'id' not in b:
  207. b['id'], = yield [("CNV", [b['value']])]
  208. is_in, = yield [("RDN", [a['id'], b['id']])]
  209. if not is_in:
  210. edge, = yield [("CE", [a['id'], a['id']])]
  211. _, = yield [("CE", [edge, b['id']])]
  212. yield [("RETURN", [a])]
  213. def set_pop(a, **remainder):
  214. outgoing, = yield [("RO", [a['id']])]
  215. if outgoing:
  216. outgoing = outgoing[0]
  217. new_outgoing, = yield [("RO", [outgoing])]
  218. new_outgoing = new_outgoing[0]
  219. edge, _ = yield [("RE", [new_outgoing]), ("DE", [outgoing])]
  220. yield [("RETURN", [{'id': edge[1]}])]
  221. else:
  222. raise Exception("POP from empty set")
  223. yield [("RETURN", [{'id': remainder["root"]}])]
  224. def set_create(**remainder):
  225. result, = yield [("CN", [])]
  226. yield [("RETURN", [{'id': result}])]
  227. def list_create(**remainder):
  228. result, = yield [("CN", [])]
  229. yield [("RETURN", [{'id': result}])]
  230. def dict_create(**remainder):
  231. result, = yield [("CN", [])]
  232. yield [("RETURN", [{'id': result}])]
  233. def create_tuple(a, b, **remainder):
  234. if "id" not in a:
  235. a['id'], = yield [("CNV", [a['value']])]
  236. if "id" not in b:
  237. b['id'], = yield [("CNV", [b['value']])]
  238. result, = yield [("CN", [])]
  239. _, _ = yield [("CD", [result, 0, a['id']]),
  240. ("CD", [result, 1, b['id']]),
  241. ]
  242. yield [("RETURN", [{'id': result}])]
  243. def set_overlap(a, b, **remainder):
  244. a_keys, b_keys, res = yield [("RDK", [a['id']]), ("RDK", [b['id']]), ("CN", [])]
  245. a_values = yield [("RV", [i]) for i in a_keys]
  246. b_values = yield [("RV", [i]) for i in b_keys]
  247. result = set(a_values) & set(b_values)
  248. yield [("CD", [res, value, res]) for value in result]
  249. yield [("RETURN", [{'id': res}])]
  250. def list_pop_final(a, **remainder):
  251. lst, = yield [("RO", [a['id']])]
  252. length = len(lst)
  253. result, result_edge = yield [("RD", [a['id'], length - 1]),
  254. ("RDE", [a['id'], length -1])]
  255. _, = yield [("DE", [result_edge])]
  256. yield [("RETURN", [{'id': result}])]
  257. def instantiate_node(a, b, c, **remainder):
  258. if "value" not in c:
  259. c['value'], = yield [("RV", [c['id']])]
  260. if "id" not in b:
  261. b['id'], = yield [("CNV", [b['value']])]
  262. node, dict_entry, typing = \
  263. yield [("CN", []),
  264. ("RD", [a['id'], "model"]),
  265. ("RD", [a['id'], "type_mapping"]),
  266. ]
  267. if c['value'] == "":
  268. name = "__" + str(node)
  269. name_node = {'value': name}
  270. else:
  271. name = c['value']
  272. name_node = c
  273. yield [("CD", [dict_entry, name, node])]
  274. yield [("CD", [typing, name, b['id']])]
  275. yield [("RETURN", [name_node])]
  276. def list_insert(a, b, c, **remainder):
  277. if "id" not in b:
  278. b["id"], = yield [("CNV", [b['value']])]
  279. if "value" not in c:
  280. c['value'], = yield [("RV", [c['id']])]
  281. a_outgoing, = yield [("RO", [a['id']])]
  282. links = yield [("RD", [a['id'], i]) for i in range(c['value'], len(a_outgoing))] + \
  283. [("RDE", [a['id'], i]) for i in range(c['value'], len(a_outgoing))]
  284. values = links[:len(links) // 2]
  285. edges = links[len(links) // 2:]
  286. yield [("CD", [a['id'], c['value'], b['id']])] + \
  287. [("CD", [a['id'], c['value'] + 1 + index, value]) for index, value in enumerate(values)] + \
  288. [("DE", [i]) for i in edges]
  289. yield [("RETURN", [a])]
  290. def list_delete(a, b, **remainder):
  291. if "value" not in b:
  292. b['value'], = yield [("RV", [b['id']])]
  293. a_outgoing, = yield [("RO", [a['id']])]
  294. links = yield [("RD", [a['id'], i]) for i in range(b['value'], len(a_outgoing))] + \
  295. [("RDE", [a['id'], i]) for i in range(b['value'], len(a_outgoing))]
  296. values = links[:len(links) // 2]
  297. edges = links[len(links) // 2:]
  298. yield [("CD", [a['id'], b['value'] + index, value]) for index, value in enumerate(values[1:])] + \
  299. [("DE", [i]) for i in edges]
  300. yield [("RETURN", [a])]
  301. def set_len(a, **remainder):
  302. if "id" not in a:
  303. yield [("RETURN", [{'value': 0}])]
  304. else:
  305. outgoing, = yield [("RO", [a['id']])]
  306. yield [("RETURN", [{'value': len(outgoing)}])]
  307. def set_in(a, b, **remainder):
  308. if "value" not in b:
  309. b['value'], = yield [("RV", [b['id']])]
  310. value, = yield [("RD", [a['id'], b['value']])]
  311. yield [("RETURN", [{'value': value is not None}])]
  312. def set_in_node(a, b, **remainder):
  313. if "id" not in b:
  314. # Not even allocated the node, so it is certain not to be in the dictionary
  315. yield [("RETURN", [{'value': False}])]
  316. value, = yield [("RDN", [a['id'], b['id']])]
  317. yield [("RETURN", [{'value': value is not None}])]
  318. def read_type(a, b, **remainder):
  319. if "value" not in b:
  320. b['value'], = yield [("RV", [b['id']])]
  321. model, type_mapping, metamodel = yield [("RD", [a['id'], 'model']), ("RD", [a['id'], 'type_mapping']), ("RD", [a['id'], 'metamodel'])]
  322. metamodel, in_model, type_value = yield [("RD", [metamodel, 'model']), ("RD", [model, b['value']]), ("RD", [type_mapping, b['value']])]
  323. if in_model is None:
  324. yield [("RETURN", [{'value': ""}])]
  325. elif type_value is None:
  326. yield [("RETURN", [{'value': ""}])]
  327. else:
  328. type_value, = yield [("RV", [type_value])]
  329. in_metamodel, = yield [("RD", [metamodel, type_value])]
  330. if in_metamodel is None:
  331. yield [("RETURN", [{'value': ""}])]
  332. else:
  333. yield [("RETURN", [{'value': type_value}])]