Code cleaning

AUTHORS

-Zered <zered@member.fsf.org>
+Yann Weber <yannweb@member.fsf.org>

pybfenc.py

 #!/usr/bin/python
 
 #
-#	Copyright 2014 Zered <zered@member.fsf.org>
+#	Copyright 2014 Yann Weber <yannweb@member.fsf.org>
 #
 #	bfstr is free software: you can redistribute it and/or modify
 #	it under the terms of the GNU General Public License as published by
 				plus = False
 				delta*=-1
 				
-			"""
-			if delta > 1:
-				res+=nb2bf(delta,plus)
-			elif delta == 1:
-				if plus:
-					res+='+'
-				else:
-					res+='-'
-			"""
-			
 			if delta > OPTIDELTAMIN:
 				res+=nb2bf(delta,plus)
 			elif delta > 0:
 	primesP1 = primeFact(delta+1)
 	primesM1 = primeFact(delta-1)
 	
-	"""
-	#print "delta",delta
-	primes = optiPrime(primeFact(delta))
-	#we will test if when adding or substracting 1 is not shorter
-	primesP1 = optiPrime(primeFact(delta+1))
-	primesM1 = optiPrime(primeFact(delta-1))
-	"""
-	
-	
 	p1 = False
 	m1 = False
 	
 	nc = n
 	
 	res = []
-	"""
-	for i in PRIMES:
-		if nc == 0:
-			return res
-		while nc%i == 0:
-			res.append(i)
-			nc/=i
-	"""
 	for i in PRIMES:
 		if nc == 0:
 			return res