-
Notifications
You must be signed in to change notification settings - Fork 91
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[Windows][melodic-devel] Windows\MSVC port #239
base: melodic-devel
Are you sure you want to change the base?
[Windows][melodic-devel] Windows\MSVC port #239
Conversation
The CI failure seems not to do with the change. The error message are as followed:
|
@jrgnicho Hope I am pinging the correct owner. Any feedback would be appreciated! |
I've restarted the build. This is most likely due to the recent key change. |
@gavanderhoorn @jrgnicho Sorry to ping again. Any chance to take a look and make this PR move forward? |
@@ -190,7 +190,7 @@ bool PlanningGraph::calculateJointSolutions(const TrajectoryPtPtr* points, const | |||
bool success = true; | |||
|
|||
#pragma omp parallel for shared(success) | |||
for (std::size_t i = 0; i < count; ++i) | |||
for (int i = 0; i < count; ++i) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Why change the iterator datatype here?
@@ -26,7 +28,7 @@ struct IdGenerator; | |||
* for the unique 'state'. Zero is reserved as a special value | |||
*/ | |||
template <> | |||
struct IdGenerator<uint64_t> | |||
struct DESCARTES_CORE_DECL IdGenerator<uint64_t> |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I'm not too familiar with MSVC toolchains so could you explain why this is needed?
@@ -64,7 +64,7 @@ bool PlanningGraph::insertGraph(const std::vector<TrajectoryPtPtr>& points) | |||
|
|||
// now we have a graph with data in the 'rungs' and we need to compute the edges | |||
#pragma omp parallel for | |||
for (std::size_t i = 0; i < graph_.size() - 1; ++i) | |||
for (int i = 0; i < graph_.size() - 1; ++i) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Why change the iterator type?
if(NOT MSVC) | ||
add_compile_options(-std=c++11 -Wall -Wextra) | ||
else() | ||
add_definitions(-D__PRETTY_FUNCTION__=__FUNCTION__) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
What does this definition do?
This is a change to enable
descartes
to build by MSVC toolchains with https://aka.ms/ros installation.catkin
guide.TR1
headers by checking C++ standard version supported by compilers.[[gnu::unused]]
.-std=c++11 -Wall -Wextra
by checking what compiler is in use.eigen_conversions
dependency since some cpp files consuming it. (e.g.,ikfast_moveit_state_adapter.cpp
.)