{
"info": {
"author": "Dusan Klinec (ph4r05)",
"author_email": "dusan.klinec@gmail.com",
"bugtrack_url": null,
"classifiers": [
"Development Status :: 5 - Production/Stable",
"Intended Audience :: Developers",
"License :: OSI Approved :: Python Software Foundation License",
"Operating System :: OS Independent",
"Programming Language :: C",
"Programming Language :: Python :: 2",
"Programming Language :: Python :: 2.4",
"Programming Language :: Python :: 2.5",
"Programming Language :: Python :: 2.6",
"Programming Language :: Python :: 2.7",
"Programming Language :: Python :: 3",
"Programming Language :: Python :: 3.1",
"Programming Language :: Python :: 3.2",
"Programming Language :: Python :: 3.3",
"Programming Language :: Python :: 3.4",
"Programming Language :: Python :: 3.5",
"Programming Language :: Python :: 3.6",
"Topic :: Utilities"
],
"description": "======================================\nbitarray: efficient arrays of booleans\n======================================\n\nThis module provides an object type which efficiently represents an array\nof booleans. Bitarrays are sequence types and behave very much like usual\nlists. Eight bits are represented by one byte in a contiguous block of\nmemory. The user can select between two representations: little-endian\nand big-endian. All of the functionality is implemented in C.\nMethods for accessing the machine representation are provided.\nThis can be useful when bit level access to binary files is required,\nsuch as portable bitmap image files (.pbm). Also, when dealing with\ncompressed data which uses variable bit length encoding, you may find\nthis module useful.\n\n\nKey features\n------------\n\n* All functionality implemented in C.\n\n* Bitarray objects behave very much like a list object, in particular\n slicing (including slice assignment and deletion) is supported.\n\n* The bit endianness can be specified for each bitarray object, see below.\n\n* On 32bit systems, a bitarray object can contain up to 2^34 elements,\n that is 16 Gbits (on 64bit machines up to 2^63 elements in theory --\n on Python 2.4 only 2^31 elements,\n see `PEP 353 `_\n (added in Python 2.5)).\n\n* Packing and unpacking to other binary data formats,\n e.g. `numpy.ndarray `_,\n is possible.\n\n* Fast methods for encoding and decoding variable bit length prefix codes\n\n* Sequential search (as list or iterator)\n\n* Bitwise operations: ``&, |, ^, &=, |=, ^=, ~``\n\n* Pickling and unpickling of bitarray objects possible.\n\n* Bitarray objects support the buffer protocol (Python 2.7 only)\n\n\nImprovements in this fork\n-------------------------\n\n* Fast copy function - used in many places internally. If have same endianness and aligned offsets, ``memmove`` is used.\n\n* Pull request for fast bitwise operations using SIMD instructions merged - 16 bytes in one instruction.\n\n* Bitcount function optimised ``count()``. Hamming weight is computed using WP3 algorithm on 64bit words.\n\n* New method: ``ba.fast_copy(other)``. If the dest bitarray has same bitlength the fast copy is used - ``memmove``.\n\n* New method: ``ba.eval_monic(data, index, blocksize)``. Evaluates a monic term on the input data with x_index and the given\n blocksize. Equivalent to ``data[index::blocksize]``. The evaluation is performed in-place with minimal memory reallocations.\n The result is a bitarray of evaluations of the term.\n\n* New method: ``ba.fast_hw_and(other)``. Performs ``return count(ba & other)`` in memory without reallocations\n\n* New method: ``ba.fast_hw_or(other)``. Performs ``return count(ba | other)`` in memory without reallocations\n\n* New method: ``ba.fast_hw_xor(other)``. Performs ``return count(ba ^ other)`` in memory without reallocations\n\nInstallation\n------------\n\nInstallation from pip::\n\n $ pip install bitarray_ph4\n\n\nbitarray can be installed from source::\n\n $ tar xzf bitarray-0.8.2.tar.gz\n $ cd bitarray-0.8.2\n $ python setup.py install\n\nOn Unix systems, the latter command may have to be executed with root\nprivileges.\nIf you have `distribute `_\ninstalled, you can easy_install bitarray.\nOnce you have installed the package, you may want to test it::\n\n $ python -c 'import bitarray; bitarray.test()'\n bitarray is installed in: /usr/local/lib/python2.7/site-packages/bitarray\n bitarray version: 0.8.2\n 2.7.2 (r271:86832, Nov 29 2010) [GCC 4.2.1 (SUSE Linux)]\n .........................................................................\n ...........................................\n ----------------------------------------------------------------------\n Ran 134 tests in 1.396s\n \n OK\n\nYou can always import the function test,\nand ``test().wasSuccessful()`` will return True when the test went well.\n\n\n\nUsing the module\n----------------\n\nAs mentioned above, bitarray objects behave very much like lists, so\nthere is not too new to learn. The biggest difference to list objects\nis the ability to access the machine representation of the object.\nWhen doing so, the bit endianness is of importance, this issue is\nexplained in detail in the section below. Here, we demonstrate the\nbasic usage of bitarray objects:\n\n >>> from bitarray import bitarray\n >>> a = bitarray() # create empty bitarray\n >>> a.append(True)\n >>> a.extend([False, True, True])\n >>> a\n bitarray('1011')\n\nBitarray objects can be instantiated in different ways:\n\n >>> a = bitarray(2**20) # bitarray of length 1048576 (uninitialized)\n >>> bitarray('1001011') # from a string\n bitarray('1001011')\n >>> lst = [True, False, False, True, False, True, True]\n >>> bitarray(lst) # from list, tuple, iterable\n bitarray('1001011')\n\nBits can be assigned from any Python object, if the value can be interpreted\nas a truth value. You can think of this as Python's built-in function bool()\nbeing applied, whenever casting an object:\n\n >>> a = bitarray([42, '', True, {}, 'foo', None])\n >>> a\n bitarray('101010')\n >>> a.append(a) # note that bool(a) is True\n >>> a.count(42) # counts occurrences of True (not 42)\n 4L\n >>> a.remove('') # removes first occurrence of False\n >>> a\n bitarray('110101')\n\nLike lists, bitarray objects support slice assignment and deletion:\n\n >>> a = bitarray(50)\n >>> a.setall(False)\n >>> a[11:37:3] = 9 * bitarray([True])\n >>> a\n bitarray('00000000000100100100100100100100100100000000000000')\n >>> del a[12::3]\n >>> a\n bitarray('0000000000010101010101010101000000000')\n >>> a[-6:] = bitarray('10011')\n >>> a\n bitarray('000000000001010101010101010100010011')\n >>> a += bitarray('000111')\n >>> a[9:]\n bitarray('001010101010101010100010011000111')\n\nIn addition, slices can be assigned to booleans, which is easier (and\nfaster) than assigning to a bitarray in which all values are the same:\n\n >>> a = 20 * bitarray('0')\n >>> a[1:15:3] = True\n >>> a\n bitarray('01001001001001000000')\n\nThis is easier and faster than:\n\n >>> a = 20 * bitarray('0')\n >>> a[1:15:3] = 5 * bitarray('1')\n >>> a\n bitarray('01001001001001000000')\n\nNote that in the latter we have to create a temporary bitarray whose length\nmust be known or calculated.\n\n\nBit endianness\n--------------\n\nSince a bitarray allows addressing of individual bits, where the machine\nrepresents 8 bits in one byte, there are two obvious choices for this\nmapping: little- and big-endian.\nWhen creating a new bitarray object, the endianness can always be\nspecified explicitly:\n\n >>> a = bitarray(endian='little')\n >>> a.frombytes(b'A')\n >>> a\n bitarray('10000010')\n >>> b = bitarray('11000010', endian='little')\n >>> b.tobytes()\n 'C'\n\nHere, the low-bit comes first because little-endian means that increasing\nnumeric significance corresponds to an increasing address (index).\nSo a[0] is the lowest and least significant bit, and a[7] is the highest\nand most significant bit.\n\n >>> a = bitarray(endian='big')\n >>> a.frombytes(b'A')\n >>> a\n bitarray('01000001')\n >>> a[6] = 1\n >>> a.tobytes()\n 'C'\n\nHere, the high-bit comes first because big-endian\nmeans \"most-significant first\".\nSo a[0] is now the lowest and most significant bit, and a[7] is the highest\nand least significant bit.\n\nThe bit endianness is a property attached to each bitarray object.\nWhen comparing bitarray objects, the endianness (and hence the machine\nrepresentation) is irrelevant; what matters is the mapping from indices\nto bits:\n\n >>> bitarray('11001', endian='big') == bitarray('11001', endian='little')\n True\n\nBitwise operations (``&, |, ^, &=, |=, ^=, ~``) are implemented efficiently\nusing the corresponding byte operations in C, i.e. the operators act on the\nmachine representation of the bitarray objects. Therefore, one has to be\ncautious when applying the operation to bitarrays with different endianness.\n\nWhen converting to and from machine representation, using\nthe ``tobytes``, ``frombytes``, ``tofile`` and ``fromfile`` methods,\nthe endianness matters:\n\n >>> a = bitarray(endian='little')\n >>> a.frombytes(b'\\x01')\n >>> a\n bitarray('10000000')\n >>> b = bitarray(endian='big')\n >>> b.frombytes(b'\\x80')\n >>> b\n bitarray('10000000')\n >>> a == b\n True\n >>> a.tobytes() == b.tobytes()\n False\n\nThe endianness can not be changed once an object is created.\nHowever, since creating a bitarray from another bitarray just copies the\nmemory representing the data, you can create a new bitarray with different\nendianness:\n\n >>> a = bitarray('11100000', endian='little')\n >>> a\n bitarray('11100000')\n >>> b = bitarray(a, endian='big')\n >>> b\n bitarray('00000111')\n >>> a == b\n False\n >>> a.tobytes() == b.tobytes()\n True\n\nThe default bit endianness is currently big-endian, however this may change\nin the future, and when dealing with the machine representation of bitarray\nobjects, it is recommended to always explicitly specify the endianness.\n\nUnless, explicitly converting to machine representation, using\nthe ``tobytes``, ``frombytes``, ``tofile`` and ``fromfile`` methods,\nthe bit endianness will have no effect on any computation, and one\ncan safely ignore setting the endianness, and other details of this section.\n\n\nBuffer protocol\n---------------\n\nPython 2.7 provides memoryview objects, which allow Python code to access\nthe internal data of an object that supports the buffer protocol without\ncopying. Bitarray objects support this protocol, with the memory being\ninterpreted as simple bytes.\n\n >>> a = bitarray('01000001' '01000010' '01000011', endian='big')\n >>> v = memoryview(a)\n >>> len(v)\n 3\n >>> v[-1]\n 'C'\n >>> v[:2].tobytes()\n 'AB'\n >>> v.readonly # changing a bitarray's memory is also possible\n False\n >>> v[1] = 'o'\n >>> a\n bitarray('010000010110111101000011')\n\n\nVariable bit length prefix codes\n--------------------------------\n\nThe method ``encode`` takes a dictionary mapping symbols to bitarrays\nand an iterable, and extends the bitarray object with the encoded symbols\nfound while iterating. For example:\n\n >>> d = {'H':bitarray('111'), 'e':bitarray('0'),\n ... 'l':bitarray('110'), 'o':bitarray('10')}\n ...\n >>> a = bitarray()\n >>> a.encode(d, 'Hello')\n >>> a\n bitarray('111011011010')\n\nNote that the string ``'Hello'`` is an iterable, but the symbols are not\nlimited to characters, in fact any immutable Python object can be a symbol.\nTaking the same dictionary, we can apply the ``decode`` method which will\nreturn a list of the symbols:\n\n >>> a.decode(d)\n ['H', 'e', 'l', 'l', 'o']\n >>> ''.join(a.decode(d))\n 'Hello'\n\nSince symbols are not limited to being characters, it is necessary to return\nthem as elements of a list, rather than simply returning the joined string.\n\n\nReference\n---------\n\n**The bitarray class:**\n\n``bitarray([initial], [endian=string])``\n Return a new bitarray object whose items are bits initialized from\n the optional initial, and endianness.\n If no object is provided, the bitarray is initialized to have length zero.\n The initial object may be of the following types:\n \n int, long\n Create bitarray of length given by the integer. The initial values\n in the array are random, because only the memory allocated.\n \n string\n Create bitarray from a string of '0's and '1's.\n \n list, tuple, iterable\n Create bitarray from a sequence, each element in the sequence is\n converted to a bit using truth value value.\n \n bitarray\n Create bitarray from another bitarray. This is done by copying the\n memory holding the bitarray data, and is hence very fast.\n \n The optional keyword arguments 'endian' specifies the bit endianness of the\n created bitarray object.\n Allowed values are 'big' and 'little' (default is 'big').\n \n Note that setting the bit endianness only has an effect when accessing the\n machine representation of the bitarray, i.e. when using the methods: tofile,\n fromfile, tobytes, frombytes.\n\n\n**A bitarray object supports the following methods:**\n\n``all()`` -> bool\n Returns True when all bits in the array are True.\n\n\n``any()`` -> bool\n Returns True when any bit in the array is True.\n\n\n``append(item)``\n Append the value bool(item) to the end of the bitarray.\n\n\n``buffer_info()`` -> tuple\n Return a tuple (address, size, endianness, unused, allocated) giving the\n current memory address, the size (in bytes) used to hold the bitarray's\n contents, the bit endianness as a string, the number of unused bits\n (e.g. a bitarray of length 11 will have a buffer size of 2 bytes and\n 5 unused bits), and the size (in bytes) of the allocated memory.\n\n\n``bytereverse()``\n For all bytes representing the bitarray, reverse the bit order (in-place).\n Note: This method changes the actual machine values representing the\n bitarray; it does not change the endianness of the bitarray object.\n\n\n``copy()`` -> bitarray\n Return a copy of the bitarray.\n\n\n``count([value])`` -> int\n Return number of occurrences of value (defaults to True) in the bitarray.\n\n\n``decode(code)`` -> list\n Given a prefix code (a dict mapping symbols to bitarrays),\n decode the content of the bitarray and return the list of symbols.\n\n\n``encode(code, iterable)``\n Given a prefix code (a dict mapping symbols to bitarrays),\n iterates over iterable object with symbols, and extends the bitarray\n with the corresponding bitarray for each symbols.\n\n\n``endian()`` -> string\n Return the bit endianness as a string (either 'little' or 'big').\n\n\n``extend(object)``\n Append bits to the end of the bitarray. The objects which can be passed\n to this method are the same iterable objects which can given to a bitarray\n object upon initialization.\n\n\n``fill()`` -> int\n Adds zeros to the end of the bitarray, such that the length of the bitarray\n is not a multiple of 8. Returns the number of bits added (0..7).\n\n\n``frombytes(bytes)``\n Append from a byte string, interpreted as machine values.\n\n\n``fromfile(f, [n])``\n Read n bytes from the file object f and append them to the bitarray\n interpreted as machine values. When n is omitted, as many bytes are\n read until EOF is reached.\n\n\n``fromstring(string)``\n Append from a string, interpreting the string as machine values.\n Deprecated since version 0.4.0, use ``frombytes()`` instead.\n\n\n``index(value, [start, [stop]])`` -> int\n Return index of the first occurrence of bool(value) in the bitarray.\n Raises ValueError if the value is not present.\n\n\n``insert(i, item)``\n Insert bool(item) into the bitarray before position i.\n\n\n``invert()``\n Invert all bits in the array (in-place),\n i.e. convert each 1-bit into a 0-bit and vice versa.\n\n\n``iterdecode(code)`` -> iterator\n Given a prefix code (a dict mapping symbols to bitarrays),\n decode the content of the bitarray and iterate over the symbols.\n\n\n``itersearch(bitarray)`` -> iterator\n Searches for the given a bitarray in self, and return an iterator over\n the start positions where bitarray matches self.\n\n\n``length()`` -> int\n Return the length, i.e. number of bits stored in the bitarray.\n This method is preferred over __len__ (used when typing ``len(a)``),\n since __len__ will fail for a bitarray object with 2^31 or more elements\n on a 32bit machine, whereas this method will return the correct value,\n on 32bit and 64bit machines.\n\n\n``pack(bytes)``\n Extend the bitarray from a byte string, where each characters corresponds to\n a single bit. The character b'\\x00' maps to bit 0 and all other characters\n map to bit 1.\n This method, as well as the unpack method, are meant for efficient\n transfer of data between bitarray objects to other python objects\n (for example NumPy's ndarray object) which have a different view of memory.\n\n\n``pop([i])`` -> item\n Return the i-th (default last) element and delete it from the bitarray.\n Raises IndexError if bitarray is empty or index is out of range.\n\n\n``remove(item)``\n Remove the first occurrence of bool(item) in the bitarray.\n Raises ValueError if item is not present.\n\n\n``reverse()``\n Reverse the order of bits in the array (in-place).\n\n\n``search(bitarray, [limit])`` -> list\n Searches for the given a bitarray in self, and returns the start positions\n where bitarray matches self as a list.\n The optional argument limits the number of search results to the integer\n specified. By default, all search results are returned.\n\n\n``setall(value)``\n Set all bits in the bitarray to bool(value).\n\n\n``sort(reverse=False)``\n Sort the bits in the array (in-place).\n\n\n``to01()`` -> string\n Return a string containing '0's and '1's, representing the bits in the\n bitarray object.\n Note: To extend a bitarray from a string containing '0's and '1's,\n use the extend method.\n\n\n``tobytes()`` -> bytes\n Return the byte representation of the bitarray.\n When the length of the bitarray is not a multiple of 8, the few remaining\n bits (1..7) are set to 0.\n\n\n``tofile(f)``\n Write all bits (as machine values) to the file object f.\n When the length of the bitarray is not a multiple of 8,\n the remaining bits (1..7) are set to 0.\n\n\n``tolist()`` -> list\n Return an ordinary list with the items in the bitarray.\n Note that the list object being created will require 32 or 64 times more\n memory than the bitarray object, which may cause a memory error if the\n bitarray is very large.\n Also note that to extend a bitarray with elements from a list,\n use the extend method.\n\n\n``tostring()`` -> string\n Return the string representing (machine values) of the bitarray.\n When the length of the bitarray is not a multiple of 8, the few remaining\n bits (1..7) are set to 0.\n Deprecated since version 0.4.0, use ``tobytes()`` instead.\n\n\n``unpack(zero=b'\\x00', one=b'\\xff')`` -> bytes\n Return a byte string containing one character for each bit in the bitarray,\n using the specified mapping.\n See also the pack method.\n\n\n**Functions defined in the module:**\n\n``test(verbosity=1, repeat=1)`` -> TextTestResult\n Run self-test, and return unittest.runner.TextTestResult object.\n\n\n``bitdiff(a, b)`` -> int\n Return the difference between two bitarrays a and b.\n This is function does the same as (a ^ b).count(), but is more memory\n efficient, as no intermediate bitarray object gets created\n\n\n``bits2bytes(n)`` -> int\n Return the number of bytes necessary to store n bits.\n\n\nChange log\n----------\n\n2013-XX-XX 0.8.2:\n\n\n\n**0.8.1** (2013-03-30):\n\n * fix issue #10, i.e. int(bitarray()) segfault\n * added tests for using a bitarray object as an argument to functions\n like int, long (on Python 2), float, list, tuple, dict\n\n\n**0.8.0** (2012-04-04):\n\n * add Python 2.4 support\n * add (module level) function bitdiff for calculating the difference\n between two bitarrays\n\n\n**0.7.0** (2012-02-15):\n\n * add iterdecode method (C level), which returns an iterator but is\n otherwise like the decode method\n * improve memory efficiency and speed of pickling large bitarray objects\n\n\nPlease find the complete change log\n`here `_.",
"description_content_type": null,
"docs_url": null,
"download_url": "UNKNOWN",
"downloads": {
"last_day": -1,
"last_month": -1,
"last_week": -1
},
"home_page": "https://github.com/ph4r05/bitarray",
"keywords": null,
"license": "PSF",
"maintainer": null,
"maintainer_email": null,
"name": "bitarray_ph4",
"package_url": "https://pypi.org/project/bitarray_ph4/",
"platform": "UNKNOWN",
"project_url": "https://pypi.org/project/bitarray_ph4/",
"project_urls": {
"Download": "UNKNOWN",
"Homepage": "https://github.com/ph4r05/bitarray"
},
"release_url": "https://pypi.org/project/bitarray_ph4/0.8.11/",
"requires_dist": null,
"requires_python": null,
"summary": "efficient arrays of booleans -- C extension",
"version": "0.8.11"
},
"last_serial": 2706079,
"releases": {
"0.8.10": [
{
"comment_text": "",
"digests": {
"md5": "03d9e73616e095bbf8617ec2a4ae267d",
"sha256": "c0b43f397d95f73770c12ea636d8dd11a63bd6a9edbc6ea167867ac34a04fa75"
},
"downloads": -1,
"filename": "bitarray_ph4-0.8.10.tar.gz",
"has_sig": false,
"md5_digest": "03d9e73616e095bbf8617ec2a4ae267d",
"packagetype": "sdist",
"python_version": "source",
"requires_python": null,
"size": 49913,
"upload_time": "2017-03-14T22:50:47",
"url": "https://files.pythonhosted.org/packages/e7/81/6355fe58e711742c0e736a93f869676bd2602d04749b53f07a6da3865849/bitarray_ph4-0.8.10.tar.gz"
}
],
"0.8.11": [
{
"comment_text": "",
"digests": {
"md5": "a2708f3cfab1241b332ed670dc9bb9b4",
"sha256": "2e0acd76655978b91d8dc7bd69a959b37c065311d0f498f177b6142b90f7b75e"
},
"downloads": -1,
"filename": "bitarray_ph4-0.8.11.tar.gz",
"has_sig": false,
"md5_digest": "a2708f3cfab1241b332ed670dc9bb9b4",
"packagetype": "sdist",
"python_version": "source",
"requires_python": null,
"size": 49945,
"upload_time": "2017-03-14T22:58:46",
"url": "https://files.pythonhosted.org/packages/b9/6a/aab98a2cfbec402dff1610aa392552a2742b25903428c1a57534e70c8d41/bitarray_ph4-0.8.11.tar.gz"
}
],
"0.8.3": [
{
"comment_text": "",
"digests": {
"md5": "85191965a3a61c295697119c85161960",
"sha256": "f1f4dbc63fe3b329bb194a2ada23993d5217452fbcf73ee5ce24cc9b56acd130"
},
"downloads": -1,
"filename": "bitarray_ph4-0.8.3.tar.gz",
"has_sig": false,
"md5_digest": "85191965a3a61c295697119c85161960",
"packagetype": "sdist",
"python_version": "source",
"requires_python": null,
"size": 36927,
"upload_time": "2017-01-16T23:14:00",
"url": "https://files.pythonhosted.org/packages/1f/67/8cbd6624574d5683a6f7899175028b24d9068f8ec893216356d7d582a104/bitarray_ph4-0.8.3.tar.gz"
}
],
"0.8.4": [
{
"comment_text": "",
"digests": {
"md5": "2c97e0b4f12d912507a9065bf7856220",
"sha256": "61833f5306f28e3bfe4601b9c6bd4f1d5ce70000d88800f3446e90eae279b42f"
},
"downloads": -1,
"filename": "bitarray_ph4-0.8.4.tar.gz",
"has_sig": false,
"md5_digest": "2c97e0b4f12d912507a9065bf7856220",
"packagetype": "sdist",
"python_version": "source",
"requires_python": null,
"size": 38314,
"upload_time": "2017-01-17T14:03:33",
"url": "https://files.pythonhosted.org/packages/79/b3/4d2a4631f92e96b35028e979f49bdef5ef0de49909df607399970ad97f45/bitarray_ph4-0.8.4.tar.gz"
}
],
"0.8.5": [
{
"comment_text": "",
"digests": {
"md5": "5a018a5cb0a98a04c1a222d409586794",
"sha256": "3042dd0706a8878766778b3b222c0c6a3fbdc36393b4ba65f9bf1d13146077c8"
},
"downloads": -1,
"filename": "bitarray_ph4-0.8.5.tar.gz",
"has_sig": false,
"md5_digest": "5a018a5cb0a98a04c1a222d409586794",
"packagetype": "sdist",
"python_version": "source",
"requires_python": null,
"size": 40548,
"upload_time": "2017-01-22T15:32:34",
"url": "https://files.pythonhosted.org/packages/6b/be/8f73ea5d34f1b1da7e52ddb1086703489f76cbf12c81098243c64f8f2d36/bitarray_ph4-0.8.5.tar.gz"
}
],
"0.8.6": [
{
"comment_text": "",
"digests": {
"md5": "89c331533483eb0c5904b230ede64e7b",
"sha256": "1b4e1374f6a9ec3d1df0b9da3579f43565be70770e512d42e78cb6ce02eb85c2"
},
"downloads": -1,
"filename": "bitarray_ph4-0.8.6.tar.gz",
"has_sig": false,
"md5_digest": "89c331533483eb0c5904b230ede64e7b",
"packagetype": "sdist",
"python_version": "source",
"requires_python": null,
"size": 40971,
"upload_time": "2017-01-22T16:19:24",
"url": "https://files.pythonhosted.org/packages/ab/90/9b3e9a7900d327d1e9da03f0b3f542aa6e13ed7da2b629f485eeca7e90af/bitarray_ph4-0.8.6.tar.gz"
}
],
"0.8.7": [
{
"comment_text": "",
"digests": {
"md5": "19b4e473405fe88f165e3fa5c7f7dcb5",
"sha256": "ba0b6b910bce30ceb3de56b1c8f419b8d50fe91024530d4624651d9b1cd359a2"
},
"downloads": -1,
"filename": "bitarray_ph4-0.8.7.tar.gz",
"has_sig": false,
"md5_digest": "19b4e473405fe88f165e3fa5c7f7dcb5",
"packagetype": "sdist",
"python_version": "source",
"requires_python": null,
"size": 47069,
"upload_time": "2017-02-21T21:10:25",
"url": "https://files.pythonhosted.org/packages/08/2e/18470481f87f6d280f912c30bb272e440e2ea87c14bfc49d9a8205c878d4/bitarray_ph4-0.8.7.tar.gz"
}
]
},
"urls": [
{
"comment_text": "",
"digests": {
"md5": "a2708f3cfab1241b332ed670dc9bb9b4",
"sha256": "2e0acd76655978b91d8dc7bd69a959b37c065311d0f498f177b6142b90f7b75e"
},
"downloads": -1,
"filename": "bitarray_ph4-0.8.11.tar.gz",
"has_sig": false,
"md5_digest": "a2708f3cfab1241b332ed670dc9bb9b4",
"packagetype": "sdist",
"python_version": "source",
"requires_python": null,
"size": 49945,
"upload_time": "2017-03-14T22:58:46",
"url": "https://files.pythonhosted.org/packages/b9/6a/aab98a2cfbec402dff1610aa392552a2742b25903428c1a57534e70c8d41/bitarray_ph4-0.8.11.tar.gz"
}
]
}