[Python-checkins] python/dist/src/Objects longobject.c,1.135,1.136

[tim_one@users.sourceforge.net]

Update of /cvsroot/python/python/dist/src/Objects
In directory usw-pr-cvs1:/tmp/cvs-serv12143/python/Objects

Modified Files:
	longobject.c 
Log Message:
Fixed error in new comment.


Index: longobject.c
===================================================================
RCS file: /cvsroot/python/python/dist/src/Objects/longobject.c,v
retrieving revision 1.135
retrieving revision 1.136
diff -C2 -d -r1.135 -r1.136
*** longobject.c	13 Aug 2002 20:37:51 -0000	1.135
--- longobject.c	13 Aug 2002 20:42:00 -0000	1.136
***************
*** 1787,1796 ****
  laziness was in the "the same is true of ah+al" clause:  ah+al can't actually
  have shift+1 digits + 1 bit unless bsize is odd and asize == bsize.  In that
! case, we actually have (2*shift+1)*2 - shift = 3*shift + 2 allocated digits
! remaining, and that's obviously plenty to hold 2*shift + 2 digits + 2 bits.
  Else (bsize is odd and asize < bsize) ah and al each have at most shift digits,
  so ah+al has at most shift digits + 1 bit, and (ah+al)*(bh+bl) has at most
! 2*shift+1 digits + 2 bits, and again 2*shift+2 digits + 2 bits is
! enough to hold it.
  */
  
--- 1787,1795 ----
  laziness was in the "the same is true of ah+al" clause:  ah+al can't actually
  have shift+1 digits + 1 bit unless bsize is odd and asize == bsize.  In that
! case, we actually have (2*shift+1)*2 - shift = 3*shift+2 allocated digits
! remaining, and that's obviously plenty to hold 2*shift+2 digits + 2 bits.
  Else (bsize is odd and asize < bsize) ah and al each have at most shift digits,
  so ah+al has at most shift digits + 1 bit, and (ah+al)*(bh+bl) has at most
! 2*shift+1 digits + 2 bits, and again 2*shift+2 digits is enough to hold it.
  */