-
Notifications
You must be signed in to change notification settings - Fork 1.4k
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
Used std::vector instead of c-style arrays for point storage. #8709
base: master
Are you sure you want to change the base?
Conversation
In case the size is known at compile time, please use |
Nice suggestion, initially i thought of using |
// (0,0), (-1,0), (2,0), (-3,0), ... | ||
} | ||
|
||
Min_circle mc1( P, P+n, false); // very slow | ||
Min_circle mc2( P, P+n, true); // fast | ||
Min_circle mc1( P.begin(), P.begin() + n, false); // very slow |
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.
Min_circle mc1( P.begin(), P.begin() + n, false); // very slow | |
Min_circle mc1( P.begin(), P.end(), false); // very slow |
Min_circle mc1( P, P+n, false); // very slow | ||
Min_circle mc2( P, P+n, true); // fast | ||
Min_circle mc1( P.begin(), P.begin() + n, false); // very slow | ||
Min_circle mc2( P.begin(), P.begin() +n, true); // fast |
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.
Min_circle mc2( P.begin(), P.begin() +n, true); // fast | |
Min_circle mc2( P.begin(), P.end(), true); // fast |
Updated two CGAL examples to use
std::vector
instead of plain C-style arrays for storing points.Few more examples can be improved the same way to use
std::vector
and avoid usage of c-style arrays.