parameters: (self, pntXY, pointScaled=True)
return_statement: return closestPts[i]
docstring: Returns list with
              [curveNumber, legend, index of closest point, pointXY, scaledXY, distance]
              list for only the closest curve.
              Returns [] if no curves are being plotted.
  
              x, y in user coords
              if pointScaled == True based on screen coords
              if pointScaled == False based on user coords
docstring_summary: Returns list with
              [curveNumber, legend, index of closest point, pointXY, scaledXY, distance]
              list for only the closest curve.
              Returns [] if no curves are being plotted.
docstring_tokens: Returns list with [ curveNumber legend index of closest point pointXY scaledXY distance ] list for only the closest curve . Returns [] if no curves are being plotted .
function: def GetClosestPoint(self, pntXY, pointScaled=True):
          """Returns list with
              [curveNumber, legend, index of closest point, pointXY, scaledXY, distance]
              list for only the closest curve.
              Returns [] if no curves are being plotted.
  
              x, y in user coords
              if pointScaled == True based on screen coords
              if pointScaled == False based on user coords
          """
          # closest points on screen based on screen scaling (pointScaled= True)
          # list [curveNumber, index, pointXY, scaledXY, distance] for each curve
          closestPts = self.GetClosestPoints(pntXY, pointScaled)
          if closestPts == []:
              return []  # no graph present
          # find one with least distance
          dists = [c[-1] for c in closestPts]
          mdist = min(dists)  # Min dist
          i = dists.index(mdist)  # index for min dist
          return closestPts[i]
function_tokens: def GetClosestPoint ( self , pntXY , pointScaled = True ) : # closest points on screen based on screen scaling (pointScaled= True) # list [curveNumber, index, pointXY, scaledXY, distance] for each curve closestPts = self . GetClosestPoints ( pntXY , pointScaled ) if closestPts == [ ] : return [ ] # no graph present # find one with least distance dists = [ c [ - 1 ] for c in closestPts ] mdist = min ( dists ) # Min dist i = dists . index ( mdist ) # index for min dist return closestPts [ i ]