It is often necessary to iterate over all pairs of names and terms of TermNames. Previously this was done by looking up the term for each name, which is inefficient. The proposed method has just linear complexity of such iterations.
Furthermore, the PR offers to also iterate only over names or only over terms, which, if the pairs are not desired, is even more efficient.
It is often necessary to iterate over all pairs of names and terms of
TermNames. Previously this was done by looking up the term for each name, which is inefficient. The proposed method has just linear complexity of such iterations.Furthermore, the PR offers to also iterate only over names or only over terms, which, if the pairs are not desired, is even more efficient.