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

30
prime.c
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:14
* File existed as early as: 1994
* Under source code control: 1994/06/04 03:26:14
* 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/
*/
@@ -31,14 +31,14 @@
#include "have_const.h"
#include "banned.h" /* include after system header <> includes */
#include "banned.h" /* include after system header <> includes */
/*
* odd prime bitmap for odd values < 2^16
*
* pr_map[i] & (1<<j) == 1 ==> i*16 + j*2 + 1 is prime
* 0 ==> i*16 + j*2 + 1 is not prime
* pr_map[i] & (1<<j) == 1 ==> i*16 + j*2 + 1 is prime
* 0 ==> i*16 + j*2 + 1 is not prime
*
* This table is useful to quickly determine if a 16 bit odd number
* is prime. Use the prime[] array to quickly walk thru the 16 bit
@@ -312,18 +312,18 @@ CONST unsigned char pr_map[(MAX_MAP_VAL/8)+1] = {
*
* We end the list with the value 1. Thus, loops of the form:
*
* FULL isqr, n;
* unsigned short *tp;
* FULL isqr, n;
* unsigned short *tp;
*
* for (isqr=fsqrt(n), tp=prime; (*tp <= isqr) && (n % *tp); ++tp) {
* }
* for (isqr=fsqrt(n), tp=prime; (*tp <= isqr) && (n % *tp); ++tp) {
* }
*
* will terminate because *tp == 1 and thus (n % *tp) == 0. To determine if
* a factor was found, one must:
*
* if (*tp <= isqr && *tp != 1) {
* *tp is a factor of n
* }
* if (*tp <= isqr && *tp != 1) {
* *tp is a factor of n
* }
*/
CONST unsigned short prime[MAP_POPCNT+1] = {
3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73,