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 Array::dedup_consecutive for removing consecutive repeated elements in array #1062

Open
wants to merge 10 commits into
base: main
Choose a base branch
from

Conversation

tonyfettes
Copy link
Contributor

@tonyfettes tonyfettes commented Oct 6, 2024

For backward compatibility, this PR updates the documentation for Array::dedup, so that it shall not break any existing code that use this function. This PR also add another function (Array::unique) to implement the originally proposed functionality, i.e. de-duplication of consecutive repeated elements.

cc @Demonmasterlqx

close #1061

Implementation in other programming language

Language Consecutive Non-consecutive
C++ unique N/A
Rust dedup unique
NumPy N/A unique
JavaScript N/A N/A
Python N/A N/A
Scala N/A distinct
*nix uniq N/A
Haskell N/A Data.List.Unique

See more on https://rosettacode.org/wiki/Remove_duplicate_elements

Algorithm Complexity

For the time-complexity of removing non-consecutive duplications:

There are basically three approaches seen here:

  • Put the elements into a hash table which does not allow duplicates. The complexity is O(n) on average, and O(n^2) worst case. This approach requires a hash function for your type (which is compatible with equality), either built-in to your language, or provided by the user.
  • Sort the elements and remove consecutive duplicate elements. The complexity of the best sorting algorithms is O(n * log(n)). This approach requires that your type be "comparable", i.e., have an ordering. Putting the elements into a self-balancing binary search tree is a special case of sorting.
  • Go through the list, and for each element, check the rest of the list to see if it appears again, and discard it if it does. The complexity is O(n^2). The up-shot is that this always works on any type (provided that you can test for equality).

quoted from https://rosettacode.org/wiki/Remove_duplicate_elements

Removing consecutive duplications should only require Eq trait and of O(n) time complexity.

Copy link
Contributor

coderabbitai bot commented Oct 6, 2024

Important

Review skipped

Auto reviews are disabled on this repository.

Please check the settings in the CodeRabbit UI or the .coderabbit.yaml file in this repository. To trigger a single review, invoke the @coderabbitai review command.

You can disable this status message by setting the reviews.review_status to false in the CodeRabbit configuration file.


Thank you for using CodeRabbit. We offer it for free to the OSS community and would appreciate your support in helping us grow. If you find it useful, would you consider giving us a shout-out on your favorite social media?

❤️ Share
🪧 Tips

Chat

There are 3 ways to chat with CodeRabbit:

  • Review comments: Directly reply to a review comment made by CodeRabbit. Example:
    • I pushed a fix in commit <commit_id>, please review it.
    • Generate unit testing code for this file.
    • Open a follow-up GitHub issue for this discussion.
  • Files and specific lines of code (under the "Files changed" tab): Tag @coderabbitai in a new review comment at the desired location with your query. Examples:
    • @coderabbitai generate unit testing code for this file.
    • @coderabbitai modularize this function.
  • PR comments: Tag @coderabbitai in a new PR comment to ask questions about the PR branch. For the best results, please provide a very specific query, as very limited context is provided in this mode. Examples:
    • @coderabbitai gather interesting stats about this repository and render them as a table. Additionally, render a pie chart showing the language distribution in the codebase.
    • @coderabbitai read src/utils.ts and generate unit testing code.
    • @coderabbitai read the files in the src/scheduler package and generate a class diagram using mermaid and a README in the markdown format.
    • @coderabbitai help me debug CodeRabbit configuration file.

Note: Be mindful of the bot's finite context window. It's strongly recommended to break down tasks such as reading entire modules into smaller chunks. For a focused discussion, use review comments to chat about specific files and their changes, instead of using the PR comments.

CodeRabbit Commands (Invoked using PR comments)

  • @coderabbitai pause to pause the reviews on a PR.
  • @coderabbitai resume to resume the paused reviews.
  • @coderabbitai review to trigger an incremental review. This is useful when automatic reviews are disabled for the repository.
  • @coderabbitai full review to do a full review from scratch and review all the files again.
  • @coderabbitai summary to regenerate the summary of the PR.
  • @coderabbitai resolve resolve all the CodeRabbit review comments.
  • @coderabbitai configuration to show the current CodeRabbit configuration for the repository.
  • @coderabbitai help to get help.

Other keywords and placeholders

  • Add @coderabbitai ignore anywhere in the PR description to prevent this PR from being reviewed.
  • Add @coderabbitai summary to generate the high-level summary at a specific location in the PR description.
  • Add @coderabbitai anywhere in the PR title to generate the title automatically.

