Searched refs:PossibleLeaves (Results 1 – 2 of 2) sorted by relevance
129 LeafVector PossibleLeaves; variable143 PossibleLeaves.push_back(V); in addPossibleLeaf()144 PossibleLeaves.back().setIsFullyTraversed(IsFullyTraversed); in addPossibleLeaf()145 PossibleLeaves.back().setIsFullyTested(IsFullyTested); in addPossibleLeaf()148 if (PossibleLeaves.size() > Length) in dropLeavesAfter()149 PossibleLeaves.resize(Length); in dropLeavesAfter()174 return PossibleLeaves.begin(); in possible_leaves_begin()177 return PossibleLeaves.end(); in possible_leaves_end()184 return PossibleLeaves.begin(); in possible_leaves_begin()187 return PossibleLeaves.end(); in possible_leaves_end()
40 for (const auto &Leaf : PossibleLeaves) { in writeDOTGraphNode()53 for (const GIMatchTreeLeafInfo &Leaf : PossibleLeaves) { in writeDOTGraphNode()64 (!IsFullyTraversed || !IsFullyTested || PossibleLeaves.size() > 1)) in writeDOTGraphNode()537 BitVector PossibleLeaves = getPossibleLeavesForPartition(PartitionIdx); in applyForPartition() local540 if (!PossibleLeaves[EnumeratedLeaf.index()]) in applyForPartition()708 BitVector PossibleLeaves = getPossibleLeavesForPartition(PartitionIdx); in applyForPartition() local713 if (!PossibleLeaves[EnumeratedLeaf.index()]) in applyForPartition()