v0.1.0

First registered release.

TreeAMR.jl is a tree-based (octree-style) block-structured AMR mesh —
storage, ghost exchange, inter-grid operators, regridding — with no
physics. It is a linear octree with leaf-only data: the sorted leaf
vector is the tree, and there is no coarse data under refined
regions.

Milestones M0–M6 and M8 are complete: the tree core, ghost exchange,
ODE coupling, regridding, multi-threading and GPU support, then every
centering, per-field-set ghost widths, and conservation at coarse-fine
faces. Everything is generic in the dimension D and in the
floating-point type.

Some properties the test suite asserts as numbers rather than
sentiments: results are bit-identical across thread counts; all
per-cell work in src/ is a KernelAbstractions kernel, so the CPU
implementation is already the GPU one; and there is no subcycling,
which is a permanent design commitment rather than a simplification to
be removed later.

See CODE.md for the design argument and the measured results behind
these choices.

Note on this tag. It was created by hand, after the fact. The
version was registered before the repository had a TagBot workflow, so
nothing recorded which commit had been released; dcadb89 was
recovered from the registry's tree hash fbb1afb4. Later releases are
tagged normally.