Overview
Comment: | [build] darg: code cleaning (pylint) |
---|---|
Downloads: | Tarball | ZIP archive | SQL archive |
Timelines: | family | ancestors | descendants | both | trunk | build |
Files: | files | file ages | folders |
SHA3-256: |
36a7c2130010729c9433a22af4a6b548 |
User & Date: | olr on 2019-05-11 10:07:45 |
Other Links: | manifest | tags |
Context
2019-05-11
| ||
10:17 | [cli] code cleaning (pylint) check-in: d792e0b938 user: olr tags: trunk, cli | |
10:07 | [build] darg: code cleaning (pylint) check-in: 36a7c21300 user: olr tags: trunk, build | |
09:33 | [fx] gc panel: message panel adjustments check-in: a5675dcdb7 user: olr tags: trunk, fx | |
Changes
Modified darg.py from [0d3ea50a3a] to [8854c10a7e].
1 2 3 4 5 6 7 8 9 10 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 | - - | #!python3 """ RULE GRAPH BUILDER """ # by Olivier R. # License: MPL 2 import re |
︙ | |||
53 54 55 56 57 58 59 | 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 | - + | nCommonPrefix += 1 # Check the lUncheckedNodes for redundant nodes, proceeding from last # one down to the common prefix size. Then truncate the list at that point. self._minimize(nCommonPrefix) # add the suffix, starting from the correct node mid-way through the graph |
︙ | |||
125 126 127 128 129 130 131 | 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 | - + - + - - + + - + - + - + | dKeyTrans = {} for i, nKey in enumerate(dGraph): dKeyTrans[nKey] = i # replace keys dNewGraph = {} for nKey, dVal in dGraph.items(): dNewGraph[dKeyTrans[nKey]] = dVal |
︙ | |||
169 170 171 172 173 174 175 | 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 | - + - + | sPattern, sNegPattern = sRegex.split("¬") try: if not sNegPattern: print("# Warning! Empty negpattern:", sRegex) re.compile(sPattern) if sNegPattern != "*": re.compile(sNegPattern) |
︙ |