| Key | Value |
|---|---|
| FileName | ./usr/share/doc/darts/changelog.Debian.gz |
| FileSize | 1081 |
| MD5 | 010C29A1DF48F0EEE4C5DD84DE35479C |
| SHA-1 | F5227B832F25C56304752C2E15F83B74E7A88303 |
| SHA-256 | A2B3E07DA574E0381F70E8D69DD8A5BCDA3938B82205A4F3F315BD42423F8442 |
| SSDEEP | 24:X2C+lzySRtXEWxpqjxWqPG6YCMjaOqh35O0PdetxP958u3oUep/Rll:Xqy4tX/pqjxTe6YVeOE5O0Vc1586oU6R |
| TLSH | T15B11B99036980703A5CC89D7C99BF4DE4FC0D5D596023AA042C4CC06715DF766728637 |
| hashlookup:parent-total | 6 |
| hashlookup:trust | 80 |
The searched file hash is included in 6 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| FileSize | 24584 |
| MD5 | D76EFB0E89CBB6B8EAEAA2DCC668856F |
| 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-18 |
| SHA-1 | 1B3D0E962427290883990CB049E5FD055D43EC6D |
| SHA-256 | CB29B9FD04BC4B9AEC3BCBDB3970E42D1D9F03DCF210BDEBC6A13BF9D6D2D481 |
| Key | Value |
|---|---|
| FileSize | 26896 |
| MD5 | E90E8382A9B7C22E141D72822149BD09 |
| 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-18 |
| SHA-1 | 63580C8D120BBB6381698FC13E9820909A8D262D |
| SHA-256 | F0CFB05C5590991205534467AC320A23D5360A7B1FCAE29B551A6D7C2CC146E3 |
| Key | Value |
|---|---|
| FileSize | 23860 |
| MD5 | D6CEF833A27F2C1BBFA0EB6FFDCC46E8 |
| 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-18 |
| SHA-1 | 9042FDBAD9128A52227BAECECF803CDE9061220A |
| SHA-256 | 73C2A39C4038AB15AEEE560EE8B0FFB7A531DA1ADE319C62AA4565F34354BE19 |
| Key | Value |
|---|---|
| FileSize | 25580 |
| MD5 | B1498DD12129EAB9997DC6ED6C400433 |
| 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-18 |
| SHA-1 | EB0011E1F3BC5A65B5F6A9EA760769E549ECFEF3 |
| SHA-256 | F00AF7BC2A69FB267379E8782686D0E791F70FEB865D31294573F1B03E5677DF |
| Key | Value |
|---|---|
| FileSize | 24676 |
| MD5 | E243C25EA30232AC6381EF3A551A59D8 |
| 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-18 |
| SHA-1 | BDB0A30757011A4D9B0A0D548B551A17DDFCBEF9 |
| SHA-256 | 7E6E87266640AAB88ADF2BFA1CC1998CC7F060B38FD02262E59A9DF6D4CD23DD |
| Key | Value |
|---|---|
| FileSize | 26008 |
| MD5 | 0D341430EFE1B39570B45FC350F0167A |
| 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-18 |
| SHA-1 | 9281B4C3F5BF9EE77FB94F2833111AEB55BAA14C |
| SHA-256 | 27B99A6748E9E11AADF752BB786CBBEB0BDAF804D5937839AA5919F347A7D7F8 |