mirror of
https://github.com/Hopiu/micro.git
synced 2026-03-17 06:20:28 +00:00
7fe98ccfee
Let calcHash() unconditionally hash whatever buffer it is asked to hash, and let its callers explicitly check if the buffer is too large before calling calcHash(). This makes things simpler and less error-prone (no extra source of truth about whether the file is too large, we don't need to remember to check if calcHash() fails, we can be sure calcHash() will actually update the provided hash), and actually faster (since just calculating the buffer size, i.e. adding line lengths, is faster than md5 calculation). In particular, this fixes the following bugs: 1. Since ReOpen() doesn't check calcHash() return value, if the reloaded file is too large while the old version of the file is not, calcHash() returns ErrFileTooLarge and doesn't update origHash, so so Modified() returns true since the reloaded file's md5 sum doesn't match the old origHash, so micro wrongly reports the newly reloaded file as modified. 2. Since Modified() doesn't check calcHash() return value, Modified() may return false positives or false negatives if the buffer has *just* become too large so calcHash() returns ErrFileTooLarge and doesn't update `buff`. |
||
|---|---|---|
| .. | ||
| autocomplete.go | ||
| backup.go | ||
| buffer.go | ||
| buffer_generated_test.go | ||
| buffer_test.go | ||
| cursor.go | ||
| eventhandler.go | ||
| line_array.go | ||
| line_array_test.go | ||
| loc.go | ||
| message.go | ||
| save.go | ||
| search.go | ||
| serialize.go | ||
| settings.go | ||
| stack.go | ||
| stack_test.go | ||