Key | Value |
---|---|
FileName | ./usr/lib/python3.6/site-packages/HeapDict-1.0.1-py3.6.egg-info/PKG-INFO |
FileSize | 2193 |
MD5 | CEA94F55D730AC40CBAEE8CCCB5B33A2 |
SHA-1 | 60EF47BA7E43142B33102851A13DB86A2C7E9640 |
SHA-256 | 596B063D131B2018BF522EC6663C13138D5060090FE57650A2BD1D2D1A5CC068 |
SSDEEP | 24:DwfwdD/yHZnnHvatvVc2w6uiJyzVQIybA13OZftOKW0ZftWZft2ZftB6Zft5ZftI:Dc4DaHdnPSva2SxRQIJ138wiaas1lo |
TLSH | T1C341341125C4AEA556E3F913B75EC1438C590216624D688C34EEC54D7F43BB2877D3AC |
tar:gname | root |
tar:uname | root |
hashlookup:parent-total | 37 |
hashlookup:trust | 100 |
The searched file hash is included in 37 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
MD5 | 604ADF50050ECB1CA920783B884F50B3 |
PackageArch | noarch |
PackageDescription | HeapDict implements the MutableMapping ABC, meaning it works pretty much like a regular Python dict. It's designed to be used as a priority queue. Unlike the Python standard library's heapq module, the HeapDict supports efficiently changing the priority of an existing object (often called "decrease-key" in textbooks). Altering the priority is important for many algorithms such as Dijkstra's Algorithm and A*. |
PackageName | python2-HeapDict |
PackageRelease | 3.3 |
PackageVersion | 1.0.1 |
SHA-1 | 0A2DB507DF5115EC28B25ED6C92A98F864B42568 |
SHA-256 | ABFE89DF3E212720707DB4856111FE5F5F20401BE12DFB4AB29FDC0E23CC2E58 |
Key | Value |
---|---|
FileSize | 5324 |
MD5 | 1F204F29B4049D5BD102258F8361F946 |
PackageDescription | heap with decrease-key and increase-key operations for Python 3 heapdict implements the MutableMapping ABC, meaning it works pretty much like a regular Python dict. It's designed to be used as a priority queue. . This contains the Python 3 version |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | python3-heapdict |
PackageSection | python |
PackageVersion | 1.0.1-1 |
SHA-1 | 0B286719E743A3F3B6B2AC030DB79E6CDEFEB2E8 |
SHA-256 | 2FC46A71E13468A6E738B42093B32B30909130B42A46293E10A10B951BCFEB73 |
Key | Value |
---|---|
MD5 | F0FB112056C271500850B903626A054F |
PackageArch | noarch |
PackageDescription | HeapDict implements the MutableMapping ABC, meaning it works pretty much like a regular Python dict. It's designed to be used as a priority queue. Unlike the Python standard library's heapq module, the HeapDict supports efficiently changing the priority of an existing object (often called "decrease-key" in textbooks). Altering the priority is important for many algorithms such as Dijkstra's Algorithm and A*. |
PackageMaintainer | https://bugs.opensuse.org |
PackageName | python3-HeapDict |
PackageRelease | bp153.1.17 |
PackageVersion | 1.0.1 |
SHA-1 | 1574DF613FB2F7C0A13E359B923719AAE7C1503F |
SHA-256 | 366A084B29F7AFD5DCD8BABDFCBFBFFCF0DA342ABFC797D8ACF89048A505DD10 |
Key | Value |
---|---|
MD5 | A51DCFDE5506968CFB1BF4E196001026 |
PackageArch | noarch |
PackageDescription | HeapDict implements the MutableMapping ABC, meaning it works pretty much like a regular Python dict. It's designed to be used as a priority queue. Unlike the Python standard library's heapq module, the HeapDict supports efficiently changing the priority of an existing object (often called "decrease-key" in textbooks). Altering the priority is important for many algorithms such as Dijkstra's Algorithm and A*. |
PackageName | python2-HeapDict |
PackageRelease | lp151.14.1 |
PackageVersion | 1.0.1 |
SHA-1 | 1878AA82C157C8F37022F11228231A6276CEC3C0 |
SHA-256 | B03220E1F04FA8D880C0F6739731981258D679B3B01DC9B67B2459F92D3ABD3C |
Key | Value |
---|---|
MD5 | B1AF1B975A3B692EAEEDF6C69B7AD269 |
PackageArch | noarch |
PackageDescription | HeapDict implements the MutableMapping ABC, meaning it works pretty much like a regular Python dict. It's designed to be used as a priority queue. Unlike the Python standard library's heapq module, the HeapDict supports efficiently changing the priority of an existing object (often called "decrease-key" in textbooks). Altering the priority is important for many algorithms such as Dijkstra's Algorithm and A*. |
PackageName | python2-HeapDict |
PackageRelease | lp153.3.14 |
PackageVersion | 1.0.1 |
SHA-1 | 1A294EB509402D6FD8171A990EC8F261DE969827 |
SHA-256 | AF4E19742B6B29A81220A2CE31D098B054C60D4B0F8465EFFD7465F48C658B57 |
Key | Value |
---|---|
MD5 | 07B9A39B25DCCE9D07ED6436212E3CC5 |
PackageArch | noarch |
PackageDescription | HeapDict implements the MutableMapping ABC, meaning it works pretty much like a regular Python dict. It's designed to be used as a priority queue. Unlike the Python standard library's heapq module, the HeapDict supports efficiently changing the priority of an existing object (often called "decrease-key" in textbooks). Altering the priority is important for many algorithms such as Dijkstra's Algorithm and A*. |
PackageName | python3-HeapDict |
PackageRelease | lp151.14.1 |
PackageVersion | 1.0.1 |
SHA-1 | 21CFBE94CDDD141BAF97A558D9B2EBEF8EE6788B |
SHA-256 | 6C1AD517F2847153EBFD5D16687611D3B102D0990C05421003519F47958D55A4 |
Key | Value |
---|---|
MD5 | 0E999C1B180B1B1D1942D768EE05FA7A |
PackageArch | noarch |
PackageDescription | HeapDict implements the MutableMapping ABC, meaning it works pretty much like a regular Python dict. It's designed to be used as a priority queue. Unlike the Python standard library's heapq module, the HeapDict supports efficiently changing the priority of an existing object (often called "decrease-key" in textbooks). Altering the priority is important for many algorithms such as Dijkstra's Algorithm and A*. |
PackageName | python2-HeapDict |
PackageRelease | lp152.14.4 |
PackageVersion | 1.0.1 |
SHA-1 | 25F63B90C16D3836CD6F037DED82004F49B40A11 |
SHA-256 | 8C53506791F7124DE0DAD43435A75EEEAC1108F35A131C679D5DADFB8BEC0D5A |
Key | Value |
---|---|
MD5 | C2FC47B7C41265D99CDB09C56B6E0287 |
PackageArch | noarch |
PackageDescription | HeapDict implements the MutableMapping ABC, meaning it works pretty much like a regular Python dict. It's designed to be used as a priority queue. Unlike the Python standard library's heapq module, the HeapDict supports efficiently changing the priority of an existing object (often called "decrease-key" in textbooks). Altering the priority is important for many algorithms such as Dijkstra's Algorithm and A*. |
PackageMaintainer | https://bugs.opensuse.org |
PackageName | python2-HeapDict |
PackageRelease | bp153.1.17 |
PackageVersion | 1.0.1 |
SHA-1 | 2883EB4E9E76F27B3826C73DD713ADE9C0CEE08C |
SHA-256 | B6C9278966F809189D4A3B568683C77BE24CCA642AB21F405EB3C07B93434B94 |
Key | Value |
---|---|
MD5 | 82333F017612DE4E9038CE5A8B024FD7 |
PackageArch | noarch |
PackageDescription | HeapDict implements the MutableMapping ABC, meaning it works pretty much like a regular Python dict. It's designed to be used as a priority queue. Unlike the Python standard library's heapq module, the HeapDict supports efficiently changing the priority of an existing object (often called "decrease-key" in textbooks). Altering the priority is important for many algorithms such as Dijkstra's Algorithm and A*. |
PackageName | python2-HeapDict |
PackageRelease | 3.4 |
PackageVersion | 1.0.1 |
SHA-1 | 2CDCBF8426FA4B788FE82AEFBD52250612FFA0B6 |
SHA-256 | 0E680E5F8614B3AE0C5B4D40438E8848AC26728415412CF48A05DF9CD2543A9F |
Key | Value |
---|---|
MD5 | 9203BB75A40B49F7A8AEEB22A419FE42 |
PackageArch | noarch |
PackageDescription | HeapDict is designed to be used as a priority queue, where items are added and consumed by priority. Compared to an ordinary dict, a heapdict has the following differences: popitem and peekitem returns the (key, priority) pair with the lowest priority, instead of a random object. |
PackageMaintainer | Fedora Project |
PackageName | python3-heapdict |
PackageRelease | 4.fc33 |
PackageVersion | 1.0.1 |
SHA-1 | 325F379DEEC2442DED9EA4E95279C8D40333311F |
SHA-256 | 7B332A4062B482B66E8D08940ADFB4EA87FF7B02B0E64163D9AA707153BF8ABA |