Obtain a unique key given a dictionary.
(adict)
| 112 | return ','.join(l) |
| 113 | |
| 114 | def unique_key(adict): |
| 115 | """ Obtain a unique key given a dictionary.""" |
| 116 | allkeys = list(adict.keys()) |
| 117 | done = False |
| 118 | n = 1 |
| 119 | while not done: |
| 120 | newkey = f'__l{n}' |
| 121 | if newkey in allkeys: |
| 122 | n += 1 |
| 123 | else: |
| 124 | done = True |
| 125 | return newkey |
| 126 | |
| 127 | |
| 128 | template_name_re = re.compile(r'\A\s*(\w[\w\d]*)\s*\Z') |
no test coverage detected
searching dependent graphs…