(astr)
| 102 | |
| 103 | item_re = re.compile(r"\A\\(?P<index>\d+)\Z") |
| 104 | def conv(astr): |
| 105 | b = astr.split(',') |
| 106 | l = [x.strip() for x in b] |
| 107 | for i in range(len(l)): |
| 108 | m = item_re.match(l[i]) |
| 109 | if m: |
| 110 | j = int(m.group('index')) |
| 111 | l[i] = l[j] |
| 112 | return ','.join(l) |
| 113 | |
| 114 | def unique_key(adict): |
| 115 | """ Obtain a unique key given a dictionary.""" |
searching dependent graphs…