@@ -20,7 +20,7 @@ def _compute_len(param):
2020 mant , l = math .frexp (float (param ))
2121 bitmask = 1L << l
2222 if bitmask <= param :
23- raise 'FATAL' , '(param, l) = ' + ` param, l`
23+ raise 'FATAL' , '(param, l) = %r' % (( param , l ),)
2424 while l :
2525 bitmask = bitmask >> 1
2626 if param & bitmask :
@@ -167,10 +167,10 @@ def seq(self):
167167
168168 def __repr__ (self ):
169169 ##rprt('<bitvec class instance object>.' + '__repr__()\n')
170- return 'bitvec' + ` self._data, self._len`
170+ return 'bitvec(%r, %r)' % ( self ._data , self ._len )
171171
172172 def __cmp__ (self , other , * rest ):
173- #rprt(`self`+' .__cmp__'+`(other, ) + rest`+'\n' )
173+ #rprt('%r .__cmp__%r\n' % (self, (other, ) + rest) )
174174 if type (other ) != type (self ):
175175 other = apply (bitvec , (other , ) + rest )
176176 #expensive solution... recursive binary, with slicing
@@ -193,16 +193,16 @@ def __cmp__(self, other, *rest):
193193
194194
195195 def __len__ (self ):
196- #rprt(`self`+' .__len__()\n')
196+ #rprt('%r .__len__()\n' % (self,) )
197197 return self ._len
198198
199199 def __getitem__ (self , key ):
200- #rprt(`self`+' .__getitem__('+`key`+' )\n')
200+ #rprt('%r .__getitem__(%r )\n' % (self, key) )
201201 key = _check_key (self ._len , key )
202202 return self ._data & (1L << key ) != 0
203203
204204 def __setitem__ (self , key , value ):
205- #rprt(`self`+' .__setitem__'+`key, value`+' \n')
205+ #rprt('%r .__setitem__(%r, %r) \n' % (self, key, value) )
206206 key = _check_key (self ._len , key )
207207 #_check_value(value)
208208 if value :
@@ -211,14 +211,14 @@ def __setitem__(self, key, value):
211211 self ._data = self ._data & ~ (1L << key )
212212
213213 def __delitem__ (self , key ):
214- #rprt(`self`+' .__delitem__('+`key`+' )\n')
214+ #rprt('%r .__delitem__(%r )\n' % (self, key) )
215215 key = _check_key (self ._len , key )
216216 #el cheapo solution...
217217 self ._data = self [:key ]._data | self [key + 1 :]._data >> key
218218 self ._len = self ._len - 1
219219
220220 def __getslice__ (self , i , j ):
221- #rprt(`self`+' .__getslice__'+`i, j`+' \n')
221+ #rprt('%r .__getslice__(%r, %r) \n' % (self, i, j) )
222222 i , j = _check_slice (self ._len , i , j )
223223 if i >= j :
224224 return BitVec (0L , 0 )
@@ -234,7 +234,7 @@ def __getslice__(self, i, j):
234234 return BitVec (ndata , nlength )
235235
236236 def __setslice__ (self , i , j , sequence , * rest ):
237- #rprt(`self`+' .__setslice__'+`( i, j, sequence) + rest`+'\n' )
237+ #rprt('%s .__setslice__%r\n' % (self, ( i, j, sequence) + rest) )
238238 i , j = _check_slice (self ._len , i , j )
239239 if type (sequence ) != type (self ):
240240 sequence = apply (bitvec , (sequence , ) + rest )
@@ -247,7 +247,7 @@ def __setslice__(self, i, j, sequence, *rest):
247247 self ._len = self ._len - j + i + sequence ._len
248248
249249 def __delslice__ (self , i , j ):
250- #rprt(`self`+' .__delslice__'+`i, j`+' \n')
250+ #rprt('%r .__delslice__(%r, %r) \n' % (self, i, j) )
251251 i , j = _check_slice (self ._len , i , j )
252252 if i == 0 and j == self ._len :
253253 self ._data , self ._len = 0L , 0
@@ -256,13 +256,13 @@ def __delslice__(self, i, j):
256256 self ._len = self ._len - j + i
257257
258258 def __add__ (self , other ):
259- #rprt(`self`+' .__add__('+`other`+' )\n')
259+ #rprt('%r .__add__(%r )\n' % (self, other) )
260260 retval = self .copy ()
261261 retval [self ._len :self ._len ] = other
262262 return retval
263263
264264 def __mul__ (self , multiplier ):
265- #rprt(`self`+' .__mul__('+`multiplier`+' )\n')
265+ #rprt('%r .__mul__(%r )\n' % (self, multiplier) )
266266 if type (multiplier ) != type (0 ):
267267 raise TypeError , 'sequence subscript not int'
268268 if multiplier <= 0 :
@@ -281,7 +281,7 @@ def __mul__(self, multiplier):
281281 return retval
282282
283283 def __and__ (self , otherseq , * rest ):
284- #rprt(`self`+' .__and__'+`(otherseq, ) + rest`+'\n' )
284+ #rprt('%r .__and__%r\n' % (self, (otherseq, ) + rest) )
285285 if type (otherseq ) != type (self ):
286286 otherseq = apply (bitvec , (otherseq , ) + rest )
287287 #sequence is now of our own type
@@ -290,7 +290,7 @@ def __and__(self, otherseq, *rest):
290290
291291
292292 def __xor__ (self , otherseq , * rest ):
293- #rprt(`self`+' .__xor__'+`(otherseq, ) + rest`+'\n' )
293+ #rprt('%r .__xor__%r\n' % (self, (otherseq, ) + rest) )
294294 if type (otherseq ) != type (self ):
295295 otherseq = apply (bitvec , (otherseq , ) + rest )
296296 #sequence is now of our own type
@@ -299,7 +299,7 @@ def __xor__(self, otherseq, *rest):
299299
300300
301301 def __or__ (self , otherseq , * rest ):
302- #rprt(`self`+' .__or__'+`(otherseq, ) + rest`+'\n' )
302+ #rprt('%r .__or__%r\n' % (self, (otherseq, ) + rest) )
303303 if type (otherseq ) != type (self ):
304304 otherseq = apply (bitvec , (otherseq , ) + rest )
305305 #sequence is now of our own type
@@ -308,13 +308,13 @@ def __or__(self, otherseq, *rest):
308308
309309
310310 def __invert__ (self ):
311- #rprt(`self`+' .__invert__()\n')
311+ #rprt('%r .__invert__()\n' % (self,) )
312312 return BitVec (~ self ._data & ((1L << self ._len ) - 1 ), \
313313 self ._len )
314314
315315 def __coerce__ (self , otherseq , * rest ):
316316 #needed for *some* of the arithmetic operations
317- #rprt(`self`+' .__coerce__'+`(otherseq, ) + rest`+'\n' )
317+ #rprt('%r .__coerce__%r\n' % (self, (otherseq, ) + rest) )
318318 if type (otherseq ) != type (self ):
319319 otherseq = apply (bitvec , (otherseq , ) + rest )
320320 return self , otherseq
0 commit comments