Git 2.42 Release: Improved Performance and Flexibility
After two and a half months of development, the release of the distributed system of the source texts git 2.42 has been published. GIT is one of the most popular, reliable, and high-performance version management systems that provide flexible means of nonlinear development, based on branch and fusion of branches. To ensure the integrity of history and resistance to changes in “retroactively,” implicit hashing of the entire previous story in each community is also used, along with the ability to certify the digital signatures of the developers of individual tags and commits.
In comparison with the previous version, this release includes 453 changes made by 78 developers, including 17 first-time contributors. The main innovations are:
- A new algorithm for bypassing the bit card, known as the “Reachability Bitmaps” disk structure, has been introduced. This algorithm reflects data on objects of objects available for each commander, allowing for quick determination of the presence of a basic object to reduce data extraction during transactions such as “Git Fetch,” “Git Rev-List,” and “Git Clone” with large repositories. The new algorithm provides a noticeable increase in performance in situations where the bit card does not completely cover one of the compared branches. In some scenarios, the use of this algorithm can lead to acceleration by 2-15 times. To switch to the new algorithm, users can set the Pack.usebitMapboundaryTraversal parameter and re-reap indexes, then use the option “-bitmap-index” when performing “Git Rev-List”:
Git Repack-Bitmap -index
Git Config Pack.usebitmapboundaryTraversal True
Git Rev-List-Count --objects --not --branches-bitmap -index
- The Git For-Each-REF team has implemented a more flexible mechanism for excluding links from the conclusion, which is more convenient and effective than the use of the variable “Transfer