Thanks. It looks very good <3. For improvement;
You can find count for all possibilities to hash length. Because you can check it like that;
if n_possible_count == redis_n_count: n_possible_count += 1
So you avoid duplicates. Of course, you should check the hash either exists in the database or not.
Sure, we can use incremental value. Instead of checking the hash is already exists. This will improve the performance.
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Thanks. It looks very good <3. For improvement;
You can find count for all possibilities to hash length. Because you can check it like that;
So you avoid duplicates. Of course, you should check the hash either exists in the database or not.
Sure, we can use incremental value. Instead of checking the hash is already exists.
This will improve the performance.