| 90 | } |
| 91 | |
| 92 | std::vector<var> expression::findNonConsts(const std::vector<var>& leaves){ |
| 93 | std::vector<var> nonconsts; |
| 94 | std::queue<var> q; |
| 95 | for(const var& v : leaves) |
| 96 | q.push(v); |
| 97 | |
| 98 | while(!q.empty()){ |
| 99 | var v = q.front(); |
| 100 | q.pop(); |
| 101 | |
| 102 | if (std::end(nonconsts) != std::find(std::begin(nonconsts), std::end(nonconsts), v)) |
| 103 | continue; |
| 104 | |
| 105 | nonconsts.emplace_back(v); |
| 106 | std::vector<var> parents = v.getParents(); |
| 107 | for(const var& parent : parents){ |
| 108 | q.push(parent); |
| 109 | } |
| 110 | } |
| 111 | return nonconsts; |
| 112 | } |
| 113 | |
| 114 | //copied from std::vector<var> expression::findNonConsts(const std::vector<var>& leaves) |
| 115 | std::vector<var> expression::findNonConsts(const std::unordered_set<var>& leaves) { |