\n",
"Note:\n",
"\n",
"Be sure to remember the quotes around the hex and binary strings.\n",
"If you forget them you would just have an ordinary Python integer, which would instead create a bitstring of that many '0' bits.\n",
"For example `0xff01` is the same as the base-10 number 65281, so `BitArray(0xff01)` would consist of 65281 zero bits!\n",
"\n",
"\n",
"There are lots of things we can do with our new bitstrings, the simplest of which is just to print them:"
]
},
{
"cell_type": "code",
"execution_count": 3,
"metadata": {},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"0xff01\n",
"0b110\n"
]
}
],
"source": [
"print(a)\n",
"print(b)"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"Now you would be forgiven for thinking that the strings that we used to create the two bitstrings had just been stored to be given back when printed, but that's not the case.\n",
"Every bitstring should be considered just as a sequence of bits.\n",
"As we'll see there are lots of ways to create and manipulate them, but they have no memory of how they were created.\n",
"When they are printed they just pick the simplest hex or binary representation of themselves.\n",
"If you prefer you can pick the representation that you want:"
]
},
{
"cell_type": "code",
"execution_count": 4,
"metadata": {},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"1111111100000001\n",
"6\n",
"-2\n",
"b'\\xff\\x01'\n"
]
}
],
"source": [
"print(a.bin)\n",
"print(b.oct)\n",
"print(b.int)\n",
"print(a.bytes)"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"\n",
"There are a few things to note here:\n",
"\n",
"* To get the different interpretations of the binary data we use properties such as `bin`, `hex`, `oct`, `int` and `bytes`. You can probably guess what these all mean, but you don't need to know quite yet. The properties are calculated when you ask for them rather than being stored as part of the object itself.\n",
"* Many of the interpretations have single letter aliases, and interpretations can also have bit lengths appended to them. This allows expressions such as `a.u32 = 900` which will set `a` to the 32 bit representation of the unsigned integer `900`. You're not restricted to the usual bit lengths, so something like `a.i5 = -8` will work as well.\n",
"\n",
"Great - let's try some more:"
]
},
{
"cell_type": "code",
"execution_count": 5,
"metadata": {},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"Cannot convert to hex unambiguously - not a multiple of 4 bits long.\n"
]
}
],
"source": [
"try:\n",
" b.hex\n",
"except bitstring.InterpretError as e:\n",
" print(e)"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"\n",
"Oh dear - this throws a `bitstring.InterpretError` error.\n",
"The problem we have here is that `b` is 3 bits long, whereas each hex digit represents 4 bits.\n",
"This means that there is no unambiguous way to represent it in hexadecimal.\n",
"There are similar restrictions on other interpretations (octal must be a multiple of 3 bits, bytes a multiple of 8 bits etc.)\n",
"\n",
"An exception is raised rather than trying to guess the best hex representation as there are a multitude of ways to convert to hex.\n",
"I occasionally get asked why it doesn't just do the 'obvious' conversion, which is invariably what that person expects from his own field of work.\n",
"This could be truncating bits at the start or end, or padding at the start or end with either zeros or ones.\n",
"Rather than try to guess what is meant we just raise an exception - if you want a particular behaviour then write it explicitly:\n"
]
},
{
"cell_type": "code",
"execution_count": 6,
"metadata": {},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"c\n",
"6\n"
]
}
],
"source": [
"print((b + [0]).hex)\n",
"print(([0] + b).hex)"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"\n",
"Here we've added a zero bit first to the end and then to the start.\n",
"Don't worry too much about how it all works, but just to give you a taster the zero bit `[0]` could also have been written as `BitArray([0])`, `BitArray('0b0')`, `BitArray(bin='0')`, `'0b0'` or just `1` (this final option isn't a typo, it means construct a bitstring of length one, with all the bits initialised to zero - it does look a bit confusing though which is why I prefer `[0]` and `[1]` to represent single bits).\n",
"Take a look at [the auto initialiser](https://bitstring.readthedocs.io/en/stable/creation.html#the-auto-initialiser) for more details."
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Modifying bitstrings\n",
"\n",
"A `BitArray` can be treated just like a list of bits. You can slice it, delete sections, insert new bits and more using standard index notation:"
]
},
{
"cell_type": "code",
"execution_count": 7,
"metadata": {},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"0b111110\n",
"0b1111111100\n"
]
}
],
"source": [
"print(a[3:9])\n",
"del a[-6:]\n",
"print(a)"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"\n",
"The slicing works just as it does for other containers, so the deletion above removes the final six bits.\n",
"\n",
"If you ask for a single item, rather than a slice, a boolean is returned. Naturally enough `1` bits are `True` whereas `0` bits are `False`."
]
},
{
"cell_type": "code",
"execution_count": 8,
"metadata": {},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"True\n",
"False\n"
]
}
],
"source": [
"print(a[0])\n",
"print(a[-1])"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"\n",
"To join together bitstrings you can use a variety of methods, including `append`, `prepend`, `insert`, and plain `+` or `+=` operations::"
]
},
{
"cell_type": "code",
"execution_count": 9,
"metadata": {},
"outputs": [],
"source": [
"a.prepend('0b01')\n",
"a.append('0o7')\n",
"a += '0x06'"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"\n",
"Here we first put two bits at the start of `a`, then three bits on the end (a single octal digit) and finally another byte (two hex digits) on the end.\n",
"\n",
"Note how we are just using ordinary strings to specify the new bitstrings we are adding.\n",
"These get converted automatically to the right sequence of bits.\n",
"\n",
"\n",
"Note:\n",
" The length in bits of bitstrings specified with strings depends on the number of characters, including leading zeros.\n",
" So each hex character is four bits, each octal character three bits and each binary character one bit.\n",
"
"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Finding and replacing\n",
"\n",
"A `find` is provided to search for bit patterns within a bitstring.\n",
"You can choose whether to search only on byte boundaries or at any bit position:"
]
},
{
"cell_type": "code",
"execution_count": 10,
"metadata": {},
"outputs": [
{
"data": {
"text/plain": "(3,)"
},
"execution_count": 10,
"metadata": {},
"output_type": "execute_result"
}
],
"source": [
"a = BitArray('0xa9f')\n",
"a.find('0x4f')"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"Here we have found the `0x4f` byte in our bitstring, though it wasn't obvious from the hexadecimal as it was at bit position 3.\n",
"To see this clearer consider this equality:\n"
]
},
{
"cell_type": "code",
"execution_count": 11,
"metadata": {},
"outputs": [
{
"data": {
"text/plain": "True"
},
"execution_count": 11,
"metadata": {},
"output_type": "execute_result"
}
],
"source": [
"a == '0b101, 0x4f, 0b1'"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"in which we've broken the bitstring into three parts to show the found byte.\n",
"This also illustrates using commas to join bitstring sections."
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Constructing a bitstring\n",
"\n",
"Let's say you have a specification for a binary file type (or maybe a packet specification etc.) and you want to create a bitstring quickly and easily in Python.\n",
"For this example I'm going to use a header from the MPEG-2 video standard.\n",
"Here's how the header is described in the standard:\n",
"\n",
"|sequence_header() | No. of bits | Mnemonic|\n",
"|-----------------------------------|--------------|----------|\n",
"|sequence_header_code | 32 | bslbf |\n",
"|horizontal_size_value | 12 | uimsbf |\n",
"|vertical_size_value | 12 | uimsbf |\n",
"|aspect_ratio_information | 4 | uimsbf |\n",
"|frame_rate_code | 4 | uimsbf |\n",
"|bit_rate_value | 18 | uimsbf |\n",
"|marker_bit | 1 | bslbf |\n",
"|vbv_buffer_size_value | 10 | uimsbf |\n",
"|constrained_parameters_flag | 1 | bslbf |\n",
"|load_intra_quantiser_matrix | 1 | uimsbf |\n",
"|if (load_intra_quantiser_matrix) |\n",
"|{ intra_quantiser_matrix[64] } | 8*64 | uimsbf |\n",
"|load_non_intra_quantiser_matrix | 1 | uimsbf |\n",
"|if (load_non_intra_quantiser_matrix) |\n",
"|{ non_intra_quantiser_matrix[64] } | 8*64 | uimsbf |\n",
"|next_start_code() | | |\n",
"\n",
"The mnemonics mean things like uimsbf = 'Unsigned integer, most significant bit first'.\n",
"\n",
"So to create a sequence_header for your particular stream with width of 352 and height of 288 you could start like this:\n"
]
},
{
"cell_type": "code",
"execution_count": 12,
"metadata": {},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"000001b3160120\n"
]
}
],
"source": [
"s = BitArray()\n",
"s.append('0x000001b3') # the sequence_header_code\n",
"s.append('uint12=352') # 12 bit unsigned integer\n",
"s.append('uint12=288')\n",
"print(s.hex)"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"which is fine, but if you wanted to be a bit more concise you could just write"
]
},
{
"cell_type": "code",
"execution_count": 13,
"metadata": {},
"outputs": [],
"source": [
"s = BitArray('0x000001b3, uint12=352, uint12=288')"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"This is better, but it might not be a good idea to have the width and height hard-wired in like that.\n",
"We can make it more flexible by using a format string and the `pack` function:"
]
},
{
"cell_type": "code",
"execution_count": 14,
"metadata": {},
"outputs": [],
"source": [
"width, height = 352, 288\n",
"s = bitstring.pack('0x000001b3, 2*u12', width, height)"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"where we have also used `2*u12` as shorthand for `uint12, uint12`.\n",
"\n",
"The [`pack`](https://bitstring.readthedocs.io/en/stable/functions.html#bitstring.pack) function can also take a dictionary as a parameter which can replace the tokens in the format string.\n",
"For example:"
]
},
{
"cell_type": "code",
"execution_count": 15,
"metadata": {},
"outputs": [
{
"data": {
"text/plain": "\"BitStream('0x000001b31601201')\""
},
"execution_count": 15,
"metadata": {},
"output_type": "execute_result"
}
],
"source": [
"fmt = 'sequence_header_code, \\\n",
" uint12=horizontal_size_value, \\\n",
" uint12=vertical_size_value, \\\n",
" uint4=aspect_ratio_information, '\n",
" # ...\n",
"d = {'sequence_header_code': '0x000001b3',\n",
" 'horizontal_size_value': 352,\n",
" 'vertical_size_value': 288,\n",
" 'aspect_ratio_information': 1,\n",
" # ...\n",
" }\n",
"\n",
"s = bitstring.pack(fmt, **d)\n",
"repr(s)"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Parsing bitstreams\n",
"\n",
"You might have noticed that `pack` returned a `BitStream` rather than a `BitArray`.\n",
"This isn't a problem as the `BitStream` class just adds a few stream-like qualities to `BitArray` which we'll take a quick look at here.\n",
"\n",
"The stream-ness of this object is via its bit position, and various reading and peeking methods.\n",
"First let's try a read or two, and see how this affects the bit position:\n"
]
},
{
"cell_type": "code",
"execution_count": 16,
"metadata": {},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"0\n",
"BitStream('0x000001')\n",
"24\n",
"b3\n",
"32\n"
]
}
],
"source": [
"print(s.pos)\n",
"print(repr(s.read(24)))\n",
"print(s.pos)\n",
"print(s.read('hex8'))\n",
"print(s.pos)"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"First we read 24 bits, which returned a new `BitStream` object, then we used a format string to read 8 bits interpreted as a hexadecimal string.\n",
"We know that the next two sets of 12 bits were created from integers, so to read them back we can say"
]
},
{
"cell_type": "code",
"execution_count": 17,
"metadata": {},
"outputs": [
{
"data": {
"text/plain": "[352, 288]"
},
"execution_count": 17,
"metadata": {},
"output_type": "execute_result"
}
],
"source": [
"s.readlist('2*u12')"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"\n",
"If you don't want to use a bitstream then you can always use [`unpack`](https://bitstring.readthedocs.io/en/stable/bits.html#bitstring.Bits.unpack).\n",
"This takes much the same form as [`readlist`](https://bitstring.readthedocs.io/en/stable/constbitstream.html#bitstring.ConstBitStream.readlist) except it just unpacks from the start of the bitstring.\n",
"For example:"
]
},
{
"cell_type": "code",
"execution_count": 18,
"metadata": {},
"outputs": [
{
"data": {
"text/plain": "[b'\\x00\\x00\\x01\\xb3', 352, 288, 1]"
},
"execution_count": 18,
"metadata": {},
"output_type": "execute_result"
}
],
"source": [
"s.unpack('bytes4, 2*u12, uint4')"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"# Worked Examples\n",
"\n",
"Below are a few examples of using the bitstring module, as I always find that a good example can help more than a lengthy reference manual."
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Hamming distance\n",
"\n",
"The Hamming distance between two bitstrings is the number of bit positions in which the two bitstrings differ.\n",
"So for example the distance between `0b00110` and `0b01100` is 2 as the second and fourth bits are different.\n",
"\n",
"Let's write a function that calculates the Hamming weight of two bitstrings.\n"
]
},
{
"cell_type": "code",
"execution_count": 19,
"metadata": {},
"outputs": [
{
"data": {
"text/plain": "2"
},
"execution_count": 19,
"metadata": {},
"output_type": "execute_result"
}
],
"source": [
"def hamming_weight(a, b):\n",
" return (BitArray(a)^b).count(True)\n",
"\n",
"hamming_weight('0b00110', '0b01100')"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"Er, that's it. The `^` is a bit-wise exclusive or, which means that the bits in `a^b` are only set if they differ in `a` and `b`.\n",
"The `count` method just counts the number of 1 (or True) bits."
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Sieve of Eratosthenes\n",
"\n",
"The sieve of Eratosthenes is an ancient (and _very_ inefficient) method of finding prime numbers.\n",
"The algorithm starts with the number 2 (which is prime) and marks all of its multiples as not prime, it then continues with the next unmarked integer (which will also be prime) and marks all of its multiples as not prime.\n",
"\n",
"[](https://commons.wikimedia.org/wiki/File:Sieve_of_Eratosthenes_animation.svg)\n",
"\n",
"So to find all primes under a hundred million you could write:"
]
},
{
"cell_type": "code",
"execution_count": 20,
"metadata": {},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"There are 5761455 primes less than 100000000,\n",
"the largest one of which is 99999989\n",
"and there are 440312 twin primes.\n"
]
}
],
"source": [
"# Create a BitArray with a hundred million 'one' bits\n",
"limit = 100_000_000\n",
"is_prime = BitArray(limit)\n",
"is_prime.set(True)\n",
"# Manually set 0 and 1 to be not prime.\n",
"is_prime.set(False, [0, 1])\n",
"# For every other integer, if it's set as prime then unset all of its multiples\n",
"for i in range(2, math.ceil(math.sqrt(limit))):\n",
" if is_prime[i]:\n",
" is_prime.set(False, range(i*i, limit, i))\n",
"\n",
"print(f\"There are {is_prime.count(True)} primes less than {limit},\")\n",
"print(f\"the largest one of which is {is_prime.rfind('0b1')[0]}\")\n",
"print(f\"and there are {len(list(is_prime.findall('0b101')))} twin primes.\")"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"We find the largest prime with a reverse find ([`rfind`](https://bitstring.readthedocs.io/en/stable/bits.html#bitstring.Bits.rfind)) looking for a single set bit.\n",
"For twin primes (primes which differ by 2) we use [`findall`](https://bitstring.readthedocs.io/en/stable/bits.html#bitstring.Bits.findall) to look for the binary sequence `101` which returns a generator for the bit positions.\n",
"\n",
"To see the pattern of the primes we could use the [pretty print](https://bitstring.readthedocs.io/en/stable/bits.html#bitstring.Bits.pp) method:"
]
},
{
"cell_type": "code",
"execution_count": 21,
"metadata": {},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
" 0: 00110101 00010100 01010001 00000101 00000100 01010001 35 14 51 05 04 51\n",
" 48: 00000100 00010100 00010001 01000001 00010000 01000000 04 14 11 41 10 40\n",
" 96: 01000101 00010100 01000000 00000001 00010000 01010000 45 14 40 01 10 50\n",
" 144: 00000101 00000100 00010001 00000100 00010100 00000001 05 04 11 04 14 01\n",
" 192: 01000101 00000000 00010000 00000001 00010100 01000001 45 00 10 01 14 41\n",
" 240: 01000000 00010000 01000001 00000101 00000100 01010000 40 10 41 05 04 50\n",
" 288: 00000100 00000000 00010001 01000100 00000000 00010000 04 00 11 44 00 10\n",
" 336: 01000000 00010100 01000001 00000001 00000100 00010001 40 14 41 01 04 11\n",
" 384: 00000100 00000100 01000000 01000000 00010100 00000001 04 04 40 40 14 01\n",
" 432: 01000001 00010000 01000000 01000101 00010000 00000001 41 10 40 45 10 01\n",
" 480: 00000001 00010000 00010001 00000100 00000000 01010000 01 10 11 04 00 50\n",
" 528: 00000000 00000100 00010000 00000100 00010000 01010000 00 04 10 04 10 50\n",
" 576: 01000000 00010000 01000001 01000001 00000100 01010000 40 10 41 41 04 50\n",
" 624: 00000001 00000000 01010001 00000100 00010100 00000000 01 00 51 04 14 00\n",
" 672: 01000100 00010000 00010000 00000100 00000100 00000001 44 10 10 04 04 01\n",
" 720: 00000001 00000100 00010001 00000001 00000100 01000000 01 04 11 01 04 40\n",
" 768: 01000100 00000000 00010000 00000100 00000000 01010000 44 00 10 04 00 50\n",
" 816: 00000101 00010100 00000001 00000000 00000100 01010001 05 14 01 00 04 51\n",
" 864: 00000000 00000100 01010001 00000000 00000000 00010001 00 04 51 00 00 11\n",
" 912: 00000001 00000000 01000000 01000100 00010000 01000000 01 00 40 44 10 40\n",
" 960: 00000001 00010000 01000001 00000001 00000100 01 10 41 01 04 \n"
]
}
],
"source": [
"is_prime[0:1000].pp('bin, hex', width=88)"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"I'll leave optimising the algorithm as an exercise for the reader, but it illustrates both bit checking and setting.\n",
"One reason you might want to use a bitstring for this purpose (instead of a plain list for example) is that the million bits only take up a million bits in memory, whereas for a list of integers it would be much more."
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Next Steps\n",
"\n",
"There is fairly extensive [documentation](https://bitstring.readthedocs.io/en/stable/) available.\n",
"The [Quick Reference](https://bitstring.readthedocs.io/en/stable/quick_ref.html) is a good place to quickly see what's available.\n",
"\n",
"For any discussions / bug reports / feature requests see the homepage on [GitHub](https://github.com/scott-griffiths/bitstring/)."
]
}
],
"metadata": {
"kernelspec": {
"display_name": "Python 3 (ipykernel)",
"language": "python",
"name": "python3"
},
"language_info": {
"codemirror_mode": {
"name": "ipython",
"version": 3
},
"file_extension": ".py",
"mimetype": "text/x-python",
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython3",
"version": "3.11.0"
}
},
"nbformat": 4,
"nbformat_minor": 1
}
bitstring-bitstring-4.1.4/pyproject.toml 0000664 0000000 0000000 00000002202 14531676336 0020456 0 ustar 00root root 0000000 0000000 [build-system]
requires = ["setuptools>=61"]
build-backend = "setuptools.build_meta"
[project]
name = "bitstring"
version = "4.1.4"
authors = [
{ name="Scott Griffiths", email="dr.scottgriffiths@gmail.com" },
]
description = "Simple construction, analysis and modification of binary data."
readme = "README.md"
requires-python = ">=3.7"
classifiers = [
"Development Status :: 5 - Production/Stable",
"Intended Audience :: Developers",
"Operating System :: OS Independent",
"Programming Language :: Python :: 3",
"Programming Language :: Python :: 3.7",
"Programming Language :: Python :: 3.8",
"Programming Language :: Python :: 3.9",
"Programming Language :: Python :: 3.10",
"Programming Language :: Python :: 3.11",
"License :: OSI Approved :: MIT License",
"Topic :: Software Development :: Libraries :: Python Modules",
]
keywords = ["binary", "bitarray", "bitvector", "bitfield"]
dependencies = [
"bitarray >= 2.8.0, < 3.0.0",
]
[project.urls]
homepage = "https://github.com/scott-griffiths/bitstring"
documentation = "https://bitstring.readthedocs.io/"
[tool.setuptools]
packages = ["bitstring"]
bitstring-bitstring-4.1.4/release_notes.txt 0000664 0000000 0000000 00000177167 14531676336 0021162 0 ustar 00root root 0000000 0000000 --------------------------------
bitstring module version history
--------------------------------
----------------------------
November 2023: version 4.1.4
----------------------------
Fixing a regression introduced in 4.1.3
* 'bytes' token can't be used without explicit length. Bug #303.
----------------------------
November 2023: version 4.1.3
----------------------------
A maintenance release, with some changes to the beta features introduced in 4.1.
* Removed a couple of files that accidentally got included in the previous release. Bug #293.
* The 8-bit float formats have been renamed 'e4m3float' and 'e5m2float'.
* Some refactoring and performance optimizations.
--------------------------------------
September 2023: version 4.1.2 released
--------------------------------------
Another maintenance release. Once again some small changes to the 'beta' Array class,
plus new Array functionality.
* Fix for the module command-line usage. Bug #290.
* Fix for when creating bitstrings from memoryview objects.
* Renamed the 'fmt' parameter for Arrays to 'dtype'.
* More Array operator coverage.
* Added operators that act on two Arrays of the same size.
* Added comparison operators for Arrays that return an Array of bools.
* Added Array.equals method as == will now return an Array (see above item).
* Added astype() method for Arrays to easily cast to a new dtype.
-----------------------------------
August 2023: version 4.1.1 released
-----------------------------------
A maintenance release, with some changes to the Array class which is still in 'beta'.
* bitarray dependency now pinned to ">=2.8.0, <3.0.0" rather than a specific version. Bug #283.
* Fix for using numpy integers as integer parameters. Bug #286.
* Removed ability to extend an Array with the '+' operator. Use the 'extend' method instead.
* Improvements when pretty-printing the Array.
* Array.count() can now count 'nan' values for floating point types.
-----------------------------------
August 2023: version 4.1.0 released
-----------------------------------
This has turned into a suprisingly big release, with a major refactor and a brand new
class (the first for 12 years!) There are also a couple of small possibly breaking changes
detailed below, in particular 'auto' initialising bitstrings from integers is now disallowed.
* Speed increased with bitarray dependency.
The major weakness of bitstring has been its poor performance for computationally
intensive tasks relative to lower level alternatives. This was principally due to
relying on pure Python code to achieve things that the base language often didn't have
fast ways of doing.
This release starts to address that problem with a fairly extensive rewrite to replace
much of the pure Python low-level bit operations with methods from the bitarray package.
This is a package that does many of the same things as bitstring, and the two packages
have co-existed for a long time. While bitarray doesn't have all of the options and
facilities of bitstring it has the advantage of being very fast as it is implemented in C.
By replacing the internal datatypes I can speed up bitstring's operations while keeping
the same API.
Huge kudos to Ilan Schnell for all his work on bitarray.
* New Array class for homogeneous data (beta)
If your data is all of the same type you can make use of the new Array class, which
mirrors much of the functionality of the standard array.array type, but doesn't restrict
you to just a dozen formats.
>>> from bitstring import Array
>>> a = Array('uint7', [9, 100, 3, 1])
>>> a.data
BitArray('0x1390181')
>>> b = Array('float16', a.tolist())
>>> b.append(0.25)
>>> b.tobytes()
b'H\x80V@B\x00<\x004\x00'
>>> b.tolist()
[9.0, 100.0, 3.0, 1.0, 0.25]
The data is stored efficiently in a BitArray object, and you can manipulate both the
data and the Array format freely. See the main documentation for more details. Note that
this feature carries the 'beta' flag so may change in future point versions.
Other changes:
* Added two new floating point interpretations: float8_143 and float8_152. These are 8-bit
floating point formats, with very limited range and precision, but useful in some fields,
particularly machine learning. This is an experimental feature - the formats haven't
even been standardised yet.
>>> a = Bits(float8_143=16.5)
>>> a.bin
'01100000'
>>> a.float8_143
16.0
* Auto initialistion from ints has been removed and now raises a TypeError. Creating a
bitstring from an int still creates a zeroed bitstring of that length but ints won't
be promoted to bitstrings as that has been a constant source of errors and confusion.
>>> a = BitArray(100) # Fine - create with 100 zeroed bits
>>> a += 0xff # TypeError - previously this would have appended 0xff (=255) zero bits.
>>> a += '0xff' # Probably what was meant - append eight '1' bits.
>>> a += Bits(255) # Fine, append 255 zero bits.
This is a breaking change, but it breaks loudly with an exception, it is easily recoded,
and it removes a confusing wrinkle.
* Explicitly specifying the 'auto' parameter is now disallowed rather than discouraged.
It was always meant to be a positional-only parameter (and will be once I can drop
Python 3.7 support) but for now it's renamed to '__auto'. In the unlikely event
this breaks code, the fix should be just to delete the 'auto=' if it's already the
first parameter.
>>> s = Bits(auto='0xff') # Now raises a CreationError
>>> s = Bits('0xff') # Fine, as always
* Deleting, replacing or inserting into a bitstring resets the bit position to 0 if the
bitstring's length has been changed. Previously the bit position was adjusted but
this was not well defined.
* Only empty bitstring are now considered False in a boolean sense. Previously s was
False is no bits in s were set to 1, but this goes against what it means to be a
container in Python so I consider this to be a bug, even if it was documented. I'm
guessing it's related to __nonzero__ in Python 2 becoming __bool__ in Python 3, and
it's never been fixed before now.
* Casting to bytes now behaves as expected, so that bytes(s) gives the same result as
s.tobytes(). Previously it created a byte per bit.
* Pretty printing with the 'bytes' format now uses characters from the 'Latin Extended-A'
unicode block for non-ASCII and unprintable characters instead of replacing them with '.'
* When using struct-like codes you can now use '=' instead of '@' to signify native-
endianness. They behave identically, but the new '=' is now preferred.
* More fixes for LSB0 mode. There are now no known issues with this feature.
----------------------------------
April 2023: version 4.0.2 released
----------------------------------
A maintenance release.
* Added py.typed file and converted the module to a package to let mypy find type
annotations. Bug 248.
* Fix to shifting operations when using LSB0 mode. Bug 251.
* A few more fixes for LSB0 mode.
* Improved LSB0 documentation.
* Added build-system section to pyproject.toml. Bug 243.
* Rewrote the walkthrough documentation as a jupyter notebook.
* Updated the project's logo.
-------------------------------------
November 2022: version 4.0.1 released
-------------------------------------
This is a major release which drops support for Python 2.7 and has a new minimum
requirement of Python 3.7. Around 95% of downloads satisfy this - users of
older versions can continue to use bitstring 3.1, which will still be supported
with fixes, but no new features.
Other breaking changes are minimal, and there are a few cool features added.
Breaking changes:
* Minimum supported Python version is now Python 3.7.
* Removed ConstBitArray and BitString class aliases. Use Bits and BitStream instead.
* The cut() method will now also yield the final bits of a bitstring, even if they
are shorter than the requested cut size.
* Removed default uint interpretation. This wasn't being applied uniformly - default
is now always to return a bitstring object of the given length and not to interpret
it as a uint. Bug 220.
* If an overwrite goes beyond the end of the bitstring it will now extend the bitstring
rather than raise an exception. Bug 148.
New features and improvements:
* Type hints added throughout the code.
* Underscores are now allowed in strings representing number literals.
* The copy() method now works on Bits as well as BitArray objects.
* The experimental command-line feature is now official. Command-line
parameters are concatenated and a bitstring created from them. If
the final parameter is either an interpretation string or ends with
a '.' followed by an interpretation string then that interpretation
of the bitstring will be used when printing it.
$ python -m bitstring int:16=-400
0xfe70
$ python -m bitstring float:32=0.2 bin
00111110010011001100110011001101
* New pp() method that pretty-prints the bitstring in various formats - useful
especially in interactive sessions. Thanks to Omer Barak for the suggestion
and discussion.
>>> s.pp()
0: 10001000 01110110 10001110 01110110 11111000 01110110 10000111 00101000
64: 01110010 11111001 10000111 10011000 11110111 10011110 10000111 11111101
128: 11111001 10001100 01111111 10111100 10111111 11011011 11101011 11111011
192: 1100
>>> s.pp('bin, hex')
0: 10001000 01110110 10001110 01110110 11111000 01110110 88 76 8e 76 f8 76
48: 10000111 00101000 01110010 11111001 10000111 10011000 87 28 72 f9 87 98
96: 11110111 10011110 10000111 11111101 11111001 10001100 f7 9e 87 fd f9 8c
144: 01111111 10111100 10111111 11011011 11101011 11111011 7f bc bf db eb fb
192: 1100 c
* Shorter and more versatile properties. The bin, oct, hex, float, uint and int
properties can now be shortened to just their first letter. They can also have
a length in bits after them - allowing Rust-like data types. ::
>>> s = BitArray('0x44961000')
>>> s.h
'44961000'
>>> s.f32
1200.5
>>> s.u
1150685184
>>> s.i7 = -60
>>> s.b
'1000100'
>>> t = Bits('u12=160, u12=120, b=100')
* Other types with bit lengths can also be used as properties ::
>>> s.floatle64 = 10.511
* A colon is no longer required in format strings before a bit length. So for
example `Bits('int:15=-101')` could be written as `Bits('int15=-101')`. This is
now the preferred usage in the documentation except where the colon improves
readability.
* Support for IEEE 16 bit floats. Floating point types can now be 16 bits long as well
as 32 and 64 bits. This is using the 'e' format from the struct module.
* Support for bfloats. This is a specialised 16-bit floating point format
mostly used in machine learning. It's essentially a truncated IEEE 32-bit
format that keeps its range but only has a couple of signficant figures of
accuracy.
---------------------------------------
July 20th 2021: version 3.1.9 released
---------------------------------------
(version 3.1.8 was pulled due to serious issues)
Another maintenance release.
* Fixed a couple of outdated results in the readme (Issue 214).
* Some more documentation tidying.
* Turned off some debug code by default.
* Fixed a couple of failing tests in different Python versions.
* Fix for consistent pos initialisation semantics for different types.
* Change to allow wheels to be uploaded to PyPI.
* More work for LSB0 mode, but still not finished or documented (sorry).
---------------------------------------
May 5th 2020: version 3.1.7 released
---------------------------------------
This is a maintenance release with a few bug fixes plus an experimental
feature to allow bits to be indexed in the opposite direction.
* Fixing del not working correctly when stop value negative (Issue 201)
* Removed deprecated direct import of ABC from collections module (Issue 196)
* Tested and added explicit support for Python 3.7 and 3.8. (Issue 193)
* Fixing a few stale links to documentation. (Issue 194)
* Allowing initialisation with an io.BytesIO object. (Issue 189)
Experimental LSB0 mode
----------------------
This feature allows bitstring to use Least Significant Bit Zero
(LSB0) bit numbering; that is the final bit in the bitstring will
be bit 0, and the first bit will be bit (n-1), rather than the
other way around. LSB0 is a more natural numbering
system in many fields, but is the opposite to Most Significant Bit
Zero (MSB0) numbering which is the natural option when thinking of
bitstrings as standard Python containers.
To switch from the default MSB0, use the module level function
>>> bitstring.set_lsb0(True)
Getting and setting bits should work in this release, as will some
other methods. Many other methods are not tested yet and might not
work as expected. This is mostly a release to get feedback before
finalising the interface.
Slicing is still done with the start bit smaller than the end bit.
For example:
>>> s = Bits('0b000000111')
>>> s[0:5]
Bits('0b00111')
>>> s[0]
True
Negative indices work as (hopefully) you'd expect, with the first stored
bit being `s[-1]` and the final stored bit being `s[-n]`.
See https://github.com/scott-griffiths/bitstring/issues/156 for
discussions and to add any further comments.
---------------------------------------
July 9th 2019: version 3.1.6 released
---------------------------------------
A long overdue maintenance release with some fixes.
* Fixed immutability bug. Bug 176.
* Fixed failure of `__contains__` in some circumstances. Bug 180.
* Better handling of open files. Bug 186.
* Better Python 2/3 check.
* Making unit tests easier to run.
* Allowing length of 1 to be specified for bools. (Thanks to LemonPi)
---------------------------------------
May 17th 2016: version 3.1.5 released
---------------------------------------
* Support initialisation from an array.
* Added a separate LICENSE file.
---------------------------------------
March 19th 2016: version 3.1.4 released
---------------------------------------
This is another bug fix release.
* Fix for bitstring types when created directly from other bitstring types.
* Updating contact, website details.
---------------------------------------
March 4th 2014: version 3.1.3 released
---------------------------------------
This is another bug fix release.
* Fix for problem with prepend for bitstrings with byte offsets in their data store.
---------------------------------------
April 18th 2013: version 3.1.2 released
---------------------------------------
This is another bug fix release.
* Fix for problem where unpacking bytes would by eight times too long
---------------------------------------
March 21st 2013: version 3.1.1 released
---------------------------------------
This is a bug fix release.
* Fix for problem where concatenating bitstrings sometimes modified method's arguments
------------------------------------------
February 26th 2013: version 3.1.0 released
------------------------------------------
This is a minor release with a couple of new features and some bug fixes.
New 'pad' token
---------------
This token can be used in reads and when packing/unpacking to indicate that
you don't care about the contents of these bits. Any padding bits will just
be skipped over when reading/unpacking or zero-filled when packing.
>>> a, b = s.readlist('pad:5, uint:3, pad:1, uint:3')
Here only two items are returned in the list - the padding bits are ignored.
New clear and copy convenience methods
--------------------------------------
These methods have been introduced in Python 3.3 for lists and bytearrays,
as more obvious ways of clearing and copying, and we mirror that change here.
t = s.copy() is equivalent to t = s[:], and s.clear() is equivalent to del s[:].
Other changes
-------------
* Some bug fixes.
-----------------------------------------
February 7th 2012: version 3.0.2 released
-----------------------------------------
This is a minor update that fixes a few bugs.
* Fix for subclasses of bitstring classes behaving strangely (Issue 121).
* Fix for excessive memory usage in rare cases (Issue 120).
* Fixes for slicing edge cases.
There has also been a reorganisation of the code to return it to a single
'bitstring.py' file rather than the package that has been used for the past
several releases. This change shouldn't affect users directly.
------------------------------------------
November 21st 2011: version 3.0.1 released
------------------------------------------
This release fixed a small but very visible bug in bitstring printing.
------------------------------------------
November 21st 2011: version 3.0.0 released
------------------------------------------
This is a major release which breaks backward compatibility in a few places.
Backwardly incompatible changes
===============================
Hex, oct and bin properties don't have leading 0x, 0o and 0b
------------------------------------------------------------
If you ask for the hex, octal or binary representations of a bitstring then
they will no longer be prefixed with '0x', 0o' or '0b'. This was done as it
was noticed that the first thing a lot of user code does after getting these
representations was to cut off the first two characters before further
processing.
>>> a = BitArray('0x123')
>>> a.hex, a.oct, a.bin
('123', '0443', '000100100011')
Previously this would have returned ('0x123', '0o0443', '0b000100100011')
This change might require some recoding, but it should all be simplifications.
ConstBitArray renamed to Bits
-----------------------------
Previously Bits was an alias for ConstBitStream (for backward compatibility).
This has now changed so that Bits and BitArray loosely correspond to the
built-in types bytes and bytearray.
If you were using streaming/reading methods on a Bits object then you will
have to change it to a ConstBitStream.
The ConstBitArray name is kept as an alias for Bits.
Stepping in slices has conventional meaning
-------------------------------------------
The step parameter in __getitem__, __setitem__ and __delitem__ used to act
as a multiplier for the start and stop parameters. No one seemed to use it
though and so it has now reverted to the conventional meaning for containers.
If you are using step then recoding is simple: s[a:b:c] becomes s[a*c:b*c].
Some examples of the new usage:
>>> s = BitArray('0x0000')
s[::4] = [1, 1, 1, 1]
>>> s.hex
'8888'
>>> del s[8::2]
>>> s.hex
'880'
New features
============
New readto method
-----------------
This method is a mix between a find and a read - it searches for a bitstring
and then reads up to and including it. For example:
>>> s = ConstBitStream('0x47000102034704050647')
>>> s.readto('0x47', bytealigned=True)
BitStream('0x47')
>>> s.readto('0x47', bytealigned=True)
BitStream('0x0001020347')
>>> s.readto('0x47', bytealigned=True)
BitStream('0x04050647')
pack function accepts an iterable as its format
-----------------------------------------------
Previously only a string was accepted as the format in the pack function.
This was an oversight as it broke the symmetry between pack and unpack.
Now you can use formats like this:
fmt = ['hex:8', 'bin:3']
a = pack(fmt, '47', '001')
a.unpack(fmt)
--------------------------------------
June 18th 2011: version 2.2.0 released
--------------------------------------
This is a minor upgrade with a couple of new features.
New interleaved exponential-Golomb interpretations
--------------------------------------------------
New bit interpretations for interleaved exponential-Golomb (as used in the
Dirac video codec) are supplied via 'uie' and 'sie':
>>> s = BitArray(uie=41)
>>> s.uie
41
>>> s.bin
'0b00010001001'
These are pretty similar to the non-interleaved versions - see the manual
for more details. Credit goes to Paul Sargent for the patch.
New package-level bytealigned variable
--------------------------------------
A number of methods take a 'bytealigned' parameter to indicate that they
should only work on byte boundaries (e.g. find, replace, split). Previously
this parameter defaulted to 'False'. Instead it now defaults to
'bitstring.bytealigned', which itself defaults to 'False', but can be changed
to modify the default behaviour of the methods. For example:
>>> a = BitArray('0x00 ff 0f ff')
>>> a.find('0x0f')
(4,) # found first not on a byte boundary
>>> a.find('0x0f', bytealigned=True)
(16,) # forced looking only on byte boundaries
>>> bitstring.bytealigned = True # Change default behaviour
>>> a.find('0x0f')
(16,)
>>> a.find('0x0f', bytealigned=False)
(4,)
If you're only working with bytes then this can help avoid some errors and
save some typing!
Other changes
-------------
* Fix for Python 3.2, correcting for a change to the binascii module.
* Fix for bool initialisation from 0 or 1.
* Efficiency improvements, including interning strategy.
------------------------------------------
February 23rd 2011: version 2.1.1 released
------------------------------------------
This is a release to fix a couple of bugs that were introduced in 2.1.0.
* Bug fix: Reading using the 'bytes' token had been broken (Issue 102).
* Fixed problem using some methods on ConstBitArrays.
* Better exception handling for tokens missing values.
* Some performance improvements.
-----------------------------------------
January 23rd 2011: version 2.1.0 released
-----------------------------------------
New class hierarchy introduced with simpler classes
---------------------------------------------------
Previously there were just two classes, the immutable Bits which was the base
class for the mutable BitString class. Both of these classes have the concept
of a bit position, from which reads etc. take place so that the bitstring could
be treated as if it were a file or stream.
Two simpler classes have now been added which are purely bit containers and
don't have a bit position. These are called ConstBitArray and BitArray. As you
can guess the former is an immutable version of the latter.
The other classes have also been renamed to better reflect their capabilities.
Instead of BitString you can use BitStream, and instead of Bits you can use
ConstBitStream. The old names are kept as aliases for backward compatibility.
The classes hierarchy is:
ConstBitArray
/ \
/ \
BitArray ConstBitStream (formerly Bits)
\ /
\ /
BitStream (formerly BitString)
Other changes
-------------
A lot of internal reorganisation has taken place since the previous version,
most of which won't be noticed by the end user. Some things you might see are:
* New package structure. Previous versions have been a single file for the
module and another for the unit tests. The module is now split into many
more files so it can't be used just by copying bitstring.py any more.
* To run the unit tests there is now a script called runtests.py in the test
directory.
* File based bitstring are now implemented in terms of an mmap. This should
be just an implementation detail, but unfortunately for 32-bit versions of
Python this creates a limit of 4GB on the files that can be used. The work
around is either to get a 64-bit Python, or just stick with version 2.0.
* The ConstBitArray and ConstBitStream classes no longer copy byte data when
a slice or a read takes place, they just take a reference. This is mostly
a very nice optimisation, but there are occasions where it could have an
adverse effect. For example if a very large bitstring is created, a small
slice taken and the original deleted. The byte data from the large
bitstring would still be retained in memory.
* Optimisations. Once again this version should be faster than the last.
The module is still pure Python but some of the reorganisation was to make
it more feasible to put some of the code into Cython or similar, so
hopefully more speed will be on the way.
--------------------------------------
July 26th 2010: version 2.0.3 released
--------------------------------------
* Bug fix: Using peek and read for a single bit now returns a new bitstring
as was intended, rather than the old behaviour of returning a bool.
* Removed HTML docs from source archive - better to use the online version.
--------------------------------------
July 25th 2010: version 2.0.2 released
--------------------------------------
This is a major release, with a number of backwardly incompatible changes.
The main change is the removal of many methods, all of which have simple
alternatives. Other changes are quite minor but may need some recoding.
There are a few new features, most of which have been made to help the
stream-lining of the API. As always there are performance improvements and
some API changes were made purely with future performance in mind.
The backwardly incompatible changes are:
-----------------------------------------
* Methods removed.
About half of the class methods have been removed from the API. They all have
simple alternatives, so what remains is more powerful and easier to remember.
The removed methods are listed here on the left, with their equivalent
replacements on the right:
s.advancebit() -> s.pos += 1
s.advancebits(bits) -> s.pos += bits
s.advancebyte() -> s.pos += 8
s.advancebytes(bytes) -> s.pos += 8*bytes
s.allunset([a, b]) -> s.all(False, [a, b])
s.anyunset([a, b]) -> s.any(False, [a, b])
s.delete(bits, pos) -> del s[pos:pos+bits]
s.peekbit() -> s.peek(1)
s.peekbitlist(a, b) -> s.peeklist([a, b])
s.peekbits(bits) -> s.peek(bits)
s.peekbyte() -> s.peek(8)
s.peekbytelist(a, b) -> s.peeklist([8*a, 8*b])
s.peekbytes(bytes) -> s.peek(8*bytes)
s.readbit() -> s.read(1)
s.readbitlist(a, b) -> s.readlist([a, b])
s.readbits(bits) -> s.read(bits)
s.readbyte() -> s.read(8)
s.readbytelist(a, b) -> s.readlist([8*a, 8*b])
s.readbytes(bytes) -> s.read(8*bytes)
s.retreatbit() -> s.pos -= 1
s.retreatbits(bits) -> s.pos -= bits
s.retreatbyte() -> s.pos -= 8
s.retreatbytes(bytes) -> s.pos -= 8*bytes
s.reversebytes(start, end) -> s.byteswap(0, start, end)
s.seek(pos) -> s.pos = pos
s.seekbyte(bytepos) -> s.bytepos = bytepos
s.slice(start, end, step) -> s[start:end:step]
s.tell() -> s.pos
s.tellbyte() -> s.bytepos
s.truncateend(bits) -> del s[-bits:]
s.truncatestart(bits) -> del s[:bits]
s.unset([a, b]) -> s.set(False, [a, b])
Many of these methods have been deprecated for the last few releases, but
there are some new removals too. Any recoding needed should be quite
straightforward, so while I apologise for the hassle, I had to take the
opportunity to streamline and rationalise what was becoming a bit of an
overblown API.
* set / unset methods combined.
The set/unset methods have been combined in a single method, which now
takes a boolean as its first argument:
s.set([a, b]) -> s.set(1, [a, b])
s.unset([a, b]) -> s.set(0, [a, b])
s.allset([a, b]) -> s.all(1, [a, b])
s.allunset([a, b]) -> s.all(0, [a, b])
s.anyset([a, b]) -> s.any(1, [a, b])
s.anyunset([a, b]) -> s.any(0, [a, b])
* all / any only accept iterables.
The all and any methods (previously called allset, allunset, anyset and
anyunset) no longer accept a single bit position. The recommended way of
testing a single bit is just to index it, for example instead of:
>>> if s.all(True, i):
just use
>>> if s[i]:
If you really want to you can of course use an iterable with a single
element, such as 's.any(False, [i])', but it's clearer just to write
'not s[i]'.
* Exception raised on reading off end of bitstring.
If a read or peek goes beyond the end of the bitstring then a ReadError
will be raised. The previous behaviour was that the rest of the bitstring
would be returned and no exception raised.
* BitStringError renamed to Error.
The base class for errors in the bitstring module is now just Error, so
it will likely appears in your code as bitstring.Error instead of
the rather repetitive bitstring.BitStringError.
* Single bit slices and reads return a bool.
A single index slice (such as s[5]) will now return a bool (i.e. True or
False) rather than a single bit bitstring. This is partly to reflect the
style of the bytearray type, which returns an integer for single items, but
mostly to avoid common errors like:
>>> if s[0]:
... do_something()
While the intent of this code snippet is quite clear (i.e. do_something if
the first bit of s is set) under the old rules s[0] would be true as long
as s wasn't empty. That's because any one-bit bitstring was true as it was a
non-empty container. Under the new rule s[0] is True if s starts with a '1'
bit and False if s starts with a '0' bit.
The change does not affect reads and peeks, so s.peek(1) will still return
a single bit bitstring, which leads on to the next item...
* Empty bitstrings or bitstrings with only zero bits are considered False.
Previously a bitstring was False if it had no elements, otherwise it was True.
This is standard behaviour for containers, but wasn't very useful for a container
of just 0s and 1s. The new behaviour means that the bitstring is False if it
has no 1 bits. This means that code like this:
>>> if s.peek(1):
... do_something()
should work as you'd expect. It also means that Bits(1000), Bits(0x00) and
Bits('uint:12=0') are all also False. If you need to check for the emptiness of
a bitstring then instead check the len property:
if s -> if s.len
if not s -> if not s.len
* Length and offset disallowed for some initialisers.
Previously you could create bitstring using expressions like:
>>> s = Bits(hex='0xabcde', offset=4, length=13)
This has now been disallowed, and the offset and length parameters may only
be used when initialising with bytes or a file. To replace the old behaviour
you could instead use
>>> s = Bits(hex='0xabcde')[4:17]
* Renamed 'format' parameter 'fmt'.
Methods with a 'format' parameter have had it renamed to 'fmt', to prevent
hiding the built-in 'format'. Affects methods unpack, read, peek, readlist,
peeklist and byteswap and the pack function.
* Iterables instead of *format accepted for some methods.
This means that for the affected methods (unpack, readlist and peeklist) you
will need to use an iterable to specify multiple items. This is easier to
show than to describe, so instead of
>>> a, b, c, d = s.readlist('uint:12', 'hex:4', 'bin:7')
you would instead write
>>> a, b, c, d = s.readlist(['uint:12', 'hex:4', 'bin:7'])
Note that you could still use the single string 'uint:12, hex:4, bin:7' if
you preferred.
* Bool auto-initialisation removed.
You can no longer use True and False to initialise single bit bitstrings.
The reasoning behind this is that as bool is a subclass of int, it really is
bad practice to have Bits(False) be different to Bits(0) and to have Bits(True)
different to Bits(1).
If you have used bool auto-initialisation then you will have to be careful to
replace it as the bools will now be interpreted as ints, so Bits(False) will
be empty (a bitstring of length 0), and Bits(True) will be a single zero bit
(a bitstring of length 1). Sorry for the confusion, but I think this will
prevent bigger problems in the future.
There are a few alternatives for creating a single bit bitstring. My favourite
it to use a list with a single item:
Bits(False) -> Bits([0])
Bits(True) -> Bits([1])
* New creation from file strategy
Previously if you created a bitstring from a file, either by auto-initialising
with a file object or using the filename parameter, the file would not be read
into memory unless you tried to modify it, at which point the whole file would
be read.
The new behaviour depends on whether you create a Bits or a BitString from the
file. If you create a Bits (which is immutable) then the file will never be
read into memory. This allows very large files to be opened for examination
even if they could never fit in memory.
If however you create a BitString, the whole of the referenced file will be read
to store in memory. If the file is very big this could take a long time, or fail,
but the idea is that in saying you want the mutable BitString you are implicitly
saying that you want to make changes and so (for now) we need to load it into
memory.
The new strategy is a bit more predictable in terms of performance than the old.
The main point to remember is that if you want to open a file and don't plan to
alter the bitstring then use the Bits class rather than BitString.
Just to be clear, in neither case will the contents of the file ever be changed -
if you want to output the modified BitString then use the tofile method, for
example.
* find and rfind return a tuple instead of a bool.
If a find is unsuccessful then an empty tuple is returned (which is False in a
boolean sense) otherwise a single item tuple with the bit position is returned
(which is True in a boolean sense). You shouldn't need to recode unless you
explicitly compared the result of a find to True or False, for example this
snippet doesn't need to be altered:
>>> if s.find('0x23'):
... print(s.bitpos)
but you could now instead use
>>> found = s.find('0x23')
>>> if found:
... print(found[0])
The reason for returning the bit position in a tuple is so that finding at
position zero can still be True - it's the tuple (0,) - whereas not found can
be False - the empty tuple ().
The new features in this release are:
-------------------------------------
* New count method.
This method just counts the number of 1 or 0 bits in the bitstring.
>>> s = Bits('0x31fff4')
>>> s.count(1)
16
* read and peek methods accept integers.
The read, readlist, peek and peeklist methods now accept integers as parameters
to mean "read this many bits and return a bitstring". This has allowed a number
of methods to be removed from this release, so for example instead of:
>>> a, b, c = s.readbits(5, 6, 7)
>>> if s.peekbit():
... do_something()
you should write:
>>> a, b, c = s.readlist([5, 6, 7])
>>> if s.peek(1):
... do_something()
* byteswap used to reverse all bytes.
The byteswap method now allows a format specifier of 0 (the default) to signify
that all of the whole bytes should be reversed. This means that calling just
byteswap() is almost equivalent to the now removed bytereverse() method (a small
difference is that byteswap won't raise an exception if the bitstring isn't a
whole number of bytes long).
* Auto initialise with bytearray or (for Python 3 only) bytes.
So rather than writing:
>>> a = Bits(bytes=some_bytearray)
you can just write
>>> a = Bits(some_bytearray)
This also works for the bytes type, but only if you're using Python 3.
For Python 2 it's not possible to distinguish between a bytes object and a
str. For this reason this method should be used with some caution as it will
make you code behave differently with the different major Python versions.
>>> b = Bits(b'abcd\x23\x00') # Only Python 3!
* set, invert, all and any default to whole bitstring.
This means that you can for example write:
>>> a = BitString(100) # 100 zero bits
>>> a.set(1) # set all bits to 1
>>> a.all(1) # are all bits set to 1?
True
>>> a.any(0) # are any set to 0?
False
>>> a.invert() # invert every bit
* New exception types.
As well as renaming BitStringError to just Error
there are also new exceptions which use Error as a base class.
These can be caught in preference to Error if you need finer control.
The new exceptions sometimes also derive from built-in exceptions:
ByteAlignError(Error) - whole byte position or length needed.
ReadError(Error, IndexError) - reading or peeking off the end of
the bitstring.
CreationError(Error, ValueError) - inappropriate argument during
bitstring creation.
InterpretError(Error, ValueError) - inappropriate interpretation of
binary data.
--------------------------------------------------------------
March 18th 2010: version 1.3.0 for Python 2.6 and 3.x released
--------------------------------------------------------------
New features:
* byteswap method for changing endianness.
Changes the endianness in-place according to a format string or
integer(s) giving the byte pattern. See the manual for details.
>>> s = BitString('0x00112233445566')
>>> s.byteswap(2)
3
>>> s
BitString('0x11003322554466')
>>> s.byteswap('h')
3
>>> s
BitString('0x00112233445566')
>>> s.byteswap([2, 5])
1
>>> s
BitString('0x11006655443322')
* Multiplicative factors in bitstring creation and reading.
For example:
>>> s = Bits('100*0x123')
* Token grouping using parenthesis.
For example:
>>> s = Bits('3*(uint:6=3, 0b1)')
* Negative slice indices allowed.
The start and end parameters of many methods may now be negative, with the
same meaning as for negative slice indices. Affects all methods with these
parameters.
* Sequence ABCs used.
The Bits class now derives from collections.Sequence, while the BitString
class derives from collections.MutableSequence.
* Keywords allowed in readlist, peeklist and unpack.
Keywords for token lengths are now permitted when reading. So for example,
you can write
>>> s = bitstring.pack('4*(uint:n)', 2, 3, 4, 5, n=7)
>>> s.unpack('4*(uint:n)', n=7)
[2, 3, 4, 5]
* start and end parameters added to rol and ror.
* join function accepts other iterables.
Also its parameter has changed from 'bitstringlist' to 'sequence'. This is
technically a backward incompatibility in the unlikely event that you are
referring to the parameter by name.
* __init__ method accepts keywords.
Rather than a long list of initialisers the __init__ methods now use a
**kwargs dictionary for all initialisers except 'auto'. This should have no
effect, except that this is a small backward incompatibility if you use
positional arguments when initialising with anything other than auto
(which would be rather unusual).
* More optimisations.
* Bug fixed in replace method (it could fail if start != 0).
----------------------------------------------------------------
January 19th 2010: version 1.2.0 for Python 2.6 and 3.x released
----------------------------------------------------------------
* New 'Bits' class.
Introducing a brand new class, Bits, representing an immutable sequence of
bits.
The Bits class is the base class for the mutable BitString. The differences
between Bits and BitStrings are:
1) Bits are immutable, so once they have been created their value cannot change.
This of course means that mutating methods (append, replace, del etc.) are not
available for Bits.
2) Bits are hashable, so they can be used in sets and as keys in dictionaries.
3) Bits are potentially more efficient than BitStrings, both in terms of
computation and memory. The current implementation is only marginally
more efficient though - this should improve in future versions.
You can switch from Bits to a BitString or vice versa by constructing a new
object from the old.
>>> s = Bits('0xabcd')
>>> t = BitString(s)
>>> t.append('0xe')
>>> u = Bits(t)
The relationship between Bits and BitString is supposed to loosely mirror that
between bytes and bytearray in Python 3.
* Deprecation messages turned on.
A number of methods have been flagged for removal in version 2. Deprecation
warnings will now be given, which include an alternative way to do the same
thing. All of the deprecated methods have simpler equivalent alternatives.
>>> t = s.slice(0, 2)
__main__:1: DeprecationWarning: Call to deprecated function slice.
Instead of 's.slice(a, b, c)' use 's[a:b:c]'.
The deprecated methods are: advancebit, advancebits, advancebyte, advancebytes,
retreatbit, retreatbits, retreatbyte, retreatbytes, tell, seek, slice, delete,
tellbyte, seekbyte, truncatestart and truncateend.
* Initialise from bool.
Booleans have been added to the list of types that can 'auto'
initialise a bitstring.
>>> zerobit = BitString(False)
>>> onebit = BitString(True)
* Improved efficiency.
More methods have been speeded up, in particular some deletions and insertions.
* Bug fixes.
A rare problem with truncating the start of bitstrings was fixed.
A possible problem outputting the final byte in tofile() was fixed.
-----------------------------------------------------------------
December 22nd 2009: version 1.1.3 for Python 2.6 and 3.x released
-----------------------------------------------------------------
This version hopefully fixes an installation problem for platforms with
case-sensitive file systems. There are no new features or other bug fixes.
-----------------------------------------------------------------
December 18th 2009: version 1.1.2 for Python 2.6 and 3.x released
-----------------------------------------------------------------
This is a minor update with (almost) no new features.
* Improved efficiency.
The speed of many typical operations has been increased, some substantially.
* Initialise from integer.
A BitString of '0' bits can be created using just an integer to give the length
in bits. So instead of
>>> s = BitString(length=100)
you can write just
>>> s = BitString(100)
This matches the behaviour of bytearrays and (in Python 3) bytes.
* A defect related to using the set / unset functions on BitStrings initialised
from a file has been fixed.
-----------------------------------------------------------------
November 24th 2009: version 1.1.0 for Python 2.6 and 3.x released
-----------------------------------------------------------------
Note that this version will not work for Python 2.4 or 2.5. There may be an
update for these Python versions some time next year, but it's not a priority
quite yet. Also note that only one version is now provided, which works for
Python 2.6 and 3.x (done with the minimum of hackery!)
* Improved efficiency.
A fair number of functions have improved efficiency, some quite dramatically.
* New bit setting and checking functions.
Although these functions don't do anything that couldn't be done before, they
do make some common use cases much more efficient. If you need to set or check
single bits then these are the functions you need.
set / unset : Set bit(s) to 1 or 0 respectively.
allset / allunset : Check if all bits are 1 or all 0.
anyset / anyunset : Check if any bits are 1 or any 0.
>>> s = BitString(length=1000)
>>> s.set((10, 100, 44, 12, 1))
>>> s.allunset((2, 22, 222))
True
>>> s.anyset(range(7, 77))
True
* New rotate functions.
ror / rol : Rotate bits to the right or left respectively.
>>> s = BitString('0b100000000')
>>> s.ror(2)
>>> s.bin
'0b001000000'
>>> s.rol(5)
>>> s.bin
'0b000000100'
* Floating point interpretations.
New float initialisations and interpretations are available. These only work
for BitStrings of length 32 or 64 bits.
>>> s = BitString(float=0.2, length=64)
>>> s.float
0.200000000000000001
>>> t = bitstring.pack('<3f', -0.4, 1e34, 17.0)
>>> t.hex
'0xcdccccbedf84f67700008841'
* 'bytes' token reintroduced.
This token returns a bytes object (equivalent to a str in Python 2.6).
>>> s = BitString('0x010203')
>>> s.unpack('bytes:2, bytes:1')
['\x01\x02', '\x03']
* 'uint' is now the default token type.
So for example these are equivalent:
a, b = s.readlist('uint:12, uint:12')
a, b = s.readlist('12, 12')
--------------------------------------------------------
October 10th 2009: version 1.0.1 for Python 3.x released
--------------------------------------------------------
This is a straight port of version 1.0.0 to Python 3.
For changes since the last Python 3 release read all the way down in this
document to version 0.4.3.
This version will also work for Python 2.6, but there's no advantage to using
it over the 1.0.0 release. It won't work for anything before 2.6.
-------------------------------------------------------
October 9th 2009: version 1.0.0 for Python 2.x released
-------------------------------------------------------
Version 1 is here!
This is the first release not to carry the 'beta' tag. It contains a couple of
minor new features but is principally a release to fix the API. If you've been
using an older version then you almost certainly will have to recode a bit. If
you're not ready to do that then you may wish to delay updating.
So the bad news is that there are lots of small changes to the API. The good
news is that all the changes are pretty trivial, the new API is cleaner and
more 'Pythonic', and that by making it version 1.0 I'm promising not to
tweak it again for some time.
** API Changes **
* New read / peek functions for returning multiple items.
The functions read, readbits, readbytes, peek, peekbits and peekbytes now only
ever return a single item, never a list.
The new functions readlist, readbitlist, readbytelist, peeklist, peekbitlist
and peekbytelist can be used to read multiple items and will always return a
list.
So a line like:
>>> a, b = s.read('uint:12, hex:32')
becomes
>>> a, b = s.readlist('uint:12, hex:32')
* Renaming / removing functions.
Functions have been renamed as follows:
seekbit -> seek
tellbit -> tell
reversebits -> reverse
deletebits -> delete
tostring -> tobytes
and a couple have been removed altogether:
deletebytes - use delete instead.
empty - use 'not s' rather than 's.empty()'.
* Renaming parameters.
The parameters 'startbit' and 'endbit' have been renamed 'start' and 'end'.
This affects the functions slice, find, findall, rfind, reverse, cut and split.
The parameter 'bitpos' has been renamed to 'pos'. The affects the functions
seek, tell, insert, overwrite and delete.
* Mutating methods return None rather than self.
This means that you can't chain functions together so
>>> s.append('0x00').prepend('0xff')
>>> t = s.reverse()
Needs to be rewritten
>>> s.append('0x00')
>>> s.prepend('0xff)
>>> s.reverse()
>>> t = s
Affects truncatestart, truncateend, insert, overwrite, delete, append,
prepend, reverse and reversebytes.
* Properties renamed.
The 'data' property has been renamed to 'bytes'. Also if the BitString is not a
whole number of bytes then a ValueError exception will be raised when using
'bytes' as a 'getter'.
Properties 'len' and 'pos' have been added to replace 'length' and 'bitpos',
although the longer names have not been removed so you can continue to use them
if you prefer.
* Other changes.
The unpack function now always returns a list, never a single item.
BitStrings are now 'unhashable', so calling hash on one or making a set will
fail.
The colon separating the token name from its length is now mandatory. So for
example BitString('uint12=100') becomes BitString('uint:12=100').
Removed support for the 'bytes' token in format strings. Instead of
s.read('bytes:4') use s.read('bits:32').
** New features **
* Added endswith and startswith functions.
These do much as you'd expect; they return True or False depending on whether
the BitString starts or ends with the parameter.
>>> BitString('0xef342').startswith('0b11101')
True
----------------------------------------------------------
September 11th 2009: version 0.5.2 for Python 2.x released
----------------------------------------------------------
Finally some tools for dealing with endianness!
* New interpretations are now available for whole-byte BitStrings that treat
them as big, little, or native-endian.
>>> big = BitString(intbe=1, length=16) # or BitString('intbe:16=1') if you prefer.
>>> little = BitString(intle=1, length=16)
>>> print big.hex, little.hex
0x0001 0x0100
>>> print big.intbe, little.intle
1 1
* 'Struct'-like compact format codes
To save some typing when using pack, unpack, read and peek, compact format
codes based on those used in the struct and array modules have been added.
These must start with a character indicating the endianness (>, < or @ for
big, little and native-endian), followed by characters giving the format:
b 1-byte signed int
B 1-byte unsigned int
h 2-byte signed int
H 2-byte unsigned int
l 4-byte signed int
L 4-byte unsigned int
q 8-byte signed int
Q 8-byte unsigned int
For example:
>>> s = bitstring.pack('<4h', 0, 1, 2, 3)
creates a BitString with four little-endian 2-byte integers. While
>>> x, y, z = s.read('>hhl')
reads them back as two big-endian two-byte integers and one four-byte big
endian integer.
Of course you can combine this new format with the old ones however you like:
>>> s.unpack('>> from bitstring import BitString, pack
>>> a = pack('0b11, 0xff, 0o77, int:5=-1, se=33')
You can also leave placeholders in the format, which will be filled in by
the values provided.
>>> b = pack('uint:10, hex:4', 33, 'f')
Finally you can use a dictionary or keywords.
>>> c = pack('bin=a, hex=b, bin=a', a='010', b='ef')
The unpack function is similar to the read function except that it always
unpacks from the start of the BitString.
>>> x, y = b.unpack('uint:10, hex')
If a token is given without a length (as above) then it will expand to fill the
remaining bits in the BitString. This also now works with read() and peek().
* New tostring() and tofile() functions.
The tostring() function just returns the data as a string, with up to seven
zero bits appended to byte align. The tofile() function does the same except
writes to a file object.
>>> f = open('myfile', 'wb')
>>> BitString('0x1234ff').tofile(f)
* Other changes.
The use of '=' is now mandatory in 'auto' initialisers. Tokens like 'uint12 100' will
no longer work. Also the use of a ':' before the length is encouraged, but not yet
mandated. So the previous example should be written as 'uint:12=100'.
The 'auto' initialiser will now take a file object.
>>> f = open('myfile', 'rb')
>>> s = BitString(f)
-----------------------------------------------------
July 19th 2009: version 0.5.0 for Python 2.x released
-----------------------------------------------------
This update breaks backward compatibility in a couple of areas. The only one
you probably need to be concerned about is the change to the default for
bytealigned in find, replace, split, etc.
See the user manual for more details on each of these items.
* Expanded abilities of 'auto' initialiser.
More types can be initialised through the 'auto' initialiser. For example
instead of
>>> a = BitString(uint=44, length=16)
you can write
>>> a = BitString('uint16=44')
Also, different comma-separated tokens will be joined together, e.g.
>>> b = BitString('0xff') + 'int8=-5'
can be written
>>> b = BitString('0xff, int8=-5')
* New formatted read() and peek() functions.
These takes a format string similar to that used in the auto initialiser.
If only one token is provided then a single value is returned, otherwise a
list of values is returned.
>>> start_code, width, height = s.read('hex32, uint12, uint12')
is equivalent to
>>> start_code = s.readbits(32).hex
>>> width = s.readbits(12).uint
>>> height = s.readbits(12).uint
The tokens are:
int n : n bits as an unsigned integer.
uint n : n bits as a signed integer.
hex n : n bits as a hexadecimal string.
oct n : n bits as an octal string.
bin n : n bits as a binary string.
ue : next bits as an unsigned exp-Golomb.
se : next bits as a signed exp-Golomb.
bits n : n bits as a new BitString.
bytes n : n bytes as a new BitString.
See the user manual for more details.
* hex() and oct() functions removed.
The special functions for hex() and oct() have been removed. Please use the
hex and oct properties instead.
>>> hex(s)
becomes
>>> s.hex
* join made a member function.
The join function must now be called on a BitString object, which will be
used to join the list together. You may need to recode slightly:
>>> s = bitstring.join('0x34', '0b1001', '0b1')
becomes
>>> s = BitString().join('0x34', '0b1001', '0b1')
* More than one value allowed in readbits, readbytes, peekbits and peekbytes
If you specify more than one bit or byte length then a list of BitStrings will
be returned.
>>> a, b, c = s.readbits(10, 5, 5)
is equivalent to
>>> a = readbits(10)
>>> b = readbits(5)
>>> c = readbits(5)
* bytealigned defaults to False, and is at the end of the parameter list
Functions that have a bytealigned parameter have changed so that it now
defaults to False rather than True. Also its position in the parameter list
has changed to be at the end. You may need to recode slightly (sorry!)
* readue and readse functions have been removed
Instead you should use the new read function with a 'ue' or 'se' token:
>>> i = s.readue()
becomes
>>> i = s.read('ue')
This is more flexible as you can read multiple items in one go, plus you can
now also use the peek function with ue and se.
* Minor bugs fixed.
See the issue tracker for more details.
-----------------------------------------------------
June 15th 2009: version 0.4.3 for Python 2.x released
-----------------------------------------------------
This is a minor update. This release is the first to bundle the bitstring
manual. This is a PDF and you can find it in the docs directory.
Changes in version 0.4.3
* New 'cut' function
This function returns a generator for constant sized chunks of a BitString.
>>> for byte in s.cut(8):
... do_something_with(byte)
You can also specify a startbit and endbit, as well as a count, which limits
the number of items generated:
>>> first100TSPackets = list(s.cut(188*8, count=100))
* 'slice' function now equivalent to __getitem__.
This means that a step can also be given to the slice function so that the
following are now the same thing, and it's just a personal preference which
to use:
>>> s1 = s[a:b:c]
>>> s2 = s.slice(a, b, c)
* findall gets a 'count' parameter.
So now
>>> list(a.findall(s, count=n))
is equivalent to
>>> list(a.findall(s))[:n]
except that it won't need to generate the whole list and so is much more
efficient.
* Changes to 'split'.
The split function now has a 'count' parameter rather than 'maxsplit'. This
makes the interface closer to that for cut, replace and findall. The final item
generated is now no longer the whole of the rest of the BitString.
* A couple of minor bugs were fixed. See the issue tracker for details.
----------------------------------------------------
May 25th 2009: version 0.4.2 for Python 2.x released
----------------------------------------------------
This is a minor update, and almost doesn't break compatibility with version
0.4.0, but with the slight exception of findall() returning a generator,
detailed below.
Changes in version 0.4.2
* Stepping in slices
The use of the step parameter (also known as the stride) in slices has been
added. Its use is a little non-standard as it effectively gives a multiplicative
factor to apply to the start and stop parameters, rather than skipping over
bits.
For example this makes it much more convenient if you want to give slices in
terms of bytes instead of bits. Instead of writing s[a*8:b*8] you can use
s[a:b:8].
When using a step the BitString is effectively truncated to a multiple of the
step, so s[::8] is equal to s if s is an integer number of bytes, otherwise it
is truncated by up to 7 bits. So the final seven complete 16-bit words could be
written as s[-7::16]
Negative slices are also allowed, and should do what you'd expect. So for
example s[::-1] returns a bit-reversed copy of s (which is similar to
s.reversebits(), which does the same operation on s in-place). As another
example, to get the first 10 bytes in reverse byte order you could use
s_bytereversed = s[0:10:-8].
* Removed restrictions on offset
You can now specify an offset of greater than 7 bits when creating a BitString,
and the use of offset is also now permitted when using the filename initialiser.
This is useful when you want to create a BitString from the middle of a file
without having to read the file into memory.
>>> f = BitString(filename='reallybigfile', offset=8000000, length=32)
* Integers can be assigned to slices
You can now assign an integer to a slice of a BitString. If the integer doesn't
fit in the size of slice given then a ValueError exception is raised. So this
is now allowed and works as expected:
>>> s[8:16] = 106
and is equivalent to
>>> s[8:16] = BitString(uint=106, length=8)
* Less exceptions raised
Some changes have been made to slicing so that less exceptions are raised,
bringing the interface closer to that for lists. So for example trying to delete
past the end of the BitString will now just delete to the end, rather than
raising a ValueError.
* Initialisation from lists and tuples
A new option for the auto initialiser is to pass it a list or tuple. The items
in the list or tuple are evaluated as booleans and the bits in the BitString are
set to 1 for True items and 0 for False items. This can be used anywhere the
auto initialiser can currently be used. For example:
>>> a = BitString([True, 7, False, 0, ()]) # 0b11000
>>> b = a + ['Yes', ''] # Adds '0b10'
>>> (True, True, False) in a
True
* Miscellany
reversebits() now has optional startbit and endbit parameters.
As an optimisation findall() will return a generator, rather than a list. If you
still want the whole list then of course you can just call list() on the
generator.
Improved efficiency of rfind().
A couple of minor bugs were fixed. See the issue tracker for details.
-----------------------------------------------------
April 23rd 2009: Python 3 only version 0.4.1 released
-----------------------------------------------------
This version is just a port of version 0.4.0 to Python 3. All the unit tests
pass, but beyond that only limited ad hoc testing has been done and so it
should be considered an experimental release. That said, the unit test
coverage is very good - I'm just not sure if anyone even wants a Python 3
version!
---------------------------------------
April 11th 2009: version 0.4.0 released
---------------------------------------
Changes in version 0.4.0
* New functions
Added rfind(), findall(), replace(). These do pretty much what you'd expect -
see the docstrings or the wiki for more information.
* More special functions
Some missing functions were added: __repr__, __contains__, __rand__,
__ror__, _rxor__ and __delitem__.
* Miscellany
A couple of small bugs were fixed (see the issue tracker).
----
There are some small backward incompatibilities relative to version 0.3.2:
* Combined find() and findbytealigned()
findbytealigned() has been removed, and becomes part of find(). The default
start position has changed on both find() and split() to be the start of the
BitString. You may need to recode:
>>> s1.find(bs)
>>> s2.findbytealigned(bs)
>>> s2.split(bs)
becomes
>>> s1.find(bs, bytealigned=False, startbit=s1.bitpos)
>>> s2.find(bs, startbit=s1.bitpos) # bytealigned defaults to True
>>> s2.split(bs, startbit=s2.bitpos)
* Reading off end of BitString no longer raises exception.
Previously a read or peek function that encountered the end of the BitString
would raise a ValueError. It will now instead return the remainder of the
BitString, which could be an empty BitString. This is closer to the file
object interface.
* Removed visibility of offset.
The offset property was previously read-only, and has now been removed from
public view altogether. As it is used internally for efficiency reasons you
shouldn't really have needed to use it. If you do then use the _offset parameter
instead (with caution).
---------------------------------------
March 11th 2009: version 0.3.2 released
---------------------------------------
Changes in version 0.3.2
* Better performance
A number of functions (especially find() and findbytealigned()) have been sped
up considerably.
* Bit-wise operations
Added support for bit-wise AND (&), OR (|) and XOR (^). For example:
>>> a = BitString('0b00111')
>>> print a & '0b10101'
0b00101
* Miscellany
Added seekbit() and seekbyte() functions. These complement the 'advance' and
'retreat' functions, although you can still just use bitpos and bytepos
properties directly.
>>> a.seekbit(100) # Equivalent to a.bitpos = 100
Allowed comparisons between BitString objects and strings. For example this
will now work:
>>> a = BitString('0b00001111')
>>> a == '0x0f'
True
------------------------------------------
February 26th 2009: version 0.3.1 released
------------------------------------------
Changes in version 0.3.1
This version only adds features and fixes bugs relative to 0.3.0, and doesn't
break backwards compatibility.
* Octal interpretation and initialisation
The oct property now joins bin and hex. Just prefix octal numbers with '0o'.
>>> a = BitString('0o755')
>>> print a.bin
0b111101101
* Simpler copying
Rather than using b = copy.copy(a) to create a copy of a BitString, now you
can just use b = BitString(a).
* More special methods
Lots of new special methods added, for example bit-shifting via << and >>,
equality testing via == and !=, bit inversion (~) and concatenation using *.
Also __setitem__ is now supported so BitString objects can be modified using
standard index notation.
* Proper installer
Finally got round to writing the distutils script. To install just
python setup.py install.
------------------------------------------
February 15th 2009: version 0.3.0 released
------------------------------------------
Changes in version 0.3.0
* Simpler initialisation from binary and hexadecimal
The first argument in the BitString constructor is now called auto and will
attempt to interpret the type of a string. Prefix binary numbers with '0b'
and hexadecimals with '0x'.
>>> a = BitString('0b0') # single zero bit
>>> b = BitString('0xffff') # two bytes
Previously the first argument was data, so if you relied on this then you
will need to recode:
>>> a = BitString('\x00\x00\x01\xb3') # Don't do this any more!
becomes
>>> a = BitString(data='\x00\x00\x01\xb3')
or just
>>> a = BitString('0x000001b3')
This new notation can also be used in functions that take a BitString as an
argument. For example:
>>> a = BitString('0x0011') + '0xff'
>>> a.insert('0b001', 6)
>>> a.find('0b1111')
* BitString made more mutable
The functions append, deletebits, insert, overwrite, truncatestart and
truncateend now modify the BitString that they act upon. This allows for
cleaner and more efficient code, but you may need to rewrite slightly if you
depended upon the old behaviour:
>>> a = BitString(hex='0xffff')
>>> a = a.append(BitString(hex='0x00'))
>>> b = a.deletebits(10, 10)
becomes:
>>> a = BitString('0xffff')
>>> a.append('0x00')
>>> b = copy.copy(a)
>>> b.deletebits(10, 10)
Thanks to Frank Aune for suggestions in this and other areas.
* Changes to printing
The binary interpretation of a BitString is now prepended with '0b'. This is
in keeping with the Python 2.6 (and 3.0) bin function. The prefix is optional
when initialising using 'bin='.
Also, if you just print a BitString with no interpretation it will pick
something appropriate - hex if it is an integer number of bytes, otherwise
binary. If the BitString representation is very long it will be truncated
by '...' so it is only an approximate interpretation.
>>> a = BitString('0b0011111')
>>> print a
0b0011111
>>> a += '0b0'
>>> print a
0x3e
* More convenience functions
Some missing functions such as advancebit and deletebytes have been added. Also
a number of peek functions make an appearance as have prepend and reversebits.
See the Tutorial for more details.
-----------------------------------------
January 13th 2009: version 0.2.0 released
-----------------------------------------
Some fairly minor updates, not really deserving of a whole version point update.
------------------------------------------
December 29th 2008: version 0.1.0 released
------------------------------------------
First release!
bitstring-bitstring-4.1.4/tests/ 0000775 0000000 0000000 00000000000 14531676336 0016710 5 ustar 00root root 0000000 0000000 bitstring-bitstring-4.1.4/tests/__init__.py 0000664 0000000 0000000 00000000000 14531676336 0021007 0 ustar 00root root 0000000 0000000 bitstring-bitstring-4.1.4/tests/smalltestfile 0000664 0000000 0000000 00000000010 14531676336 0021472 0 ustar 00root root 0000000 0000000 #Eg bitstring-bitstring-4.1.4/tests/stress_test.py 0000664 0000000 0000000 00000005343 14531676336 0021651 0 ustar 00root root 0000000 0000000 #!/usr/bin/env python
import sys
sys.path.insert(0, '..')
from bitstring import Bits, BitStream
import bitstring
import time
import random
import cProfile
import pstats
import math
# Some performance tests. Each is a task - it is permissible to rewrite
# to do it in a different way.
# TEST 1: Create a bitstring, read every 3 bits and count how many equal '001'.
def perf1():
s = bitstring.Bits('0xef1356a6200b3, 0b0')
s *= 6000
c = 0
for triplet in s.cut(3):
if triplet == '0b001':
c += 1
assert c == 12000, c
def perf2():
s = bitstring.BitArray(100000000)
s.set(1, [10, 100, 1000, 100000])
count = s.count(1)
assert count == 4
def perf3():
s = bitstring.BitArray()
for i in range(10000):
s += 'uint:12=244, float:32=0.4'
s += '0x3e44f, 0b11011, 0o75523'
s += [0, 1, 2, 0, 0, 1, 2, 0, -1, 0, 'hello']
s += bitstring.BitArray(104)
def perf4():
random.seed(999)
i = random.randrange(0, 2**20000000)
s = bitstring.BitArray(uint=i, length=20000000)
for ss in ['0b11010010101', '0xabcdef1234, 0b000101111010101010011010100100101010101', '0x4321']:
x = len(list(s.findall(ss)))
assert x == 289
def perf5():
s = set()
s2 = set()
random.seed(12)
for _ in range(20000):
v = random.randint(0, 2**10)
s.add(bitstring.ConstBitStream(uint=v, length=1001, pos=v % 1000))
s2.add(v)
assert len(s) == len(s2)
def perf6():
random.seed(1414)
i = random.randrange(0, 2 ** 800000)
s = bitstring.ConstBitStream(uint=i, length=800000)
for _ in range(800000 // 40):
_ = s.readlist('uint:4, float:32, bool, bool, bool, bool')
def perf7():
limit = 1000000
is_prime = bitstring.BitArray(limit)
is_prime.set(True)
# Manually set 0 and 1 to be not prime.
is_prime.set(False, [0, 1])
# For every other integer, if it's set as prime then unset all of its multiples
for i in range(2, math.ceil(math.sqrt(limit))):
if is_prime[i]:
is_prime.set(False, range(i*i, limit, i))
twin_primes = len(list(is_prime.findall('0b101')))
assert twin_primes == 8169
def run(f):
start_time = time.perf_counter()
print("Running {0}".format(str(f)))
f()
print("Took {0} s".format(time.perf_counter() - start_time))
def main():
start_time = time.perf_counter()
run(perf1)
run(perf2)
run(perf3)
run(perf4)
run(perf5)
run(perf6)
run(perf7)
print("Total time {0} s".format(time.perf_counter() - start_time))
if __name__ == '__main__':
print(f"bitstring version {bitstring.__version__}")
cProfile.run('main()', 'stats')
p = pstats.Stats('stats')
p.sort_stats('time').print_stats(10)
bitstring-bitstring-4.1.4/tests/test.m1v 0000664 0000000 0000000 00000364564 14531676336 0020336 0 ustar 00root root 0000000 0000000 MPEG-1 Test Sequence, 25 frames/sec
@
R".RJR")H".RJR")H".RH"&J֓B'bER)JD\)rER)JD\)rD +})H".RJR")H"*9JR")H".RJR")H".R#P?")HZ"4JR")H".RJR" })H".R)H".RJR")H".RJR")HퟝP t!,`r@
,v !,7!,m ZH~x[ <poF延=
VI珼 RVJv6@B !JŠ% " 1wQ(w)J)H %
U K3 1L ,\m)z H] A
khBcPBprxؓ s)[JǾ (i4 { Gr !H``o ,q480P i`0,f7'QsHx
8
`}3@3I`T5` M bssn %| $V{\co, ,40(J6.@#w-8@/BƣiD G#R_m@ "C6mbn!
<5$vOR.RORt".RJR")H })H".RJR")H".RJV5 b PGK>~B9!XhiDt`vA) @0g-߾GL:
P(b2#_K @2Xeyw T1 vT%t:z @70) 9?s % @ 1_H @aܚ`T
ߧ4
0) ()@b [ bM`*YO2 3
eGaaۮbhb{0 v@V^l7-` Y = |C @>XK))+"h 0!ВGh_ z3 "hHCwI홗H B fC,5oaRo 4<5+Z RQט 1+d;_1 p@+JQ ~q hP@3&ǥ/ (`IOH/%c5 0
'L2&` BlK}}?O?6uYqpSorER)J%I bFsﾌ)H })H".RJR")H".R= T~h
L Ԡj߶VSp!c`Yhd%J|`t(' & b;gٛ܉}D2
?nI5?`gc ߫>a3 ! n_?H`'&!j7 `CJ1)=@0 xL͐6^ 4&7}r- * =J9@ 4 hc ?-WH $ `C Ԙ j;+c. 1 8)8rLJLnFၜ 8@ ^ e 7ePf Q0(`9=N곆< К+
^ -@11oo\}\ .
/P< v `~K)(<`@paPo)(PaG[V@idfm " `0ҀtPo37a^v 5D2](3w * v n? 0F [P 1;{`"dA0!$
+
71 @ dᇣTJ_:>s@ @@,{ 41! t% ﹟ZuYBsw6m.R >rE$S];+@) "%nb:A]gb })H".RJR")H".P B Xh c1;$wfP t ;OX1??g1v`k`la 0@/(nrD
A2v;Ct 1
? @B\ 8![!OX@ !;ck$! ??@@yp 'd? T',
%(Os: tB& ۥ[ }P g :rcV`|
&$4b Go6+d#dl/l '!M/"W)BJRV\] @@ ,d2VF7 @0 Jqx%
c D 0,*K}}-< !@A (,j 5
G>;9 g [,%tUHI> P*P* vѿ״
8/$]@&:S 7N^`«@0 πhCC>oP INd *0 P
GܵB@; @i]Н0@i bO} G$8⠀aDԠ,u ] T1 Y JRjdoz#3EJR")HH5))OӴtRNNo })H".RJR")H"/x y[$1_\ a1
2ͻlEO7)JZE˨ ;pс 䏷ۓ簀' b `C9 #R@0C%
@jR2? BwO3va]>0 I` @bzBS=Tw{ j %
~o?& o, 0B6hFF
!?x@R ?qL. !@\ 8J ?⠀0 ( XK )%tax=W Ieg hhh @F
(&BI0bQ^<{ :&&Kߑx b !'1# 8bO# `8BLHu0 10' @,` a93(Kpp q h P3N Sy3 RYAn"0q!.=Ѽ/R)OER)JDYO7s'>rIݓlI10O3|ȅ)c })H".RJR")H"/@
;J NlssG}# vP Jߟ @@xjJ @51a1aq~/>sy <
%x` ^]0
HIfNm5@p w)h `@LP8M) KOv n B CC% ҷ+e% ;X Y(8Ha3:e@R ` X
7}( e @ *W}dΎƧjoPH * hMn+/bHe?mշ( @?;107%+;Bﲂ f75#8 [ ftGIy\ހ) R_ `Qe
''ٓ
rA `!!#I D
He `wA 78A` L_fGh-9 E` vC!' B;6?sE a `PEbghp!,_?Zz{߶P @Y $1x ab3!yohh 0 Av@ThIG' %Z .+v8% Q^E(| %Bx߇5pX QGn @NlR0ж=x( f` \ pyE\|4 ,V͉Uր&G(n U}XnزWӟr:qqҘF:1)JD\)sԤ66ڔD
})H".RJR"(x".]@(i [y pC!C'}; 4@*Q 3wQ Q0 )GJJxdM!| " tp 3$kl/{@v; lC
|N8u@^ FB ~ֳٜ
@ pi_p@/rёЬ_@{
@00!H Y4"w @: nBJ B7s7=d@
^m F< !Fnd>@ AD2ٔA) p @ @ez> 2p oR {) nOu
@ p ]k = ahuLBu, / 5
!h]_ p`i ^sc_t@
Z e,@#>hY
0
/1Ʊڠ_k42 LjR20wP2A0 `
1(471*WnƏ f I ;-u F _H CS8o P XBHe(%S:Z PM ) P^ONQ8{` ғߑj!!bY|
h<x (B25P2Ӟ0 Mqe @fc+EA\@ ӌ,
p C1, nK@ NQ0J]
C/lLB:!ebrҗ>ޔJR")H".RJR" })H".RFzR"j6".6)rE 4@Tyr@B @tS7sx)b (bC bJNo04!bRϿC_G z ThoUפ n \@2-)'0 \(M, :ܴη3 (
140BSB,׀ L {&'2?RMUB~̒HX4Z?ydh B>I `1= ^$=a t :s^`d2o %{
M(1l*,Q.i N<*CHp`
@ ; v 6pᡥI}y؍0oe` ;_ PbM ^|8Hd$cx} vhB@tev^A 0
VBl˸ 1L [,2ɻk 6 LCfC'%t6#x 2& \ (LFB 0 (QEdd#!?b
U/ fC fs֔-rR>ͩrER)JD\) })H".RJR")HjD\)r&0rF@ J`T['8@ $ `!>7K/ MA4; ^ %
R %˼P@B ,Csc $ 0 hX#!};LD0Vop $͊wJ7pzvǽ?k : :b҇=@@ xp,Ηf9Mf@M! , @'&#PNjm58j
v7M~
CU %ttLc
yJ]i + n `e# # Hإ
0(@i PwCL-)l)CZT 72@v姛z@pH@& OBِR
̄da5)hXiaJS)IR)JD\)rER)JD\)
})H".RJ5".RN):v/jrp %`!v Q,BQNH qpҁ$3 R_
g =@P[
qA4vuqbO@A
@NZRp :
d'` _A @v 41+ 8 0Y C!3m`k@:P(L!bU۔~LJ+ @ 0JQKb! f By y dB tb`L?V7NɦBu'_o
iS{?HER)jt,7i9i/#X"C!J~ڛ\)̐ݼJg })H".RJR")H".RFԤEa
G?| 2i f
k=$$%(k 2 ` HC 9:f&O닃56ڔJR")H".Rԥ".td mHxsmH
a? D xmEȖoJ+.GE͛R })H}D;By::v Oy1`'K%>i
B5J frpĠ@jkJgPnNJo".RJR")H".RJR"6sJR")Hh__mQN\},
^FadER)JD@ })Hbi]:(Q,3}"yB&vBuːPo] U>uy|b:B+*!4|V\W"ɩ!%V$ 1 Jr): ^:H--nP,3 b KrA:W xۀ?F=:@#-H
O^T xLKB$
P i>C=
xLG;U
fL4$pjR)Έ7
chFk
;R:v(bh+/"r=6i@!I}Zs,2¬RmF}.w>_d@B+{c
~XԽR3j!
I!.RJR" })HJsSJ?|!h\)roJD\3Rj ԤE5)pe6jR")HԤE-6l?BH,H9tR~(#.jR'JR"~
DYhm))B^ER })H".RJRCk#F}Fztoq Dm>Am
RrC" ܥ))H)JD?JR!RRrC%ʮ uGi0:e)̄h
K9:o
F
tb0t)`&Q$ )JSRx ҇Q Rt ~ JVM(0GU.2Q4ӼDZI1 !gJuv 011~R R& : (}-@PeQRMa3/oΖ=zֱC֜? ;4 bd *v?Ҹ4Q3:S@ #(+DPc
kdް ~+8~߽";M&b_L95~"@5 ]!ۨC
Q~" z<}FDAĈ@T]! ~Co0MVpAMcWv_dCIPMoBoG˷}ϤP- 0
a@:cI/ 2` Rx(wbYVP} {Q O뾂C
KwTM k&y~ }Pt^xr{CDQ܂ w! "iԖ-C1(;)E>Į :@~s % 0H5[ܨK^z G@OKC_A!Gx%'A/H4ɯhJV׆ͨHHtFFJ%z$ @2j6 H8 p Bx/ʾ(pMGx20d+DPOEqNT">BC
!F^
?^ C ʻ (-6EmTPw :"5p PË/| 7%>")>L뷦Lˈ _M & ̢(KE `tk?= ܤ"`U_qHg֡@2{X_x!| bA?Z :e9=o1 Q8@`, 1=qI*8 rxKwF >(}xkC{# ̷"!3rYE+
@;!Ҁ S>"^@)\cOPOgPhe@ 2OIiPQ 1g/}k` 8(2&hB^A< @\ ~E< 0b5ڰb!=78R< + >GDj fMޑ>)3_`Kc BAN\hJHV>7\q-N "v P_@c jC_}qw tSR . rШ *L@BXf_@ @Q|u ܤ]FS]U;x6if (.2~"L)ka x|0z i etCČ1Rh) LgfM3v8uࠛڌ 6 @
Y1^L(0Py7]ޢ %# ^,ȱ Q"@cv^ؑ- ',}gR@Ok
Ϲ " >)ӑtѯ@=h G,mH 珹 b( ϾM 4P
7:q4OTEL&\` Ո ?DBA `L " 5tdB-kG0-.)-$~?ƥ)9R IMN " 8!wɻ
A` A?.rw: DPIHo@4-{W!'A;#& ǔm3Qo\K.ɼ 1 2z03E!oڏ d뷀vDQ \f Hh,v[6jͩ8>E )A )G)JDW4?X9:@5'I ?%9}l
L%bE X5u8 Bߣ#^ Z
ס $DĞRE )G)JDQRrE"g
qV?Ҕ"()H9JR"R"()H @Zzy"ԒJ@p qp,"()H9JR"R"()HA`, q:B 4aJ2>E )H wEH]p
rmU%A`]!nޏ", X`7[` ޛSJ-롵l\-5@;APn7
K
0
N
p03jq4Ir롹c=ڼ5-*uXSκp
z&
@*\AJA
CZ-d7 nKǛ3
y [jC^k jCz`1
YM @M
Hh
f@lX `o
fh4Ŏ@EAOWʮ#HUpl @ l ri Dg
{n`l/LoKO 6
k'n-Piil6Ki
ruui. o!5V Z r\ @*PgyX :W'܂5
IH 4 ))I` :W[MRpM LFfT")7#
"c})H9JR"M0ie 8d 2 2WZ
= p p(')G)JDQRrEAArmp) 2WUWW\0
v RI
,!
o@&uҩ\Bc})H9JR"R"()H9JR"
P
Wm @H0b#:6Z+3Kp
WMԬ'Tz"p\(&@Wd(! "*Z"",
Pm @R C $&A!4Z=I zJȎF@
W&hBii˖
\d(Sa!# `}'@TpuSbH&`,K >oS; };a`?>&k:P@)0ஆ` M161
W'o% K(А)p[\ .NCJ 00b[(#͂ ? @
9``PgR>_FYyo㎀vCA
8iy(iM c6N,Piddc#la1AA B942cPi@7H & P \00Zeq! i4JS
%@!ǖ@
&
ٛ 4xB @H҃ _ 4`1ID !}MB!`l kg@7!hgqMӈiK".5A('[& #%ɻd ]d$Ͼt
I-3;: H0qN%Ѡf(4j%mȐ lC ,
MHae)S@ wBv@iΎzA @tHɘlڐtX
WI
NAH2HC ,^B;
I\Ҝ^P,I@jJ3$J@]1mEXihAE'I/ (a`XyEYE ,p];0T3ei%$@`aE>:;=D{KgYh;?>A4
tpчlƘ&( q\ bd0I& , ܴ8w dcd33.Ai- t$|pjUvPha4Z{ԓ ,`ƥn &$:
::P4`Q g0WC qu&$
Bi7: dvWhb &C rڀlQ7 T@4C h&?P d?<èL 76ہ _Y5(bp00OC 3
m6Ih!PO)(=X5 c 5 w|3o@ |>&,`ܶ0O`@ dL?XjP?@' 0
+
@0:IL&$aNGjcը JR"$ ϤI
2 H$
W; (jḆn1940ۍ!bpщ%8 @`K VLi:d*ZL/uɀ1 ! 'cݙM Aԝfc$
tpa t?H2ί~s R zJ@bNŧ`ʯ@H 80e8{&% pX
%>=k(Y5 !X҆) ! 7 ⒐ەS={ y ?|7lJq/ *,1}?}o@F.J, 86Fv a@`a5
Xj ǜ8$hI d$gV_o) d0
(
Wl](LA0 d $ : P2 'X41*ku% l"h䏐4;8
Py ҧG5 P : 4ur
* ugu⟹ٱN0PyjW JR"R(.M @pH`
Wuhb
/uty|ɟ$
4 h0o+8iX3s|a:@ 0IJ#@-JzCC_9 EwY(8jNӎ_< ԓJOA4?4оk | L 0Zs Ճi4!k) `w̾8`b0l% * @&n9dt,c# 3x[J .,tܑ|ʹ+[ZKO(ahBw1y_|p2\bp,MN!C> q?HoFJM_rq8!)g&+NBI_ܘlyܰӊB:.S \CJJ
a&|iJ @hk k.`hhYn#95N;- @4 b\CRh)A w_$C L
1m
0Ӷ~#g. z @ LH{:<#9"()H9JR"R(,kI
e;R Ap^@t @
W';a#ӄ=+UpD~< 6~P5@9FPwQdd
DѩJ9)zR &O)N)O k~ZF!=Dxg%b5k>lJ:$[ bWsL~efJ?zAØ 3&4j9e| p !4W
|YFlv02ၥb7I%~WHv
~Jtrվ)n\vX| Dґ9Q>E )G)JDQRS@~HLA!ÙN}H
>:| :rOoc<ߚep8!}ֽs١J\4Ї}(HT( rWۖO҂^$sGOc3rR[|زⶤ8AP#T$?$:_8蜂@l 8E iR
>9X|Ԗ!qW
!;,DՃs(U jl?3x!$R8r 94ƀH.~V HsJd#Q'VOBIK-qQ[c
FN=;^ԁbRNdQ#0͊r7Ư7$21HFc2 7f5U1 xӜ
hdq53ZvvOC!9id10oasB OUAZ֨t A'6iY l3sHc J@p
W'Dg"*nnD50zFcjG #,
W'dE B H@6" j@l ,