drygdryg/calc
1
0
Fork 0
mirror of https://github.com/lcn2/calc.git synced 2025-08-19 01:13:27 +03:00
Code Issues Packages Projects Releases Wiki Activity

convert ASCII TABs to ASCII SPACEs

Browse Source 
Converted all ASCII tabs to ASCII spaces using a 8 character
tab stop, for all files, except for all Makefiles (plus rpm.mk).
The `git diff -w` reports no changes.
This commit is contained in:
Landon Curt Noll
2024-07-11 22:03:52 -07:00
parent fe9cefe6ef
commit db77e29a23
631 changed files with 90607 additions and 90600 deletions
Download Patch File Download Diff File Expand all files Collapse all files

48
prime.h
View File

@@ -9,7 +9,7 @@
*
* Calc is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General
* Public License for more details.
*
* A copy of version 2.1 of the GNU Lesser General Public License is
@@ -17,11 +17,11 @@
* received a copy with calc; if not, write to Free Software Foundation, Inc.
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
* Under source code control: 1994/06/04 03:26:15
* File existed as early as: 1994
* Under source code control: 1994/06/04 03:26:15
* File existed as early as: 1994
*
* chongo <was here> /\oo/\ http://www.isthe.com/chongo/
* Share and enjoy! :-) http://www.isthe.com/chongo/tech/comp/calc/
* chongo <was here> /\oo/\ http://www.isthe.com/chongo/
* Share and enjoy! :-) http://www.isthe.com/chongo/tech/comp/calc/
*/
@@ -29,7 +29,7 @@
#define INCLUDE_PRIME_H
#if defined(CALC_SRC) /* if we are building from the calc source tree */
#if defined(CALC_SRC) /* if we are building from the calc source tree */
# include "qmath.h"
# include "have_const.h"
#else
@@ -38,33 +38,33 @@
#endif
#define MAX_MAP_PRIME ((FULL)65521) /* (2^16-15) largest prime in prmap */
#define MAX_MAP_VAL ((FULL)65535) /* (2^16-1) largest bit in pr_map */
#define MAX_SM_PRIME ((FULL)0xfffffffb) /* (2^32-5) largest 32 bit prime */
#define MAX_SM_VAL ((FULL)0xffffffff) /* (2^32-1) largest 32 bit value */
#define MAX_MAP_PRIME ((FULL)65521) /* (2^16-15) largest prime in prmap */
#define MAX_MAP_VAL ((FULL)65535) /* (2^16-1) largest bit in pr_map */
#define MAX_SM_PRIME ((FULL)0xfffffffb) /* (2^32-5) largest 32 bit prime */
#define MAX_SM_VAL ((FULL)0xffffffff) /* (2^32-1) largest 32 bit value */
#define MAP_POPCNT 6541 /* number of odd primes in pr_map */
#define MAP_POPCNT 6541 /* number of odd primes in pr_map */
#define NXT_MAP_PRIME ((FULL)65537) /* (2^16+1) smallest prime > 2^16 */
#define NXT_MAP_PRIME ((FULL)65537) /* (2^16+1) smallest prime > 2^16 */
#define PIX_32B ((FULL)203280221) /* pix(2^32-1) - max pix() value */
#define PIX_32B ((FULL)203280221) /* pix(2^32-1) - max pix() value */
/*
* product of primes that fit into a long
*/
#if BASEB == 32
#define MAX_PFACT_VAL 52 /* max x, for which pfact(x) is a long */
#define NXT_PFACT_VAL 14 /* next prime for higher pfact values */
#define MAX_PFACT_VAL 52 /* max x, for which pfact(x) is a long */
#define NXT_PFACT_VAL 14 /* next prime for higher pfact values */
#else
#define MAX_PFACT_VAL 28 /* max x, for which pfact(x) is a long */
#define NXT_PFACT_VAL 8 /* next prime for higher pfact values */
#define MAX_PFACT_VAL 28 /* max x, for which pfact(x) is a long */
#define NXT_PFACT_VAL 8 /* next prime for higher pfact values */
#endif
/*
* If n is odd and 1 <= n <= MAX_MAP_VAL, then:
*
* pr_map_bit(n) != 0 ==> n is prime
* pr_map_bit(n) == 0 ==> n is NOT prime
* pr_map_bit(n) != 0 ==> n is prime
* pr_map_bit(n) == 0 ==> n is NOT prime
*/
#define pr_map_bit(n) (pr_map[(HALF)(n)>>4] & (1 << (((HALF)(n)>>1)&0x7)))
@@ -72,8 +72,8 @@
* Limits for piXb tables. Do not test about this value using the
* given table, even though the table has a higher sentinel value.
*/
#define MAX_PI10B ((1024*256)-1) /* largest pi10b value to test */
#define MAX_PI18B ((FULL)(0xFFFFFFFF)) /* largest pi18b value to test */
#define MAX_PI10B ((1024*256)-1) /* largest pi10b value to test */
#define MAX_PI18B ((FULL)(0xFFFFFFFF)) /* largest pi18b value to test */
/*
* Prime related external arrays.
@@ -82,9 +82,9 @@ EXTERN CONST unsigned short prime[];
EXTERN CONST unsigned char pr_map[];
EXTERN CONST unsigned short pi10b[];
EXTERN CONST unsigned short pi18b[];
EXTERN NUMBER _nxtprime_; /* 2^32+15 - smallest prime > 2^32 */
EXTERN CONST ZVALUE _nxt_prime_; /* 2^32+15 - smallest prime > 2^32 */
EXTERN CONST ZVALUE _jmpmod2_; /* JMPMOD*2 as a ZVALUE */
EXTERN NUMBER _nxtprime_; /* 2^32+15 - smallest prime > 2^32 */
EXTERN CONST ZVALUE _nxt_prime_; /* 2^32+15 - smallest prime > 2^32 */
EXTERN CONST ZVALUE _jmpmod2_; /* JMPMOD*2 as a ZVALUE */
#endif /* !INCLUDE_PRIME_H */