well, it just goes from true to false, kinda. and if it's false, happens [something] mod 0 that is always 0.
so in english, the line: Code:
until 0 = InStr($r,a+$f+a) - Len($+$o[$f]) mod $l * $e
keeps the loop going on until a random number is met that is not already used and if doing a even loop, checks if file-length is matched. that is, can't accept "01" and "101" as the first 2 pieces if $length is 10. as that would break my left() (and it did in the beginning) instead, the code keeps looking until it finds a pair that has the required length.
