NextCloud/dlib
1
0
Fork 0
mirror of https://github.com/davisking/dlib.git synced 2024-11-01 10:14:53 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fully qualified some more dlib set objects.

Browse Source
This commit is contained in:
Davis King 2012-08-24 23:16:01 -04:00
parent 2a5072d116
commit 3bcab68a3e
2 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
examples/bayes_net_ex.cpp
View File

@ -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<unsigned long>::compare_1b_c set_type;
typedef dlib::set<unsigned long>::compare_1b_c set_type;
typedef graph<set_type, set_type>::kernel_1a_c join_tree_type;
join_tree_type join_tree;

2
examples/bayes_net_from_disk_ex.cpp
View File

@ -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<set<unsigned long>::compare_1b_c, set<unsigned long>::compare_1b_c>::kernel_1a_c join_tree_type;
typedef graph<dlib::set<unsigned long>::compare_1b_c, dlib::set<unsigned long>::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