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

add allocations tests and clean time evolution tests #304

Merged
merged 4 commits into from
Nov 13, 2024

Conversation

albertomercurio
Copy link
Member

Description

With this PR I add the test for the number of allocations in all the time-evolution functions, in order to keep track of the memory allocations in the future.

Moreover, I clean a bit the file. I defined a global problem, and from that I tested all the cases like sesolve, mesolve, ....

Copy link

codecov bot commented Nov 12, 2024

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 92.99%. Comparing base (eaddad0) to head (87b32e2).
Report is 12 commits behind head on main.

Additional details and impacted files
@@            Coverage Diff             @@
##             main     #304      +/-   ##
==========================================
- Coverage   93.69%   92.99%   -0.71%     
==========================================
  Files          32       32              
  Lines        2490     2483       -7     
==========================================
- Hits         2333     2309      -24     
- Misses        157      174      +17     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

@ytdHuang
Copy link
Member

Hmm, somehow the format check doesn't pass

@albertomercurio
Copy link
Member Author

Now it should be fine

@albertomercurio albertomercurio merged commit 3fd5a62 into qutip:main Nov 13, 2024
10 of 11 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants