featmap 0.1.0__py3-none-any.whl
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Potentially problematic release.
This version of featmap might be problematic. Click here for more details.
- featmap-0.1.0.dist-info/METADATA +129 -0
- featmap-0.1.0.dist-info/RECORD +130 -0
- featmap-0.1.0.dist-info/WHEEL +5 -0
- featmap-0.1.0.dist-info/entry_points.txt +2 -0
- featmap-0.1.0.dist-info/licenses/LICENSE +24 -0
- featmap-0.1.0.dist-info/licenses/fmap/vendor/typescript/LICENSE.txt +55 -0
- featmap-0.1.0.dist-info/licenses/fmap/vendor/typescript/ThirdPartyNoticeText.txt +193 -0
- featmap-0.1.0.dist-info/top_level.txt +1 -0
- fmap/__init__.py +1 -0
- fmap/__main__.py +3 -0
- fmap/axum.py +485 -0
- fmap/cache.py +25 -0
- fmap/cli.py +907 -0
- fmap/goext/go.mod +3 -0
- fmap/goext/main.go +547 -0
- fmap/goext.py +43 -0
- fmap/graph.py +920 -0
- fmap/impact.py +171 -0
- fmap/index.py +66 -0
- fmap/pyx.py +1133 -0
- fmap/routes.py +163 -0
- fmap/rsx.py +381 -0
- fmap/scip.py +80 -0
- fmap/trace_site.py +63 -0
- fmap/tsx.cjs +1258 -0
- fmap/tsx.py +98 -0
- fmap/vendor/typescript/LICENSE.txt +55 -0
- fmap/vendor/typescript/ThirdPartyNoticeText.txt +193 -0
- fmap/vendor/typescript/lib/lib.d.ts +22 -0
- fmap/vendor/typescript/lib/lib.decorators.d.ts +384 -0
- fmap/vendor/typescript/lib/lib.decorators.legacy.d.ts +22 -0
- fmap/vendor/typescript/lib/lib.dom.asynciterable.d.ts +41 -0
- fmap/vendor/typescript/lib/lib.dom.d.ts +39429 -0
- fmap/vendor/typescript/lib/lib.dom.iterable.d.ts +571 -0
- fmap/vendor/typescript/lib/lib.es2015.collection.d.ts +147 -0
- fmap/vendor/typescript/lib/lib.es2015.core.d.ts +597 -0
- fmap/vendor/typescript/lib/lib.es2015.d.ts +28 -0
- fmap/vendor/typescript/lib/lib.es2015.generator.d.ts +77 -0
- fmap/vendor/typescript/lib/lib.es2015.iterable.d.ts +605 -0
- fmap/vendor/typescript/lib/lib.es2015.promise.d.ts +81 -0
- fmap/vendor/typescript/lib/lib.es2015.proxy.d.ts +128 -0
- fmap/vendor/typescript/lib/lib.es2015.reflect.d.ts +144 -0
- fmap/vendor/typescript/lib/lib.es2015.symbol.d.ts +46 -0
- fmap/vendor/typescript/lib/lib.es2015.symbol.wellknown.d.ts +326 -0
- fmap/vendor/typescript/lib/lib.es2016.array.include.d.ts +116 -0
- fmap/vendor/typescript/lib/lib.es2016.d.ts +21 -0
- fmap/vendor/typescript/lib/lib.es2016.full.d.ts +23 -0
- fmap/vendor/typescript/lib/lib.es2016.intl.d.ts +31 -0
- fmap/vendor/typescript/lib/lib.es2017.arraybuffer.d.ts +21 -0
- fmap/vendor/typescript/lib/lib.es2017.d.ts +26 -0
- fmap/vendor/typescript/lib/lib.es2017.date.d.ts +31 -0
- fmap/vendor/typescript/lib/lib.es2017.full.d.ts +23 -0
- fmap/vendor/typescript/lib/lib.es2017.intl.d.ts +44 -0
- fmap/vendor/typescript/lib/lib.es2017.object.d.ts +49 -0
- fmap/vendor/typescript/lib/lib.es2017.sharedmemory.d.ts +135 -0
- fmap/vendor/typescript/lib/lib.es2017.string.d.ts +45 -0
- fmap/vendor/typescript/lib/lib.es2017.typedarrays.d.ts +53 -0
- fmap/vendor/typescript/lib/lib.es2018.asyncgenerator.d.ts +77 -0
- fmap/vendor/typescript/lib/lib.es2018.asynciterable.d.ts +53 -0
- fmap/vendor/typescript/lib/lib.es2018.d.ts +24 -0
- fmap/vendor/typescript/lib/lib.es2018.full.d.ts +24 -0
- fmap/vendor/typescript/lib/lib.es2018.intl.d.ts +83 -0
- fmap/vendor/typescript/lib/lib.es2018.promise.d.ts +30 -0
- fmap/vendor/typescript/lib/lib.es2018.regexp.d.ts +37 -0
- fmap/vendor/typescript/lib/lib.es2019.array.d.ts +79 -0
- fmap/vendor/typescript/lib/lib.es2019.d.ts +24 -0
- fmap/vendor/typescript/lib/lib.es2019.full.d.ts +24 -0
- fmap/vendor/typescript/lib/lib.es2019.intl.d.ts +23 -0
- fmap/vendor/typescript/lib/lib.es2019.object.d.ts +33 -0
- fmap/vendor/typescript/lib/lib.es2019.string.d.ts +37 -0
- fmap/vendor/typescript/lib/lib.es2019.symbol.d.ts +24 -0
- fmap/vendor/typescript/lib/lib.es2020.bigint.d.ts +765 -0
- fmap/vendor/typescript/lib/lib.es2020.d.ts +27 -0
- fmap/vendor/typescript/lib/lib.es2020.date.d.ts +42 -0
- fmap/vendor/typescript/lib/lib.es2020.full.d.ts +24 -0
- fmap/vendor/typescript/lib/lib.es2020.intl.d.ts +474 -0
- fmap/vendor/typescript/lib/lib.es2020.number.d.ts +28 -0
- fmap/vendor/typescript/lib/lib.es2020.promise.d.ts +47 -0
- fmap/vendor/typescript/lib/lib.es2020.sharedmemory.d.ts +99 -0
- fmap/vendor/typescript/lib/lib.es2020.string.d.ts +44 -0
- fmap/vendor/typescript/lib/lib.es2020.symbol.wellknown.d.ts +41 -0
- fmap/vendor/typescript/lib/lib.es2021.d.ts +23 -0
- fmap/vendor/typescript/lib/lib.es2021.full.d.ts +24 -0
- fmap/vendor/typescript/lib/lib.es2021.intl.d.ts +166 -0
- fmap/vendor/typescript/lib/lib.es2021.promise.d.ts +48 -0
- fmap/vendor/typescript/lib/lib.es2021.string.d.ts +33 -0
- fmap/vendor/typescript/lib/lib.es2021.weakref.d.ts +78 -0
- fmap/vendor/typescript/lib/lib.es2022.array.d.ts +121 -0
- fmap/vendor/typescript/lib/lib.es2022.d.ts +25 -0
- fmap/vendor/typescript/lib/lib.es2022.error.d.ts +75 -0
- fmap/vendor/typescript/lib/lib.es2022.full.d.ts +24 -0
- fmap/vendor/typescript/lib/lib.es2022.intl.d.ts +145 -0
- fmap/vendor/typescript/lib/lib.es2022.object.d.ts +26 -0
- fmap/vendor/typescript/lib/lib.es2022.regexp.d.ts +39 -0
- fmap/vendor/typescript/lib/lib.es2022.string.d.ts +25 -0
- fmap/vendor/typescript/lib/lib.es2023.array.d.ts +924 -0
- fmap/vendor/typescript/lib/lib.es2023.collection.d.ts +21 -0
- fmap/vendor/typescript/lib/lib.es2023.d.ts +22 -0
- fmap/vendor/typescript/lib/lib.es2023.full.d.ts +24 -0
- fmap/vendor/typescript/lib/lib.es2023.intl.d.ts +56 -0
- fmap/vendor/typescript/lib/lib.es2024.arraybuffer.d.ts +65 -0
- fmap/vendor/typescript/lib/lib.es2024.collection.d.ts +29 -0
- fmap/vendor/typescript/lib/lib.es2024.d.ts +26 -0
- fmap/vendor/typescript/lib/lib.es2024.full.d.ts +24 -0
- fmap/vendor/typescript/lib/lib.es2024.object.d.ts +29 -0
- fmap/vendor/typescript/lib/lib.es2024.promise.d.ts +35 -0
- fmap/vendor/typescript/lib/lib.es2024.regexp.d.ts +25 -0
- fmap/vendor/typescript/lib/lib.es2024.sharedmemory.d.ts +68 -0
- fmap/vendor/typescript/lib/lib.es2024.string.d.ts +29 -0
- fmap/vendor/typescript/lib/lib.es5.d.ts +4601 -0
- fmap/vendor/typescript/lib/lib.es6.d.ts +23 -0
- fmap/vendor/typescript/lib/lib.esnext.array.d.ts +35 -0
- fmap/vendor/typescript/lib/lib.esnext.collection.d.ts +96 -0
- fmap/vendor/typescript/lib/lib.esnext.d.ts +29 -0
- fmap/vendor/typescript/lib/lib.esnext.decorators.d.ts +28 -0
- fmap/vendor/typescript/lib/lib.esnext.disposable.d.ts +193 -0
- fmap/vendor/typescript/lib/lib.esnext.error.d.ts +24 -0
- fmap/vendor/typescript/lib/lib.esnext.float16.d.ts +445 -0
- fmap/vendor/typescript/lib/lib.esnext.full.d.ts +24 -0
- fmap/vendor/typescript/lib/lib.esnext.intl.d.ts +21 -0
- fmap/vendor/typescript/lib/lib.esnext.iterator.d.ts +148 -0
- fmap/vendor/typescript/lib/lib.esnext.promise.d.ts +34 -0
- fmap/vendor/typescript/lib/lib.esnext.sharedmemory.d.ts +25 -0
- fmap/vendor/typescript/lib/lib.scripthost.d.ts +322 -0
- fmap/vendor/typescript/lib/lib.webworker.asynciterable.d.ts +41 -0
- fmap/vendor/typescript/lib/lib.webworker.d.ts +13150 -0
- fmap/vendor/typescript/lib/lib.webworker.importscripts.d.ts +23 -0
- fmap/vendor/typescript/lib/lib.webworker.iterable.d.ts +340 -0
- fmap/vendor/typescript/lib/typescript.js +200276 -0
- fmap/vendor/typescript/package.json +120 -0
fmap/impact.py
ADDED
|
@@ -0,0 +1,171 @@
|
|
|
1
|
+
"""Changed-symbol and verification selection for fmap commands."""
|
|
2
|
+
import fnmatch
|
|
3
|
+
import json
|
|
4
|
+
import os
|
|
5
|
+
import re
|
|
6
|
+
import shlex
|
|
7
|
+
import time
|
|
8
|
+
|
|
9
|
+
from . import graph as G
|
|
10
|
+
from . import index as I
|
|
11
|
+
|
|
12
|
+
|
|
13
|
+
def fmap_json_ignored(root):
|
|
14
|
+
"""featmap.json kept out of git on purpose (.gitignore): a supported mode, not an error."""
|
|
15
|
+
r = G.git(root, "check-ignore", "-q", "--", "featmap.json", check=False)
|
|
16
|
+
if r.returncode not in (0, 1):
|
|
17
|
+
raise SystemExit(f"fmap: git check-ignore failed: {r.stderr.strip()}")
|
|
18
|
+
return r.returncode == 0 and G.git(root, "ls-files", "--error-unmatch", "featmap.json", check=False).returncode != 0
|
|
19
|
+
|
|
20
|
+
|
|
21
|
+
HUNK = re.compile(r"^@@ -(\d+)(?:,(\d+))? \+(\d+)(?:,(\d+))? @@")
|
|
22
|
+
|
|
23
|
+
|
|
24
|
+
def diff_ranges(root, rev):
|
|
25
|
+
old, new = {}, {}
|
|
26
|
+
r = G.git(root, "diff", "-U0", "--no-color", "--no-ext-diff", rev, "--", check=False)
|
|
27
|
+
if r.returncode != 0:
|
|
28
|
+
raise SystemExit(f"fmap: git diff {rev} failed: {r.stderr.strip()}")
|
|
29
|
+
a = b = None
|
|
30
|
+
for line in r.stdout.splitlines():
|
|
31
|
+
if line.startswith("--- "):
|
|
32
|
+
a = line[6:] if line.startswith("--- a/") else None
|
|
33
|
+
elif line.startswith("+++ "):
|
|
34
|
+
b = line[6:] if line.startswith("+++ b/") else None
|
|
35
|
+
else:
|
|
36
|
+
m = HUNK.match(line)
|
|
37
|
+
if m:
|
|
38
|
+
os_, oc, ns, nc = m.groups()
|
|
39
|
+
oc, nc = int(oc if oc is not None else 1), int(nc if nc is not None else 1)
|
|
40
|
+
if a and oc:
|
|
41
|
+
old.setdefault(a, []).append((int(os_), int(os_) + oc - 1))
|
|
42
|
+
if b and nc:
|
|
43
|
+
new.setdefault(b, []).append((int(ns), int(ns) + nc - 1))
|
|
44
|
+
if b and not nc: # pure deletion: mark the line it sits on
|
|
45
|
+
new.setdefault(b, []).append((int(ns), int(ns)))
|
|
46
|
+
return old, new
|
|
47
|
+
|
|
48
|
+
|
|
49
|
+
def innermost(nodes, ranges):
|
|
50
|
+
by_file = {}
|
|
51
|
+
for nid, n in nodes.items():
|
|
52
|
+
by_file.setdefault(n["file"], []).append((n["end_line"] - n["line"], nid, n))
|
|
53
|
+
hit = set()
|
|
54
|
+
for f, rs in ranges.items():
|
|
55
|
+
cands = sorted(by_file.get(f, []), key=lambda x: (x[0], x[1].endswith(":<module>"), x[1])) # equal span: the deeper node wins
|
|
56
|
+
for lo, hi in rs:
|
|
57
|
+
for line in range(lo, hi + 1):
|
|
58
|
+
for _, nid, n in cands:
|
|
59
|
+
if n["line"] <= line <= n["end_line"]:
|
|
60
|
+
hit.add(nid)
|
|
61
|
+
break
|
|
62
|
+
return hit
|
|
63
|
+
|
|
64
|
+
|
|
65
|
+
def impact_data(root, rev, possible, config, after, files):
|
|
66
|
+
r = G.git(root, "show", f"{rev}:featmap.json", check=False)
|
|
67
|
+
before_note = None
|
|
68
|
+
before_build_failed = False
|
|
69
|
+
committed = json.loads(r.stdout) if r.returncode == 0 else None
|
|
70
|
+
if committed and committed.get("meta", {}).get("extractor") == after["meta"]["extractor"]:
|
|
71
|
+
before = committed
|
|
72
|
+
else:
|
|
73
|
+
before = {"nodes": {}, "edges": [], "entries": [], "features": {}}
|
|
74
|
+
# a map from other fmap code would differ only by extractor changes and pollute the diff
|
|
75
|
+
before_note = f"{rev}:featmap.json " + ("başka bir fmap sürümüyle kurulmuş" if committed else "yok")
|
|
76
|
+
started = time.monotonic()
|
|
77
|
+
# An untracked/new featmap.toml: the revision gets the working tree's rules (ignore missing, exclude, ...).
|
|
78
|
+
own_config = G.git(root, "cat-file", "-e", f"{rev}:featmap.toml", check=False).returncode == 0
|
|
79
|
+
config_note = ("" if own_config or not os.path.exists(os.path.join(root, "featmap.toml"))
|
|
80
|
+
else f"; {rev}:featmap.toml yok, çalışma ağacındaki featmap.toml kullanıldı")
|
|
81
|
+
try:
|
|
82
|
+
before = G.build_revision(root, rev, config=None if own_config else config)
|
|
83
|
+
before_note += f" — 'önce' grafiği {rev} revizyonundan kuruldu ({time.monotonic() - started:.2f} s){config_note}"
|
|
84
|
+
except (Exception, SystemExit) as error:
|
|
85
|
+
before_build_failed = True
|
|
86
|
+
before_note += f" — 'önce' grafiği boş kabul edildi; revizyon grafiği kurulamadı: {error}{config_note}"
|
|
87
|
+
if fmap_json_ignored(root):
|
|
88
|
+
before_note += (" — featmap.json commit edilmiyor (.gitignore): her impact 'önce' grafiğini yeniden kurar; "
|
|
89
|
+
"hızlandırmak istersen .gitignore sonuna `!featmap.json` ekle, `featmap build` ve `git add featmap.json` ile commit et")
|
|
90
|
+
try:
|
|
91
|
+
old_r, new_r = diff_ranges(root, rev)
|
|
92
|
+
except SystemExit:
|
|
93
|
+
if not before_build_failed:
|
|
94
|
+
raise
|
|
95
|
+
old_r, new_r = {}, {}
|
|
96
|
+
tracked = set(G.list_files(root))
|
|
97
|
+
for p in files:
|
|
98
|
+
if p not in tracked: # untracked new file: every line is new
|
|
99
|
+
n = G.read(root, p).count("\n") + 1
|
|
100
|
+
new_r.setdefault(p, []).append((1, n))
|
|
101
|
+
changed = innermost(after["nodes"], new_r)
|
|
102
|
+
removed = set(before["nodes"]) - set(after["nodes"])
|
|
103
|
+
added = set(after["nodes"]) - set(before["nodes"])
|
|
104
|
+
changed |= added
|
|
105
|
+
changed_old = (innermost(before["nodes"], old_r) & set(before["nodes"])) | removed
|
|
106
|
+
# removed nodes: their old callers come from the before graph
|
|
107
|
+
ia, ib = I.Index(after), I.Index(before)
|
|
108
|
+
aff = ia.affected(sorted(changed & set(after["nodes"])), possible=possible)
|
|
109
|
+
for n, v in ib.affected(sorted(changed_old), possible=possible).items():
|
|
110
|
+
if n in after["nodes"] and n not in aff:
|
|
111
|
+
aff[n] = v
|
|
112
|
+
feats, cmds, unverified, manual, steps = [], [], [], [], []
|
|
113
|
+
# `route:/x`-style reach keys stand for their entry nodes, as in `find` (spec §8.1); the before graph
|
|
114
|
+
# keeps a renamed/deleted key's old nodes, so its feature stays in impact
|
|
115
|
+
sites = {}
|
|
116
|
+
keys = lambda g: {f"{e['kind']}:{e['value']}" for e in g.get("entries", []) + g.get("reach", [])}
|
|
117
|
+
for e in before.get("entries", []) + before.get("reach", []) + after["entries"] + after.get("reach", []):
|
|
118
|
+
sites.setdefault(f"{e['kind']}:{e['value']}", []).extend(e.get("nodes", []))
|
|
119
|
+
# a reach key that appeared or vanished (e.g. a renamed route path with a named handler) is itself a change
|
|
120
|
+
keys_changed = sorted((keys(before) ^ keys(after)) & {k for f in after["features"].values() for k in f.get("reach", [])})
|
|
121
|
+
entry_nodes = {fid: f.get("entry", []) + [n for k in f.get("reach", []) for n in sites.get(k, [])]
|
|
122
|
+
for fid, f in after["features"].items()}
|
|
123
|
+
for fid, f in sorted(after["features"].items()):
|
|
124
|
+
if (any(e in aff or e in changed or e in removed for e in entry_nodes[fid])
|
|
125
|
+
or set(f.get("reach", [])) & set(keys_changed)):
|
|
126
|
+
feats.append(fid)
|
|
127
|
+
if f.get("test"):
|
|
128
|
+
cmds += [(c, fid) for c in f["test"]]
|
|
129
|
+
steps += [fid] if f.get("verify") else []
|
|
130
|
+
elif f.get("verify"):
|
|
131
|
+
manual.append(fid)
|
|
132
|
+
else:
|
|
133
|
+
unverified.append(fid)
|
|
134
|
+
test_files = sorted({after["nodes"][n]["file"] for n in aff if n in after["nodes"]
|
|
135
|
+
and not after["nodes"][n].get("sourced_only")})
|
|
136
|
+
for rule in config.get("runner", []):
|
|
137
|
+
for tf in test_files:
|
|
138
|
+
if fnmatch.fnmatchcase(tf, rule["glob"]):
|
|
139
|
+
cmds.append((rule["cmd"].replace("{file}", shlex.quote(tf)), tf))
|
|
140
|
+
# a changed symbol no selected test reaches must be reported, not passed over silently
|
|
141
|
+
tested = set(f for f in test_files if any(fnmatch.fnmatchcase(f, r["glob"]) for r in config.get("runner", [])))
|
|
142
|
+
tested_entries = {e for fid in feats if after["features"][fid].get("test") for e in entry_nodes[fid]}
|
|
143
|
+
unreached = []
|
|
144
|
+
for n in sorted(changed & set(after["nodes"])):
|
|
145
|
+
up = set(ia.affected([n], possible=possible)) | {n}
|
|
146
|
+
if not any(after["nodes"][u]["file"] in tested or u in tested_entries for u in up if u in after["nodes"]):
|
|
147
|
+
unreached.append(n)
|
|
148
|
+
# no selected test reaches a changed symbol: fall back to every runner-mapped test file (spec §8.1)
|
|
149
|
+
removed_unreached = [n for n in sorted(removed) if not any(
|
|
150
|
+
before["nodes"][u]["file"] in tested or u in tested_entries
|
|
151
|
+
for u in set(ib.affected([n], possible=possible)) | {n} if u in before["nodes"])]
|
|
152
|
+
fallback = []
|
|
153
|
+
if unreached or removed_unreached:
|
|
154
|
+
helpers = {n["file"] for n in after["nodes"].values() if n.get("sourced_only")}
|
|
155
|
+
all_tests = sorted(set(files) - helpers)
|
|
156
|
+
for rule in config.get("runner", []):
|
|
157
|
+
for tf in all_tests:
|
|
158
|
+
if fnmatch.fnmatchcase(tf, rule["glob"]):
|
|
159
|
+
fallback.append((rule["cmd"].replace("{file}", shlex.quote(tf)), "tam takım: seçilen test ulaşmıyor"))
|
|
160
|
+
seen, uniq = set(), []
|
|
161
|
+
for c, why in cmds + fallback:
|
|
162
|
+
if c not in seen:
|
|
163
|
+
seen.add(c)
|
|
164
|
+
uniq.append((c, why))
|
|
165
|
+
return {
|
|
166
|
+
"root": root, "rev": rev, "note": before_note, "ia": ia,
|
|
167
|
+
"changed": sorted(changed), "removed": sorted(removed), "affected": aff, "keys_changed": keys_changed,
|
|
168
|
+
"features": feats, "commands": uniq, "unverified": unverified, "unreached": unreached,
|
|
169
|
+
"fallback": bool(fallback), "manual": manual, "steps": steps,
|
|
170
|
+
"framework_callbacks": [e for e in after["edges"] if e.get("framework") and e["kind"] == "?callback" and e["from"] in aff],
|
|
171
|
+
}
|
fmap/index.py
ADDED
|
@@ -0,0 +1,66 @@
|
|
|
1
|
+
"""Graph lookup and traversal for fmap commands."""
|
|
2
|
+
from collections import deque
|
|
3
|
+
|
|
4
|
+
from . import graph as G
|
|
5
|
+
|
|
6
|
+
TRAVERSE = set(G.RESOLVED)
|
|
7
|
+
|
|
8
|
+
|
|
9
|
+
class Index:
|
|
10
|
+
def __init__(self, g):
|
|
11
|
+
self.g = g
|
|
12
|
+
self.nodes = g["nodes"]
|
|
13
|
+
self.rev, self.fwd = {}, {}
|
|
14
|
+
for e in g["edges"]:
|
|
15
|
+
self.fwd.setdefault(e["from"], []).append(e)
|
|
16
|
+
if e["to"] != "?":
|
|
17
|
+
self.rev.setdefault(e["to"], []).append(e)
|
|
18
|
+
for c in e.get("candidates", []):
|
|
19
|
+
self.rev.setdefault(c, []).append(e)
|
|
20
|
+
|
|
21
|
+
def loc(self, nid):
|
|
22
|
+
n = self.nodes.get(nid)
|
|
23
|
+
return f"{n['file']}:{n['line']}" if n else "?"
|
|
24
|
+
|
|
25
|
+
def find_symbol(self, q):
|
|
26
|
+
if q in self.nodes:
|
|
27
|
+
return [q]
|
|
28
|
+
out = []
|
|
29
|
+
for nid in self.nodes:
|
|
30
|
+
if nid.endswith(q):
|
|
31
|
+
pre = nid[: -len(q)]
|
|
32
|
+
if not pre or pre[-1] in ":./" or pre.endswith(":<module>"):
|
|
33
|
+
out.append(nid)
|
|
34
|
+
return sorted(out)
|
|
35
|
+
|
|
36
|
+
def callers(self, nid, possible=False):
|
|
37
|
+
res = []
|
|
38
|
+
for e in self.rev.get(nid, []):
|
|
39
|
+
if e["kind"] in TRAVERSE and e["to"] == nid:
|
|
40
|
+
res.append((e, False))
|
|
41
|
+
elif e["kind"] == "method?" and nid in e.get("candidates", []):
|
|
42
|
+
res.append((e, True))
|
|
43
|
+
return [(e, p) for e, p in res if possible or not p] , sum(1 for _, p in res if p)
|
|
44
|
+
|
|
45
|
+
def callees(self, nid, possible=False):
|
|
46
|
+
res = []
|
|
47
|
+
for e in self.fwd.get(nid, []):
|
|
48
|
+
if e["kind"] in TRAVERSE:
|
|
49
|
+
res.append((e, e["to"]))
|
|
50
|
+
elif possible and e["kind"] == "method?":
|
|
51
|
+
res.extend((e, c) for c in e["candidates"])
|
|
52
|
+
return res
|
|
53
|
+
|
|
54
|
+
def affected(self, starts, possible=True):
|
|
55
|
+
"""Transitive reverse closure: node -> (depth, possible?)."""
|
|
56
|
+
seen = {s: (0, False) for s in starts}
|
|
57
|
+
q = deque(starts)
|
|
58
|
+
while q:
|
|
59
|
+
n = q.popleft()
|
|
60
|
+
d, p = seen[n]
|
|
61
|
+
for e, poss in self.callers(n, possible=possible)[0]:
|
|
62
|
+
f = e["from"]
|
|
63
|
+
if f not in seen:
|
|
64
|
+
seen[f] = (d + 1, p or poss)
|
|
65
|
+
q.append(f)
|
|
66
|
+
return seen
|