Hi, I have a table that has a keycode field which is 4 characters long and is alphanumeric. The keycodes in the table are the ones that are already used and I have to find out where there are large contiguous ranges of unused keycodes to be avaiable for use later. Keycodes look like this for example "A1W9" and the sequence for each position would start with 0 to 9 then A to Z.
Here is an example of a contiguous sequence of keycodes...
0001
0002
0003
0004
0005
0006
0007
0008
0009
000A
000B
000C
and so on...
I haven't searched for ranges before, but I feel that using some sort of looping structure to count the number of instances of missing keycodes between two available one keycodes might be a good direction -problem is that I am not very good with coding, so any help would be very appreciated. Thanks!
Andre
Here is an example of a contiguous sequence of keycodes...
0001
0002
0003
0004
0005
0006
0007
0008
0009
000A
000B
000C
and so on...
I haven't searched for ranges before, but I feel that using some sort of looping structure to count the number of instances of missing keycodes between two available one keycodes might be a good direction -problem is that I am not very good with coding, so any help would be very appreciated. Thanks!
Andre