Key | Value |
---|---|
FileName | ./usr/share/doc/darts/changelog.Debian.gz |
FileSize | 973 |
MD5 | 8E02E4A7A1F8374CE4E5EA52774B9C1C |
RDS:package_id | 182052 |
SHA-1 | 49FA3BAE9AC9F19921D617BE40AB411746768EA1 |
SHA-256 | 29FA5E16D144B04094DD44E8DA43CE9D21AE6609BDC121403797013089EA5639 |
SSDEEP | 24:XtzaL5GFlJOgSFP3OgFobH9jo7U+iFMe4XgSVNGwc:XtvfSmpoA2vgG3c |
TLSH | T1E411981DD41D63DADEF9E2A34084587863807E1C18882F0F1E35E14B20858526B276A5 |
insert-timestamp | 1679426120.553794 |
source | RDS.db |
hashlookup:parent-total | 7 |
hashlookup:trust | 85 |
The searched file hash is included in 7 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
FileSize | 25128 |
MD5 | 91993C2FFF8BBC4BF551022103CF1C55 |
PackageDescription | C++ Template Library for implementation of Double-Array Darts is simple C++ Template Library for implementation of Double-Array Structure. . A double-array structure is a kind of Trie structure, digital search tree, an efficient data structure combining fast access of a matrix form with the compactness of a list form. It is faster than other implementations like Hash tree, Patricia tree, Suffix Array and so. . For more detail about double-array structure, see "Aoe, J. An Efficient Digital Search Algorithm by Using a Double-Array Structure. IEEE Transactions on Software Engineering. Vol. 15, 9 (Sep 1989). pp. 1066-1077." . This software provides indexing operations for Common Prefix Search. Darts is used for MeCab and ChaSen, Japanese Morphological Analysis System. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | darts |
PackageSection | devel |
PackageVersion | 0.32-14 |
SHA-1 | B6D790F163138A1A3B209980D8F56F43A6D1B778 |
SHA-256 | B20D2EB231CE554FC84429E68CBD1ADDBA2F01CB3C0FD395FDF1A3849E1D064A |
Key | Value |
---|---|
FileSize | 24530 |
MD5 | C661C14E7A188F4ADC42CF8F2ABF19F5 |
PackageDescription | C++ Template Library for implementation of Double-Array Darts is simple C++ Template Library for implementation of Double-Array Structure. . A double-array structure is a kind of Trie structure, digital search tree, an efficient data structure combining fast access of a matrix form with the compactness of a list form. It is faster than other implementations like Hash tree, Patricia tree, Suffix Array and so. . For more detail about double-array structure, see "Aoe, J. An Efficient Digital Search Algorithm by Using a Double-Array Structure. IEEE Transactions on Software Engineering. Vol. 15, 9 (Sep 1989). pp. 1066-1077." . This software provides indexing operations for Common Prefix Search. Darts is used for MeCab and ChaSen, Japanese Morphological Analysis System. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | darts |
PackageSection | devel |
PackageVersion | 0.32-14 |
SHA-1 | AE77147FAE5D5AA05EE0AFF357E9E2C6D5343850 |
SHA-256 | 317DF7C0210B10DF4A152199382715F7218F9C2A9DFD72C1B99121B35D58ED46 |
Key | Value |
---|---|
FileSize | 25190 |
MD5 | 371BC4143F010291BE54926EC300B8B0 |
PackageDescription | C++ Template Library for implementation of Double-Array Darts is simple C++ Template Library for implementation of Double-Array Structure. . A double-array structure is a kind of Trie structure, digital search tree, an efficient data structure combining fast access of a matrix form with the compactness of a list form. It is faster than other implementations like Hash tree, Patricia tree, Suffix Array and so. . For more detail about double-array structure, see "Aoe, J. An Efficient Digital Search Algorithm by Using a Double-Array Structure. IEEE Transactions on Software Engineering. Vol. 15, 9 (Sep 1989). pp. 1066-1077." . This software provides indexing operations for Common Prefix Search. Darts is used for MeCab and ChaSen, Japanese Morphological Analysis System. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | darts |
PackageSection | devel |
PackageVersion | 0.32-14 |
SHA-1 | DFA13EBDEC171FA4E682607F7BCD1635B6D084DA |
SHA-256 | 096391D3FC84FA916E199EA3068418A1A0E9D999CED89DC73589FE3642E15A1C |
Key | Value |
---|---|
FileSize | 24374 |
MD5 | F58248F700F051BC2704B65DD341D9A8 |
PackageDescription | C++ Template Library for implementation of Double-Array Darts is simple C++ Template Library for implementation of Double-Array Structure. . A double-array structure is a kind of Trie structure, digital search tree, an efficient data structure combining fast access of a matrix form with the compactness of a list form. It is faster than other implementations like Hash tree, Patricia tree, Suffix Array and so. . For more detail about double-array structure, see "Aoe, J. An Efficient Digital Search Algorithm by Using a Double-Array Structure. IEEE Transactions on Software Engineering. Vol. 15, 9 (Sep 1989). pp. 1066-1077." . This software provides indexing operations for Common Prefix Search. Darts is used for MeCab and ChaSen, Japanese Morphological Analysis System. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | darts |
PackageSection | devel |
PackageVersion | 0.32-14 |
SHA-1 | 478E5D725D22B9FC2B001255F623E0B32EFBA201 |
SHA-256 | BA20B667A5B650B3C87442FC70EED4D9FEE8A8A2FAE4BCF54911AD9B08A1AC6F |
Key | Value |
---|---|
FileName | 14224 |
FileSize | 25510 |
MD5 | F53D2C29360E3188EABB0B2C8AA9306D |
PackageDescription | C++ Template Library for implementation of Double-Array Darts is simple C++ Template Library for implementation of Double-Array Structure. . A double-array structure is a kind of Trie structure, digital search tree, an efficient data structure combining fast access of a matrix form with the compactness of a list form. It is faster than other implementations like Hash tree, Patricia tree, Suffix Array and so. . For more detail about double-array structure, see "Aoe, J. An Efficient Digital Search Algorithm by Using a Double-Array Structure. IEEE Transactions on Software Engineering. Vol. 15, 9 (Sep 1989). pp. 1066-1077." . This software provides indexing operations for Common Prefix Search. Darts is used for MeCab and ChaSen, Japanese Morphological Analysis System. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | darts |
PackageSection | devel |
PackageVersion | 0.32-14 |
RDS:package_id | 182052 |
SHA-1 | C02B0FDA67C0655AFC083316C563B3EE4ABE87ED |
SHA-256 | B03E467A89C3EC7356CC5B88461371D0EE78ABBC08E4E06B1EDA5E2CC9784F1E |
insert-timestamp | 1679408378.6830144 |
source | RDS.db |
Key | Value |
---|---|
FileSize | 26366 |
MD5 | 3A6B11079178A2C2A71D6596C9D261C8 |
PackageDescription | C++ Template Library for implementation of Double-Array Darts is simple C++ Template Library for implementation of Double-Array Structure. . A double-array structure is a kind of Trie structure, digital search tree, an efficient data structure combining fast access of a matrix form with the compactness of a list form. It is faster than other implementations like Hash tree, Patricia tree, Suffix Array and so. . For more detail about double-array structure, see "Aoe, J. An Efficient Digital Search Algorithm by Using a Double-Array Structure. IEEE Transactions on Software Engineering. Vol. 15, 9 (Sep 1989). pp. 1066-1077." . This software provides indexing operations for Common Prefix Search. Darts is used for MeCab and ChaSen, Japanese Morphological Analysis System. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | darts |
PackageSection | devel |
PackageVersion | 0.32-14 |
SHA-1 | 64A68CD76DE0D51BEE3139019B290DE4A0B02CED |
SHA-256 | DC0CFD89AEB90F585E0F0465E834EC7EA2712295D334DC4CA5D67C729C6C74A3 |
Key | Value |
---|---|
FileSize | 23818 |
MD5 | 4763AFA5C03F34090E9CD2BE3F43DC14 |
PackageDescription | C++ Template Library for implementation of Double-Array Darts is simple C++ Template Library for implementation of Double-Array Structure. . A double-array structure is a kind of Trie structure, digital search tree, an efficient data structure combining fast access of a matrix form with the compactness of a list form. It is faster than other implementations like Hash tree, Patricia tree, Suffix Array and so. . For more detail about double-array structure, see "Aoe, J. An Efficient Digital Search Algorithm by Using a Double-Array Structure. IEEE Transactions on Software Engineering. Vol. 15, 9 (Sep 1989). pp. 1066-1077." . This software provides indexing operations for Common Prefix Search. Darts is used for MeCab and ChaSen, Japanese Morphological Analysis System. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | darts |
PackageSection | devel |
PackageVersion | 0.32-14 |
SHA-1 | 414F13864D1BBD8DEA6060AEAD49EDCC12C9D7DB |
SHA-256 | 63D04412B6F4CE98649CEF12F1896E02200FCBBA47359CA60BAF667CEF1E3A27 |