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.

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

Modified hierarchy algorithm to be linear for insertion and O(n^{2}) … #22

Merged
merged 1 commit into from
Jan 18, 2024

Conversation

AssemblyJohn
Copy link
Collaborator

…worst case for pruning

@AssemblyJohn AssemblyJohn added the enhancement New feature or request label Nov 20, 2023
@AssemblyJohn AssemblyJohn self-assigned this Nov 20, 2023
@AssemblyJohn AssemblyJohn marked this pull request as ready for review November 20, 2023 10:09
@AssemblyJohn AssemblyJohn requested review from Pietfried and removed request for valentin-dimov January 17, 2024 07:34
@marcemmers
Copy link
Contributor

I've just encountered a endless while loop that did not have a timeout. This PR seems to fix it for me so hopefully we can merge this one soon.

To reproduce, I just install a single csms root certificate in the bundle and try to delete that. On the delete ocpp hangs.

@AssemblyJohn AssemblyJohn force-pushed the refactor/hierarchy_tree_operations branch from 44fc314 to 7f8f2cd Compare January 18, 2024 06:59
@AssemblyJohn AssemblyJohn merged commit 20304cd into main Jan 18, 2024
2 checks passed
@AssemblyJohn AssemblyJohn deleted the refactor/hierarchy_tree_operations branch January 18, 2024 09:05
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants