(maxSize)
| 31 | |
| 32 | #Details: Generate sorted numbers in radices of 2,3 and 5 upto a given upper limit number |
| 33 | def generate235Radices(maxSize): |
| 34 | sizeList = list() |
| 35 | i = 0 |
| 36 | j = 0 |
| 37 | k = 0 |
| 38 | SUM = int() |
| 39 | sumj = int() |
| 40 | sumk = int() |
| 41 | sumi = 1 |
| 42 | while(True): |
| 43 | sumj = 1 |
| 44 | j = 0 |
| 45 | while(True): |
| 46 | sumk = 1 |
| 47 | k = 0 |
| 48 | while(True): |
| 49 | SUM = sumi*sumj*sumk |
| 50 | if ( SUM > maxSize ): break |
| 51 | sizeList.append(SUM) |
| 52 | k += 1 |
| 53 | sumk *= 2 |
| 54 | if (k == 0): break |
| 55 | j += 1 |
| 56 | sumj *= 3 |
| 57 | if ( j == 0 and k == 0): break |
| 58 | i += 1 |
| 59 | sumi *= 5 |
| 60 | sizeList.sort() |
| 61 | return sizeList |
| 62 | |
| 63 | |
| 64 | def timeout(timeout_time, default): |
nothing calls this directly
no outgoing calls
no test coverage detected