hashed-array-tree 1.4.0

Hashed Array Trees
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37

# Change Log

All notable changes to this project will be documented in this file.
This project adheres to [Semantic Versioning](http://semver.org/).
This file follows the convention described at
[Keep a Changelog](http://keepachangelog.com/en/1.0.0/).

## [1.4.0] - 2026-06-28
### Added
- Add `Sync` implementation for elements that implement `Sync`.
### Fixed
- `split_off()` no longer panics when `at` equals the length; it now returns an
  empty array, as documented.
- Avoid reading uninitialized leaf slots in `append()` and `dedup_by()`.
### Changed
- Document that zero-sized types are not supported.

## [1.3.0] - 2026-04-11
### Added
- Add `iter_mut()` implementation for `HashedArrayTree`.
- Add `size_hint()` to all iterators and implement `ExactSizeIterator`.

## [1.2.0] - 2025-11-05
### Fixed
- Panic when dropping an empty `IntoIterator`.
### Added
- Add `hat!` macro, add `split_off()` and `truncate()` functions.

## [1.1.0] - 2025-10-28
### Added
- Add `Clone` implementation for elements that implement `Clone`.
- Add `Send` implementation for elements that implement `Send`.
- Add `append()`, `swap()`, `dedup_by()`, and `sort_unstable_by()` functions.

## [1.0.0] - 2025-10-24
### Changed
- Initial release