| Key | Value |
|---|---|
| FileName | ./usr/share/doc/darts/changelog.Debian.gz |
| FileSize | 953 |
| MD5 | 733F9FD940BBF00EB63292260E4E7555 |
| SHA-1 | 8EE1E4780F59ECA06BDF36EC26D0305D7AE5B19A |
| SHA-256 | CA6E823C5C61FC54C20C3CA52A8396624FAEEAF3119AC7F1C3D1F2427E2CCDE8 |
| SSDEEP | 24:X6DC/TywezObSW/bhHPdrJMSh+5AWWMcDCYQWba:X6DCrjsObSaHPQQ+5Acce0a |
| TLSH | T10611C8E06C39E4D80C2186F666F6A7E1B1C81FA6431D69DC2F78227AEB6D39131C804C |
| hashlookup:parent-total | 4 |
| hashlookup:trust | 70 |
The searched file hash is included in 4 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| FileSize | 27556 |
| MD5 | A980AB5A56CF882C27C81CF2627CAFA4 |
| 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-12 |
| SHA-1 | 1C78F897EBEA4E9A42DD73AAF2B17D67B951527D |
| SHA-256 | 3A2AF32B339F1419FFDC94D4D4C069EAA1A588B40EEF4AF4F1384152282E45B9 |
| Key | Value |
|---|---|
| FileSize | 26368 |
| MD5 | 29E59097FD533538929E14C01AA361B2 |
| 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-12 |
| SHA-1 | 8D5AD7CA56B288FD207836BF9F9EFB1ACAF6C834 |
| SHA-256 | 0B475B1B2F14F47EE1D248154BBA7D6524BD4FE8BC6620E93763F623ED225E1D |
| Key | Value |
|---|---|
| FileSize | 28690 |
| MD5 | DFFC739A02F9AC817CBA9DE3860665A2 |
| 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-12 |
| SHA-1 | A93001E09D043F2E5023AF28B34CCDBBACAA302A |
| SHA-256 | 47146768F62CFB8D6CA80D2DC9F9C13CA7CD488998F20898B4FB6EE501A25E4B |
| Key | Value |
|---|---|
| FileSize | 28614 |
| MD5 | DD6D1915C58D95988FAF63035B266395 |
| 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-12 |
| SHA-1 | FC9FD1F74754CF0655F97FDDA7E25A79D88405E4 |
| SHA-256 | 0CB746E74C19306BB8A72321778A6E5234CA776933D47597162B8D43B88B891F |