{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":148641954,"defaultBranch":"master","name":"Rust","ownerLogin":"TheAlgorithms","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2018-09-13T13:29:27.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/20487725?v=4","public":true,"private":false,"isOrgOwned":true},"refInfo":{"name":"","listCacheKey":"v0:1719249315.0","currentOid":""},"activityList":{"items":[{"before":"63c4430711f448a06f4093d5887dd992eafdfdd2","after":"b2acfd2480ca5a7fa419a958eae8dc1a16207f48","ref":"refs/heads/master","pushedAt":"2024-09-16T17:51:47.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Improve bit manipulation algorithm implementations (#788)\n\n* chore[clean_up]: improve bit manipulation algorithm implementations\r\n- Add docstring to file and function\r\n- Rewrite tests using macro\r\n\r\n* chore: update tests\r\n\r\n---------\r\n\r\nCo-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>","shortMessageHtmlLink":"Improve bit manipulation algorithm implementations (#788)"}},{"before":"7015301d5bc35f277ad4bd1966b83719555d9b7b","after":"63c4430711f448a06f4093d5887dd992eafdfdd2","ref":"refs/heads/master","pushedAt":"2024-09-12T18:04:34.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"fix: suppress new clippy warnings (#789)","shortMessageHtmlLink":"fix: suppress new clippy warnings (#789)"}},{"before":"5e2d1e266a9be3467ad94e97b2cd88994ba58764","after":"7015301d5bc35f277ad4bd1966b83719555d9b7b","ref":"refs/heads/master","pushedAt":"2024-09-11T18:47:51.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Update DIRECTORY.md [skip actions]","shortMessageHtmlLink":"Update DIRECTORY.md [skip actions]"}},{"before":"84c466581b335ebf7f57c6bfdf283ea5c63aa4d6","after":"5e2d1e266a9be3467ad94e97b2cd88994ba58764","ref":"refs/heads/master","pushedAt":"2024-09-11T18:47:33.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Implement n bits gray code (#787)\n\nfeat: add `n_bits_gray_code.rs`","shortMessageHtmlLink":"Implement n bits gray code (#787)"}},{"before":"77da9fefa7947b86546d85193a12655247b2ca60","after":"84c466581b335ebf7f57c6bfdf283ea5c63aa4d6","ref":"refs/heads/master","pushedAt":"2024-09-10T18:35:54.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Improve Heap Implementation (#785)\n\n* ref: add `from_vec` method to create heap from vector\r\n\r\n* chore: update docstrings","shortMessageHtmlLink":"Improve Heap Implementation (#785)"}},{"before":"618c13d91a7121012a8fcda9c4b4d21a95f90e30","after":"77da9fefa7947b86546d85193a12655247b2ca60","ref":"refs/heads/master","pushedAt":"2024-09-09T20:43:03.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Update Fenwick Tree Implementation (#784)\n\n* ref: update Fenwick Tree implementation\r\n- Add basic functinalities: `range_query`, `point_query`, `update`\r\nand `set`\r\n- Add docstring\r\n\r\n* ref: refactor implementation\r\n- Clarify the documentation to emphasize the distinction between 1-based indexing (internally) and 0-based indexing (externally)\r\n- Simplify the lowbit function to avoid casting between `isize` and `usize`\r\n\r\n* docs: update docstring","shortMessageHtmlLink":"Update Fenwick Tree Implementation (#784)"}},{"before":"e2f9e8a482bed6bb80638c76474d1912f4d2d2c6","after":"618c13d91a7121012a8fcda9c4b4d21a95f90e30","ref":"refs/heads/master","pushedAt":"2024-09-08T20:01:22.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"siriak","name":"Andrii Siriak","path":"/siriak","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/29201949?s=80&v=4"},"commit":{"message":"style: remove duplicated `the` (#786)","shortMessageHtmlLink":"style: remove duplicated the (#786)"}},{"before":"28dda986da5d3713304b37324d7332eaf1cde32b","after":"e2f9e8a482bed6bb80638c76474d1912f4d2d2c6","ref":"refs/heads/master","pushedAt":"2024-09-08T16:07:46.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"style: remove duplicated `the` (#779)\n\nchore: remove repetitive words\r\n\r\nSigned-off-by: friendlyping ","shortMessageHtmlLink":"style: remove duplicated the (#779)"}},{"before":"44270b738a0c83dbad4e655700bb5bc7535088e2","after":"28dda986da5d3713304b37324d7332eaf1cde32b","ref":"refs/heads/master","pushedAt":"2024-09-07T20:02:48.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Improve All Combinations of Size k Implementation (#782)\n\n* ref: refactor all combinations of size k implementation\r\n\r\n* ref: add `CombinationError` type\r\n\r\n* ref: refactor implementation\r\n- The recursion starts from `start = 0`, so it aligns with zero-indexing.\r\n- Pre-allocate `current` vector and using index to track position to avoid unnecessary heap allocations during each recursive call\r\n\r\n---------\r\n\r\nCo-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>","shortMessageHtmlLink":"Improve All Combinations of Size k Implementation (#782)"}},{"before":"72dc88fa8f9046a9bad3700ae706312e1567673a","after":"44270b738a0c83dbad4e655700bb5bc7535088e2","ref":"refs/heads/master","pushedAt":"2024-09-05T18:45:54.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Improve Permutation Implementation (#781)\n\n* ref: improve permutation implementation\r\n\r\n* ref: permutations of collection of duplicates should be distinct\r\n\r\n* ref: improve permutation implementation\r\n- Add `test_of_all_duplicates`\r\n- Update docstring\r\n\r\n* docs: use slice in doc-str\r\n\r\n---------\r\n\r\nCo-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>","shortMessageHtmlLink":"Improve Permutation Implementation (#781)"}},{"before":"c51bc8927817e363f08e663fd0107b80ebf92b0f","after":"72dc88fa8f9046a9bad3700ae706312e1567673a","ref":"refs/heads/master","pushedAt":"2024-09-02T17:08:12.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Add custom error types `HammingDistanceError` (#780)\n\nref: add custom error types `HammingDistanceError`","shortMessageHtmlLink":"Add custom error types HammingDistanceError (#780)"}},{"before":"2d2ffc447936a94dc3962375dd4b054d230529a3","after":"c51bc8927817e363f08e663fd0107b80ebf92b0f","ref":"refs/heads/master","pushedAt":"2024-08-31T19:49:55.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Refactor Maximum Subarray Implementation (#777)\n\n* ref: refactor maximum subarray\r\n\r\n* ref: improve maximum subarray\r\n- Add custom error type: handling empty array\r\n- Optimize the `maximum_subarray` space complexity from `O(n)` to `O(1)`\r\n- Correct docstring\r\n\r\n---------\r\n\r\nCo-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>","shortMessageHtmlLink":"Refactor Maximum Subarray Implementation (#777)"}},{"before":"45edeb9b58b0c200972a73c0a1f84ec3a7e6cf6d","after":"2d2ffc447936a94dc3962375dd4b054d230529a3","ref":"refs/heads/master","pushedAt":"2024-08-19T14:52:23.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Refator Egg Dropping Implementation (#776)\n\n* ref: improve egg dropping implementation\r\n\r\n* chore: update docstring\r\n\r\n* style: use proper grammar\r\n\r\n---------\r\n\r\nCo-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>","shortMessageHtmlLink":"Refator Egg Dropping Implementation (#776)"}},{"before":"f08e936712b53618ca752cf45f5c57cab085b8f2","after":"45edeb9b58b0c200972a73c0a1f84ec3a7e6cf6d","ref":"refs/heads/master","pushedAt":"2024-08-10T13:14:42.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Refator Knuth-Moris-Pratt Algorithm Implementation (#775)\n\nref: improve kmp algorithm implementation","shortMessageHtmlLink":"Refator Knuth-Moris-Pratt Algorithm Implementation (#775)"}},{"before":"65ca19d797c94edc6819bddef0ebee716173eb21","after":"f08e936712b53618ca752cf45f5c57cab085b8f2","ref":"refs/heads/master","pushedAt":"2024-08-08T06:11:19.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"perf: Optimize BTree search using binary search (#767)\n\n* perf: Optimize BTree search using binary search\r\n\r\nThis commit optimizes the search function in the BTree implementation\r\nby replacing the linear search with a binary search algorithm. This\r\nchange significantly improves the search performance, especially for\r\nlarge trees.\r\n\r\nImplementation details:\r\n- Modified the `search` method in the `BTree` struct\r\n- Replaced the while loop with `binary_search` method on the `keys` vector\r\n\r\nComplexity analysis:\r\n- Previous implementation: O(n) per node, where n is the number of keys\r\n- New implementation: O(log n) per node\r\n\r\nBenchmark results:\r\n- Environment: MacOS 14.5, Apple M1 Pro, 32 GB RAM\r\n- Dataset: 1,000,000 random integers for insertion\r\n- Search: 1,000,000 searches for the key 500,000\r\n- Before:\r\n - Insertion: 3.002587333s\r\n - Search: 2.334683584s\r\n- After:\r\n - Insertion: 2.998482583s\r\n - Search: 288.659458ms\r\n\r\nNote: Insertion time remains largely unchanged, as expected. All\r\nexisting tests pass with the new implementation.\r\n\r\nBenchmark code is not included in this commit.\r\n\r\n* tests: expand existing `test_search`\r\n\r\n---------\r\n\r\nCo-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>","shortMessageHtmlLink":"perf: Optimize BTree search using binary search (#767)"}},{"before":"3cbb841f58b0227a3e5bb01c8cbd49878d851960","after":"65ca19d797c94edc6819bddef0ebee716173eb21","ref":"refs/heads/master","pushedAt":"2024-08-06T06:22:50.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Refactor Rod Cutting Implementation (#774)\n\n* ref: refactor rod cutting\r\n\r\n* chore: rename tests\r\n\r\n* tests: add a test case, when greedy approach does not work\r\n\r\n---------\r\n\r\nCo-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>","shortMessageHtmlLink":"Refactor Rod Cutting Implementation (#774)"}},{"before":"faa626cd26a21edaf54681c3fda760c85e00649d","after":"3cbb841f58b0227a3e5bb01c8cbd49878d851960","ref":"refs/heads/master","pushedAt":"2024-08-04T06:38:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Update DIRECTORY.md [skip actions]","shortMessageHtmlLink":"Update DIRECTORY.md [skip actions]"}},{"before":"b8fa915a59a44ffc09fd46c3eaf0ca1a3902cecd","after":"faa626cd26a21edaf54681c3fda760c85e00649d","ref":"refs/heads/master","pushedAt":"2024-08-04T06:37:48.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Improve infix to postfix notation algorithm and suppress some clippy warnings (#772)\n\n* refactor(infix_to_postfix): Move to more appropriate place\r\n\r\nI think that infix to postfix notation algorithm belongs to conversions,\r\nand certainly not to data structures\r\n\r\n* style(infix_to_postfix): Change to be a doc-comment + links added\r\n\r\n* General code improvement\r\n\r\nNo need for the closure to return `i32`, since not only it is never\r\nnegative, but also it will never be as huge to make it a 32 bit\r\n\r\n* Add error type for infix to postfix conversion + tests for it\r\n\r\n* Move the algorithm in the `DIRECTORY.md`\r\n\r\n* Move Infix to Postfix algorithm to `math` section\r\n\r\n* Move Infix to Postfix algorithm to `math` section\r\n\r\n* test(infix_to_postfix): Add more tests\r\n\r\n* tests: add tests with `^`\r\n\r\n* fix: suppress new clippy warnings\r\n\r\n---------\r\n\r\nCo-authored-by: vil02 <65706193+vil02@users.noreply.github.com>","shortMessageHtmlLink":"Improve infix to postfix notation algorithm and suppress some clippy …"}},{"before":"3c50b910902ea13879e66062d1417586185c2153","after":"b8fa915a59a44ffc09fd46c3eaf0ca1a3902cecd","ref":"refs/heads/master","pushedAt":"2024-08-01T06:37:34.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Improve Coin Change Implementation (#773)\n\n* ref: refactor coin change\r\n- Use Rust closures to streamline the implementation\r\n- Rewrite tests using macro\r\n\r\n* feat(tests): add some edge tests\r\n\r\n* tests: add `test_greedy_approach_does_not_work`\r\n\r\n* tests: add `zero_denominations`-like tests\r\n\r\n---------\r\n\r\nCo-authored-by: vil02 <65706193+vil02@users.noreply.github.com>","shortMessageHtmlLink":"Improve Coin Change Implementation (#773)"}},{"before":"27bfd422be37938384b62eeb9884c72c9e1110ec","after":"3c50b910902ea13879e66062d1417586185c2153","ref":"refs/heads/master","pushedAt":"2024-07-31T16:08:59.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Improve Longest Common Subsequence Implementation (#771)\n\n* ref: refactor implementation\r\n- Decopose the `longest_common_subsequence` to use helper functions\r\n- Rewrite tests using macro\r\n- Naming variables and functions descriptively\r\n- Add docstrings\r\n\r\n* chore(docs): explain which is returned LCS\r\n\r\n* chore: remove redundant comments\r\n\r\n* chore: explain the different LCS outputs returned\r\n\r\n* tests: add a test case showing that `longest_common_subsequence` is not symmetric\r\n\r\n---------\r\n\r\nCo-authored-by: vil02 <65706193+vil02@users.noreply.github.com>","shortMessageHtmlLink":"Improve Longest Common Subsequence Implementation (#771)"}},{"before":"7833c0c581beec4e147b938340bb093669f4a07a","after":"27bfd422be37938384b62eeb9884c72c9e1110ec","ref":"refs/heads/master","pushedAt":"2024-07-30T19:31:35.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Update DIRECTORY.md [skip actions]","shortMessageHtmlLink":"Update DIRECTORY.md [skip actions]"}},{"before":"06cbf4862368ba996a562042f8ca8646718d9bc1","after":"7833c0c581beec4e147b938340bb093669f4a07a","ref":"refs/heads/master","pushedAt":"2024-07-30T19:31:15.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":" Implementation of Average Marginal Ranking Loss Function (#742)\n\n* Docs: added documentation to marginal ranking loss function\r\n\r\n* Feat: created function signature\r\n\r\n* Doc: added return comment\r\n\r\n* Feat: finished implementation and changed type of input\r\n\r\n* Test: created a test case\r\n\r\n* Feat: added the correct exports\r\n\r\n* Feat: now using option as a return type\r\n\r\n* Test: added a macro for testing purposes as suggested\r\n\r\n* Test: macro tests took too long\r\n\r\n* Docs: added the algorithm to directory with the correct link\r\n\r\n* Feat: algorithm now returns Result and updated tests\r\n\r\n* Test: added a macro for testing purposes and more tests\r\n\r\n* Docs: added more documentation to the file\r\n\r\n* Refcator: changed the name of the function\r\n\r\n* Feat: added 1 more possible error message\r\n\r\n* Test: added symmetric error handling\r\n\r\n* Refactoring: added more rust-like syntaxis\r\n\r\n* Feat: fixed with the correct export\r\n\r\n* Feat: added suggested check_input function\r\n\r\n* Refactoring: changed the name to margin ranking loss\r\n\r\n* docs: update dead link\r\n\r\n---------\r\n\r\nCo-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>","shortMessageHtmlLink":" Implementation of Average Marginal Ranking Loss Function (#742)"}},{"before":"875f825ef196f12167e6316d644818a0b238ecd8","after":"06cbf4862368ba996a562042f8ca8646718d9bc1","ref":"refs/heads/master","pushedAt":"2024-07-23T06:54:43.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Improve Matrix Chain Multiplication (#769)\n\n* ref: refactor matrix chain multiply\r\n\r\n* chore: change `u32` to `usize`\r\n\r\n* chore: update tests\r\n\r\n* ref: add custom error type\r\n\r\n* chore: rename tests\r\n\r\n* tests: remove duplicated test\r\n\r\n---------\r\n\r\nCo-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>","shortMessageHtmlLink":"Improve Matrix Chain Multiplication (#769)"}},{"before":"d94e82156b86cc4d4d7983c4a250e02a12e9c654","after":"875f825ef196f12167e6316d644818a0b238ecd8","ref":"refs/heads/master","pushedAt":"2024-07-17T19:10:30.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Update DIRECTORY.md [skip actions]","shortMessageHtmlLink":"Update DIRECTORY.md [skip actions]"}},{"before":"46ad2da2a21c55cf34b687188f275526bab0e9d2","after":"d94e82156b86cc4d4d7983c4a250e02a12e9c654","ref":"refs/heads/master","pushedAt":"2024-07-17T19:10:00.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Implement subset sum using backtracking (#765)\n\n* feat[backtracking]: implement subset sum\r\n\r\n* chore(docs): add docstring\r\n\r\n* chore: format code\r\n\r\n* chore: change `i32` to `isize`\r\n\r\n* docs: remove redundant comment","shortMessageHtmlLink":"Implement subset sum using backtracking (#765)"}},{"before":"3481e513fd9c9e0205b85e1e0d5653d014fc9607","after":"46ad2da2a21c55cf34b687188f275526bab0e9d2","ref":"refs/heads/master","pushedAt":"2024-07-15T15:46:00.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Refactor fast factorial algorithm (#761)\n\n* Refactor fast factorial: Rename `p_indeces` -> `p_indices`\r\n\r\n* Refactor fast factorial: rework `p_indices`\r\n\r\nCollect indices into the map using `Iterator::collect` instead of\r\niterating each prime and inserting it\r\n\r\n* Refactor fast factorial: better vector of ones\r\n\r\nAvoid unnecessary resizing and just use `vec![]` macro directly\r\n\r\n---------\r\n\r\nCo-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>","shortMessageHtmlLink":"Refactor fast factorial algorithm (#761)"}},{"before":"18886d4c60149b560ed3805e629bfa06e01fa4c2","after":"3481e513fd9c9e0205b85e1e0d5653d014fc9607","ref":"refs/heads/master","pushedAt":"2024-07-12T17:52:26.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Improve Ford Fulkerson Implementation (#745)\n\n* ref(graph): refactor Ford Fulkerson implementation\r\n- Added Rust doc comments to provide better documentation for the functions and the module\r\n- Return residual graph for flow verification\r\n- Renamed variables for better readability\r\n- Use a macro to define the tests\r\n- Add test for no feasible flow (`test_example_6`)\r\n\r\n* chore(fix:fmt): remove trailing white spaces\r\n\r\n* chore(fix[fmt]): fix no newline at the end of file\r\n\r\n* ref: refactor ford fulkerson\r\n- Add custom error types\r\n- Add some edge tests\r\n\r\n* chore: fix typo in document\r\n\r\n* ref: add error variant of graph is not square matrix\r\n\r\n* ref: refactor implementation\r\n- Move error checking into a validation function\r\n- Remove redundant comments explained variants\r\n\r\n* chore: change `isize` to `usize` in graph reprentation\r\n\r\n---------\r\n\r\nCo-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>","shortMessageHtmlLink":"Improve Ford Fulkerson Implementation (#745)"}},{"before":"c17cb5a9e03625bc3f3a1b94a049975c842319f8","after":"18886d4c60149b560ed3805e629bfa06e01fa4c2","ref":"refs/heads/master","pushedAt":"2024-07-09T15:30:13.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Update DIRECTORY.md [skip actions]","shortMessageHtmlLink":"Update DIRECTORY.md [skip actions]"}},{"before":"616b1fbd1833dde3f8b387da55308c38f11fcb27","after":"c17cb5a9e03625bc3f3a1b94a049975c842319f8","ref":"refs/heads/master","pushedAt":"2024-07-09T15:29:58.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Implementation of Negative Log Likelihood Loss Function (#734)\n\n* Doc: added documentation of negative log likelihood function\r\n\r\n* Feat: created function signature for negative log likelihood\r\n\r\n* Feat: implementation of the negative log likelihood\r\n\r\n* Test: created a test for the negative log likelihood\r\n\r\n* Feat: added the needed exports\r\n\r\n* Feat: added explicit checks regarding\r\n\r\n* Test: added test cases for the checks\r\n\r\n* Feat: added another empty check\r\n\r\n* Test: added tests for negative values\r\n\r\n* Refactoring: added auxiliary function to check range of values\r\n\r\n* Docs: added link to an article with the explanation\r\n\r\n* Fix: fixed cargo clippy warning by moving location of function\r\n\r\n* Docs: added the algorithm to the directory with link\r\n\r\n* Fix: reverted the file to previous format\r\n\r\n* Fix: removed an innecesary condition\r\n\r\n* Fix: changed return type to Result instead of Option\r\n\r\n* Fix: fixed test and moved position of if statements\r\n\r\n* Feat: added suggestions and removed one condition\r\n\r\n* Tests: added suggestion to use a macro for testing purposes\r\n\r\n* Fix: fixed clippy issue and wrapped tests\r\n\r\n* Docs: added more documentation for the binary problem\r\n\r\n* style: remove blank line\r\n\r\n---------\r\n\r\nCo-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>","shortMessageHtmlLink":"Implementation of Negative Log Likelihood Loss Function (#734)"}},{"before":"70b20f2f5d48503e2701409b2ddb4a600280c5a7","after":"616b1fbd1833dde3f8b387da55308c38f11fcb27","ref":"refs/heads/master","pushedAt":"2024-07-07T20:38:40.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"siriak","name":"Andrii Siriak","path":"/siriak","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/29201949?s=80&v=4"},"commit":{"message":"style: include: `no_effect_underscore_binding` (#763)","shortMessageHtmlLink":"style: include: no_effect_underscore_binding (#763)"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"Y3Vyc29yOnYyOpK7MjAyNC0wOS0xNlQxNzo1MTo0Ny4wMDAwMDBazwAAAAS3uc7G","startCursor":"Y3Vyc29yOnYyOpK7MjAyNC0wOS0xNlQxNzo1MTo0Ny4wMDAwMDBazwAAAAS3uc7G","endCursor":"Y3Vyc29yOnYyOpK7MjAyNC0wNy0wN1QyMDozODo0MC4wMDAwMDBazwAAAAR5A7uA"}},"title":"Activity · TheAlgorithms/Rust"}