yt.frontends.ramses.hilbert module

yt.frontends.ramses.hilbert.get_cpu_list_cuboid(ds, X: ndarray[Any, dtype[float64]], bound_keys: ndarray[Any, dtype[float64]]) → set[int][source]

Return the list of the CPU intersecting with the cuboid containing the positions. Note that it will be 0-indexed.

Parameters:

  • ds (Dataset) – The dataset containing the information

  • X ((N, ndim) float array) – An array containing positions. They should be between 0 and 1.

yt.frontends.ramses.hilbert.get_intersecting_cpus(ds, region: YTRegion, LE: ndarray[Any, dtype[float64]] | None = None, dx: float = 1.0, dx_cond: float | None = None, factor: float = 4.0, bound_keys: ndarray[Any, dtype[float64]] | None = None) → set[int][source]

Find the subset of CPUs that intersect the bbox in a recursive fashion.

yt.frontends.ramses.hilbert.hilbert3d(ijk: ndarray[Any, dtype[int64]], bit_length: int) → ndarray[Any, dtype[float64]][source]

Compute the order using Hilbert indexing.

Parameters:

  • ijk ((N, ndim) integer array) – The positions

  • bit_length (integer) – The bit_length for the indexing.