bitwise scripts fixed

Author: Mari Wahl

src/bitwise/bit_operations/bit_array.py renamed to src/bitwise/bit_array.py

@@ -1,17 +1,16 @@
-#!/usr/bin/python3
-# mari von steinkirch @2013
-# steinkirch at gmail
+#!/usr/bin/env python
 
-''' Example of how to use a bit array in python as a "counter" dict:
+__author__ = "bt3"
 
+''' Example of how to use a bit array in python as a "counter" dict'''
+
+def print_dupl_ba(l1):
+    '''
     >>> l1 = [0, 1, 2, 3, 4, 2, 6, 7, 8, 9]
     >>> print_dupl_ba(l1)
     2
-'''
-
+    '''
 
-
-def print_dupl_ba(l1):
     bs = bytearray(10)
     for i in range(len(l1)):
         if i == l1[i]:
@@ -22,9 +21,6 @@ def print_dupl_ba(l1):
     return None
 
 
-    
-    
-    
 
 if __name__ == '__main__':
     import doctest

src/bitwise/bit_operations/clear_bits.py

@@ -6,7 +6,8 @@
     1) Start with a mask of 1
     2) Mask with AND
     3) if result (if true): count += 1
-    (obs: to find the int of a bin do int('1001', 2)) and to show in bin do bin(int))
+    (obs: to find the int of a bin do int('1001', 2)) and to show in bin
+    do bin(int))
 '''
 
 
@@ -22,4 +23,3 @@ def find_bit_len(int_num):
     for i in range(17):
         print(find_bit_len(i))
         print i.bit_length()
-        print

src/bitwise/bit_operations/find_bit_len.py

@@ -1,21 +1,22 @@
-#!/usr/bin/python3
-# mari von steinkirch @2013
-# steinkirch at gmail
+#!/usr/bin/env python
+
+__author__ = "bt3"
 
 ''' Find how many 1s in the binary:
     1) Start with a mask of 1
     2) Mask with AND
     3) if result (if true): count += 1
-    (obs: to find the int of a bin do int('1001', 2)) and to show in bin do bin(int))
-    
-    >>> find_how_many_1_in_a_binary(9)
-    2
-
+    (obs: to find the int of a bin do int('1001',
+        2)) and to show in bin do bin(int))
 '''
 
 
-
 def find_how_many_1_in_a_binary(n):
+    '''
+    >>> find_how_many_1_in_a_binary(9)
+    2
+    '''
+
     counter = 0
     while n:
         if n & 1:
@@ -24,9 +25,6 @@ def find_how_many_1_in_a_binary(n):
     return counter
 
 
-    
-    
-    
 
 if __name__ == '__main__':
     import doctest

src/bitwise/bit_operations/get_bit.py

@@ -1,20 +1,22 @@
-#!/usr/bin/python3
-# mari von steinkirch @2013
-# steinkirch at gmail
+#!/usr/bin/env python
+
+__author__ = "bt3"
 
 ''' Given a real number between 0 and 1 (eg: 0.72), this method print the binary
     representation. If the Number cannot be represented accurately in binary, with at
     most 32 chars, print error:
-    
+'''
+
+def get_float_rep(num):
+    '''
     >>> get_float_rep(0.72)
     ('Error 2', '.1011100001010001111010111000010')
     >>> get_float_rep(0.1)
     ('Error 2', '.0001100110011001100110011001100')
     >>> get_float_rep(0.5)
     '.1'
-'''
+    '''
 
-def get_float_rep(num):
     if num >= 1 or num <= 0: return 'Error 1'
     result = '.'
     while num:
@@ -27,7 +29,7 @@ def get_float_rep(num):
             result += '0'
             num = r
     return result
-    
+
 
 if __name__ == '__main__':
     import doctest