September 2014 - Boost-users - lists.preview.boost.org

[Boost.Log] translate 3rd party log entries
by Olaf Peter 01 Sep '14

01 Sep '14

Hello, from 3rd party lib I have to integrate the logging message - incorporating into boost.log. But I run into the problem with scopes: main.cpp: In function 'int main(int, char**)': main.cpp:55:5: error: no matching function for call to 'boost::log::v2s_mt_posix::attributes::named_scope_entry::named_scope_entry(const char [6], const char*&, int&)' main.cpp:55:5: note: candidates are: /opt/boost/boost_1_55_0/boost/log/attributes/named_scope.hpp:88:5: note: boost::log::v2s_mt_posix::attributes::named_scope_entry::named_scope_entry(const string_literal&, const string_literal&, unsigned int) /opt/boost/boost_1_55_0/boost/log/attributes/named_scope.hpp:88:5: note: no known conversion for argument 2 from 'const char*' to 'const string_literal& {aka const boost::log::v2s_mt_posix::basic_string_literal<char>&}' /opt/boost/boost_1_55_0/boost/log/attributes/named_scope.hpp:63:8: note: boost::log::v2s_mt_posix::attributes::named_scope_entry::named_scope_entry(const boost::log::v2s_mt_posix::attributes::named_scope_entry&) /opt/boost/boost_1_55_0/boost/log/attributes/named_scope.hpp:63:8: note: candidate expects 1 argument, 3 provided The problem rises on string_literal of __FILE__ entry. How can I get this working?? Thanks, Olaf

1 2

Trouble with compiling/linking the unit test library
by Christoff Kok 01 Sep '14

01 Sep '14

Hi, I am struggling to compile a simple test with the Unit test library. It seems to be a linker error when trying to link the unit_test_framework library. I have tried diffrerent options but to no avail. I have tried to link it with a visual studio library as well, but I am still receiving the same error. clang++.exe -o bin\Debug\QuickTest.exe obj\Debug\functions.o obj\Debug\functionsTest.o obj\Debug\maintest.o *C:\boost_1_55_0\stage\lib\libboost_unit_test_framework-mgw48-mt-1_55.a* obj\Debug\functionsTest.o: In function `_cxx_global_var_init2': D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/functionsTest.cpp:4: undefined reference to `_imp___ZN5boost9unit_test9ut_detail24auto_test_unit_registrarC1EPNS0_9test_caseEm' obj\Debug\functionsTest.o: In function `ZN8Multiply11test_methodEv': D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/functionsTest.cpp:6: *undefined reference to * `_imp___ZN5boost9unit_test15unit_test_log_t14set_checkpointENS0_13basic_cstringIKcEEjS4_' D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/functionsTest.cpp:6: undefined reference to `_imp___ZN5boost10test_tools16predicate_resultC1Eb' D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/functionsTest.cpp:6: *undefined reference to * `_imp___ZN5boost10test_tools9tt_detail10check_implERKNS0_16predicate_resultERKNS_9unit_test12lazy_ostreamENS5_13basic_cstringIKcEEjNS1_10tool_levelENS1_10check_typeEjz' D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/functionsTest.cpp:6: *undefined reference to* `_imp___ZN5boost10test_tools16predicate_resultD1Ev' D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/functionsTest.cpp:7: undefined reference to `_imp___ZN5boost10test_tools16predicate_resultD1Ev' obj\Debug\functionsTest.o: In function `_dtor__ZZN5boost9unit_test9singletonINS0_15unit_test_log_tEE8instanceEvE8the_inst': D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/functionsTest.cpp:38: *undefined reference to* `_imp___ZN5boost9unit_test15unit_test_log_tD1Ev' obj\Debug\functionsTest.o: In function `ZN5boost9unit_test9singletonINS0_15unit_test_log_tEE8instanceEv': C:\boost_1_55_0\boost/test/utils/trivial_singleton.hpp:38: undefined reference to `_imp___ZN5boost9unit_test15unit_test_log_tC1Ev' obj\Debug\functionsTest.o: In function `ZN5boost9unit_test14make_test_caseERKNS0_9callback0INS0_9ut_detail6unusedEEENS0_13basic_cstringIKcEE': C:\boost_1_55_0\boost/test/unit_test_suite_impl.hpp:255: undefined reference to `_imp___ZN5boost9unit_test9ut_detail24normalize_test_case_nameENS0_13basic_cstringIKcEE' C:\boost_1_55_0\boost/test/unit_test_suite_impl.hpp:255: undefined reference to `_imp___ZN5boost9unit_test9test_caseC1ENS0_13basic_cstringIKcEERKNS0_9callback0INS0_9ut_detail6unusedEEE' obj\Debug\maintest.o: In function `main': C:\boost_1_55_0\boost/test/unit_test.hpp:59: undefined reference to `_imp___ZN5boost9unit_test14unit_test_mainEPFbvEiPPc' obj\Debug\maintest.o: In function `_cxx_global_var_init2': D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/maintest.cpp:5: undefined reference to `_imp___ZN5boost9unit_test9ut_detail24auto_test_unit_registrarC1EPNS0_9test_caseEm' obj\Debug\maintest.o: In function `ZN29SimpleTestInMainTestingModule11test_methodEv': D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/maintest.cpp:7: undefined reference to `_imp___ZN5boost9unit_test15unit_test_log_t14set_checkpointENS0_13basic_cstringIKcEEjS4_' D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/maintest.cpp:7: undefined reference to `_imp___ZN5boost10test_tools16predicate_resultC1Eb' D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/maintest.cpp:7: undefined reference to `_imp___ZN5boost10test_tools9tt_detail10check_implERKNS0_16predicate_resultERKNS_9unit_test12lazy_ostreamENS5_13basic_cstringIKcEEjNS1_10tool_levelENS1_10check_typeEjz' D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/maintest.cpp:7: undefined reference to `_imp___ZN5boost10test_tools16predicate_resultD1Ev' D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/maintest.cpp:8: undefined reference to `_imp___ZN5boost10test_tools16predicate_resultD1Ev' obj\Debug\maintest.o: In function `_dtor__ZZN5boost9unit_test9singletonINS0_15unit_test_log_tEE8instanceEvE8the_inst': D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/maintest.cpp:38: undefined reference to `_imp___ZN5boost9unit_test15unit_test_log_tD1Ev' collect2.exe: error: ld returned 1 exit status clang++.exe: error: linker (via gcc) command failed with exit code 1 (use -v to see invocation) Kind Regards, Christoff

