You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
We noticed that a significant performance improvement to the tree.add(interval) method can be made by commenting out the following line from interval.py:
def __eq__(self, other):
"""
Whether the begins equal, the ends equal, and the data fields
equal. Compare range_matches().
:param other: Interval
:return: True or False
:rtype: bool
"""
return (
self.begin == other.begin and
self.end == other.end # and
# self.data == other.data
)
If it is known that all data items are unique (in our case they are), perhaps a parameter for --unique_data would be useful? Happy to include a PR
The text was updated successfully, but these errors were encountered:
We noticed that a significant performance improvement to the
tree.add(interval)
method can be made by commenting out the following line frominterval.py
:If it is known that all
data
items are unique (in our case they are), perhaps a parameter for--unique_data
would be useful? Happy to include a PRThe text was updated successfully, but these errors were encountered: