store 2 sets of numbers in 1 integer using fortran
The programming language is fortran. Need to store 2 sets of numbers in 1 integer. the range of numbers is firstset=any number between 1 and 32-- secondset=any number between 1 and 999. The original code read:
integer=firstset*1000+secondset
and retrived as:
aa=integer\1000
bb=mod(integer/1000)
I need to increase the first set to a maximum of 62. Is this even possible?
(1) Depends on the flavor of Fortran. Or, rather, on the size of an integer. If it is bigger than 16 bits then your code should work as is. If you're limited to 16 bits, then things get interesting.
How about biasing your first set number by -31 so you stay on the legal range:
I am rusty on my Fortran types but I think if you are limited to a 2 byte signed integer you are stuck with something like this. You need 10 bits to represent 1000 values and you need 6 bits to represent 62 values. You are using all 16 bits and if the representation is signed, about half of those represent negative values.
The sort should work as it does now except (possibly, I am thinking) when the firstset values are identical. Right now 1001 sorts before 10002 and after we have -29999 which sorts before -29998 so I am pretty sure the values all sort in the same order they did before (benefit of biased notation).
What is the problem with the sort?
0
The revolutionary project management tool is here! Plan visually with a single glance and make sure your projects get done.
I am not sure but I think your solution will sort incorectly. If you think about it for a second, increasing values of secondset always move your values away from 0. That is negative values get more negative for equal values of firstset as secondset values increase and positive values (for equal values of firstset) get more positive. So an incresing sort will not sort negative values by firstset and then secondset (nor will a decreasing sort handle positive values). When the failed sort was mentioned I immeadiately jumped to your suggestion as the solution but then when I looked at the ordering I found that I had happened upon an order preserving transformation.
-bcl
0
kphillips1Author Commented:
Good Morning Gentleman
The integer in question is written to a temp file that contains various information. That temp file is sorted and thats where I lose it. I do not know C so I cannot convert Amamment code to fortran to test it.
Always moving away from 0 so if the thousands is negative, subtract the second set, otherwise add it. So 1,999 becomes -30999 rather than -29001 (as with earlier code) and 61, 999 is 30999 in both cases
Just need to reverse the sign of the remaining part. Note that this method might work better with mod (what is -30999 mod 1000? -999 or 1? I just don't have a Fortran standard to look that one up).
It is the space and the minus, right? The sort in the file is by character line and space (0x20) sorts before minus (0x2d). You could try reversing firstset. Instead of using firstset - 31, use -firstset + 31 so the high numbers are negative and they will sort before the positive numbers. The data in the file will be all but unreadable for humanbeings but you should be able to get the sort to come out right.
-bcl
0
Featured Post
Work with freelancers specializing in everything from database administration to programming, who have proven themselves as experts in their field. Hire the best, collaborate easily, pay securely, and get projects done right.
How about biasing your first set number by -31 so you stay on the legal range:
integer = (firstset - 31) * 1000 + secondset
firstset = (integer \ 1000) + 31
secondset = integer - (firstset - 31) * 1000
mod may well work for the second calculation but I don't recall how Fortran's mod works with negative numbers.
Hope this helps,
-bcl