MCPcopy Create free account
hub / github.com/davisking/dlib / do_test_

Function do_test_

dlib/test/find_max_factor_graph_viterbi.cpp:119–139  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

117 bool all_negative
118 >
119 void do_test_()
120 {
121 dlog << LINFO << "order: "<< order
122 << " num_states: " << num_states
123 << " num_nodes: " << num_nodes
124 << " all_negative: " << all_negative;
125
126 for (int i = 0; i < 25; ++i)
127 {
128 print_spinner();
129 map_problem<order,num_states,num_nodes,all_negative> prob;
130 std::vector<unsigned long> assign, assign2;
131 brute_force_find_max_factor_graph_viterbi(prob, assign);
132 find_max_factor_graph_viterbi(prob, assign2);
133
134 DLIB_TEST_MSG(mat(assign) == mat(assign2),
135 trans(mat(assign))
136 << trans(mat(assign2))
137 );
138 }
139 }
140
141 template <
142 unsigned long order,

Callers

nothing calls this directly

Calls 5

print_spinnerFunction · 0.85
matFunction · 0.50
transFunction · 0.50

Tested by

no test coverage detected