semi_primitives.alc 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452
  1. include "primitives.alh"
  2. // This function must be kept internally, only called through the "sleep" and "interruptable_sleep" functions
  3. Float function __sleep(a : Float, b : Boolean) = ?primitives/__sleep
  4. Element function list_create():
  5. return create_node()!
  6. Element function dict_create():
  7. return create_node()!
  8. Element function set_create():
  9. return create_node()!
  10. Boolean function value_neq(a : Element, b : Element):
  11. return bool_not(value_eq(a, b))!
  12. Boolean function integer_gt(a : Element, b : Element):
  13. return bool_or(integer_lt(a, b), value_eq(a, b))!
  14. Boolean function float_gt(a : Element, b : Element):
  15. return bool_or(float_lt(a, b), value_eq(a, b))!
  16. Element function dict_add(a : Element, b : Element, c : Element):
  17. log("Doing dict_add for " + cast_v2s(b))
  18. create_edge(create_edge(a, c), b)
  19. return a!
  20. Boolean function element_neq(a : Element, b : Element):
  21. return bool_not(element_eq(a, b))!
  22. Integer function dict_len(a : Element):
  23. return read_nr_out(a)!
  24. Integer function list_len(a : Element):
  25. return read_nr_out(a)!
  26. Integer function set_len(a : Element):
  27. return read_nr_out(a)!
  28. Float function float_neg(a : Float):
  29. return float_subtraction(0, a)!
  30. Integer function integer_neg(a : Integer):
  31. return integer_subtraction(0, a)!
  32. Element function list_read(a : Element, b : Integer):
  33. return dict_read(a, b)!
  34. Element function list_append(a : Element, b : Element):
  35. dict_add(a, integer_addition(list_len(a), 1), b)
  36. return a!
  37. Element function set_add(a : Element, b : Element):
  38. if (bool_not(set_in(a, b))):
  39. // Treat set as a dictionary with a mock-value
  40. dict_add(a, b, a)
  41. return a!
  42. Element function set_add_node(a : Element, b : Element):
  43. if (bool_not(set_in_node(a, b))):
  44. // Treat set as a dictionary with a mock-value
  45. dict_add(a, b, a)
  46. return a!
  47. Element function set_pop(a : Element):
  48. if (integer_gt(set_len(a), 0)):
  49. Element edge
  50. Element result
  51. edge = read_out(a, 0)
  52. result = read_edge_dst(read_out(edge, 0))
  53. delete_element(edge)
  54. log("Value: " + cast_v2s(result))
  55. return result!
  56. else:
  57. log("Set pop on empty set!")
  58. return read_root()!
  59. Element function set_read(a : Element):
  60. if (integer_gt(set_len(a), 0)):
  61. return read_edge_dst(read_out(read_out(a, 0), 0))!
  62. else:
  63. log("Set read on empty set!")
  64. return read_root()!
  65. Void function sleep(a : Float):
  66. __sleep(a, False)
  67. return!
  68. Void function interruptable_sleep(a : Float):
  69. __sleep(a, True)
  70. return!
  71. Element function exec(first_instr : Element):
  72. // This does very ugly things, so beware!
  73. // Basically, we dynamically construct an if True condition with as body the provided instructions
  74. // after the if conditional, we append a return of an empty element, as we need a return at the end
  75. // returns in the code are therefore allowed (and will be the return value), but not necessarily
  76. Element n
  77. Element exec_if
  78. Element exec_const_true
  79. Element exec_return
  80. n = create_node()
  81. exec_if = create_value(!if)
  82. exec_const_true = create_value(!constant)
  83. exec_return = create_value(!return)
  84. dict_add(n, "params", create_node())
  85. dict_add(exec_const_true, "node", create_value(True))
  86. dict_add(exec_if, "cond", exec_const_true)
  87. dict_add(exec_if, "then", first_instr)
  88. dict_add(n, "body", exec_if)
  89. dict_add(exec_if, "next", exec_return)
  90. return n()!
  91. Boolean function string_startswith(a: String, b: String):
  92. Integer i
  93. i = 0
  94. if (string_len(b) > string_len(a)):
  95. return False!
  96. while (i < string_len(b)):
  97. if (string_get(a, i) != string_get(b, i)):
  98. return False!
  99. i = i + 1
  100. return True!
  101. Boolean function has_value(a: Element):
  102. return bool_or(bool_or(bool_or(is_physical_action, is_physical_int(a)), is_physical_float(a)), bool_or(is_physical_string(a), is_physical_boolean(a)))!
  103. Boolean function float_gte(a: Float, b: Float):
  104. return bool_or(float_gt(a, b), value_eq(a, b))!
  105. Boolean function float_lte(a: Float, b: Float):
  106. return bool_or(float_lt(a, b), value_eq(a, b))!
  107. Boolean function integer_lte(a: Integer, b: Integer):
  108. return bool_or(integer_lt(a, b), value_eq(a, b))!
  109. Boolean function integer_gte(a: Integer, b: Integer):
  110. return bool_or(integer_gt(a, b), value_eq(a, b))!
  111. String function string_substr(a: String, b: Integer, c: Integer):
  112. String result
  113. Integer i
  114. // First handle corner cases!
  115. // If the string is too short for b to even start, return empty
  116. if (b > string_len(a)):
  117. return ""!
  118. // If the part we want to snip is negative, we return empty
  119. if (b > c):
  120. return ""!
  121. i = 0
  122. result = ""
  123. while (i < string_len(a)):
  124. if (bool_and(i >= b, i <= c)):
  125. result = result + string_get(a, i)
  126. if (i > c):
  127. return result!
  128. i = i + 1
  129. return result!
  130. Element function resolve(name : String):
  131. // Could directly access it through introspection
  132. // But seems safer to create some code and execute it...
  133. Element task_root
  134. task_root = read_taskroot()
  135. task_root = task_root["globals"][name]["value"]
  136. return task_root!
  137. Integer function integer_modulo(a : Integer, b : Integer):
  138. return a - b * (a / b)!
  139. Boolean function has_input():
  140. return dict_in(dict_read(read_taskroot(), "input"), "value")!
  141. Element function list_pop(lst : Element, index : Integer):
  142. Element v
  143. v = list_read(lst, index)
  144. list_delete(lst, index)
  145. return v!
  146. Element function list_pop_final(lst : Element):
  147. return list_pop(lst, list_len(lst) - 1)!
  148. Element function set_copy(a : Element):
  149. return dict_keys(a)!
  150. String function set_to_string(s : Element):
  151. String result
  152. result = "{"
  153. s = set_copy(s)
  154. while (set_len(s) > 0):
  155. result = (result + cast_v2s(set_pop(s))) + ", "
  156. result = result + "}"
  157. return result!
  158. String function list_to_string(s : Element):
  159. String result
  160. Integer i
  161. result = "["
  162. i = 0
  163. while (i < list_len(s)):
  164. result = result + cast_v2s(list_read(s, i))
  165. result = result + ", "
  166. i = i + 1
  167. result = result + "]"
  168. return result!
  169. Element function create_tuple(a : Element, b : Element):
  170. Element tuple
  171. tuple = list_create()
  172. list_append(tuple, a)
  173. list_append(tuple, b)
  174. return tuple!
  175. String function dict_to_string(d : Element):
  176. String result
  177. Element keys
  178. Element key
  179. result = "{"
  180. keys = dict_keys(d)
  181. while (set_len(keys) > 0):
  182. key = set_pop(keys)
  183. result = result + cast_v2s(key)
  184. result = result + ": "
  185. result = result + cast_v2s(dict_read_node(d, key))
  186. if (set_len(keys) > 0):
  187. result = result + ", "
  188. result = result + "}"
  189. return result!
  190. Element function set_overlap(sa : Element, sb : Element):
  191. Element result
  192. Element elem
  193. if (set_len(sa) > set_len(sb)):
  194. // Pick the smallest set to iterate over, so switch if sa is not the smallest
  195. result = sa
  196. sa = sb
  197. sb = result
  198. result = set_create()
  199. sa = set_copy(sa)
  200. // Iterate over each element of sa and only add it to the result if it is also in sb
  201. while (set_len(sa) > 0):
  202. elem = set_pop(sa)
  203. if (set_in(sb, elem)):
  204. // Shared between both
  205. set_add(result, elem)
  206. return result!
  207. Boolean function set_equality(sa : Element, sb : Element):
  208. if (set_len(sa) != set_len(sb)):
  209. return False!
  210. sa = set_copy(sa)
  211. while (0 < set_len(sa)):
  212. if (bool_not(set_in(sb, set_pop(sa)))):
  213. return False!
  214. return True!
  215. Boolean function dict_eq(da : Element, db : Element):
  216. if (bool_not(set_equality(dict_keys(da), dict_keys(db)))):
  217. // They don't even share the same keys
  218. return False!
  219. Element keys
  220. Element key
  221. keys = dict_keys(da)
  222. while (set_len(keys) > 0):
  223. key = set_pop(keys)
  224. if (value_neq(da[key], db[key])):
  225. // Value that is not equal
  226. return False!
  227. return True!
  228. Element function dict_copy(d : Element):
  229. String result
  230. Element keys
  231. Element key
  232. result = dict_create()
  233. keys = dict_keys(d)
  234. while (set_len(keys) > 0):
  235. key = set_pop(keys)
  236. dict_add_fast(result, key, dict_read_node(d, key))
  237. return result!
  238. Element function set_to_list(s : Element):
  239. Element result
  240. Element tmp
  241. result = list_create()
  242. tmp = set_copy(s)
  243. while (set_len(tmp) > 0):
  244. list_append(result, set_pop(tmp))
  245. return result!
  246. Void function dict_overwrite(d : Element, key : Element, value : Element):
  247. if (dict_in(d, key)):
  248. dict_delete(d, key)
  249. if (dict_in_node(d, key)):
  250. dict_delete_node(d, key)
  251. dict_add(d, key, value)
  252. return !
  253. Void function set_merge(a : Element, b : Element):
  254. b = set_copy(b)
  255. while (set_len(b) > 0):
  256. set_add(a, set_pop(b))
  257. return!
  258. Element function make_reverse_dictionary(dict : Element):
  259. Element keys
  260. Element reverse
  261. String key
  262. String value
  263. reverse = dict_create()
  264. keys = dict_keys(dict)
  265. while (set_len(keys) > 0):
  266. key = set_pop(keys)
  267. value = cast_id2s(dict[key])
  268. if (dict_in(reverse, value)):
  269. dict_delete(reverse, value)
  270. dict_add(reverse, value, key)
  271. return reverse!
  272. Element function set_remove(a: Element, b: Element):
  273. return dict_delete(a, b)!
  274. Element function set_remove_node(a: Element, b: Element):
  275. return dict_delete_node(a, b)!
  276. Boolean function set_in(a: Element, b: Element):
  277. return dict_in(a, b)!
  278. Element function set_in_node(a: Element, b: Element):
  279. return dict_in_node(a, b)!
  280. String function reverseKeyLookup(dict : Element, element : Element):
  281. // TODO don't know if this AL will actually work...
  282. Integer nr_in
  283. Integer nr_out
  284. Integer counter
  285. Element link
  286. nr_in = read_nr_in(element)
  287. counter = 0
  288. while (counter < nr_in):
  289. if (element_eq(read_edge_src(read_in(element, counter)), dict)):
  290. // Got a match
  291. return (read_edge_dst(read_out(read_in(element, counter), 0)))!
  292. counter = counter + 1
  293. return ""!
  294. Element function reverseKeyLookupMulti(dict : Element, element : Element):
  295. // TODO don't know if this AL will actually work...
  296. Integer nr_in
  297. Integer nr_out
  298. Integer counter
  299. Element link
  300. Element result
  301. result = set_create()
  302. nr_in = read_nr_in(element)
  303. counter = 0
  304. while (counter < nr_in):
  305. if (element_eq(read_edge_src(read_in(element, counter)), dict)):
  306. // Got a match
  307. set_add(result, read_edge_dst(read_out(read_in(element, counter), 0)))
  308. counter = counter + 1
  309. return result!
  310. Boolean function list_in(list : Element, elem : Element):
  311. Integer i
  312. i = 0
  313. while (i < list_len(list)):
  314. if (value_eq(list_read(list, i), elem)):
  315. return True!
  316. i = i + 1
  317. return False!
  318. Element function dict_values(dict : Element):
  319. Element result
  320. result = set_create()
  321. Element keys
  322. keys = dict_keys(dict)
  323. while (set_len(keys) > 0):
  324. set_add(result, dict[set_pop(keys)])
  325. return result!
  326. Element function set_difference(sa : Element, sb : Element):
  327. Element result
  328. Element elem
  329. result = set_copy(sa)
  330. sb = set_copy(sb)
  331. while (set_len(sb) > 0):
  332. elem = set_pop(sb)
  333. if (set_in(sa, elem)):
  334. // Shared between both
  335. set_remove(result, elem)
  336. return result!
  337. Void function set_subtract(set1 : Element, set2 : Element):
  338. Element elem
  339. set2 = set_copy(set2)
  340. while (set_len(set2) > 0):
  341. elem = set_pop(set2)
  342. if (set_in(set1, elem)):
  343. set_remove(set1, elem)
  344. return!