Skip to content

1000x faster duplicate points removal #19

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.

Sign up for GitHub

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

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

1000x faster duplicate points removal #19

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
0d96be0
Performance improvement
shimpe Jul 15, 2019
cf788b0
Performance improvement
shimpe Jul 15, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
11 changes: 3 additions & 8 deletions gcodetools-dev.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5266,15 +5266,10 @@ def get_boundaries(points):


def remove_duplicates(points):
i=0
out=[]
s = set([])
for p in points:
for j in xrange(i,len(points)):
if p==points[j]: points[j]=[None,None]
if p!=[None,None]: out+=[p]
i+=1
return(out)

s.add(p)
return list(s)

def get_way_len(points):
l=0
Expand Down
11 changes: 3 additions & 8 deletions stable/gcodetools.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4439,15 +4439,10 @@ def get_boundaries(points):


def remove_duplicates(points):
i=0
out=[]
s = set([])
for p in points:
for j in xrange(i,len(points)):
if p==points[j]: points[j]=[None,None]
if p!=[None,None]: out+=[p]
i+=1
return(out)

s.add(p)
return list(s)

def get_way_len(points):
l=0
Expand Down