322   // We maintain pointers to the roots of the tries we see.
323   DenseMap<uint32_t, RootVector> Roots;  member in StackTrie
338       Roots[ThreadId].push_back(Node);  in createTrieNode()
343     const auto &RootsByThread = Roots[ThreadId];  in findRootNode()
447   bool isEmpty() const { return Roots.empty(); }  in isEmpty()
481     for (const auto &iter : Roots) {  in printPerThread()
492     for (const auto &iter : Roots)  in printAllPerThread()
503     using RootsType = decltype(Roots.begin())::value_type;  in printIgnoringThreads()
507          make_range(map_iterator(Roots.begin(), MapValueFn),  in printIgnoringThreads()
508                     map_iterator(Roots.end(), MapValueFn))) {  in printIgnoringThreads()
520     for (const auto &MapIter : Roots) {  in mergeAcrossThreads()
598     // Go through each of the roots, and traverse the call stack, producing the  in print()