CodeRabbit Configuration File (.coderabbit.yaml)

  • You can programmatically configure CodeRabbit by adding a .coderabbit.yaml file to the root of your repository.
  • Please see the configuration documentation for more information.
  • If your editor has YAML language server enabled, you can add the path at the top of this file to enable auto-completion and validation: # yaml-language-server: $schema=https://coderabbit.ai/integrations/schema.v2.json

Documentation and Community

  • Visit our Documentation for detailed information on how to use CodeRabbit.
  • Join our Discord Community to get help, request features, and share feedback.
  • Follow us on X/Twitter for updates and announcements.

Copy link

peter-jerry-ye-code-review bot commented Oct 6, 2024

Potential Issues in the Provided git diff Output

  1. Documentation Update Inconsistency:

    • The original comment for the dedup function was corrected from "consecutive repeated elements" to "repeated elements", which seems to be a typo correction. However, the new function dedup_consecutive was added with a comment that correctly states it removes "consecutive repeated elements". This inconsistency in the documentation might cause confusion for users.
    • Suggestion: Ensure that the documentation for both dedup and dedup_consecutive is clear and correctly reflects their functionalities. The comment for dedup should be updated to clarify that it removes all repeated elements, not just consecutive ones, if that is indeed the case.
  2. Possible Infinite Loop in dedup_consecutive:

    • In the dedup_consecutive function, the while loop condition while i + 1 < self.length() && self[i] == self[i + 1] checks for consecutive duplicates and removes the second occurrence. However, if there are more than two consecutive duplicates, removing one might not move the index i forward, potentially causing an infinite loop if the array continuously has consecutive duplicates at the same index after removal.
    • Suggestion: Adjust the loop to ensure that i is incremented or the removal logic is adjusted to handle multiple consecutive duplicates more effectively.
  3. Test Coverage for Edge Cases:

    • The test cases added for dedup_consecutive cover typical scenarios and some edge cases like an empty array and an array with no duplicates. However, it lacks a test case for a large array with multiple groups of consecutive duplicates, which could stress-test the efficiency and correctness of the function.
    • Suggestion: Add a test case that includes a large array with various patterns of consecutive duplicates to ensure the function handles large inputs efficiently and correctly.

These observations focus on potential issues related to documentation clarity, logical correctness, and test coverage, which are crucial for maintaining code quality and user understanding.

@tonyfettes tonyfettes changed the title Fix array dedup add Array::unique for removing consecutive repeated elements in array Oct 6, 2024
@coveralls
Copy link
Collaborator

coveralls commented Oct 6, 2024

Pull Request Test Coverage Report for Build 3307

Details

  • 3 of 3 (100.0%) changed or added relevant lines in 1 file are covered.
  • No unchanged relevant lines lost coverage.
  • Overall coverage increased (+0.01%) to 83.218%

Totals Coverage Status
Change from base Build 3301: 0.01%
Covered Lines: 4091
Relevant Lines: 4916

💛 - Coveralls

@tonyfettes tonyfettes marked this pull request as ready for review October 6, 2024 10:09
@CAIMEOX CAIMEOX requested a review from Lampese October 6, 2024 14:01
@hackwaly
Copy link
Contributor

hackwaly commented Oct 7, 2024

Just my opinion: unique is not a good name for "removing consecutive repeated elements in array". How about keep dedup for consecutive=true and unique for consecutive=false.

@bobzhang
Copy link
Contributor

bobzhang commented Oct 7, 2024

note the original dedup is terribly inefficient (called too many remove), but it is qutie common API. (good first issue)
The unique API here is not very common, what are the use cases? if we want to call unique, we generally do such things:

[...@hashset.from_iter()]

@tonyfettes
Copy link
Contributor Author

@bobzhang using

[...@hashset.from_iter()]

has roughtly the same behavior as the Array::dedup, not Array::unique, as it will only keep one of the repeated elements.

For example, for array [3, 4, 5, 6, 6, 4, 4],

  • Array::dedup

    [3, 4, 5, 6]
    
  • [...@hashset.from_iter()]

    [6, 3, 4, 5]
    
  • Array::unique

    [3, 4, 5, 6, 4]
    

Additionally, using [...@hashset.from_iter()] discards the order that these elments has in the array, which might not be what the user would expect.

@tonyfettes
Copy link
Contributor Author

Just my opinion: unique is not a good name for "removing consecutive repeated elements in array". How about keep dedup for consecutive=true and unique for consecutive=false.

IMO neither of the two names are good for a function that removes consecutive repeated elements, I'm considering using a longer name (like dedup_consecutive) for it.

@tonyfettes tonyfettes changed the title add Array::unique for removing consecutive repeated elements in array add Array::dedup_consecutive for removing consecutive repeated elements in array Oct 8, 2024
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.

Array::dedup removes duplications ACROSS consecutive groups.
5 participants