(allstr)
| 189 | return newstr |
| 190 | |
| 191 | def process_str(allstr): |
| 192 | newstr = allstr |
| 193 | writestr = '' |
| 194 | |
| 195 | struct = parse_structure(newstr) |
| 196 | |
| 197 | oldend = 0 |
| 198 | names = {} |
| 199 | names.update(_special_names) |
| 200 | for sub in struct: |
| 201 | cleanedstr, defs = find_and_remove_repl_patterns(newstr[oldend:sub[0]]) |
| 202 | writestr += cleanedstr |
| 203 | names.update(defs) |
| 204 | writestr += expand_sub(newstr[sub[0]:sub[1]], names) |
| 205 | oldend = sub[1] |
| 206 | writestr += newstr[oldend:] |
| 207 | |
| 208 | return writestr |
| 209 | |
| 210 | |
| 211 | include_src_re = re.compile(r"(\n|\A)\s*include\s*['\"](?P<name>[\w\d./\\]+\.src)['\"]", re.I) |
searching dependent graphs…