From 4d9f27cb28db5875fe7c41037d53fbbd3b644717 Mon Sep 17 00:00:00 2001 From: Varun Agrawal Date: Sat, 25 Jan 2025 11:42:25 -0500 Subject: [PATCH] replace set with KeySet --- gtsam/discrete/DecisionTreeFactor.cpp | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/gtsam/discrete/DecisionTreeFactor.cpp b/gtsam/discrete/DecisionTreeFactor.cpp index 19deccd78..0396dc952 100644 --- a/gtsam/discrete/DecisionTreeFactor.cpp +++ b/gtsam/discrete/DecisionTreeFactor.cpp @@ -247,7 +247,7 @@ namespace gtsam { /* ************************************************************************ */ std::vector DecisionTreeFactor::probabilities() const { // Set of all keys - std::set allKeys(keys().begin(), keys().end()); + KeySet allKeys(keys().begin(), keys().end()); std::vector probs; @@ -260,7 +260,7 @@ namespace gtsam { */ auto op = [&](const Assignment& a, double p) { // Get all the keys in the current assignment - std::set assignment_keys; + KeySet assignment_keys; for (auto&& [k, _] : a) { assignment_keys.insert(k); } @@ -453,18 +453,18 @@ namespace gtsam { /* ************************************************************************ */ double DecisionTreeFactor::computeThreshold(const size_t N) const { // Set of all keys - std::set allKeys = this->labels(); + KeySet allKeys = this->labels(); MinHeap min_heap; auto op = [&](const Assignment& a, double p) { // Get all the keys in the current assignment - std::set assignment_keys; + KeySet assignment_keys; for (auto&& [k, _] : a) { assignment_keys.insert(k); } // Find the keys missing in the assignment - std::vector diff; + KeyVector diff; std::set_difference(allKeys.begin(), allKeys.end(), assignment_keys.begin(), assignment_keys.end(), std::back_inserter(diff));