-
Notifications
You must be signed in to change notification settings - Fork 0
Refactor to recursive hash tree structure #18
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
Refactor to recursive hash tree structure #18
Conversation
Summary of ChangesHello @toothlessdev, I'm Gemini Code Assist1! I'm currently reviewing this pull request and will post my feedback shortly. In the meantime, here's a summary to help you and other reviewers quickly get up to speed! This pull request introduces a significant refactoring within the "@patchlogr/core" package, transitioning from a rigid 2-depth hash tree to a recursive hash tree structure for handling partitioned specifications. This change is driven by the need for improved scalability and extensibility, particularly for future partitioning and chunking functionalities. The update modifies the output of partitioning functions, making it a breaking change, but lays a robust foundation for advanced data management. Highlights
🧠 New Feature in Public Preview: You can now enable Memory to help Gemini Code Assist learn from your team's feedback. This makes future code reviews more consistent and personalized to your project's style. Click here to enable Memory in your admin console. Using Gemini Code AssistThe full guide for Gemini Code Assist can be found on our documentation page, here are some quick tips. Invoking Gemini You can request assistance from Gemini at any point by creating a comment using either
Customization To customize Gemini Code Assist for GitHub experience, repository maintainers can create a configuration file and/or provide a custom code review style guide (such as PEP-8 for Python) by creating and adding files to a Limitations & Feedback Gemini Code Assist may make mistakes. Please leave feedback on any instances where its feedback is incorrect or counter productive. You can react with 👍 and 👎 on @gemini-code-assist comments. If you're interested in giving your feedback about your experience with Gemini Code Assist for Github and other Google products, sign up here. You can also get AI-powered code generation, chat, as well as code reviews directly in the IDE at no cost with the Gemini Code Assist IDE Extension. Footnotes
|
Test Results76 tests 76 ✅ 1s ⏱️ Results for commit b887d6d. ♻️ This comment has been updated with latest results. |
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.
Code Review
이 PR은 파티셔닝 로직을 재귀적인 해시 트리 구조로 리팩터링하여 확장성을 향상시키는 훌륭한 변경입니다. 전반적인 구조 변경은 명확하고 목적에 부합합니다. 다만, partitionByMethod.ts와 partitionByTag.ts 파일 간에 상당한 코드 중복이 발견되었습니다. 두 함수는 그룹화 키를 결정하는 로직만 다를 뿐, 전체적인 구조(그룹화, 리프 노드 생성, 중간 노드 생성, 루트 노드 생성)가 거의 동일합니다. 유지보수성을 높이기 위해 이 중복되는 로직을 별도의 헬퍼 함수로 추출하는 것을 강력히 권장합니다. 이 헬퍼 함수는 spec과 그룹화 키를 반환하는 콜백 함수를 인자로 받아 PartitionedSpec을 생성하도록 만들 수 있습니다. 이렇게 하면 코드 중복을 제거하고 향후 새로운 파티셔닝 전략을 추가하기 용이해집니다.
📎 Related issues
📦 Scope
📌 Summary
🧠 Context
✅ Checklist