mirror of
https://github.com/cedricbonhomme/Stegano.git
synced 2025-06-27 19:06:12 +02:00
Introduce a new argument in a2bits_list in order to specify the encoding of the string (unicode)
This commit is contained in:
parent
49964d4f16
commit
5f5c07493c
6 changed files with 77 additions and 28 deletions
|
@ -20,9 +20,9 @@
|
|||
# along with this program. If not, see <http://www.gnu.org/licenses/>
|
||||
|
||||
__author__ = "Cedric Bonhomme"
|
||||
__version__ = "$Revision: 0.2 $"
|
||||
__version__ = "$Revision: 0.3 $"
|
||||
__date__ = "$Date: 2010/10/01 $"
|
||||
__revision__ = "$Date: 2016/08/03 $"
|
||||
__revision__ = "$Date: 2017/05/04 $"
|
||||
__license__ = "GPLv3"
|
||||
|
||||
import base64
|
||||
|
@ -30,6 +30,11 @@ import itertools
|
|||
from typing import List, Iterator, Tuple, Union
|
||||
from functools import reduce
|
||||
|
||||
ENCODINGS = {
|
||||
'UTF-8': 8,
|
||||
'UTF-32LE': 32
|
||||
}
|
||||
|
||||
def a2bits(chars: str) -> str:
|
||||
"""Converts a string to its bits representation as a string of 0's and 1's.
|
||||
|
||||
|
@ -38,7 +43,7 @@ def a2bits(chars: str) -> str:
|
|||
"""
|
||||
return bin(reduce(lambda x, y : (x<<8)+y, (ord(c) for c in chars), 1))[3:]
|
||||
|
||||
def a2bits_list(chars: str) -> List[str]:
|
||||
def a2bits_list(chars: str, encoding: str ='UTF-8') -> List[str]:
|
||||
"""Convert a string to its bits representation as a list of 0's and 1's.
|
||||
|
||||
>>> a2bits_list("Hello World!")
|
||||
|
@ -57,8 +62,7 @@ def a2bits_list(chars: str) -> List[str]:
|
|||
>>> "".join(a2bits_list("Hello World!"))
|
||||
'010010000110010101101100011011000110111100100000010101110110111101110010011011000110010000100001'
|
||||
"""
|
||||
#return [bin(ord(x))[2:].rjust(8,"0") for x in chars]
|
||||
return [bin(ord(x))[2:].rjust(32,"0") for x in chars]
|
||||
return [bin(ord(x))[2:].rjust(ENCODINGS[encoding],"0") for x in chars]
|
||||
|
||||
def bs(s: int) -> str:
|
||||
"""Converts an int to its bits representation as a string of 0's and 1's.
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue