Key | Value |
---|---|
FileName | ./usr/share/doc/darts/copyright |
FileSize | 1996 |
MD5 | 8FD0D48EFE5E9394523C115CEB4B411F |
SHA-1 | B0DD0821FA470FF6CD60A8605E6D01B39F733E9D |
SHA-256 | 531068F2D361BF80C9CF6D4BE61DA37AC56942B505B6A8BF59F96386B55EF89A |
SSDEEP | 48:iOLQt55x4OYrYJ0rYJ0tGMiPPLQtar43NA1Mv32s9EtIz3tolHZXn7G7q:iOLUnDYrYJ0rYJ0fibQb3m2v3hlKl5X3 |
TLSH | T19941CA4B26844BF72BD1538076667AC5B25A802D3F279E0938BDE101B33B11FB9F64D5 |
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 | 27508 |
MD5 | 31F27BDDCDE907016121BDBF23A3B674 |
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-8 |
SHA-1 | 63F1FE39B8254D385FD03591E93B3C398EE72D5B |
SHA-256 | AE25BA3F2ECE8D1067FE54E1876849C5CC0756CF749EB35761D242DDE3DF23CC |
Key | Value |
---|---|
FileSize | 27876 |
MD5 | 4049D0E291B1BEF037D9CBF3CB48D06F |
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-8 |
SHA-1 | 64E841157DA565DDD448D9FB07344F8035873D4B |
SHA-256 | 00F6BA3B5865ACB8AD3DFC54EC6BC64A06BE4FA67D294B27E4C798CFF3CB8FBE |
Key | Value |
---|---|
FileSize | 26892 |
MD5 | 95CC482D350D91C8CA23222DFA78798C |
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-8 |
SHA-1 | 5B2442EC3382C2AAC1D3B81D9C64FCB67988E470 |
SHA-256 | 39E4908876396CE456B041076B7C644E7079A05E008143A0A4CCB4BCB8288906 |
Key | Value |
---|---|
FileSize | 26012 |
MD5 | 32F4145E29493C6D963112CD1A808D07 |
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-8 |
SHA-1 | 138120293979DF336F9FCF84AA626FDE61F5F7EB |
SHA-256 | 50870EA2397D2A00773588AFECF15617D9A79606085A769A2C02467B419595E6 |