These files are a subset of the python-2.7.2.tgz distribution from python.org. Changed files from PyMod-2.7.2 have been copied into the corresponding directories of this tree, replacing the original files in the distribution. Signed-off-by: daryl.mcdaniel@intel.com git-svn-id: https://edk2.svn.sourceforge.net/svnroot/edk2/trunk/edk2@13197 6f19259b-4bc3-4df7-8a09-765794883524
		
			
				
	
	
		
			34 lines
		
	
	
		
			921 B
		
	
	
	
		
			Python
		
	
	
	
	
	
			
		
		
	
	
			34 lines
		
	
	
		
			921 B
		
	
	
	
		
			Python
		
	
	
	
	
	
| #! /usr/bin/env python
 | |
| 
 | |
| # Print digits of pi forever.
 | |
| #
 | |
| # The algorithm, using Python's 'long' integers ("bignums"), works
 | |
| # with continued fractions, and was conceived by Lambert Meertens.
 | |
| #
 | |
| # See also the ABC Programmer's Handbook, by Geurts, Meertens & Pemberton,
 | |
| # published by Prentice-Hall (UK) Ltd., 1990.
 | |
| 
 | |
| import sys
 | |
| 
 | |
| def main():
 | |
|     k, a, b, a1, b1 = 2, 4, 1, 12, 4
 | |
|     while True:
 | |
|         # Next approximation
 | |
|         p, q, k = k*k, 2*k+1, k+1
 | |
|         a, b, a1, b1 = a1, b1, p*a+q*a1, p*b+q*b1
 | |
|         # Print common digits
 | |
|         d, d1 = a//b, a1//b1
 | |
|         while d == d1:
 | |
|             output(d)
 | |
|             a, a1 = 10*(a%b), 10*(a1%b1)
 | |
|             d, d1 = a//b, a1//b1
 | |
| 
 | |
| def output(d):
 | |
|     # Use write() to avoid spaces between the digits
 | |
|     sys.stdout.write(str(d))
 | |
|     # Flush so the output is seen immediately
 | |
|     sys.stdout.flush()
 | |
| 
 | |
| if __name__ == "__main__":
 | |
|     main()
 |