arphaman added inline comments.
================
Comment at: lib/Tooling/ASTDiff/ASTDiff.cpp:730
+
+Mapping TreeComparator::matchTopDown() const {
+ PriorityList L1(T1);
----------------
Johannes, it seems to me that your implementation of the top-down portion of
the GumTree algorithm doesn't use the `an empty list A of candidate mappings`
that's described in the paper (and that you have in the Python prototype). Is
that correct or am I missing something?
https://reviews.llvm.org/D34329
_______________________________________________
cfe-commits mailing list
[email protected]
http://lists.llvm.org/cgi-bin/mailman/listinfo/cfe-commits
