temporal_vector_algebra.py 35 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936
  1. """!@package grass.temporal
  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
  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. @endcode
  414. """
  415. import grass.pygrass.modules as pygrass
  416. from temporal_vector_operator import *
  417. from temporal_algebra import *
  418. ##############################################################################
  419. class TemporalVectorAlgebraLexer(TemporalAlgebraLexer):
  420. """!Lexical analyzer for the GRASS GIS temporal vector algebra"""
  421. def __init__(self):
  422. TemporalAlgebraLexer.__init__(self)
  423. # Buffer functions from v.buffer
  424. vector_buff_functions = {
  425. 'buff_p' : 'BUFF_POINT',
  426. 'buff_l' : 'BUFF_LINE',
  427. 'buff_a' : 'BUFF_AREA',
  428. }
  429. # This is the list of token names.
  430. vector_tokens = (
  431. 'DISOR',
  432. 'XOR',
  433. 'NOT',
  434. 'T_OVERLAY_OPERATOR',
  435. )
  436. # Build the token list
  437. tokens = TemporalAlgebraLexer.tokens \
  438. + vector_tokens \
  439. + tuple(vector_buff_functions.values())
  440. # Regular expression rules for simple tokens
  441. t_DISOR = r'\+'
  442. t_XOR = r'\^'
  443. t_NOT = r'\~'
  444. t_T_OVERLAY_OPERATOR = r'\{([a-zA-Z\|]+[,])?([\|&+=]?[\|&+=\^\~])\}'
  445. # Parse symbols
  446. def temporal_symbol(self, t):
  447. # Check for reserved words
  448. if t.value in TemporalVectorAlgebraLexer.time_functions.keys():
  449. t.type = TemporalVectorAlgebraLexer.time_functions.get(t.value)
  450. elif t.value in TemporalVectorAlgebraLexer.datetime_functions.keys():
  451. t.type = TemporalVectorAlgebraLexer.datetime_functions.get(t.value)
  452. elif t.value in TemporalVectorAlgebraLexer.conditional_functions.keys():
  453. t.type = TemporalVectorAlgebraLexer.conditional_functions.get(t.value)
  454. elif t.value in TemporalVectorAlgebraLexer.vector_buff_functions.keys():
  455. t.type = TemporalVectorAlgebraLexer.vector_buff_functions.get(t.value)
  456. else:
  457. t.type = 'NAME'
  458. return t
  459. ##############################################################################
  460. class TemporalVectorAlgebraParser(TemporalAlgebraParser):
  461. """The temporal algebra class"""
  462. # Get the tokens from the lexer class
  463. tokens = TemporalVectorAlgebraLexer.tokens
  464. # Setting equal precedence level for select and hash operations.
  465. precedence = (
  466. ('left', 'T_SELECT_OPERATOR', 'T_SELECT', 'T_NOT_SELECT'), # 1
  467. ('left', 'AND', 'OR', 'T_COMP_OPERATOR', 'T_OVERLAY_OPERATOR', 'DISOR', \
  468. 'NOT', 'XOR'), #2
  469. )
  470. def __init__(self, pid=None, run=False, debug=True, spatial = False):
  471. TemporalAlgebraParser.__init__(self, pid, run, debug, spatial)
  472. self.m_overlay = pygrass.Module('v.overlay', quiet=True, run_=False)
  473. self.m_rename = pygrass.Module('g.rename', quiet=True, run_=False)
  474. self.m_patch = pygrass.Module('v.patch', quiet=True, run_=False)
  475. self.m_mremove = pygrass.Module('g.mremove', quiet=True, run_=False)
  476. self.m_buffer = pygrass.Module('v.buffer', quiet=True, run_=False)
  477. def parse(self, expression, basename = None, overwrite = False):
  478. self.lexer = TemporalVectorAlgebraLexer()
  479. self.lexer.build()
  480. self.parser = yacc.yacc(module=self, debug=self.debug)
  481. self.overwrite = overwrite
  482. self.count = 0
  483. self.stdstype = "stvds"
  484. self.basename = basename
  485. self.expression = expression
  486. self.parser.parse(expression)
  487. ######################### Temporal functions ##############################
  488. def remove_intermediate_vector_maps(self):
  489. """! Removes the intermediate vector maps.
  490. """
  491. if self.names != {}:
  492. namelist = self.names.values()
  493. max = 100
  494. chunklist = [namelist[i:i + max] for i in range(0, len(namelist), max)]
  495. for chunk in chunklist:
  496. stringlist = ",".join(chunk)
  497. if self.debug:
  498. print "g.mremove type=vect pattern=%s"%(stringlist)
  499. if self.run:
  500. m = copy.deepcopy(self.m_mremove)
  501. m.inputs["type"].value = "vect"
  502. m.inputs["pattern"].value = stringlist
  503. m.flags["f"].value = True
  504. m.run()
  505. def eval_toperator(self, operator, comparison = False):
  506. """!This function evaluates a string containing temporal operations.
  507. @param operator String of temporal operations, e.g. {equal|during,=!:}.
  508. @return List of temporal relations (equal, during), the given function
  509. (!:) and the interval/instances (=).
  510. @code
  511. >>> import grass.temporal as tgis
  512. >>> tgis.init(True)
  513. >>> p = tgis.TemporalVectorAlgebraParser()
  514. >>> operator = "{equal,:}"
  515. >>> p.eval_toperator(operator)
  516. (['EQUAL'], '=', ':')
  517. >>> operator = "{equal|during,:}"
  518. >>> p.eval_toperator(operator)
  519. (['EQUAL', 'DURING'], '=', ':')
  520. >>> operator = "{equal,!:}"
  521. >>> p.eval_toperator(operator)
  522. (['EQUAL'], '=', '!:')
  523. >>> operator = "{equal|during,!:}"
  524. >>> p.eval_toperator(operator)
  525. (['EQUAL', 'DURING'], '=', '!:')
  526. >>> operator = "{equal|during,=!:}"
  527. >>> p.eval_toperator(operator)
  528. (['EQUAL', 'DURING'], '=', '!:')
  529. >>> operator = "{equal|during|starts,#}"
  530. >>> p.eval_toperator(operator)
  531. (['EQUAL', 'DURING', 'STARTS'], '=', '#')
  532. >>> operator = "{!:}"
  533. >>> p.eval_toperator(operator)
  534. (['EQUAL'], '=', '!:')
  535. >>> operator = "{=:}"
  536. >>> p.eval_toperator(operator)
  537. (['EQUAL'], '=', ':')
  538. >>> operator = "{#}"
  539. >>> p.eval_toperator(operator)
  540. (['EQUAL'], '=', '#')
  541. >>> operator = "{equal|during}"
  542. >>> p.eval_toperator(operator)
  543. (['EQUAL', 'DURING'], None, None)
  544. >>> operator = "{equal}"
  545. >>> p.eval_toperator(operator)
  546. (['EQUAL'], None, None)
  547. >>> operator = "{equal,||}"
  548. >>> p.eval_toperator(operator, True)
  549. (['EQUAL'], '=', '||')
  550. >>> operator = "{equal|during,&&}"
  551. >>> p.eval_toperator(operator, True)
  552. (['EQUAL', 'DURING'], '=', '&&')
  553. >>> operator = "{&}"
  554. >>> p.eval_toperator(operator)
  555. (['EQUAL'], '=', '&')
  556. @endcode
  557. """
  558. p = TemporalVectorOperatorParser()
  559. p.parse(operator, comparison)
  560. p.relations = [rel.upper() for rel in p.relations]
  561. return(p.relations, p.temporal, p.function)
  562. def overlay_map_extent(self, mapA, mapB, bool_op = None, temp_op = '=',
  563. copy = False):
  564. """!Compute the spatio-temporal extent of two topological related maps
  565. @param mapA The first map
  566. @param mapB The second maps
  567. @param bool_op The boolean operator specifying the spatial extent
  568. operation (intersection, union, disjoint union)
  569. @param temp_op The temporal operator specifying the temporal
  570. exntent operation (intersection, union, disjoint union)
  571. @param copy Specifies if the temporal extent of mapB should be
  572. copied to mapA
  573. """
  574. returncode = TemporalAlgebraParser.overlay_map_extent(self, mapA, mapB,
  575. bool_op, temp_op,
  576. copy)
  577. if not copy and returncode == 1:
  578. # Conditional append of command list.
  579. if "cmd_list" in dir(mapA) and "cmd_list" in dir(mapB):
  580. mapA.cmd_list = mapA.cmd_list + mapB.cmd_list
  581. elif "cmd_list" not in dir(mapA) and "cmd_list" in dir(mapB):
  582. mapA.cmd_list = mapB.cmd_list
  583. return(returncode)
  584. ###########################################################################
  585. def p_statement_assign(self, t):
  586. # The expression should always return a list of maps.
  587. """
  588. statement : stds EQUALS expr
  589. """
  590. # Execute the command lists
  591. if self.run:
  592. if isinstance(t[3], list):
  593. num = len(t[3])
  594. count = 0
  595. returncode = 0
  596. register_list = []
  597. for i in range(num):
  598. # Check if resultmap names exist in GRASS database.
  599. vectorname = self.basename + "_" + str(i)
  600. vectormap = VectorDataset(vectorname + "@" + get_current_mapset())
  601. if vectormap.map_exists() and self.overwrite == False:
  602. self.msgr.fatal(_("Error vector maps with basename %s exist. "
  603. "Use --o flag to overwrite existing file") \
  604. %(vectorname))
  605. for map_i in t[3]:
  606. if "cmd_list" in dir(map_i):
  607. # Execute command list.
  608. for cmd in map_i.cmd_list:
  609. try:
  610. # We need to check if the input maps have areas in case of v.overlay
  611. # otherwise 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 + "@" + self.mapset)
  641. if not map_test.map_exists():
  642. returncode = 1
  643. break
  644. if returncode == 0:
  645. # We remove the invalid vector name from the remove list.
  646. if self.names.has_key(map_i.get_name()):
  647. self.names.pop(map_i.get_name())
  648. mapset = map_i.get_mapset()
  649. # Change map name to given basename.
  650. newident = self.basename + "_" + str(count)
  651. m = copy.deepcopy(self.m_rename)
  652. m.inputs["vect"].value = (map_i.get_name(),newident)
  653. m.flags["overwrite"].value = self.overwrite
  654. m.run()
  655. #m(vect = (map_i.get_name(),newident), \
  656. # overwrite = self.overwrite)
  657. map_i.set_id(newident + "@" + mapset)
  658. count += 1
  659. register_list.append(map_i)
  660. else:
  661. register_list.append(map_i)
  662. if len(register_list) > 0:
  663. # Open connection to temporal database.
  664. dbif, connected = init_dbif(dbif=self.dbif)
  665. # Create result space time dataset.
  666. resultstds = open_new_stds(t[1], self.stdstype, \
  667. 'absolute', t[1], t[1], \
  668. "temporal vector algebra", dbif=dbif,
  669. overwrite = self.overwrite)
  670. for map_i in register_list:
  671. # Check if modules should be executed from command list.
  672. if "cmd_list" in dir(map_i):
  673. # Get meta data from grass database.
  674. map_i.load()
  675. if map_i.is_in_db(dbif=dbif) and self.overwrite:
  676. # Update map in temporal database.
  677. map_i.update_all(dbif=dbif)
  678. elif map_i.is_in_db(dbif=dbif) and self.overwrite == False:
  679. # Raise error if map exists and no overwrite flag is given.
  680. self.msgr.fatal(_("Error vector map %s exist in temporal database. "
  681. "Use overwrite flag. : \n%s") \
  682. %(map_i.get_map_id(), cmd.popen.stderr))
  683. else:
  684. # Insert map into temporal database.
  685. map_i.insert(dbif=dbif)
  686. else:
  687. #Get metadata from temporal database.
  688. map_i.select(dbif=dbif)
  689. # Register map in result space time dataset.
  690. resultstds.register_map(map_i, dbif=dbif)
  691. #count += 1
  692. #if count % 10 == 0:
  693. # grass.percent(count, num, 1)
  694. resultstds.update_from_registered_maps(dbif=dbif)
  695. if connected:
  696. dbif.close()
  697. self.remove_intermediate_vector_maps()
  698. t[0] = register_list
  699. def p_overlay_operation(self, t):
  700. """
  701. expr : stds AND stds
  702. | expr AND stds
  703. | stds AND expr
  704. | expr AND expr
  705. | stds OR stds
  706. | expr OR stds
  707. | stds OR expr
  708. | expr OR expr
  709. | stds XOR stds
  710. | expr XOR stds
  711. | stds XOR expr
  712. | expr XOR expr
  713. | stds NOT stds
  714. | expr NOT stds
  715. | stds NOT expr
  716. | expr NOT expr
  717. | stds DISOR stds
  718. | expr DISOR stds
  719. | stds DISOR expr
  720. | expr DISOR expr
  721. """
  722. # Check input stds.
  723. maplistA = self.check_stds(t[1])
  724. maplistB = self.check_stds(t[3])
  725. if self.run:
  726. t[0] = self.create_overlay_operations(maplistA, maplistB, ("EQUAL",), "=", t[2])
  727. else:
  728. t[0] = t[1]
  729. def p_overlay_operation_relation(self, t):
  730. """
  731. expr : stds T_OVERLAY_OPERATOR stds
  732. | expr T_OVERLAY_OPERATOR stds
  733. | stds T_OVERLAY_OPERATOR expr
  734. | expr T_OVERLAY_OPERATOR expr
  735. """
  736. # Check input stds.
  737. maplistA = self.check_stds(t[1])
  738. maplistB = self.check_stds(t[3])
  739. relations, temporal, function= self.eval_toperator(t[2])
  740. if self.run:
  741. t[0] = self.create_overlay_operations(maplistA, maplistB, relations, temporal, function)
  742. else:
  743. t[0] = t[1]
  744. def create_overlay_operations(self, maplistA, maplistB, relations, temporal, function):
  745. """!Create the spatial overlay operation commad list
  746. @param maplistA A list of map objects
  747. @param maplistB A list of map objects
  748. @param relations The temporal relationships that must be fullfilled as list of strings
  749. ("EQUAL", "DURING", ...)
  750. @param temporal The temporal operator as string "=" or "&", ...
  751. @param function The spatial overlay operations as string "&", "|", ...
  752. @return Return the list of maps with overlay commands
  753. """
  754. topolist = self.get_temporal_topo_list(maplistA, maplistB, topolist = relations)
  755. # Select operation name.
  756. if function == "&":
  757. opname = "and"
  758. elif function == "|":
  759. opname = "or"
  760. elif function == "^":
  761. opname = "xor"
  762. elif function == "~":
  763. opname = "not"
  764. elif function == "+":
  765. opname = "disor"
  766. if self.run:
  767. resultlist = []
  768. for map_i in topolist:
  769. # Generate an intermediate name for the result map list.
  770. map_new = self.generate_new_map(base_map=map_i, bool_op=opname,
  771. copy=True)
  772. # Set first input for overlay module.
  773. mapainput = map_i.get_id()
  774. # Loop over temporal related maps and create overlay modules.
  775. tbrelations = map_i.get_temporal_relations()
  776. count = 0
  777. for topo in relations:
  778. if topo in tbrelations.keys():
  779. for map_j in (tbrelations[topo]):
  780. # Create overlayed map extent.
  781. returncode = self.overlay_map_extent(map_new, map_j, opname, \
  782. temp_op = temporal)
  783. # Stop the loop if no temporal or spatial relationship exist.
  784. if returncode == 0:
  785. break
  786. if count == 0:
  787. # Set map name.
  788. name = map_new.get_id()
  789. else:
  790. # Generate an intermediate name
  791. name = self.generate_map_name()
  792. map_new.set_id(name + "@" + mapset)
  793. # Set second input for overlay module.
  794. mapbinput = map_j.get_id()
  795. # Create module command in PyGRASS for v.overlay and v.patch.
  796. if opname != "disor":
  797. m = copy.deepcopy(self.m_overlay)
  798. m.run_ = False
  799. m.inputs["operator"].value = opname
  800. m.inputs["ainput"].value = str(mapainput)
  801. m.inputs["binput"].value = str(mapbinput)
  802. m.outputs["output"].value = name
  803. m.flags["overwrite"].value = self.overwrite
  804. else:
  805. patchinput = str(mapainput) + ',' + str(mapbinput)
  806. m = copy.deepcopy(self.m_patch)
  807. m.run_ = False
  808. m.inputs["input"].value = patchinput
  809. m.outputs["output"].value = name
  810. m.flags["overwrite"].value = self.overwrite
  811. # Conditional append of module command.
  812. if "cmd_list" in dir(map_new):
  813. map_new.cmd_list.append(m)
  814. else:
  815. map_new.cmd_list = [m]
  816. # Set new map name to temporary map name.
  817. mapainput = name
  818. count += 1
  819. if returncode == 0:
  820. break
  821. # Append map to result map list.
  822. if returncode == 1:
  823. resultlist.append(map_new)
  824. return resultlist
  825. def p_buffer_operation(self,t):
  826. """
  827. expr : buff_function LPAREN stds COMMA number RPAREN
  828. | buff_function LPAREN expr COMMA number RPAREN
  829. """
  830. if self.run:
  831. # Check input stds.
  832. bufflist = self.check_stds(t[3])
  833. # Create empty result list.
  834. resultlist = []
  835. for map_i in bufflist:
  836. # Generate an intermediate name for the result map list.
  837. map_new = self.generate_new_map(base_map=map_i, bool_op=None,
  838. copy=True)
  839. # Change spatial extent based on buffer size.
  840. map_new.spatial_buffer(float(t[5]))
  841. # Check buff type.
  842. if t[1] == "buff_p":
  843. buff_type = "point"
  844. elif t[1] == "buff_l":
  845. buff_type = "line"
  846. elif t[1] == "buff_a":
  847. buff_type = "area"
  848. m = copy.deepcopy(self.m_buffer)
  849. m.run_ = False
  850. m.inputs["type"].value = buff_type
  851. m.inputs["input"].value = str(map_i.get_id())
  852. m.inputs["distance"].value = float(t[5])
  853. m.outputs["output"].value = map_new.get_name()
  854. m.flags["overwrite"].value = self.overwrite
  855. # Conditional append of module command.
  856. if "cmd_list" in dir(map_new):
  857. map_new.cmd_list.append(m)
  858. else:
  859. map_new.cmd_list = [m]
  860. resultlist.append(map_new)
  861. t[0] = resultlist
  862. def p_buff_function(self, t):
  863. """buff_function : BUFF_POINT
  864. | BUFF_LINE
  865. | BUFF_AREA
  866. """
  867. t[0] = t[1]
  868. # Handle errors.
  869. def p_error(self, t):
  870. raise SyntaxError("syntax error on line %d near '%s' expression '%s'" %
  871. (t.lineno, t.value, self.expression))
  872. ###############################################################################
  873. if __name__ == "__main__":
  874. import doctest
  875. doctest.testmod()