From 3bcab68a3e1ef76019794fb96772cda00ef82cf4 Mon Sep 17 00:00:00 2001 From: Davis King Date: Fri, 24 Aug 2012 23:16:01 -0400 Subject: [PATCH] Fully qualified some more dlib set objects. --- examples/bayes_net_ex.cpp | 2 +- examples/bayes_net_from_disk_ex.cpp | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/examples/bayes_net_ex.cpp b/examples/bayes_net_ex.cpp index 1d38314eb..f2736202c 100644 --- a/examples/bayes_net_ex.cpp +++ b/examples/bayes_net_ex.cpp @@ -168,7 +168,7 @@ int main() // First we need to create an undirected graph which contains set objects at each node and // edge. This long declaration does the trick. - typedef set::compare_1b_c set_type; + typedef dlib::set::compare_1b_c set_type; typedef graph::kernel_1a_c join_tree_type; join_tree_type join_tree; diff --git a/examples/bayes_net_from_disk_ex.cpp b/examples/bayes_net_from_disk_ex.cpp index 67fe55ea5..08e95eb57 100644 --- a/examples/bayes_net_from_disk_ex.cpp +++ b/examples/bayes_net_from_disk_ex.cpp @@ -49,7 +49,7 @@ int main(int argc, char** argv) // First we need to create an undirected graph which contains set objects at each node and // edge. This long declaration does the trick. - typedef graph::compare_1b_c, set::compare_1b_c>::kernel_1a_c join_tree_type; + typedef graph::compare_1b_c, dlib::set::compare_1b_c>::kernel_1a_c join_tree_type; join_tree_type join_tree; // Now we need to populate the join_tree with data from our bayesian network. The next two