<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def get_point_index(self, point):
 """ Gets of the closest first point Args: point (:obj:`Point`) Returns: (int, int):
 Segment id and point index in that segment """

        for i, segment in enumerate(self.segments):
            idx = segment.getPointIndex(point)
            if idx != -1:
                return i, idx
        return -1, -1