compiled.py 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571
  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. tm_dict, = yield [("RD", [tm_dict, "root"])]
  8. worklist = set([b['value']])
  9. found = set([])
  10. cache_value = {}
  11. while worklist:
  12. name = worklist.pop()
  13. if name in found:
  14. continue
  15. elem, = yield [("RD", [model_dict, name])]
  16. found.add(name)
  17. # Iterate over all outgoing links
  18. if elem is None:
  19. print("ERROR: " + str(locals()))
  20. outgoing, = yield [("RO", [elem])]
  21. outgoing = set(outgoing)
  22. while (outgoing):
  23. link = outgoing.pop()
  24. # If the link is typed by "Inheritance", we add its destination
  25. link_name_node, = yield [("CALL_ARGS", [reverseKeyLookup, [{'id': model_dict}, {'id': link}]])]
  26. if "value" not in link_name_node:
  27. link_name_node['value'], = yield [("RV", [link_name_node['id']])]
  28. t_edge, = yield [("RD", [tm_dict, link_name_node['value']])]
  29. t_edge, = yield [("RV", [t_edge])]
  30. if t_edge == "Inheritance":
  31. edge, = yield [("RE", [link])]
  32. src, dst = edge
  33. # Look up dst's name and add it
  34. if dst not in cache_value:
  35. dst_name, = yield [("CALL_ARGS", [reverseKeyLookup, [{'id': model_dict}, {'id': dst}]])]
  36. if 'value' not in dst_name:
  37. dst_name['value'], = yield [("RV", [dst_name['id']])]
  38. cache_value[dst] = dst_name['value']
  39. dst_name_value = cache_value[dst]
  40. worklist.add(dst_name_value)
  41. result, = yield [("CN", [])]
  42. yield [("CD", [result, i, result]) for i in found]
  43. yield [("RETURN", [{'id': result}])]
  44. def reverseKeyLookupMultiID(a, b, **remainder):
  45. edges, result = yield [("RO", [a['id']]), ("CN", [])]
  46. expanded_edges = yield [("RE", [i]) for i in edges]
  47. values = [i[1] for i in expanded_edges]
  48. # Keep results in a local Python set, as we want to bundle as many requests as possible
  49. todo = set()
  50. for i, edge in enumerate(values):
  51. if b['id'] == edge:
  52. todo.add(i)
  53. outgoings = yield [("RO", [edges[i]]) for i in todo]
  54. values = yield [("RE", [outgoing[0]]) for outgoing in outgoings]
  55. edges = yield [("CE", [result, result]) for value in values]
  56. yield [("CE", [edge, value[1]]) for edge, value in zip(edges, values)]
  57. yield [("RETURN", [{'id': result}])]
  58. def reverseKeyLookupMultiValue(a, b, **remainder):
  59. if "value" not in b:
  60. b['value'], = yield [("RV", [b['id']])]
  61. edges, result = yield [("RO", [a['id']]), ("CN", [])]
  62. expanded_edges = yield [("RE", [i]) for i in edges]
  63. values = yield [("RV", [i[1]]) for i in expanded_edges]
  64. # Keep results in a local Python set, as we want to bundle as many requests as possible
  65. todo = set()
  66. for i, edge in enumerate(values):
  67. if b['value'] == edge:
  68. todo.add(i)
  69. outgoings = yield [("RO", [edges[i]]) for i in todo]
  70. values = yield [("RE", [outgoing[0]]) for outgoing in outgoings]
  71. edges = yield [("CE", [result, result]) for value in values]
  72. yield [("CE", [edge, value[1]]) for edge, value in zip(edges, values)]
  73. yield [("RETURN", [{'id': result}])]
  74. def reverseKeyLookup(a, b, **remainder):
  75. edges_out, edges_in = yield [("RO", [a['id']]), ("RI", [b['id']])]
  76. if edges_out is None or edges_in is None:
  77. yield [("RETURN", [{'value': ""}])]
  78. if len(edges_in) > 2:
  79. edges_out = set(edges_out)
  80. for edge in edges_in:
  81. if edge in edges_out:
  82. out_edges, = yield [("RO", [edge])]
  83. # Select one option randomly
  84. if out_edges:
  85. out_edge = out_edges.pop()
  86. e, = yield [("RE", [out_edge])]
  87. yield [("RETURN", [{'id': e[1]}])]
  88. yield [("RETURN", [{'value': ""}])]
  89. def instantiated_name(a, b, **remainder):
  90. if "id" not in a:
  91. a['id'], = yield [("CNV", [a['value']])]
  92. if "value" not in b:
  93. b['value'], = yield [("RV", [b["id"]])]
  94. if b['value'] == "":
  95. yield [("RETURN", [{'value': "__" + str(a['id'])}])]
  96. else:
  97. yield [("RETURN", [b])]
  98. def set_merge(a, b, **remainder):
  99. keys, = yield [("RDK", [b['id']])]
  100. edges = yield [("CE", [a['id'], a['id']]) for key in keys]
  101. _ = yield [("CE", [edge, key]) for edge, key in zip(edges, keys)]
  102. yield [("RETURN", [a])]
  103. def has_value(a, **remainder):
  104. if "value" not in a:
  105. a['value'], = yield [("RV", [a['id']])]
  106. if a['value'] is None:
  107. yield [("RETURN", [{'value': False}])]
  108. else:
  109. yield [("RETURN", [{'value': True}])]
  110. def make_reverse_dictionary(a, **remainder):
  111. reverse, = yield [("CN", [])]
  112. if "id" not in a:
  113. yield [("RETURN", [{'id': reverse}])]
  114. key_nodes, = yield [("RDK", [a['id']])]
  115. values = yield [("RDN", [a['id'], i]) for i in key_nodes]
  116. yield [("CD", [reverse, str(v), k]) for k, v in zip(key_nodes, values)]
  117. yield [("RETURN", [{'id': reverse}])]
  118. def make_reverse_dictionary_multi(a, **remainder):
  119. reverse, keys = yield [("CN", []), ("RDK", [a['id']])]
  120. if "id" not in a:
  121. yield [("RETURN", [{'id': reverse}])]
  122. values = yield [("RDN", [a['id'], i]) for i in keys]
  123. keys = yield [("RV", [i]) for i in keys]
  124. values = yield [("RV", [i]) for i in values]
  125. ndict = {}
  126. for k, v in zip(keys, values):
  127. ndict.setdefault(v, set()).add(k)
  128. n = yield [("CN", []) for _ in ndict]
  129. for k in ndict:
  130. set_node = n.pop()
  131. yield [("CD", [reverse, k, set_node])]
  132. yield [("CD", [set_node, v, set_node]) for v in ndict[k]]
  133. yield [("RETURN", [{'id': reverse}])]
  134. def dict_eq(a, b, **remainder):
  135. key_nodes, = yield [("RDK", [a['id']])]
  136. key_values = yield [("RV", [i]) for i in key_nodes]
  137. values = yield [("RD", [a['id'], i]) for i in key_values]
  138. values = yield [("RV", [i]) for i in values]
  139. a_dict = dict(list(zip(key_values, values)))
  140. key_nodes, = yield [("RDK", [b['id']])]
  141. key_values = yield [("RV", [i]) for i in key_nodes]
  142. values = yield [("RD", [b['id'], i]) for i in key_values]
  143. values = yield [("RV", [i]) for i in values]
  144. b_dict = dict(list(zip(key_values, values)))
  145. yield [("RETURN", [{'value': a_dict == b_dict}])]
  146. def string_substr(a, b, c, **remainder):
  147. if "value" not in a:
  148. a['value'], = yield [("RV", [a['id']])]
  149. if "value" not in b:
  150. b['value'], = yield [("RV", [b['id']])]
  151. if "value" not in c:
  152. c['value'], = yield [("RV", [c['id']])]
  153. try:
  154. new_value = a['value'][b['value']:c['value']]
  155. except:
  156. new_value = ""
  157. yield [("RETURN", [{'value': new_value}])]
  158. def integer_gt(a, b, **remainder):
  159. if 'value' not in a:
  160. a['value'], = yield [("RV", [a['id']])]
  161. if 'value' not in b:
  162. b['value'], = yield [("RV", [b['id']])]
  163. yield [("RETURN", [{'value': a['value'] > b['value']}])]
  164. def integer_neg(a, **remainder):
  165. if 'value' not in a:
  166. a['value'], = yield [("RV", [a['id']])]
  167. yield [("RETURN", [{'value': -a['value']}])]
  168. def float_gt(a, b, **remainder):
  169. if 'value' not in a:
  170. a['value'], = yield [("RV", [a['id']])]
  171. if 'value' not in b:
  172. b['value'], = yield [("RV", [b['id']])]
  173. yield [("RETURN", [{'value': a['value'] > b['value']}])]
  174. def float_neg(a, **remainder):
  175. if 'value' not in a:
  176. a['value'], = yield [("RV", [a['id']])]
  177. yield [("RETURN", [{'value': -a['value']}])]
  178. def value_neq(a, b, **remainder):
  179. if 'value' not in a:
  180. a['value'], = yield [("RV", [a['id']])]
  181. if 'value' not in b:
  182. b['value'], = yield [("RV", [b['id']])]
  183. yield [("RETURN", [{'value': a['value'] != b['value']}])]
  184. def element_neq(a, b, **remainder):
  185. if 'id' not in a or 'id' not in b:
  186. yield [("RETURN", [{'value': False}])]
  187. else:
  188. yield [("RETURN", [{'value': a['id'] != b['id']}])]
  189. def list_append(a, b, **remainder):
  190. if "id" not in b:
  191. b['id'], = yield [("CNV", [b['value']])]
  192. a_outgoing, = yield [("RO", [a['id']])]
  193. _ = yield [("CD", [a['id'], len(a_outgoing), b['id']])]
  194. yield [("RETURN", [a])]
  195. def list_read(a, b, **remainder):
  196. if 'value' not in b:
  197. b['value'], = yield [("RV", [b['id']])]
  198. result, = yield [("RD", [a['id'], b['value']])]
  199. if result is None:
  200. raise Exception("List read out of bounds: %s" % b['value'])
  201. yield [("RETURN", [{'id': result}])]
  202. def list_len(a, **remainder):
  203. outgoings, = yield [("RO", [a['id']])]
  204. result, = yield [("CNV", [len(outgoings)])]
  205. yield [("RETURN", [{'id': result}])]
  206. def dict_add(a, b, c, **remainder):
  207. if 'id' not in b:
  208. b['id'], = yield [("CNV", [b['value']])]
  209. if 'id' not in c:
  210. c['id'], = yield [("CNV", [c['value']])]
  211. new_edge, = yield [("CE", [a['id'], c['id']])]
  212. yield [("CE", [new_edge, b['id']])]
  213. yield [("RETURN", [a])]
  214. def dict_len(a, **remainder):
  215. outgoings, = yield [("RO", [a['id']])]
  216. yield [("RETURN", [{'value': len(outgoings)}])]
  217. def set_add(a, b, **remainder):
  218. if 'value' not in b:
  219. b['value'], = yield [("RV", [b['id']])]
  220. is_in, = yield [("RD", [a['id'], b['value']])]
  221. if not is_in:
  222. _, = yield [("CD", [a['id'], b['value'], a['id']])]
  223. yield [("RETURN", [a])]
  224. def set_add_node(a, b, **remainder):
  225. if 'id' not in b:
  226. b['id'], = yield [("CNV", [b['value']])]
  227. is_in, = yield [("RDN", [a['id'], b['id']])]
  228. if not is_in:
  229. edge, = yield [("CE", [a['id'], a['id']])]
  230. _, = yield [("CE", [edge, b['id']])]
  231. yield [("RETURN", [a])]
  232. def set_pop(a, **remainder):
  233. outgoing, = yield [("RO", [a['id']])]
  234. if outgoing:
  235. outgoing = outgoing[0]
  236. new_outgoing, = yield [("RO", [outgoing])]
  237. new_outgoing = new_outgoing[0]
  238. edge, _ = yield [("RE", [new_outgoing]), ("DE", [outgoing])]
  239. yield [("RETURN", [{'id': edge[1]}])]
  240. else:
  241. raise Exception("POP from empty set")
  242. yield [("RETURN", [{'id': remainder["root"]}])]
  243. def set_create(**remainder):
  244. result, = yield [("CN", [])]
  245. yield [("RETURN", [{'id': result}])]
  246. def list_create(**remainder):
  247. result, = yield [("CN", [])]
  248. yield [("RETURN", [{'id': result}])]
  249. def dict_create(**remainder):
  250. result, = yield [("CN", [])]
  251. yield [("RETURN", [{'id': result}])]
  252. def create_tuple(a, b, **remainder):
  253. if "id" not in a:
  254. a['id'], = yield [("CNV", [a['value']])]
  255. if "id" not in b:
  256. b['id'], = yield [("CNV", [b['value']])]
  257. result, = yield [("CN", [])]
  258. _, _ = yield [("CD", [result, 0, a['id']]),
  259. ("CD", [result, 1, b['id']]),
  260. ]
  261. yield [("RETURN", [{'id': result}])]
  262. def set_overlap(a, b, **remainder):
  263. a_keys, b_keys, res = yield [("RDK", [a['id']]), ("RDK", [b['id']]), ("CN", [])]
  264. a_values = yield [("RV", [i]) for i in a_keys]
  265. b_values = yield [("RV", [i]) for i in b_keys]
  266. result = set(a_values) & set(b_values)
  267. yield [("CD", [res, value, res]) for value in result]
  268. yield [("RETURN", [{'id': res}])]
  269. def list_pop_final(a, **remainder):
  270. lst, = yield [("RO", [a['id']])]
  271. length = len(lst)
  272. result, result_edge = yield [("RD", [a['id'], length - 1]),
  273. ("RDE", [a['id'], length -1])]
  274. _, = yield [("DE", [result_edge])]
  275. yield [("RETURN", [{'id': result}])]
  276. def instantiate_node(a, b, c, **remainder):
  277. if "value" not in b:
  278. b['value'], = yield [("RV", [b['id']])]
  279. if "value" not in c:
  280. c['value'], = yield [("RV", [c['id']])]
  281. node, dict_entry, tm = \
  282. yield [("CN", []),
  283. ("RD", [a['id'], "model"]),
  284. ("RD", [a['id'], "type_mapping"]),
  285. ]
  286. if c['value'] == "":
  287. name = "__" + str(node)
  288. name_node = {'value': name}
  289. else:
  290. name = c['value']
  291. name_node = c
  292. _, root = yield [("CD", [dict_entry, name, node]),
  293. ("RD", [tm, "root"])]
  294. # Create new type links
  295. type_elem, instance_elem = yield [("CNV", [b['value']]), ("CNV", [name])]
  296. type_link, = yield [("CE", [root, type_elem])]
  297. instance_link, = yield [("CE", [type_link, instance_elem])]
  298. # Add them to the model
  299. yield [("CD", [tm, str(type_elem), type_elem]),
  300. ("CD", [tm, str(instance_elem), instance_elem]),
  301. ("CD", [tm, str(type_link), type_link]),
  302. ("CD", [tm, str(instance_link), instance_link])]
  303. yield [("RETURN", [name_node])]
  304. def list_insert(a, b, c, **remainder):
  305. if "id" not in b:
  306. b["id"], = yield [("CNV", [b['value']])]
  307. if "value" not in c:
  308. c['value'], = yield [("RV", [c['id']])]
  309. a_outgoing, = yield [("RO", [a['id']])]
  310. links = yield [("RD", [a['id'], i]) for i in range(c['value'], len(a_outgoing))] + \
  311. [("RDE", [a['id'], i]) for i in range(c['value'], len(a_outgoing))]
  312. values = links[:len(links) // 2]
  313. edges = links[len(links) // 2:]
  314. yield [("CD", [a['id'], c['value'], b['id']])] + \
  315. [("CD", [a['id'], c['value'] + 1 + index, value]) for index, value in enumerate(values)] + \
  316. [("DE", [i]) for i in edges]
  317. yield [("RETURN", [a])]
  318. def list_delete(a, b, **remainder):
  319. if "value" not in b:
  320. b['value'], = yield [("RV", [b['id']])]
  321. a_outgoing, = yield [("RO", [a['id']])]
  322. links = yield [("RD", [a['id'], i]) for i in range(b['value'], len(a_outgoing))] + \
  323. [("RDE", [a['id'], i]) for i in range(b['value'], len(a_outgoing))]
  324. values = links[:len(links) // 2]
  325. edges = links[len(links) // 2:]
  326. yield [("CD", [a['id'], b['value'] + index, value]) for index, value in enumerate(values[1:])] + \
  327. [("DE", [i]) for i in edges]
  328. yield [("RETURN", [a])]
  329. def set_len(a, **remainder):
  330. if "id" not in a:
  331. yield [("RETURN", [{'value': 0}])]
  332. else:
  333. outgoing, = yield [("RO", [a['id']])]
  334. yield [("RETURN", [{'value': len(outgoing)}])]
  335. def set_in(a, b, **remainder):
  336. if "value" not in b:
  337. b['value'], = yield [("RV", [b['id']])]
  338. value, = yield [("RD", [a['id'], b['value']])]
  339. yield [("RETURN", [{'value': value is not None}])]
  340. def set_in_node(a, b, **remainder):
  341. if "id" not in b:
  342. # Not even allocated the node, so it is certain not to be in the dictionary
  343. yield [("RETURN", [{'value': False}])]
  344. value, = yield [("RDN", [a['id'], b['id']])]
  345. yield [("RETURN", [{'value': value is not None}])]
  346. def read_type(a, b, **remainder):
  347. if "value" not in b:
  348. b['value'], = yield [("RV", [b['id']])]
  349. model, type_mapping, metamodel = yield [("RD", [a['id'], 'model']), ("RD", [a['id'], 'type_mapping']), ("RD", [a['id'], 'metamodel'])]
  350. type_mapping, = yield [("RD", [type_mapping, "root"])]
  351. metamodel, in_model, type_value = yield [("RD", [metamodel, 'model']), ("RD", [model, b['value']]), ("RD", [type_mapping, b['value']])]
  352. if in_model is None:
  353. yield [("RETURN", [{'value': ""}])]
  354. elif type_value is None:
  355. yield [("RETURN", [{'value': ""}])]
  356. else:
  357. type_value, = yield [("RV", [type_value])]
  358. in_metamodel, = yield [("RD", [metamodel, type_value])]
  359. if in_metamodel is None:
  360. yield [("RETURN", [{'value': ""}])]
  361. else:
  362. yield [("RETURN", [{'value': type_value}])]
  363. def retype(a, b, c, **remainder):
  364. if "value" not in b:
  365. b['value'], = yield [("RV", [b['id']])]
  366. if "value" not in c:
  367. c['value'], = yield [("RV", [c['id']])]
  368. tm, = yield [("RD", [a["id"], "type_mapping"])]
  369. root, = yield [("RD", [tm, "root"])]
  370. # remove_type
  371. val, = yield [("RD", [root, b["value"]])]
  372. if val is not None:
  373. # Key exists, so remove
  374. yield [("DN", [val])]
  375. # Create new type links
  376. type_elem, instance_elem = yield [("CNV", [c['value']]), ("CNV", [b['value']])]
  377. type_link, = yield [("CE", [root, type_elem])]
  378. instance_link, = yield [("CE", [type_link, instance_elem])]
  379. # Add them to the model
  380. yield [("CD", [tm, str(type_elem), type_elem]),
  381. ("CD", [tm, str(instance_elem), instance_elem]),
  382. ("CD", [tm, str(type_link), type_link]),
  383. ("CD", [tm, str(instance_link), instance_link])]
  384. yield [("RETURN", [None])]
  385. def set_equality(a, b, **remainder):
  386. if "id" not in a:
  387. yield [("RETURN", [{'value': False}])]
  388. if "id" not in b:
  389. yield [("RETURN", [{'value': False}])]
  390. keys_a, keys_b = yield [("RDK", [a["id"]]), ("RDK", [b["id"]])]
  391. if (len(keys_a) != len(keys_b)):
  392. yield [("RETURN", [{'value': False}])]
  393. keys_a = yield [("RV", [i]) for i in keys_a]
  394. keys_b = yield [("RV", [i]) for i in keys_b]
  395. yield [("RETURN", [{'value': keys_a == keys_b}])]
  396. def set_difference(a, b, **remainder):
  397. keys_a, keys_b = yield [("RDK", [a["id"]]), ("RDK", [b["id"]])]
  398. keys_a = yield [("RV", [i]) for i in keys_a]
  399. keys_b = yield [("RV", [i]) for i in keys_b]
  400. result = set(keys_a) - set(keys_b)
  401. res, = yield [("CN", [])]
  402. yield [("CD", [res, v, res]) for v in result]
  403. yield [("RETURN", [{'id': res}])]
  404. def string_startswith(a, b, **remainder):
  405. if "value" not in a:
  406. a['value'], = yield [("RV", [a['id']])]
  407. if "value" not in b:
  408. b['value'], = yield [("RV", [b['id']])]
  409. yield [("RETURN", [{"value": a['value'].startswith(b['value'])}])]
  410. def dict_copy(a, **remainder):
  411. keys, new = yield [("RDK", [a['id']]), ("CN", [])]
  412. values = yield [("RDN", [a['id'], i]) for i in keys]
  413. keys = yield [("RV", [i]) for i in keys]
  414. yield [("CD", [new, k, v]) for k, v in zip(keys, values)]
  415. yield [("RETURN", [{'id': new}])]
  416. def read_attribute(a, b, c, root, **remainder):
  417. if "value" not in b:
  418. b["value"], = yield [("RV", [b['id']])]
  419. if "value" not in c:
  420. c["value"], = yield [("RV", [c['id']])]
  421. m, metamodel = yield [("RD", [a['id'], "model"]), ("RD", [a['id'], "metamodel"])]
  422. mm, elem, tm = yield [("RD", [metamodel, "model"]), ("RD", [m, b['value']]), ("RD", [a['id'], "type_mapping"])]
  423. if elem is not None:
  424. # Read all outgoing links and their names
  425. outgoing_edges, tm = yield [("RO", [elem]), ("RD", [tm, "root"])]
  426. if outgoing_edges:
  427. outgoing_names = []
  428. backlinks = {}
  429. edges_out, = yield [("RO", [m])]
  430. for i in outgoing_edges:
  431. edges_in, = yield [("RI", [i])]
  432. if len(edges_in) > 2:
  433. edges_out = set(edges_out)
  434. for edge in edges_in:
  435. if edge in edges_out:
  436. out_edges, = yield [("RO", [edge])]
  437. # Select one option randomly
  438. out_edge = out_edges.pop()
  439. e, = yield [("RE", [out_edge])]
  440. val, = yield [("RV", [e[1]])]
  441. backlinks[val] = i
  442. outgoing_names.append(val)
  443. break
  444. if outgoing_names:
  445. # Read out the types and flatten
  446. types = yield [("RD", [tm, i]) for i in outgoing_names]
  447. types = yield [("RV", [i]) for i in types]
  448. edges = yield [("RD", [mm, i]) for i in types]
  449. sources = yield [("RE", [i]) for i in edges]
  450. sources = {i[0] for i in sources}
  451. backlinks = {e: backlinks[s] for e, s in zip(edges, outgoing_names)}
  452. # List the outgoing links with the attribute in it
  453. vals = yield [("RDE", [i, c['value']]) for i in sources]
  454. vals = [v for v in vals if v is not None]
  455. if vals:
  456. # Found the link and stored in vals[0]
  457. edge = vals[0]
  458. # Get the instance of this link
  459. if edge in backlinks:
  460. val, = yield [("RE", [backlinks[edge]])]
  461. yield [("RETURN", [{'id': val[1]}])]
  462. yield [("RETURN", [{'id': root}])]