Skip to content
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

Jump to bottom

[enhancement] Lookup and insert complexity is O(n); make it O(1) #1

Closed
egobillot opened this issue Jan 8, 2020 · 0 comments
Closed

[enhancement] Lookup and insert complexity is O(n); make it O(1) #1

egobillot opened this issue Jan 8, 2020 · 0 comments
Assignees
@egobillot
Labels
enhancement New feature or request

Comments

@egobillot
Copy link
Owner

Lookup and insert complexity is O(n); make it O(1)

The first implementation of a CtCollection is a list of Doc.

  • This was a first naive approach. The cons : not suitable when there are many (1000+) docs in collection.

An hash table is better suited

  • Use a dictionary instead of a list
  • The key will be "pid+process_name"
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@egobillot egobillot

Labels
enhancement New feature or request
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@egobillot