- * Most of the I/O is now buffered, which results in a pretty
- large speedup when running under MS Windows. (Craig Barratt)
-
- * Optimizations to the name-handling/comparing code have made
- some significant reductions in user-CPU time for large file
- sets.
-
- * Some variable-type cleanup that makes the code more consistent.
-
- * Reduced memory requirements of hard link preservation.
- (J.W. Schultz)
-
- * Implemented a new algorithm for hard-link handling that speeds
- up the code significantly. (J.W. Schultz and Wayne Davison)
-
- * The --hard-link option now uses the first existing file in the
- group of linked files as the basis for the transfer. This
- prevents the sub-optimal transfer of a file's data when a new
- hardlink is added on the sending side and it sorts alphabetically
- earlier in the list than the files that are already present on the
- receiving side.
+ - Some cleanup in the exclude code has saved some per-exclude memory
+ and made the code easier to maintain.