the10thwiz/cc65
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Fix the factorization routine and hide it in the module. The others don't need

Browse Source 
to know about it, they can use the lcm calculation routine.


git-svn-id: svn://svn.cc65.org/cc65/trunk@5328 b7a2c559-68d2-44c3-8de9-860c34a00d81
This commit is contained in:
uz
2011-12-27 22:18:05 +00:00
parent 143dcec5e6
commit d956320687
2 changed files with 45 additions and 75 deletions
Download Patch File Download Diff File Expand all files Collapse all files

34
src/common/alignment.h
View File

@@ -43,44 +43,14 @@
/*****************************************************************************/
/* Data */
/*****************************************************************************/
/* The C file contains a list of primes up to 256, so we can factorize numbers
* up to 0x10000 or somewhat more. The FactorizedNumber structure below
* contains the powers of the primes from the prime table. The size of the
* table (= the number of primes contained therein) is the constant below.
*/
#define PRIME_COUNT 54
/* A number together with its prime factors */
typedef struct FactorizedNumber FactorizedNumber;
struct FactorizedNumber {
unsigned long Value; /* The actual number */
unsigned char Powers[PRIME_COUNT]; /* Powers of the factors */
};
/*****************************************************************************/
/* Code */
/*****************************************************************************/
void Factorize (unsigned long Value, FactorizedNumber* F);
/* Factorize a value between 1 and 0x10000. */
FactorizedNumber* LCM (const FactorizedNumber* Left,
const FactorizedNumber* Right,
FactorizedNumber* Res);
/* Calculate the least common multiple of two factorized numbers and return
unsigned long LeastCommonMultiple (unsigned long Left, unsigned long Right);
/* Calculate the least common multiple of two numbers and return
* the result.
*/