Return the i-th next-nearest neighbor of a lattice site, by taking two xy_nn_hops in the suitable direction. You can feed any i ∈ ℤ, but you can get only 6 inequivalent neighbors, depending on the label of the given site: "A" and "B" activate two different suitable sets of NN hops, A lattice layout is required to build the concrete hoppings.
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
type(unit_cell), | intent(in) | :: | layout | |||
type(xy_site), | intent(in) | :: | S | |||
integer, | intent(in) | :: | i |