temporal_raster_algebra.py 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172
  1. """
  2. Temporal raster algebra
  3. (C) 2013 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. >>> p = TemporalRasterAlgebraLexer()
  10. >>> p.build()
  11. >>> p.debug = True
  12. >>> expression = 'R = A[0,1,0] / B[0,0,1] * 20 + C[0,1,1] - 2.45'
  13. >>> p.test(expression)
  14. R = A[0,1,0] / B[0,0,1] * 20 + C[0,1,1] - 2.45
  15. LexToken(NAME,'R',1,0)
  16. LexToken(EQUALS,'=',1,2)
  17. LexToken(NAME,'A',1,4)
  18. LexToken(L_SPAREN,'[',1,5)
  19. LexToken(INT,0,1,6)
  20. LexToken(COMMA,',',1,7)
  21. LexToken(INT,1,1,8)
  22. LexToken(COMMA,',',1,9)
  23. LexToken(INT,0,1,10)
  24. LexToken(R_SPAREN,']',1,11)
  25. LexToken(DIV,'/',1,13)
  26. LexToken(NAME,'B',1,15)
  27. LexToken(L_SPAREN,'[',1,16)
  28. LexToken(INT,0,1,17)
  29. LexToken(COMMA,',',1,18)
  30. LexToken(INT,0,1,19)
  31. LexToken(COMMA,',',1,20)
  32. LexToken(INT,1,1,21)
  33. LexToken(R_SPAREN,']',1,22)
  34. LexToken(MULT,'*',1,24)
  35. LexToken(INT,20,1,26)
  36. LexToken(ADD,'+',1,29)
  37. LexToken(NAME,'C',1,31)
  38. LexToken(L_SPAREN,'[',1,32)
  39. LexToken(INT,0,1,33)
  40. LexToken(COMMA,',',1,34)
  41. LexToken(INT,1,1,35)
  42. LexToken(COMMA,',',1,36)
  43. LexToken(INT,1,1,37)
  44. LexToken(R_SPAREN,']',1,38)
  45. LexToken(SUB,'-',1,40)
  46. LexToken(FLOAT,2.45,1,42)
  47. """
  48. from temporal_raster_base_algebra import *
  49. ###############################################################################
  50. class TemporalRasterAlgebraParser(TemporalRasterBaseAlgebraParser):
  51. """The temporal raster algebra class"""
  52. def __init__(self, pid=None, run=False, debug=True, spatial=False,
  53. nprocs=1, register_null=False):
  54. TemporalRasterBaseAlgebraParser.__init__(self, pid, run, debug,
  55. spatial, nprocs,
  56. register_null)
  57. self.m_mapcalc = pymod.Module('r.mapcalc', run_=False, finish_=False)
  58. self.m_remove = pymod.Module('g.remove')
  59. def parse(self, expression, basename=None, overwrite=False):
  60. self.lexer = TemporalRasterAlgebraLexer()
  61. self.lexer.build()
  62. self.parser = yacc.yacc(module=self, debug=self.debug)
  63. self.overwrite = overwrite
  64. self.count = 0
  65. self.stdstype = "strds"
  66. self.basename = basename
  67. self.expression = expression
  68. self.parser.parse(expression)
  69. def remove_empty_maps(self):
  70. """! Removes the intermediate vector maps.
  71. """
  72. if self.empty_maps:
  73. self.msgr.message(_("Removing empty raster maps"))
  74. namelist = self.empty_maps.values()
  75. max = 100
  76. chunklist = [namelist[i:i + max] for i in range(0, len(namelist), max)]
  77. for chunk in chunklist:
  78. stringlist = ",".join(chunk)
  79. if self.run:
  80. m = copy.deepcopy(self.m_remove)
  81. m.inputs["type"].value = "rast"
  82. m.inputs["pattern"].value = stringlist
  83. m.flags["f"].value = True
  84. m.run()
  85. ######################### Temporal functions ##############################
  86. def p_statement_assign(self, t):
  87. # The expression should always return a list of maps.
  88. """
  89. statement : stds EQUALS expr
  90. """
  91. TemporalRasterBaseAlgebraParser.p_statement_assign(self, t)
  92. def p_ts_neighbour_operation(self, t):
  93. # Examples:
  94. # A[1,0]
  95. # B[-2]
  96. # C[-2,1,3]
  97. """
  98. expr : stds L_SPAREN number COMMA number R_SPAREN
  99. | stds L_SPAREN number R_SPAREN
  100. | stds L_SPAREN number COMMA number COMMA number R_SPAREN
  101. """
  102. # Check input stds.
  103. maplist = self.check_stds(t[1])
  104. row_neigbour = None
  105. col_neigbour = None
  106. if len(t) == 5:
  107. t_neighbour = t[3]
  108. elif len(t) == 7:
  109. t_neighbour = 0
  110. row_neigbour = t[3]
  111. col_neigbour = t[5]
  112. elif len(t) == 9:
  113. t_neighbour = t[7]
  114. row_neigbour = t[3]
  115. col_neigbour = t[5]
  116. if self.run:
  117. resultlist = []
  118. max_index = len(maplist)
  119. for map_i in maplist:
  120. # Get map index and temporal extent.
  121. map_index = maplist.index(map_i)
  122. new_index = map_index + t_neighbour
  123. if new_index < max_index and new_index >= 0:
  124. map_i_t_extent = map_i.get_temporal_extent()
  125. # Get neighbouring map and set temporal extent.
  126. map_n = maplist[new_index]
  127. # Generate an intermediate map for the result map list.
  128. map_new = self.generate_new_map(map_n, bool_op='and',
  129. copy=True)
  130. map_new.set_temporal_extent(map_i_t_extent)
  131. # Create r.mapcalc expression string for the operation.
  132. if "cmd_list" in dir(map_new) and len(t) == 5:
  133. cmdstring = "%s" % (map_new.cmd_list)
  134. elif "cmd_list" not in dir(map_new) and len(t) == 5:
  135. cmdstring = "%s" % (map_n.get_id())
  136. elif "cmd_list" in dir(map_new) and len(t) in (7, 9):
  137. cmdstring = "%s[%s,%s]" % (map_new.cmd_list,
  138. row_neigbour, col_neigbour)
  139. elif "cmd_list" not in dir(map_new) and len(t) in (7, 9):
  140. cmdstring = "%s[%s,%s]" % (map_n.get_id(),
  141. row_neigbour, col_neigbour)
  142. # Set new command list for map.
  143. map_new.cmd_list = cmdstring
  144. # Append map with updated command list to result list.
  145. resultlist.append(map_new)
  146. t[0] = resultlist
  147. ###############################################################################
  148. if __name__ == "__main__":
  149. import doctest
  150. doctest.testmod()