Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Cleanup docs of bezier #14390

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

Merged
merged 1 commit into from
Jun 1, 2019
Merged

Cleanup docs of bezier #14390

merged 1 commit into from
Jun 1, 2019

Conversation

timhoffm
Copy link
Member

No description provided.

@timhoffm timhoffm added this to the v3.2.0 milestone May 31, 2019
lib/matplotlib/bezier.py Outdated Show resolved Hide resolved
lib/matplotlib/bezier.py Outdated Show resolved Hide resolved
lib/matplotlib/bezier.py Outdated Show resolved Hide resolved
lib/matplotlib/bezier.py Outdated Show resolved Hide resolved
lib/matplotlib/bezier.py Outdated Show resolved Hide resolved
@anntzer
Copy link
Contributor

anntzer commented May 31, 2019

see also #13355 :)

Copy link
Contributor

@anntzer anntzer left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

anyone can merge postci

Copy link
Member

@QuLogic QuLogic left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

A small typo.


- inside_closedpath : return True if the point is inside the path
Search starts from *t0* and *t1* and it uses a simple bisecting algorithm
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
Search starts from *t0* and *t1* and it uses a simple bisecting algorithm
Search starts from *t0* and *t1* and uses a simple bisecting algorithm,

dx1, dy1, dx2, dy2 : float
The gradients *dy*/*dx* of the two lines.
tolerance : float
The angular tolerange in radians up to which the lines are considered
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
The angular tolerange in radians up to which the lines are considered
The angular tolerance in radians up to which the lines are considered

@NelleV
Copy link
Member

NelleV commented Jun 1, 2019

Thanks @timhoffm !

@NelleV NelleV merged commit 537535d into matplotlib:master Jun 1, 2019
@timhoffm timhoffm deleted the doc-bezier branch June 2, 2019 18:04
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

4 participants
Morty Proxy This is a proxified and sanitized view of the page, visit original site.