def searchsorted(x, v, side='left', sorter=None):
 return SearchsortedOp(side=side)(x, v, sorter)

def searchsorted ( x , v , side = 'left' , sorter = None ) : return SearchsortedOp ( side = side ) ( x , v , sorter )
find indices where elements should be inserted to maintain order .