search for: dont_transform

...o see if any of the ordered pairs of (x,y) coordinates in 1:j are repeated in j+1:100. This seems like it should be really easy. But I cannot find a simple method. I have been calling the pivoted portion of the walk (xn[],yn[]) for(i in 1:j) for(m in {j+1}:100) if(xn[m]==x[i]) if(yn[m]==y[i]) dont_transform=1 else dont_transform=0 if(dont_transform==0) for(g in j:100) {x[g]=xn[g] ; y[g]=yn[g]} z=c(x,y) dim(z)=c(100,2) z maybe the right solution would be to use intersection() but I couldnt figure out how to make it work. Any advice would be appreciated. Thanks Seth Latimer -- View this message in...