Home
last modified time | relevance | path

Searched refs:allIdxs (Results 1 - 2 of 2) sorted by relevance

/arkcompiler/ets_runtime/ecmascript/compiler/
H A Dscheduler.cpp25 std::stack<size_t> allIdxs; in UnionFind() local
26 allIdxs.emplace(idx); in UnionFind()
28 while (pIdx != allIdxs.top()) { in UnionFind()
29 allIdxs.emplace(pIdx); in UnionFind()
33 while (!allIdxs.empty()) { in UnionFind()
34 if (semiDom[minIdx[allIdxs.top()]] > semiDom[minIdx[pIdx]]) { in UnionFind()
35 minIdx[allIdxs.top()] = minIdx[pIdx]; in UnionFind()
37 parent[allIdxs.top()] = unionFindSetRoot; in UnionFind()
38 pIdx = allIdxs.top(); in UnionFind()
39 allIdxs in UnionFind()
[all...]
H A Dgraph_linearizer.cpp234 std::stack<size_t> allIdxs; in UnionFind() local
235 allIdxs.emplace(idx); in UnionFind()
237 while (pIdx != allIdxs.top()) { in UnionFind()
238 allIdxs.emplace(pIdx); in UnionFind()
242 while (!allIdxs.empty()) { in UnionFind()
243 if (semiDom_[minIdx_[allIdxs.top()]] > semiDom_[minIdx_[pIdx]]) { in UnionFind()
244 minIdx_[allIdxs.top()] = minIdx_[pIdx]; in UnionFind()
246 parentIdx_[allIdxs.top()] = unionFindSetRoot; in UnionFind()
247 pIdx = allIdxs.top(); in UnionFind()
248 allIdxs in UnionFind()
[all...]

Completed in 3 milliseconds