Improve BlockUnitRange indexing (#175)

Author: mtfishman

Project.toml

@@ -1,7 +1,7 @@
 name = "BlockSparseArrays"
 uuid = "2c9a651f-6452-4ace-a6ac-809f4280fbb4"
 authors = ["ITensor developers <[email protected]> and contributors"]
-version = "0.10.2"
+version = "0.10.3"
 
 [deps]
 Adapt = "79e6a3ab-5dfb-504d-930d-738a2a938a0e"

src/BlockArraysExtensions/blockedunitrange.jl

@@ -156,12 +156,7 @@ function blockedunitrange_getindices(
   # mapping `indices` outputs a `BlockVector`
   # which is harder to reason about.
   blocks = map(index -> a[index], Vector(indices))
-  # We pass `length.(blocks)` to `mortar` in order
-  # to pass block labels to the axes of the output,
-  # if they exist. This makes it so that
-  # `only(axes(a[indices])) isa `GradedUnitRange`
-  # if `a isa `GradedUnitRange`, for example.
-  return mortar(blocks, length.(blocks))
+  return mortar(blocks, (mortar_axis(map(axis, blocks)),))
 end
 
 # TODO: Move this to a `BlockArraysExtensions` library.