Key | Value |
---|---|
FileName | ./usr/lib/python3.8/site-packages/__pycache__/heapdict.cpython-38.opt-1.pyc |
FileSize | 3489 |
MD5 | 8187ACD94BF31D9689DD5DE575645784 |
SHA-1 | A7CC4DF7F9AA1CC090300D48497C23302E9CF29C |
SHA-256 | 1E6344635B62AAC177A200C9BF677D541F9A8610B9DFA229A275C7DBAAFB2C7E |
SSDEEP | 48:CG0sUxPDni3b0CimmBkPbsH+d5T0L1aQuyNynb1jNRKmMYCCUcn/ZS/02m:AXl7iL0CimjsHI0s5p8mMqnBKfm |
TLSH | T1DB71DDCA89865E7FFCEDF67B541B4390AB365673A70582476019903B2C0A7D58E34688 |
hashlookup:parent-total | 8 |
hashlookup:trust | 90 |
The searched file hash is included in 8 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
MD5 | 46C7D949283F645A1CF777D2CD0C9B1B |
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 | python38-HeapDict |
PackageRelease | 14.28 |
PackageVersion | 1.0.1 |
SHA-1 | 84FAAF38606ABA6A64EDB99E4FF2F204D62B577B |
SHA-256 | 80A766952E68AD950AA8B4279775330D0E3CE49656037820F7817D5A24CD7FAF |
Key | Value |
---|---|
MD5 | 8E5BF0E5C9266C4D99BA86262037EA60 |
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 | python38-HeapDict |
PackageRelease | 2.7 |
PackageVersion | 1.0.1 |
SHA-1 | 4E22A4811AF5F252B8944003B28DE02143CDC29F |
SHA-256 | 3E169B626DB9E2D51D47BE1DD662A219F2C3A6E7E8CD20AF02A942F3D128FA33 |
Key | Value |
---|---|
MD5 | 6C8D48B53C0545D438CB2874DCA3E370 |
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 | python38-HeapDict |
PackageRelease | 2.3 |
PackageVersion | 1.0.1 |
SHA-1 | DA818630B3BECF64A74D711DBB1E44965F02A699 |
SHA-256 | A06FCF99F845EB252CF124D9BFF2C218DE61B3E771E53B10DDB6B82BF5D6177C |
Key | Value |
---|---|
MD5 | 9996F0A04D4EEFEE922DD8FDBF60F9D3 |
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 | python38-HeapDict |
PackageRelease | 14.19 |
PackageVersion | 1.0.1 |
SHA-1 | 2109DC941E3B202880A4E0198763C71A337B5A25 |
SHA-256 | 731808CF1054DB278C61737FD5DA3B6B3CE0832FE25776A832390E6BDE56648A |
Key | Value |
---|---|
MD5 | F6E18888F8AE24A6EE162170CB4D677E |
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 | python38-HeapDict |
PackageRelease | 14.16 |
PackageVersion | 1.0.1 |
SHA-1 | 6E710B5510251EB995962C786B495D3596C44256 |
SHA-256 | 27D59224D70F1F04A2A75E1C5977B45A496C51FF2559C35F0D03339AC6D8EB9F |
Key | Value |
---|---|
MD5 | 6C6605E3B7EA06760CE2647C735B428E |
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 | 2.4 |
PackageVersion | 1.0.1 |
SHA-1 | 4EB732504C34B27C4F3E026094BA24FC675605D0 |
SHA-256 | 2F1527388D914935058DD1391A74B9D7D1BA45BE3C62D662A89AAE7E860CEB46 |
Key | Value |
---|---|
MD5 | 3776F9413DF2CBDF1D60979BD3EFB230 |
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 | python38-HeapDict |
PackageRelease | 14.17 |
PackageVersion | 1.0.1 |
SHA-1 | FC106515D41ACF579AE9F47E49D58B2C70682775 |
SHA-256 | AA6A0EF937C796FCFC42A42A02C0F8490A205D3BE2FE2082961353E77B5BFBE3 |
Key | Value |
---|---|
MD5 | E0BC549A8D402343C009C73C387F22C2 |
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 | python38-HeapDict |
PackageRelease | 14.16 |
PackageVersion | 1.0.1 |
SHA-1 | 8FCE87C241FE34F08E5EFA96AD8BB5E24E426914 |
SHA-256 | 02595DC58CC86EACD7634D0CEFD3D40063796280968B74EB74B791F2543F645B |