Dont Find Same nearpoint twice

int numpoints = i@numpt;
int secondinput[];
for(int y = 0; y < npoints(1); y++){
    secondinput[y] = y;
}

int near(int points[]; vector pos){
    int numberofpoints = len(points);
    float d1 = 99999999;
    int winner = -1;
    for(int x = 0; x < numberofpoints; x++){
        vector poss = point(1, "P", points[x]);
        float d2 = distance(pos, poss);
        if(d2 < d1){
            d1 = d2;
            winner = points[x];
        }
    }
    return winner;
}



for(int i = 0; i < numpoints; i++){
    vector p = point(0, "P", i);
    int nearpt = near(secondinput, p);
    removevalue(secondinput, nearpt);
    vector p2 = point(1, "P", nearpt);
    int newpt = addpoint(0, p2);
    addprim(0, "polyline", i, newpt);
}