1 0

A* search on Implicit graph (search tree)
by Nicholas Dahm 01 Sep '14

01 Sep '14

Hi All, I'm trying to run an A* search using boost's astar_search, but I'm running into issues with 'const'. I'm trying to add the examine_vertex(my_vdesc_type &v, my_graph_type &g) function, but of course boost says that I need to make it const like examine_vertex(my_vdesc_type &v, const my_graph_type &g) However since I'm searching an implicit graph, I need to call add_vertex(g) within this function. But then I of course get an error because i'm trying to do add_vertex(const my_graph_type &g) which is invalid. I've read the example astar_maze.cpp which CLAIMS to be implicit but certainly doesn't appear to be. I've also seen the pdf at http://cs.krisbeevers.com/research/astar_bgl04.pdf which says you need to basically create non-const versions of a bunch of functions. Considering that http://www.boost.org/doc/libs/1_56_0/libs/graph/doc/astar_search.html says that "A* is particularly useful for searching implicit graphs", I'm assuming that boost ALREADY HAS some way of actually searching implicit graphs. Any ideas? cheers Nick

1 0

Re: [Boost-users] [graph] Unique vertices using setS
by Nicholas Dahm 01 Sep '14

01 Sep '14

>On Wed, Aug 27, 2014 7:24 PM EDT Nicholas Dahm wrote: > >>Is there any place where I could enforce unique properties? (i.e. not add a new vertex if it's properties are the same as an existing vertex) > >Not that I know of. > >>My graph is actually an implicit search tree for an A* search so there's lots of nodes which will be revisited via different paths. My current thought is to create the new vertex (which is a search tree state), then simply iterate through all existing vertices to see if any are identical in properties. However if the vertices were sorted by their properties in a set (i.e. weakly ordered), this would be much faster. > >Do you need to store the explored part of the search tree explicitly? You could instead use a custom graph type with your choice of vertex descriptor, then use associative_property_map to check for multiple visits to the same state. No need to store the explored part. I have exactly zero clue on how to create a custom graph type with a special vertex descriptor. At current I've gotten around it by having a "set" of vertex descriptors which use a custom "less" function which actually checks the vertex bundled properties instead of the descriptor. It's not the perfect solution but it wasn't very ugly either so it'll do. If you have a link to info on how to create custom graph types with special vertex descriptors please do let me know cheers Nick

1 0