-
Notifications
You must be signed in to change notification settings - Fork 483
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
Haskell Eq for AssocMap #6213
Merged
Merged
Haskell Eq for AssocMap #6213
Changes from all commits
Commits
Show all changes
8 commits
Select commit
Hold shift + click to select a range
65923fb
Revert "Remove AssocMap comparison instances (#6173)"
ana-pantilie 609638a
Add custom Eq and Ord for AssocMap
ana-pantilie 5a51f22
Remove PlutusTx instances
ana-pantilie 3c475a6
Revert file delete
ana-pantilie bccc721
Fix
ana-pantilie 811a554
Fix
ana-pantilie e45752f
Add changelog
ana-pantilie 7c24fd1
Fix
ana-pantilie File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
3 changes: 3 additions & 0 deletions
3
plutus-tx/changelog.d/20240614_154728_ana.pantilie95_add_haskell_sc_eq.md
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,3 @@ | ||
### Added | ||
|
||
- Haskell `Eq` and `Ord` instances for `AssocMap` based on `Data.Map.Strict`. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
So, this will work as long as there are no duplicates in the assoc map.
Because of conversion of types from ledger this is guaranteed, but I am not sure if this is sufficient for you. I am just not sure what are the semantic guarantees that you provide. So, if in presence of duplicate keys assoc map ignores them then we are fine with this implementation, but otherwise we either need to fallback to a slow O(n^2) implementation or implement something smarter