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

24
jump.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,17 +17,17 @@
* 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/29 04:03:55
* File existed as early as: 1994
* Under source code control: 1994/06/29 04:03:55
* 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/
*/
/*
* If x is divisible by a trivial prime (2,3,5,7,11), then:
*
* x + jmpindx[ (x>>1)%JMPMOD ]
* x + jmpindx[ (x>>1)%JMPMOD ]
*
* is the value of the smallest value > x that is not divisible by a
* trivial prime. JMPMOD is the product of the odd trivial primes.
@@ -37,7 +37,7 @@
*
* If x is not divisible by a trivial prime, then:
*
* x + jmp[ -jmpindx[(x>>1)%JMPMOD] ]
* x + jmp[ -jmpindx[(x>>1)%JMPMOD] ]
*
* is the value of the smallest value > x that is not divisible by a
* trivial prime.
@@ -53,7 +53,7 @@
* that are not divisible by trivial primes.
*
* Instead of testing successive odd values, this system allows us to
* skip odd values divisible by trivial primes. This is process on the
* skip odd values divisible by trivial primes. This is process on the
* average reduces the values we need to test by a factor of at least 2.4.
*/
@@ -62,7 +62,7 @@
#define INCLUDE_JUMP_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 "have_const.h"
# include "decl.h"
#else
@@ -74,9 +74,9 @@
/*
* trivial prime CONSTants
*/
#define JMPMOD (3*5*7*11) /* product of odd trivial primes */
#define JMPSIZE (2*4*6*10) /* ints mod JMPMOD not div by trivial primes */
#define JPRIME (prime+4) /* pointer to first non-trivial prime */
#define JMPMOD (3*5*7*11) /* product of odd trivial primes */
#define JMPSIZE (2*4*6*10) /* ints mod JMPMOD not div by trivial primes */
#define JPRIME (prime+4) /* pointer to first non-trivial prime */
/* given x, return the index within jmpindx that applies */
#define jmpmod(x) (((x)>>1)%JMPMOD)