temporal_vector_algebra.py 36 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954
  1. """
  2. Temporal vector algebra
  3. (C) 2014 by the GRASS Development Team
  4. This program is free software under the GNU General Public
  5. License (>=v2). Read the file COPYING that comes with GRASS
  6. for details.
  7. :authors: Thomas Leppelt and Soeren Gebbert
  8. .. code-block:: python
  9. >>> import grass.temporal as tgis
  10. >>> tgis.init(True)
  11. >>> p = tgis.TemporalVectorAlgebraLexer()
  12. >>> p.build()
  13. >>> p.debug = True
  14. >>> expression = "C = A : B"
  15. >>> p.test(expression)
  16. C = A : B
  17. LexToken(NAME,'C',1,0)
  18. LexToken(EQUALS,'=',1,2)
  19. LexToken(NAME,'A',1,4)
  20. LexToken(T_SELECT,':',1,6)
  21. LexToken(NAME,'B',1,8)
  22. >>> expression = "C = test1 !: test2"
  23. >>> p.test(expression)
  24. C = test1 !: test2
  25. LexToken(NAME,'C',1,0)
  26. LexToken(EQUALS,'=',1,2)
  27. LexToken(NAME,'test1',1,4)
  28. LexToken(T_NOT_SELECT,'!:',1,10)
  29. LexToken(NAME,'test2',1,13)
  30. >>> expression = "C = test1 {equal,:} test2"
  31. >>> p.test(expression)
  32. C = test1 {equal,:} test2
  33. LexToken(NAME,'C',1,0)
  34. LexToken(EQUALS,'=',1,2)
  35. LexToken(NAME,'test1',1,4)
  36. LexToken(T_SELECT_OPERATOR,'{equal,:}',1,10)
  37. LexToken(NAME,'test2',1,20)
  38. >>> expression = "C = test1 {equal,!:} test2"
  39. >>> p.test(expression)
  40. C = test1 {equal,!:} test2
  41. LexToken(NAME,'C',1,0)
  42. LexToken(EQUALS,'=',1,2)
  43. LexToken(NAME,'test1',1,4)
  44. LexToken(T_SELECT_OPERATOR,'{equal,!:}',1,10)
  45. LexToken(NAME,'test2',1,21)
  46. >>> expression = "C = test1 # test2"
  47. >>> p.test(expression)
  48. C = test1 # test2
  49. LexToken(NAME,'C',1,0)
  50. LexToken(EQUALS,'=',1,2)
  51. LexToken(NAME,'test1',1,4)
  52. LexToken(HASH,'#',1,10)
  53. LexToken(NAME,'test2',1,12)
  54. >>> expression = "C = test1 {#} test2"
  55. >>> p.test(expression)
  56. C = test1 {#} test2
  57. LexToken(NAME,'C',1,0)
  58. LexToken(EQUALS,'=',1,2)
  59. LexToken(NAME,'test1',1,4)
  60. LexToken(T_HASH_OPERATOR,'{#}',1,10)
  61. LexToken(NAME,'test2',1,14)
  62. >>> expression = "C = test1 {equal,#} test2"
  63. >>> p.test(expression)
  64. C = test1 {equal,#} test2
  65. LexToken(NAME,'C',1,0)
  66. LexToken(EQUALS,'=',1,2)
  67. LexToken(NAME,'test1',1,4)
  68. LexToken(T_HASH_OPERATOR,'{equal,#}',1,10)
  69. LexToken(NAME,'test2',1,20)
  70. >>> expression = "C = test1 {equal|during,#} test2"
  71. >>> p.test(expression)
  72. C = test1 {equal|during,#} test2
  73. LexToken(NAME,'C',1,0)
  74. LexToken(EQUALS,'=',1,2)
  75. LexToken(NAME,'test1',1,4)
  76. LexToken(T_HASH_OPERATOR,'{equal|during,#}',1,10)
  77. LexToken(NAME,'test2',1,27)
  78. >>> expression = "E = test1 : test2 !: test1"
  79. >>> p.test(expression)
  80. E = test1 : test2 !: test1
  81. LexToken(NAME,'E',1,0)
  82. LexToken(EQUALS,'=',1,2)
  83. LexToken(NAME,'test1',1,4)
  84. LexToken(T_SELECT,':',1,10)
  85. LexToken(NAME,'test2',1,12)
  86. LexToken(T_NOT_SELECT,'!:',1,18)
  87. LexToken(NAME,'test1',1,21)
  88. >>> expression = 'D = buff_t(test1,"10 months")'
  89. >>> p.test(expression)
  90. D = buff_t(test1,"10 months")
  91. LexToken(NAME,'D',1,0)
  92. LexToken(EQUALS,'=',1,2)
  93. LexToken(BUFF_T,'buff_t',1,4)
  94. LexToken(LPAREN,'(',1,10)
  95. LexToken(NAME,'test1',1,11)
  96. LexToken(COMMA,',',1,16)
  97. LexToken(QUOTE,'"',1,17)
  98. LexToken(INT,10,1,18)
  99. LexToken(NAME,'months',1,21)
  100. LexToken(QUOTE,'"',1,27)
  101. LexToken(RPAREN,')',1,28)
  102. >>> expression = 'H = tsnap(test1)'
  103. >>> p.test(expression)
  104. H = tsnap(test1)
  105. LexToken(NAME,'H',1,0)
  106. LexToken(EQUALS,'=',1,2)
  107. LexToken(TSNAP,'tsnap',1,4)
  108. LexToken(LPAREN,'(',1,9)
  109. LexToken(NAME,'test1',1,10)
  110. LexToken(RPAREN,')',1,15)
  111. >>> expression = 'H = tsnap(test2 {during,:} buff_t(test1, "1 days"))'
  112. >>> p.test(expression)
  113. H = tsnap(test2 {during,:} buff_t(test1, "1 days"))
  114. LexToken(NAME,'H',1,0)
  115. LexToken(EQUALS,'=',1,2)
  116. LexToken(TSNAP,'tsnap',1,4)
  117. LexToken(LPAREN,'(',1,9)
  118. LexToken(NAME,'test2',1,10)
  119. LexToken(T_SELECT_OPERATOR,'{during,:}',1,16)
  120. LexToken(BUFF_T,'buff_t',1,27)
  121. LexToken(LPAREN,'(',1,33)
  122. LexToken(NAME,'test1',1,34)
  123. LexToken(COMMA,',',1,39)
  124. LexToken(QUOTE,'"',1,41)
  125. LexToken(INT,1,1,42)
  126. LexToken(NAME,'days',1,44)
  127. LexToken(QUOTE,'"',1,48)
  128. LexToken(RPAREN,')',1,49)
  129. LexToken(RPAREN,')',1,50)
  130. >>> expression = 'H = tshift(test2 {during,:} buff_t(test1, "1 days"), "1 months")'
  131. >>> p.test(expression)
  132. H = tshift(test2 {during,:} buff_t(test1, "1 days"), "1 months")
  133. LexToken(NAME,'H',1,0)
  134. LexToken(EQUALS,'=',1,2)
  135. LexToken(TSHIFT,'tshift',1,4)
  136. LexToken(LPAREN,'(',1,10)
  137. LexToken(NAME,'test2',1,11)
  138. LexToken(T_SELECT_OPERATOR,'{during,:}',1,17)
  139. LexToken(BUFF_T,'buff_t',1,28)
  140. LexToken(LPAREN,'(',1,34)
  141. LexToken(NAME,'test1',1,35)
  142. LexToken(COMMA,',',1,40)
  143. LexToken(QUOTE,'"',1,42)
  144. LexToken(INT,1,1,43)
  145. LexToken(NAME,'days',1,45)
  146. LexToken(QUOTE,'"',1,49)
  147. LexToken(RPAREN,')',1,50)
  148. LexToken(COMMA,',',1,51)
  149. LexToken(QUOTE,'"',1,53)
  150. LexToken(INT,1,1,54)
  151. LexToken(NAME,'months',1,56)
  152. LexToken(QUOTE,'"',1,62)
  153. LexToken(RPAREN,')',1,63)
  154. >>> expression = 'H = tshift(A , 10)'
  155. >>> p.test(expression)
  156. H = tshift(A , 10)
  157. LexToken(NAME,'H',1,0)
  158. LexToken(EQUALS,'=',1,2)
  159. LexToken(TSHIFT,'tshift',1,4)
  160. LexToken(LPAREN,'(',1,10)
  161. LexToken(NAME,'A',1,11)
  162. LexToken(COMMA,',',1,13)
  163. LexToken(INT,10,1,15)
  164. LexToken(RPAREN,')',1,17)
  165. >>> expression = 'H = if(td(A) > 10, A)'
  166. >>> p.test(expression)
  167. H = if(td(A) > 10, A)
  168. LexToken(NAME,'H',1,0)
  169. LexToken(EQUALS,'=',1,2)
  170. LexToken(IF,'if',1,4)
  171. LexToken(LPAREN,'(',1,6)
  172. LexToken(TD,'td',1,7)
  173. LexToken(LPAREN,'(',1,9)
  174. LexToken(NAME,'A',1,10)
  175. LexToken(RPAREN,')',1,11)
  176. LexToken(GREATER,'>',1,13)
  177. LexToken(INT,10,1,15)
  178. LexToken(COMMA,',',1,17)
  179. LexToken(NAME,'A',1,19)
  180. LexToken(RPAREN,')',1,20)
  181. >>> expression = 'H = if(td(A) > 10, A, B)'
  182. >>> p.test(expression)
  183. H = if(td(A) > 10, A, B)
  184. LexToken(NAME,'H',1,0)
  185. LexToken(EQUALS,'=',1,2)
  186. LexToken(IF,'if',1,4)
  187. LexToken(LPAREN,'(',1,6)
  188. LexToken(TD,'td',1,7)
  189. LexToken(LPAREN,'(',1,9)
  190. LexToken(NAME,'A',1,10)
  191. LexToken(RPAREN,')',1,11)
  192. LexToken(GREATER,'>',1,13)
  193. LexToken(INT,10,1,15)
  194. LexToken(COMMA,',',1,17)
  195. LexToken(NAME,'A',1,19)
  196. LexToken(COMMA,',',1,20)
  197. LexToken(NAME,'B',1,22)
  198. LexToken(RPAREN,')',1,23)
  199. >>> expression = 'I = if(equals,td(A) > 10 {equals,||} td(B) < 10, A)'
  200. >>> p.test(expression)
  201. I = if(equals,td(A) > 10 {equals,||} td(B) < 10, A)
  202. LexToken(NAME,'I',1,0)
  203. LexToken(EQUALS,'=',1,2)
  204. LexToken(IF,'if',1,4)
  205. LexToken(LPAREN,'(',1,6)
  206. LexToken(NAME,'equals',1,7)
  207. LexToken(COMMA,',',1,13)
  208. LexToken(TD,'td',1,14)
  209. LexToken(LPAREN,'(',1,16)
  210. LexToken(NAME,'A',1,17)
  211. LexToken(RPAREN,')',1,18)
  212. LexToken(GREATER,'>',1,20)
  213. LexToken(INT,10,1,22)
  214. LexToken(T_OVERLAY_OPERATOR,'{equals,||}',1,25)
  215. LexToken(TD,'td',1,37)
  216. LexToken(LPAREN,'(',1,39)
  217. LexToken(NAME,'B',1,40)
  218. LexToken(RPAREN,')',1,41)
  219. LexToken(LOWER,'<',1,43)
  220. LexToken(INT,10,1,45)
  221. LexToken(COMMA,',',1,47)
  222. LexToken(NAME,'A',1,49)
  223. LexToken(RPAREN,')',1,50)
  224. >>> expression = 'I = if(equals,td(A) > 10 || start_day() < 10, A)'
  225. >>> p.test(expression)
  226. I = if(equals,td(A) > 10 || start_day() < 10, A)
  227. LexToken(NAME,'I',1,0)
  228. LexToken(EQUALS,'=',1,2)
  229. LexToken(IF,'if',1,4)
  230. LexToken(LPAREN,'(',1,6)
  231. LexToken(NAME,'equals',1,7)
  232. LexToken(COMMA,',',1,13)
  233. LexToken(TD,'td',1,14)
  234. LexToken(LPAREN,'(',1,16)
  235. LexToken(NAME,'A',1,17)
  236. LexToken(RPAREN,')',1,18)
  237. LexToken(GREATER,'>',1,20)
  238. LexToken(INT,10,1,22)
  239. LexToken(OR,'|',1,25)
  240. LexToken(OR,'|',1,26)
  241. LexToken(START_DAY,'start_day',1,28)
  242. LexToken(LPAREN,'(',1,37)
  243. LexToken(RPAREN,')',1,38)
  244. LexToken(LOWER,'<',1,40)
  245. LexToken(INT,10,1,42)
  246. LexToken(COMMA,',',1,44)
  247. LexToken(NAME,'A',1,46)
  248. LexToken(RPAREN,')',1,47)
  249. >>> expression = 'E = if({equals},td(A) >= 4 {contain,&&} td(B) == 2, C : D)'
  250. >>> p.test(expression)
  251. E = if({equals},td(A) >= 4 {contain,&&} td(B) == 2, C : D)
  252. LexToken(NAME,'E',1,0)
  253. LexToken(EQUALS,'=',1,2)
  254. LexToken(IF,'if',1,4)
  255. LexToken(LPAREN,'(',1,6)
  256. LexToken(T_REL_OPERATOR,'{equals}',1,7)
  257. LexToken(COMMA,',',1,15)
  258. LexToken(TD,'td',1,16)
  259. LexToken(LPAREN,'(',1,18)
  260. LexToken(NAME,'A',1,19)
  261. LexToken(RPAREN,')',1,20)
  262. LexToken(GREATER_EQUALS,'>=',1,22)
  263. LexToken(INT,4,1,25)
  264. LexToken(T_OVERLAY_OPERATOR,'{contain,&&}',1,27)
  265. LexToken(TD,'td',1,40)
  266. LexToken(LPAREN,'(',1,42)
  267. LexToken(NAME,'B',1,43)
  268. LexToken(RPAREN,')',1,44)
  269. LexToken(CEQUALS,'==',1,46)
  270. LexToken(INT,2,1,49)
  271. LexToken(COMMA,',',1,50)
  272. LexToken(NAME,'C',1,52)
  273. LexToken(T_SELECT,':',1,54)
  274. LexToken(NAME,'D',1,56)
  275. LexToken(RPAREN,')',1,57)
  276. >>> expression = 'F = if({equals},A {equal,#}, B, C : D)'
  277. >>> p.test(expression)
  278. F = if({equals},A {equal,#}, B, C : D)
  279. LexToken(NAME,'F',1,0)
  280. LexToken(EQUALS,'=',1,2)
  281. LexToken(IF,'if',1,4)
  282. LexToken(LPAREN,'(',1,6)
  283. LexToken(T_REL_OPERATOR,'{equals}',1,7)
  284. LexToken(COMMA,',',1,15)
  285. LexToken(NAME,'A',1,16)
  286. LexToken(T_HASH_OPERATOR,'{equal,#}',1,18)
  287. LexToken(COMMA,',',1,27)
  288. LexToken(NAME,'B',1,29)
  289. LexToken(COMMA,',',1,30)
  290. LexToken(NAME,'C',1,32)
  291. LexToken(T_SELECT,':',1,34)
  292. LexToken(NAME,'D',1,36)
  293. LexToken(RPAREN,')',1,37)
  294. >>> expression = 'E = A : B ^ C : D'
  295. >>> p.test(expression)
  296. E = A : B ^ C : D
  297. LexToken(NAME,'E',1,0)
  298. LexToken(EQUALS,'=',1,2)
  299. LexToken(NAME,'A',1,4)
  300. LexToken(T_SELECT,':',1,6)
  301. LexToken(NAME,'B',1,8)
  302. LexToken(XOR,'^',1,10)
  303. LexToken(NAME,'C',1,12)
  304. LexToken(T_SELECT,':',1,14)
  305. LexToken(NAME,'D',1,16)
  306. >>> expression = 'E = A : B {|^} C : D'
  307. >>> p.test(expression)
  308. E = A : B {|^} C : D
  309. LexToken(NAME,'E',1,0)
  310. LexToken(EQUALS,'=',1,2)
  311. LexToken(NAME,'A',1,4)
  312. LexToken(T_SELECT,':',1,6)
  313. LexToken(NAME,'B',1,8)
  314. LexToken(T_OVERLAY_OPERATOR,'{|^}',1,10)
  315. LexToken(NAME,'C',1,15)
  316. LexToken(T_SELECT,':',1,17)
  317. LexToken(NAME,'D',1,19)
  318. >>> expression = 'E = buff_a(A, 10)'
  319. >>> p.test(expression)
  320. E = buff_a(A, 10)
  321. LexToken(NAME,'E',1,0)
  322. LexToken(EQUALS,'=',1,2)
  323. LexToken(BUFF_AREA,'buff_a',1,4)
  324. LexToken(LPAREN,'(',1,10)
  325. LexToken(NAME,'A',1,11)
  326. LexToken(COMMA,',',1,12)
  327. LexToken(INT,10,1,14)
  328. LexToken(RPAREN,')',1,16)
  329. >>> p = tgis.TemporalVectorAlgebraParser()
  330. >>> p.run = False
  331. >>> p.debug = True
  332. >>> expression = "D = A : (B !: C)"
  333. >>> p.parse(expression)
  334. B* = B !: C
  335. A* = A : B*
  336. D = A*
  337. >>> expression = "D = A {!:} B {during,:} C"
  338. >>> print(expression)
  339. D = A {!:} B {during,:} C
  340. >>> p.parse(expression)
  341. A* = A {!:} B
  342. A** = A* {during,:} C
  343. D = A**
  344. >>> expression = "D = A {:} B {during,!:} C"
  345. >>> print(expression)
  346. D = A {:} B {during,!:} C
  347. >>> p.parse(expression)
  348. A* = A {:} B
  349. A** = A* {during,!:} C
  350. D = A**
  351. >>> expression = "D = A {:} (B {during,!:} (C : E))"
  352. >>> print(expression)
  353. D = A {:} (B {during,!:} (C : E))
  354. >>> p.parse(expression)
  355. C* = C : E
  356. B* = B {during,!:} C*
  357. A* = A {:} B*
  358. D = A*
  359. >>> p.run = False
  360. >>> p.debug = False
  361. >>> expression = "C = test1 : test2"
  362. >>> print(expression)
  363. C = test1 : test2
  364. >>> p.parse(expression, 'stvds')
  365. >>> expression = 'D = buff_t(test1,"10 months")'
  366. >>> print(expression)
  367. D = buff_t(test1,"10 months")
  368. >>> p.parse(expression, 'stvds')
  369. >>> expression = 'E = test2 {during,:} buff_t(test1,"1 days")'
  370. >>> print(expression)
  371. E = test2 {during,:} buff_t(test1,"1 days")
  372. >>> p.parse(expression, 'stvds')
  373. >>> expression = 'F = test2 {equal,:} buff_t(test1,"1 days")'
  374. >>> print(expression)
  375. F = test2 {equal,:} buff_t(test1,"1 days")
  376. >>> p.parse(expression, 'stvds')
  377. >>> p.debug = True
  378. >>> expression = 'H = tsnap(test2 {during,:} buff_t(test1, "1 days"))'
  379. >>> p.parse(expression, 'stvds')
  380. test1* = buff_t( test1 , " 1 days " )
  381. test2* = test2 {during,:} test1*
  382. test2** = tsnap( test2* )
  383. H = test2**
  384. >>> expression = 'H = tshift(test2 {during,:} test1, "1 days")'
  385. >>> p.parse(expression, 'stvds')
  386. test2* = test2 {during,:} test1
  387. test2** = tshift( test2* , " 1 days " )
  388. H = test2**
  389. >>> expression = 'H = tshift(H, 3)'
  390. >>> p.parse(expression, 'stvds')
  391. H* = tshift( H , 3 )
  392. H = H*
  393. >>> expression = 'C = if(td(A) == 2, A)'
  394. >>> p.parse(expression, 'stvds')
  395. td(A)
  396. td(A) == 2
  397. A* = if condition True then A
  398. C = A*
  399. >>> expression = 'C = if(td(A) == 5 || start_date() >= "2010-01-01", A, B)'
  400. >>> p.parse(expression, 'stvds')
  401. td(A)
  402. td(A) == 5
  403. start_date >= "2010-01-01"
  404. True || True
  405. A* = if condition True then A else B
  406. C = A*
  407. >>> expression = 'C = if(td(A) == 5, A, B)'
  408. >>> p.parse(expression, 'stvds')
  409. td(A)
  410. td(A) == 5
  411. A* = if condition True then A else B
  412. C = A*
  413. """
  414. import grass.pygrass.modules as pygrass
  415. from temporal_vector_operator import *
  416. from temporal_algebra import *
  417. ##############################################################################
  418. class TemporalVectorAlgebraLexer(TemporalAlgebraLexer):
  419. """Lexical analyzer for the GRASS GIS temporal vector algebra"""
  420. def __init__(self):
  421. TemporalAlgebraLexer.__init__(self)
  422. # Buffer functions from v.buffer
  423. vector_buff_functions = {
  424. 'buff_p': 'BUFF_POINT',
  425. 'buff_l': 'BUFF_LINE',
  426. 'buff_a': 'BUFF_AREA',
  427. }
  428. # This is the list of token names.
  429. vector_tokens = (
  430. 'DISOR',
  431. 'XOR',
  432. 'NOT',
  433. 'T_OVERLAY_OPERATOR',
  434. )
  435. # Build the token list
  436. tokens = TemporalAlgebraLexer.tokens + vector_tokens \
  437. + tuple(vector_buff_functions.values())
  438. # Regular expression rules for simple tokens
  439. t_DISOR = r'\+'
  440. t_XOR = r'\^'
  441. t_NOT = r'\~'
  442. t_T_OVERLAY_OPERATOR = r'\{([a-zA-Z\|]+[,])?([\|&+=]?[\|&+=\^\~])\}'
  443. # Parse symbols
  444. def temporal_symbol(self, t):
  445. # Check for reserved words
  446. if t.value in TemporalVectorAlgebraLexer.time_functions.keys():
  447. t.type = TemporalVectorAlgebraLexer.time_functions.get(t.value)
  448. elif t.value in TemporalVectorAlgebraLexer.datetime_functions.keys():
  449. t.type = TemporalVectorAlgebraLexer.datetime_functions.get(t.value)
  450. elif t.value in TemporalVectorAlgebraLexer.conditional_functions.keys():
  451. t.type = TemporalVectorAlgebraLexer.conditional_functions.get(t.value)
  452. elif t.value in TemporalVectorAlgebraLexer.vector_buff_functions.keys():
  453. t.type = TemporalVectorAlgebraLexer.vector_buff_functions.get(t.value)
  454. else:
  455. t.type = 'NAME'
  456. return t
  457. ##############################################################################
  458. class TemporalVectorAlgebraParser(TemporalAlgebraParser):
  459. """The temporal algebra class"""
  460. # Get the tokens from the lexer class
  461. tokens = TemporalVectorAlgebraLexer.tokens
  462. # Setting equal precedence level for select and hash operations.
  463. precedence = (
  464. ('left', 'T_SELECT_OPERATOR', 'T_SELECT', 'T_NOT_SELECT'), # 1
  465. ('left', 'AND', 'OR', 'T_COMP_OPERATOR', 'T_OVERLAY_OPERATOR', 'DISOR',
  466. 'NOT', 'XOR'), # 2
  467. )
  468. def __init__(self, pid=None, run=False, debug=True, spatial=False):
  469. TemporalAlgebraParser.__init__(self, pid, run, debug, spatial)
  470. self.m_overlay = pygrass.Module('v.overlay', quiet=True, run_=False)
  471. self.m_rename = pygrass.Module('g.rename', quiet=True, run_=False)
  472. self.m_patch = pygrass.Module('v.patch', quiet=True, run_=False)
  473. self.m_remove = pygrass.Module('g.remove', quiet=True, run_=False)
  474. self.m_buffer = pygrass.Module('v.buffer', quiet=True, run_=False)
  475. def parse(self, expression, basename=None, overwrite=False):
  476. self.lexer = TemporalVectorAlgebraLexer()
  477. self.lexer.build()
  478. self.parser = yacc.yacc(module=self, debug=self.debug)
  479. self.overwrite = overwrite
  480. self.count = 0
  481. self.stdstype = "stvds"
  482. self.basename = basename
  483. self.expression = expression
  484. self.parser.parse(expression)
  485. ######################### Temporal functions ##############################
  486. def remove_intermediate_vector_maps(self):
  487. """ Removes the intermediate vector maps.
  488. """
  489. if self.names != {}:
  490. namelist = self.names.values()
  491. max = 100
  492. chunklist = [namelist[i:i + max] for i in range(0, len(namelist), max)]
  493. for chunk in chunklist:
  494. stringlist = ",".join(chunk)
  495. if self.debug:
  496. print "g.remove type=vect name=%s" % (stringlist)
  497. if self.run:
  498. m = copy.deepcopy(self.m_remove)
  499. m.inputs["type"].value = "vect"
  500. m.inputs["name"].value = stringlist
  501. m.flags["f"].value = True
  502. m.run()
  503. def eval_toperator(self, operator, comparison=False):
  504. """This function evaluates a string containing temporal operations.
  505. :param operator: String of temporal operations, e.g.
  506. {equal|during,=!:}.
  507. :return: List of temporal relations (equal, during), the given
  508. function (!:) and the interval/instances (=).
  509. .. code-block:: python
  510. >>> import grass.temporal as tgis
  511. >>> tgis.init(True)
  512. >>> p = tgis.TemporalVectorAlgebraParser()
  513. >>> operator = "{equal,:}"
  514. >>> p.eval_toperator(operator)
  515. (['EQUAL'], '=', ':')
  516. >>> operator = "{equal|during,:}"
  517. >>> p.eval_toperator(operator)
  518. (['EQUAL', 'DURING'], '=', ':')
  519. >>> operator = "{equal,!:}"
  520. >>> p.eval_toperator(operator)
  521. (['EQUAL'], '=', '!:')
  522. >>> operator = "{equal|during,!:}"
  523. >>> p.eval_toperator(operator)
  524. (['EQUAL', 'DURING'], '=', '!:')
  525. >>> operator = "{equal|during,=!:}"
  526. >>> p.eval_toperator(operator)
  527. (['EQUAL', 'DURING'], '=', '!:')
  528. >>> operator = "{equal|during|starts,#}"
  529. >>> p.eval_toperator(operator)
  530. (['EQUAL', 'DURING', 'STARTS'], '=', '#')
  531. >>> operator = "{!:}"
  532. >>> p.eval_toperator(operator)
  533. (['EQUAL'], '=', '!:')
  534. >>> operator = "{=:}"
  535. >>> p.eval_toperator(operator)
  536. (['EQUAL'], '=', ':')
  537. >>> operator = "{#}"
  538. >>> p.eval_toperator(operator)
  539. (['EQUAL'], '=', '#')
  540. >>> operator = "{equal|during}"
  541. >>> p.eval_toperator(operator)
  542. (['EQUAL', 'DURING'], None, None)
  543. >>> operator = "{equal}"
  544. >>> p.eval_toperator(operator)
  545. (['EQUAL'], None, None)
  546. >>> operator = "{equal,||}"
  547. >>> p.eval_toperator(operator, True)
  548. (['EQUAL'], '=', '||')
  549. >>> operator = "{equal|during,&&}"
  550. >>> p.eval_toperator(operator, True)
  551. (['EQUAL', 'DURING'], '=', '&&')
  552. >>> operator = "{&}"
  553. >>> p.eval_toperator(operator)
  554. (['EQUAL'], '=', '&')
  555. """
  556. p = TemporalVectorOperatorParser()
  557. p.parse(operator, comparison)
  558. p.relations = [rel.upper() for rel in p.relations]
  559. return(p.relations, p.temporal, p.function)
  560. def overlay_map_extent(self, mapA, mapB, bool_op=None, temp_op='=',
  561. copy=False):
  562. """Compute the spatio-temporal extent of two topological related maps
  563. :param mapA: The first map
  564. :param mapB: The second maps
  565. :param bool_op: The boolean operator specifying the spatial extent
  566. operation (intersection, union, disjoint union)
  567. :param temp_op: The temporal operator specifying the temporal
  568. exntent operation (intersection, union, disjoint union)
  569. :param copy: Specifies if the temporal extent of mapB should be
  570. copied to mapA
  571. """
  572. returncode = TemporalAlgebraParser.overlay_map_extent(self, mapA, mapB,
  573. bool_op, temp_op,
  574. copy)
  575. if not copy and returncode == 1:
  576. # Conditional append of command list.
  577. if "cmd_list" in dir(mapA) and "cmd_list" in dir(mapB):
  578. mapA.cmd_list = mapA.cmd_list + mapB.cmd_list
  579. elif "cmd_list" not in dir(mapA) and "cmd_list" in dir(mapB):
  580. mapA.cmd_list = mapB.cmd_list
  581. return(returncode)
  582. ###########################################################################
  583. def p_statement_assign(self, t):
  584. # The expression should always return a list of maps.
  585. """
  586. statement : stds EQUALS expr
  587. """
  588. # Execute the command lists
  589. if self.run:
  590. if isinstance(t[3], list):
  591. num = len(t[3])
  592. count = 0
  593. returncode = 0
  594. register_list = []
  595. for i in range(num):
  596. # Check if resultmap names exist in GRASS database.
  597. vectorname = self.basename + "_" + str(i)
  598. vectormap = VectorDataset(vectorname + "@" +
  599. get_current_mapset())
  600. if vectormap.map_exists() and self.overwrite is False:
  601. self.msgr.fatal(_("Error vector maps with basename %s"
  602. " exist. Use --o flag to overwrite"
  603. " existing file") % (vectorname))
  604. for map_i in t[3]:
  605. if "cmd_list" in dir(map_i):
  606. # Execute command list.
  607. for cmd in map_i.cmd_list:
  608. try:
  609. # We need to check if the input maps have
  610. # areas in case of v.overlay otherwise
  611. # v.overlay will break
  612. if cmd.name == "v.overlay":
  613. for name in (cmd.inputs["ainput"].value,
  614. cmd.inputs["binput"].value):
  615. #self.msgr.message("Check if map <" + name + "> exists")
  616. if name.find("@") < 0:
  617. name = name + "@" + get_current_mapset()
  618. tmp_map = map_i.get_new_instance(name)
  619. if not tmp_map.map_exists():
  620. raise Exception
  621. #self.msgr.message("Check if map <" + name + "> has areas")
  622. tmp_map.load()
  623. if tmp_map.metadata.get_number_of_areas() == 0:
  624. raise Exception
  625. except Exception:
  626. returncode = 1
  627. break
  628. # run the command
  629. # print the command that will be executed
  630. self.msgr.message("Run command:\n" + cmd.get_bash())
  631. cmd.run()
  632. if cmd.popen.returncode != 0:
  633. self.msgr.fatal(_("Error starting %s : \n%s")
  634. % (cmd.get_bash(),
  635. cmd.popen.stderr))
  636. mapname = cmd.outputs['output'].value
  637. if mapname.find("@") >= 0:
  638. map_test = map_i.get_new_instance(mapname)
  639. else:
  640. map_test = map_i.get_new_instance(mapname +
  641. "@" +
  642. self.mapset)
  643. if not map_test.map_exists():
  644. returncode = 1
  645. break
  646. if returncode == 0:
  647. # We remove the invalid vector name from the remove list.
  648. if self.names.has_key(map_i.get_name()):
  649. self.names.pop(map_i.get_name())
  650. mapset = map_i.get_mapset()
  651. # Change map name to given basename.
  652. newident = self.basename + "_" + str(count)
  653. m = copy.deepcopy(self.m_rename)
  654. m.inputs["vect"].value = (map_i.get_name(),
  655. newident)
  656. m.flags["overwrite"].value = self.overwrite
  657. m.run()
  658. #m(vect = (map_i.get_name(),newident), \
  659. # overwrite = self.overwrite)
  660. map_i.set_id(newident + "@" + mapset)
  661. count += 1
  662. register_list.append(map_i)
  663. else:
  664. register_list.append(map_i)
  665. if len(register_list) > 0:
  666. # Open connection to temporal database.
  667. dbif, connected = init_dbif(dbif=self.dbif)
  668. # Create result space time dataset.
  669. resultstds = open_new_stds(t[1], self.stdstype, 'absolute',
  670. t[1], t[1],
  671. "temporal vector algebra",
  672. dbif=dbif,
  673. overwrite=self.overwrite)
  674. for map_i in register_list:
  675. # Check if modules should be executed from command list
  676. if "cmd_list" in dir(map_i):
  677. # Get meta data from grass database.
  678. map_i.load()
  679. if map_i.is_in_db(dbif=dbif) and self.overwrite:
  680. # Update map in temporal database.
  681. map_i.update_all(dbif=dbif)
  682. elif map_i.is_in_db(dbif=dbif) and self.overwrite is False:
  683. # Raise error if map exists and no overwrite
  684. # flag is given.
  685. self.msgr.fatal(_("Error vector map %s exist"
  686. " in temporal database. Use "
  687. "overwrite flag. : \n%s") %
  688. (map_i.get_map_id(),
  689. cmd.popen.stderr))
  690. else:
  691. # Insert map into temporal database.
  692. map_i.insert(dbif=dbif)
  693. else:
  694. # Get metadata from temporal database.
  695. map_i.select(dbif=dbif)
  696. # Register map in result space time dataset.
  697. resultstds.register_map(map_i, dbif=dbif)
  698. #count += 1
  699. #if count % 10 == 0:
  700. # grass.percent(count, num, 1)
  701. resultstds.update_from_registered_maps(dbif=dbif)
  702. if connected:
  703. dbif.close()
  704. self.remove_intermediate_vector_maps()
  705. t[0] = register_list
  706. def p_overlay_operation(self, t):
  707. """
  708. expr : stds AND stds
  709. | expr AND stds
  710. | stds AND expr
  711. | expr AND expr
  712. | stds OR stds
  713. | expr OR stds
  714. | stds OR expr
  715. | expr OR expr
  716. | stds XOR stds
  717. | expr XOR stds
  718. | stds XOR expr
  719. | expr XOR expr
  720. | stds NOT stds
  721. | expr NOT stds
  722. | stds NOT expr
  723. | expr NOT expr
  724. | stds DISOR stds
  725. | expr DISOR stds
  726. | stds DISOR expr
  727. | expr DISOR expr
  728. """
  729. # Check input stds.
  730. maplistA = self.check_stds(t[1])
  731. maplistB = self.check_stds(t[3])
  732. if self.run:
  733. t[0] = self.create_overlay_operations(maplistA, maplistB,
  734. ("EQUAL",), "=", t[2])
  735. else:
  736. t[0] = t[1]
  737. def p_overlay_operation_relation(self, t):
  738. """
  739. expr : stds T_OVERLAY_OPERATOR stds
  740. | expr T_OVERLAY_OPERATOR stds
  741. | stds T_OVERLAY_OPERATOR expr
  742. | expr T_OVERLAY_OPERATOR expr
  743. """
  744. # Check input stds.
  745. maplistA = self.check_stds(t[1])
  746. maplistB = self.check_stds(t[3])
  747. relations, temporal, function = self.eval_toperator(t[2])
  748. if self.run:
  749. t[0] = self.create_overlay_operations(maplistA, maplistB,
  750. relations, temporal,
  751. function)
  752. else:
  753. t[0] = t[1]
  754. def create_overlay_operations(self, maplistA, maplistB, relations,
  755. temporal, function):
  756. """Create the spatial overlay operation commad list
  757. :param maplistA: A list of map objects
  758. :param maplistB: A list of map objects
  759. :param relations: The temporal relationships that must be
  760. fullfilled as list of strings("EQUAL", "DURING",
  761. ...)
  762. :param temporal: The temporal operator as string "=" or "&", ...
  763. :param function: The spatial overlay operations as string "&", "|",
  764. ...
  765. :return: Return the list of maps with overlay commands
  766. """
  767. topolist = self.get_temporal_topo_list(maplistA, maplistB,
  768. topolist=relations)
  769. # Select operation name.
  770. if function == "&":
  771. opname = "and"
  772. elif function == "|":
  773. opname = "or"
  774. elif function == "^":
  775. opname = "xor"
  776. elif function == "~":
  777. opname = "not"
  778. elif function == "+":
  779. opname = "disor"
  780. if self.run:
  781. resultlist = []
  782. for map_i in topolist:
  783. # Generate an intermediate name for the result map list.
  784. map_new = self.generate_new_map(base_map=map_i, bool_op=opname,
  785. copy=True)
  786. # Set first input for overlay module.
  787. mapainput = map_i.get_id()
  788. # Loop over temporal related maps and create overlay modules.
  789. tbrelations = map_i.get_temporal_relations()
  790. count = 0
  791. for topo in relations:
  792. if topo in tbrelations.keys():
  793. for map_j in (tbrelations[topo]):
  794. # Create overlayed map extent.
  795. returncode = self.overlay_map_extent(map_new,
  796. map_j, opname,
  797. temp_op=temporal)
  798. # Stop the loop if no temporal or spatial
  799. # relationship exist.
  800. if returncode == 0:
  801. break
  802. if count == 0:
  803. # Set map name.
  804. name = map_new.get_id()
  805. else:
  806. # Generate an intermediate name
  807. name = self.generate_map_name()
  808. map_new.set_id(name + "@" + mapset)
  809. # Set second input for overlay module.
  810. mapbinput = map_j.get_id()
  811. # Create module command in PyGRASS for v.overlay
  812. # and v.patch.
  813. if opname != "disor":
  814. m = copy.deepcopy(self.m_overlay)
  815. m.run_ = False
  816. m.inputs["operator"].value = opname
  817. m.inputs["ainput"].value = str(mapainput)
  818. m.inputs["binput"].value = str(mapbinput)
  819. m.outputs["output"].value = name
  820. m.flags["overwrite"].value = self.overwrite
  821. else:
  822. patchinput = str(mapainput) + ',' + str(mapbinput)
  823. m = copy.deepcopy(self.m_patch)
  824. m.run_ = False
  825. m.inputs["input"].value = patchinput
  826. m.outputs["output"].value = name
  827. m.flags["overwrite"].value = self.overwrite
  828. # Conditional append of module command.
  829. if "cmd_list" in dir(map_new):
  830. map_new.cmd_list.append(m)
  831. else:
  832. map_new.cmd_list = [m]
  833. # Set new map name to temporary map name.
  834. mapainput = name
  835. count += 1
  836. if returncode == 0:
  837. break
  838. # Append map to result map list.
  839. if returncode == 1:
  840. resultlist.append(map_new)
  841. return resultlist
  842. def p_buffer_operation(self, t):
  843. """
  844. expr : buff_function LPAREN stds COMMA number RPAREN
  845. | buff_function LPAREN expr COMMA number RPAREN
  846. """
  847. if self.run:
  848. # Check input stds.
  849. bufflist = self.check_stds(t[3])
  850. # Create empty result list.
  851. resultlist = []
  852. for map_i in bufflist:
  853. # Generate an intermediate name for the result map list.
  854. map_new = self.generate_new_map(base_map=map_i, bool_op=None,
  855. copy=True)
  856. # Change spatial extent based on buffer size.
  857. map_new.spatial_buffer(float(t[5]))
  858. # Check buff type.
  859. if t[1] == "buff_p":
  860. buff_type = "point"
  861. elif t[1] == "buff_l":
  862. buff_type = "line"
  863. elif t[1] == "buff_a":
  864. buff_type = "area"
  865. m = copy.deepcopy(self.m_buffer)
  866. m.run_ = False
  867. m.inputs["type"].value = buff_type
  868. m.inputs["input"].value = str(map_i.get_id())
  869. m.inputs["distance"].value = float(t[5])
  870. m.outputs["output"].value = map_new.get_name()
  871. m.flags["overwrite"].value = self.overwrite
  872. # Conditional append of module command.
  873. if "cmd_list" in dir(map_new):
  874. map_new.cmd_list.append(m)
  875. else:
  876. map_new.cmd_list = [m]
  877. resultlist.append(map_new)
  878. t[0] = resultlist
  879. def p_buff_function(self, t):
  880. """buff_function : BUFF_POINT
  881. | BUFF_LINE
  882. | BUFF_AREA
  883. """
  884. t[0] = t[1]
  885. # Handle errors.
  886. def p_error(self, t):
  887. raise SyntaxError("syntax error on line %d near '%s' expression '%s'" %
  888. (t.lineno, t.value, self.expression))
  889. ###############################################################################
  890. if __name__ == "__main__":
  891. import doctest
  892. doctest.testmod()