PyObject *py_ped_constraint_is_solution(PyObject *s, PyObject *args) {
PyObject *in_geometry = NULL;
PedConstraint *constraint = NULL;
PedGeometry *out_geometry = NULL;
int ret = 0;
if (!PyArg_ParseTuple(args, "O!", &_ped_Geometry_Type_obj,
&in_geometry)) {
return NULL;
}
constraint = _ped_Constraint2PedConstraint(s);
if (constraint == NULL) {
return NULL;
}
out_geometry = _ped_Geometry2PedGeometry(in_geometry);
if (out_geometry == NULL) {
ped_constraint_destroy(constraint);
return NULL;
}
ret = ped_constraint_is_solution(constraint, out_geometry);
ped_constraint_destroy(constraint);
if (ret) {
Py_RETURN_TRUE;
} else {
Py_RETURN_FALSE;
}
}
/**
* Return the nearest region to \p geom that satisfy a \p constraint.
*
* Note that "nearest" is somewhat ambiguous. This function makes
* no guarantees about how this ambiguity is resovled.
*
* \return PedGeometry, or NULL when a \p constrain cannot be satisfied
*/
PedGeometry*
ped_constraint_solve_nearest (
const PedConstraint* constraint, const PedGeometry* geom)
{
PedSector start;
PedSector end;
PedGeometry* result;
if (constraint == NULL)
return NULL;
PED_ASSERT (geom != NULL);
PED_ASSERT (constraint->start_range->dev == geom->dev);
start = _constraint_get_nearest_start_soln (constraint, geom->start);
if (start == -1)
return NULL;
end = _constraint_get_nearest_end_soln (constraint, start, geom->end);
if (end == -1)
return NULL;
result = ped_geometry_new (geom->dev, start, end - start + 1);
if (!result)
return NULL;
PED_ASSERT (ped_constraint_is_solution (constraint, result));
return result;
}
