Result for 0081BC7CE7DE53AAE1DD705C109E998F7584567A

Query result

Key Value
FileName./usr/share/doc/packages/python3-PyTrie/README.md
FileSize971
MD5D691DA5946EFD1E6460A7DD7DBB5AC21
SHA-10081BC7CE7DE53AAE1DD705C109E998F7584567A
SHA-2560B8EE8BD2287509D43912B5DA3A3D52735A3BB84523C12CBCA558BB828B9E897
SSDEEP24:4iy86410bcBdkFsrLXYZLFKQ+wy+XKQevSF6Bt1C+VZ:cR418cjAmLXKLQQ+wBXhQP1hL
TLSHT181116563A6A12575984310D7A6AC7055931564BC63AA1CD9AC1E002D31028EBF3372E6
hashlookup:parent-total10
hashlookup:trust100

Network graph view

Parents (Total: 10)

The searched file hash is included in 10 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
MD50794C0A0023BE927C8CB57EDA8B16492
PackageArchnoarch
PackageDescriptionpytrie is a pure Python (2 and 3) implementation of the trie data structure. A trie is an ordered tree data structure that is used to store a mapping where the keys are sequences, usually strings over an alphabet. In addition to implementing the mapping interface, tries allow finding the items for a given prefix, and vice versa, finding the items whose keys are prefixes of a given key.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamepython3-PyTrie
PackageReleaselp152.1.1
PackageVersion0.3.1
SHA-12989FC8590E5E30556E42E9F4B38C0D6090687A9
SHA-256FE219FF9A2761BA77E3B5F67191FC60EF05C60148A5FFE8F5FDEA6B0DF28CB3A
Key Value
MD5F3CA64833FA18FB2CB2D940B238077AD
PackageArchnoarch
PackageDescriptionpytrie is a pure Python (2 and 3) implementation of the trie data structure. A trie is an ordered tree data structure that is used to store a mapping where the keys are sequences, usually strings over an alphabet. In addition to implementing the mapping interface, tries allow finding the items for a given prefix, and vice versa, finding the items whose keys are prefixes of a given key.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamepython3-PyTrie
PackageReleasebp153.1.18
PackageVersion0.3.1
SHA-14BEFC4E6C98BE16FBC7A7F6AD97BDE5EE9591672
SHA-256B2ADC7E7A026734E910E7491302BDF6735BCAA3091C10BB63EA7ABCD50333B72
Key Value
MD53FC338CB0911231526251CEE9E8328D9
PackageArchnoarch
PackageDescriptionpytrie is a pure Python (2 and 3) implementation of the trie data structure. A trie is an ordered tree data structure that is used to store a mapping where the keys are sequences, usually strings over an alphabet. In addition to implementing the mapping interface, tries allow finding the items for a given prefix, and vice versa, finding the items whose keys are prefixes of a given key.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamepython2-PyTrie
PackageReleaselp152.1.1
PackageVersion0.3.1
SHA-148EE0E1382D52AF6F68328A1EDEEB7A7AF67D5EE
SHA-256B465065E40FF6B706DBB78B0ADED1CFCCC6A533CDCFAE16EF4E80527678D48F7
Key Value
MD506AF638FA810019CBDD7C34F1D08EE20
PackageArchnoarch
PackageDescriptionpytrie is a pure Python (2 and 3) implementation of the trie data structure. A trie is an ordered tree data structure that is used to store a mapping where the keys are sequences, usually strings over an alphabet. In addition to implementing the mapping interface, tries allow finding the items for a given prefix, and vice versa, finding the items whose keys are prefixes of a given key.
PackageNamepython2-PyTrie
PackageReleaselp150.4.1
PackageVersion0.3.1
SHA-196D4A850C9B062A5C869D92ACCB162F68AE1EEDA
SHA-256814E61F0EF4860210DA53C558170A7D2257B4C84EDC645952CA0189A66928DD5
Key Value
MD526C0664238B408319A328D051086BA5C
PackageArchnoarch
PackageDescriptionpytrie is a pure Python (2 and 3) implementation of the trie data structure. A trie is an ordered tree data structure that is used to store a mapping where the keys are sequences, usually strings over an alphabet. In addition to implementing the mapping interface, tries allow finding the items for a given prefix, and vice versa, finding the items whose keys are prefixes of a given key.
PackageNamepython3-PyTrie
PackageRelease4.3
PackageVersion0.3.1
SHA-17E1B723DE9C9F7F9D49FD32445F59F71BF67AAC4
SHA-25670B3CE7487AA01726CC97D4C1835F0F15A70ADFD64C8694FEB06EF2916C8F73F
Key Value
MD5E5B327B07C2EF0905A1EE5BB8DFB43FD
PackageArchnoarch
PackageDescriptionpytrie is a pure Python (2 and 3) implementation of the trie data structure. A trie is an ordered tree data structure that is used to store a mapping where the keys are sequences, usually strings over an alphabet. In addition to implementing the mapping interface, tries allow finding the items for a given prefix, and vice versa, finding the items whose keys are prefixes of a given key.
PackageNamepython3-PyTrie
PackageReleaselp150.4.1
PackageVersion0.3.1
SHA-1837ECCAADE2EBA57E3A77F8CC23AB626AF3001DC
SHA-2563605BAEB5831642A0740367B23536F99379834B0A829A8DA200E65B31189BDE3
Key Value
MD5622071FB0330A70675507864A56C5D16
PackageArchnoarch
PackageDescriptionpytrie is a pure Python (2 and 3) implementation of the trie data structure. A trie is an ordered tree data structure that is used to store a mapping where the keys are sequences, usually strings over an alphabet. In addition to implementing the mapping interface, tries allow finding the items for a given prefix, and vice versa, finding the items whose keys are prefixes of a given key.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamepython3-PyTrie
PackageReleasebp155.2.10
PackageVersion0.3.1
SHA-1E488B6EF64BABE4D5CD30AD8FE8E50D0FBD155EB
SHA-256ACDF75F5C55BFFC6CA276110C12667CA547BF2CCB69014961A1A04F51F0FE499
Key Value
MD5299206D181F505C4B49077E8EE6689BE
PackageArchnoarch
PackageDescriptionpytrie is a pure Python (2 and 3) implementation of the trie data structure. A trie is an ordered tree data structure that is used to store a mapping where the keys are sequences, usually strings over an alphabet. In addition to implementing the mapping interface, tries allow finding the items for a given prefix, and vice versa, finding the items whose keys are prefixes of a given key.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamepython3-PyTrie
PackageReleasebp154.1.27
PackageVersion0.3.1
SHA-102DF2A7F855E71FAAF4EDF0EC31CF38179ACA136
SHA-2560E73B3203B72FAC28CCE9182FBA6533CB63F44F239896A4FD6C606011C7C5E21
Key Value
MD5F07D383D746A2B4D1A3CDE34EE0C33DE
PackageArchnoarch
PackageDescriptionpytrie is a pure Python (2 and 3) implementation of the trie data structure. A trie is an ordered tree data structure that is used to store a mapping where the keys are sequences, usually strings over an alphabet. In addition to implementing the mapping interface, tries allow finding the items for a given prefix, and vice versa, finding the items whose keys are prefixes of a given key.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamepython2-PyTrie
PackageReleasebp153.1.18
PackageVersion0.3.1
SHA-1B5E589278E430A2F8F190A4DD6E6209190B90A88
SHA-25649D76ED38D377DFDFEA5D288C2121D39D9D1F718DA754E36FBA64FAA055B299A
Key Value
MD5B1903D98B142FDBA6101203266BBB973
PackageArchnoarch
PackageDescriptionpytrie is a pure Python (2 and 3) implementation of the trie data structure. A trie is an ordered tree data structure that is used to store a mapping where the keys are sequences, usually strings over an alphabet. In addition to implementing the mapping interface, tries allow finding the items for a given prefix, and vice versa, finding the items whose keys are prefixes of a given key.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamepython3-PyTrie
PackageReleasebp156.3.1
PackageVersion0.3.1
SHA-12333F0A36C6E31CCEB72B6E76F5A7354C321F109
SHA-256B0D910D7D47FF54B23FB58D156A1BAC968213976D81BB8EE10D692B674F81128