4 #ifndef DP3_DDECAL_SOLUTIONRESAMPLER_H_
5 #define DP3_DDECAL_SOLUTIONRESAMPLER_H_
26 size_t n_antennas,
size_t solution_interval);
38 std::vector<std::vector<std::vector<std::complex<double>>>>
Upsample(
39 const std::vector<std::vector<std::vector<std::complex<double>>>>&
43 std::vector<std::vector<std::vector<ConstraintResult>>>
Upsample(
44 const std::vector<std::vector<std::vector<ConstraintResult>>>& solutions)
62 size_t direction_index,
67 const std::vector<size_t> n_solutions_per_direction_;
68 const size_t n_sub_solutions_;
69 const size_t n_directions_;
71 const size_t n_antennas_;
72 const size_t solution_interval_;
Class for resampling the solution into a square multi-dimensional array.
Definition: SolutionResampler.h:19
~SolutionResampler()=default
std::vector< std::vector< std::vector< std::complex< double > > > > Upsample(const std::vector< std::vector< std::vector< std::complex< double >>>> &solutions, size_t n_pol) const
Compute the upsampled solutions for dd interval solutions.
std::pair< size_t, size_t > MapResampledToOriginal(size_t time_index, size_t antenna_index, size_t direction_index, size_t pol_index, size_t n_pol) const
Map index in upsampled solutions vector to the matching index in the original solution vector.
SolutionResampler(const std::vector< size_t > &n_solutions_per_direction, size_t n_antennas, size_t solution_interval)
std::vector< std::vector< std::vector< ConstraintResult > > > Upsample(const std::vector< std::vector< std::vector< ConstraintResult >>> &solutions) const
size_t GetNrSubSteps() const
Get the number of substeps per solution interval.
Definition: SolutionResampler.h:54
This file has generic helper routines for testing steps.
Definition: AntennaConfig.h:53