Hi Matt,
thanks for the report! I filed a bug for this issue:
http://bugs.mitk.org/show_bug.cgi?id=17565
Right now we are working on supporting Mac OSX 10.9 for the upcoming release.
We will have a look at it.
What version of clang do you have?
Best regards
Andreas
From: Clarkson, Matt [mailto:m.clark...@ucl.ac.uk]
Sent: Mittwoch, 19. März 2014 12:16
To: MITK
Cc: Espak, Miklos
Subject: [mitk-users] Mavericks Build Error
Hi there,
Im seeing the error below. We are trying to update our build to the latest and
greatest MITK, and it looks on this version of clang, and with reporting
warnings as errors causes issues.
Thank
Matt
In file included from
/Users/mattclarkson/build/NifTKLatestMITK-SuperBuild-Debug/MITK-src/Modules/DiffusionImaging/Connectomics/IODataStructures/mitkConnectomicsNetwork.cpp:21:
In file included from
/Users/mattclarkson/build/NifTKLatestMITK-SuperBuild-Debug/Boost-install/include/boost/graph/betweenness_centrality.hpp:15:
In file included from
/Users/mattclarkson/build/NifTKLatestMITK-SuperBuild-Debug/Boost-install/include/boost/graph/dijkstra_shortest_paths.hpp:21:
In file included from
/Users/mattclarkson/build/NifTKLatestMITK-SuperBuild-Debug/Boost-install/include/boost/graph/breadth_first_search.hpp:26:
/Users/mattclarkson/build/NifTKLatestMITK-SuperBuild-Debug/Boost-install/include/boost/graph/two_bit_color_map.hpp:87:37:
error: comparison of constant 4 with expression of type
'boost::two_bit_color_type' is always true
[-Werror,-Wtautological-constant-out-of-range-compare]
BOOST_ASSERT (value >= 0 && value < 4);
~~~~~ ^ ~
/Users/mattclarkson/build/NifTKLatestMITK-SuperBuild-Debug/Boost-install/include/boost/assert.hpp:52:36:
note: expanded from macro 'BOOST_ASSERT'
# define BOOST_ASSERT(expr) assert(expr)
^
/Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.8.sdk/usr/include/assert.h:93:25:
note: expanded from macro 'assert'
(__builtin_expect(!(e), 0) ? __assert_rtn(__func__, __FILE__, __LINE__, #e)
: (void)0)
^
/Users/mattclarkson/build/NifTKLatestMITK-SuperBuild-Debug/Boost-install/include/boost/graph/dijkstra_shortest_paths.hpp:470:7:
note: in instantiation of function template specialization
'boost::put<boost::vec_adj_list_vertex_id_map<mitk::ConnectomicsNetwork::NetworkNode,
unsigned long> >' requested here
put(color, *ui, Color::white());
^
/Users/mattclarkson/build/NifTKLatestMITK-SuperBuild-Debug/Boost-install/include/boost/graph/dijkstra_shortest_paths.hpp:423:5:
note: in instantiation of function template specialization
'boost::dijkstra_shortest_paths<boost::adjacency_list<boost::vecS,
boost::vecS, boost::undirectedS, mitk::ConnectomicsNetwork::NetworkNode,
mitk::ConnectomicsNetwork::NetworkEdge,
boost::no_property, boost::listS>, unsigned long *,
boost::dijkstra_visitor<boost::null_visitor>, unsigned long *, double *,
boost::adj_list_edge_property_map<boost::undirected_tag, double, const
double &, unsigned long, const mitk::ConnectomicsNetwork::NetworkEdge,
double mitk::ConnectomicsNetwork::NetworkEdge::*>,
boost::vec_adj_list_vertex_id_map<mitk::ConnectomicsNetwork::NetworkNode,
unsigned long>, std::less<double>, boost::closed_plus<double>, double,
double,
boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<mitk::ConnectomicsNetwork::NetworkNode,
unsigned long> >
>' requested here
dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
^
/Users/mattclarkson/build/NifTKLatestMITK-SuperBuild-Debug/Boost-install/include/boost/graph/dijkstra_shortest_paths.hpp:515:5:
note: in instantiation of function template specialization
'boost::dijkstra_shortest_paths<boost::adjacency_list<boost::vecS,
boost::vecS, boost::undirectedS, mitk::ConnectomicsNetwork::NetworkNode,
mitk::ConnectomicsNetwork::NetworkEdge,
boost::no_property, boost::listS>, unsigned long *,
boost::dijkstra_visitor<boost::null_visitor>, unsigned long *, double *,
boost::adj_list_edge_property_map<boost::undirected_tag, double, const
double &, unsigned long, const mitk::ConnectomicsNetwork::NetworkEdge,
double mitk::ConnectomicsNetwork::NetworkEdge::*>,
boost::vec_adj_list_vertex_id_map<mitk::ConnectomicsNetwork::NetworkNode,
unsigned long>, std::less<double>, boost::closed_plus<double>, double,
double, char, boost::detail::unused_tag_type, boost::no_property>' requested
here
dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance,
^
/Users/mattclarkson/build/NifTKLatestMITK-SuperBuild-Debug/Boost-install/include/boost/graph/dijkstra_shortest_paths.hpp:445:5:
note: in instantiation of function template specialization
'boost::dijkstra_shortest_paths<boost::adjacency_list<boost::vecS,
boost::vecS, boost::undirectedS, mitk::ConnectomicsNetwork::NetworkNode,
mitk::ConnectomicsNetwork::NetworkEdge,
boost::no_property, boost::listS>, unsigned long *,
boost::dijkstra_visitor<boost::null_visitor>, unsigned long *, double *,
boost::adj_list_edge_property_map<boost::undirected_tag, double, const
double &, unsigned long, const mitk::ConnectomicsNetwork::NetworkEdge,
double mitk::ConnectomicsNetwork::NetworkEdge::*>,
boost::vec_adj_list_vertex_id_map<mitk::ConnectomicsNetwork::NetworkNode,
unsigned long>, std::less<double>, boost::closed_plus<double>, double,
double>' requested here
dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
^
/Users/mattclarkson/build/NifTKLatestMITK-SuperBuild-Debug/Boost-install/include/boost/graph/dijkstra_shortest_paths.hpp:560:7:
note: in instantiation of function template specialization
'boost::dijkstra_shortest_paths<boost::adjacency_list<boost::vecS,
boost::vecS, boost::undirectedS, mitk::ConnectomicsNetwork::NetworkNode,
mitk::ConnectomicsNetwork::NetworkEdge,
boost::no_property, boost::listS>,
boost::dijkstra_visitor<boost::null_visitor>, unsigned long *, double *,
boost::adj_list_edge_property_map<boost::undirected_tag, double, const double &,
unsigned long, const mitk::ConnectomicsNetwork::NetworkEdge, double
mitk::ConnectomicsNetwork::NetworkEdge::*>,
boost::vec_adj_list_vertex_id_map<mitk::ConnectomicsNetwork::NetworkNode,
unsigned
long>, std::less<double>, boost::closed_plus<double>, double, double,
boost::adj_list_edge_property_map<boost::undirected_tag, double, const double
&, unsigned long, const
mitk::ConnectomicsNetwork::NetworkEdge, double
mitk::ConnectomicsNetwork::NetworkEdge::*>, boost::edge_weight_t,
boost::bgl_named_params<double *, boost::vertex_distance_t,
boost::bgl_named_params<unsigned long *, boost::vertex_predecessor_t,
boost::no_property> > >' requested here
dijkstra_shortest_paths
^
/Users/mattclarkson/build/NifTKLatestMITK-SuperBuild-Debug/Boost-install/include/boost/graph/dijkstra_shortest_paths.hpp:591:7:
note: in instantiation of function template specialization
'boost::detail::dijkstra_dispatch2<boost::adjacency_list<boost::vecS,
boost::vecS, boost::undirectedS, mitk::ConnectomicsNetwork::NetworkNode,
mitk::ConnectomicsNetwork::NetworkEdge,
boost::no_property, boost::listS>, double *,
boost::adj_list_edge_property_map<boost::undirected_tag, double, const double
&, unsigned long, const mitk::ConnectomicsNetwork::NetworkEdge, double
mitk::ConnectomicsNetwork::NetworkEdge::*>,
boost::vec_adj_list_vertex_id_map<mitk::ConnectomicsNetwork::NetworkNode,
unsigned long>,
boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,
double, const double &, unsigned long, const
mitk::ConnectomicsNetwork::NetworkEdge, double
mitk::ConnectomicsNetwork::NetworkEdge::*>, boost::edge_weight_t,
boost::bgl_named_params<double *, boost::vertex_distance_t,
boost::bgl_named_params<unsigned long *, boost::vertex_predecessor_t,
boost::no_property> > > >' requested here
detail::dijkstra_dispatch2
^
/Users/mattclarkson/build/NifTKLatestMITK-SuperBuild-Debug/Boost-install/include/boost/graph/dijkstra_shortest_paths.hpp:609:5:
note: in instantiation of function template specialization
'boost::detail::dijkstra_dispatch1<boost::adjacency_list<boost::vecS,
boost::vecS, boost::undirectedS, mitk::ConnectomicsNetwork::NetworkNode,
mitk::ConnectomicsNetwork::NetworkEdge,
boost::no_property, boost::listS>, double *,
boost::adj_list_edge_property_map<boost::undirected_tag, double, const double
&, unsigned long, const mitk::ConnectomicsNetwork::NetworkEdge, double
mitk::ConnectomicsNetwork::NetworkEdge::*>,
boost::vec_adj_list_vertex_id_map<mitk::ConnectomicsNetwork::NetworkNode,
unsigned long>,
boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,
double, const double &, unsigned long, const
mitk::ConnectomicsNetwork::NetworkEdge, double
mitk::ConnectomicsNetwork::NetworkEdge::*>, boost::edge_weight_t,
boost::bgl_named_params<double *, boost::vertex_distance_t,
boost::bgl_named_params<unsigned long *, boost::vertex_predecessor_t,
boost::no_property> > > >' requested here
detail::dijkstra_dispatch1
^
/Users/mattclarkson/build/NifTKLatestMITK-SuperBuild-Debug/MITK-src/Modules/DiffusionImaging/Connectomics/IODataStructures/mitkConnectomicsNetwork.cpp:691:3:
note: in instantiation of function template
specialization
'boost::dijkstra_shortest_paths<boost::adjacency_list<boost::vecS, boost::vecS,
boost::undirectedS, mitk::ConnectomicsNetwork::NetworkNode,
mitk::ConnectomicsNetwork::NetworkEdge,
boost::no_property, boost::listS>,
boost::adj_list_edge_property_map<boost::undirected_tag, double, const double
&, unsigned long, const mitk::ConnectomicsNetwork::NetworkEdge, double
mitk::ConnectomicsNetwork::NetworkEdge::*>, boost::edge_weight_t,
boost::bgl_named_params<double *, boost::vertex_distance_t,
boost::bgl_named_params<unsigned long *, boost::vertex_predecessor_t,
boost::no_property> > >' requested here
boost::dijkstra_shortest_paths(m_Network, *iterator,
boost::predecessor_map(&predecessorMap[ 0 ]).distance_map(&distanceMatrix[ 0
]).weight_map( boost::get( &NetworkEdge::edge_weight ,m_Networ...
^
9 warnings and 1 error generated.
Matt Clarkson
Senior Research Associate
CMIC Software Manager
m.clark...@ucl.ac.uk<mailto:m.clark...@ucl.ac.uk>
Skype: drmattclarkson
http://cmic.cs.ucl.ac.uk/staff/matt_clarkson/
Centre For Medical Image Computing
2.21 Malet Place Engineering Building
Tel: 020 7679 0257
Fax: 020 7679 0255
------------------------------------------------------------------------------
Learn Graph Databases - Download FREE O'Reilly Book
"Graph Databases" is the definitive new guide to graph databases and their
applications. Written by three acclaimed leaders in the field,
this first edition is now available. Download your free book today!
http://p.sf.net/sfu/13534_NeoTech
_______________________________________________
mitk-users mailing list
mitk-users@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/mitk-users
