static int applicable(const solver *ego_, const problem *p_, const planner *plnr) { if (!applicable0(ego_, p_, plnr)) return 0; { const problem_dft *p = (const problem_dft *) p_; if (NO_INDIRECT_OP_P(plnr) && p->ri != p->ro) return 0; } return 1; }
static int applicable(const solver *ego_, const problem *p_, const planner *plnr, int *pdim0, int *pdim1) { if (!applicable0(ego_, p_, plnr, pdim0, pdim1)) return 0; { const problem_dft *p = (const problem_dft *) p_; INT u = p->ri == p->ii + 1 || p->ii == p->ri + 1 ? (INT)2 : (INT)1; /* UGLY if does not result in contiguous transforms or transforms of contiguous vectors (since the latter at least have efficient transpositions) */ if (NO_UGLYP(plnr) && p->vecsz->dims[*pdim0].is != u && !(p->vecsz->rnk == 2 && p->vecsz->dims[1-*pdim0].is == u && p->vecsz->dims[*pdim0].is == u * p->vecsz->dims[1-*pdim0].n)) return 0; if (NO_INDIRECT_OP_P(plnr) && p->ri != p->ro) return 0; } return 1; }