| Key | Value |
|---|---|
| FileName | ./usr/share/doc/darts/changelog.Debian.gz |
| FileSize | 565 |
| MD5 | D713439B2E6857388C3FB211C14AF158 |
| SHA-1 | 318AEFA1203C53CF4F76FC2CAC7F08B2872F103A |
| SHA-256 | ACECE54E22660DA9F77E5CBDBBA3876CC5BC5BC2D10987BDAD2AA8421EEFECDF |
| SSDEEP | 12:XPWbYTSLw8dX9q8hJd9KOAlqiKPzy0sEEDRlXiLH3u:Xua07XPD9KOmKPzesH3u |
| TLSH | T130F02626C5749873C0D433ABD5204C0105F6D61F2656DD6FC1F0BC101D2C2D4E95579D |
| 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 | 28426 |
| MD5 | 9F4A29BFDFC265B5098DAB63E1D4BEC9 |
| 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-7 |
| SHA-1 | DA3F4E6F5A833995C05ED95F4988100265C7C11C |
| SHA-256 | 34C88E2A42CC2151B050A74C480B9EA19334D66AD5724AED48B84BD71768A765 |
| Key | Value |
|---|---|
| FileSize | 29152 |
| MD5 | 8454BBC0B971B1E8C7D5F8F474CED0A9 |
| 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-7 |
| SHA-1 | A5FF5FEB2D6A9EEAB84EA0A5529BD219643FF24E |
| SHA-256 | 20F630CA767C093006B52C6E350DA518FA2794D6A094637A03023C8B36FC4D45 |
| Key | Value |
|---|---|
| FileSize | 28958 |
| MD5 | D0D2E17A9F04982C11A05F6925AAFE64 |
| 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-7 |
| SHA-1 | DD3F6604D2DD8977E22A0DA3B8154FC51684ABAD |
| SHA-256 | 49E867B952743A25029AB0BE0E2FC0804E4FD2452DEB0D7BBC598BBE62932C6E |
| Key | Value |
|---|---|
| FileSize | 28716 |
| MD5 | B3B01A65FE5D4307B0BFC98637B13091 |
| 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-7 |
| SHA-1 | FA0D350A7175C033EE75B097798FDF7FB83CFAED |
| SHA-256 | 6ECADF6232CD5DF59B25825591E14D12E3590F1740514F9B824FDAF7EA3EC527 |
| Key | Value |
|---|---|
| FileSize | 34042 |
| MD5 | 6E2F0B94341C43E729FB4891A3D4158A |
| 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-7 |
| SHA-1 | 9110E39B95937F0F406B3C3446C85D770266E89C |
| SHA-256 | 43E9B6C8437EA00C8399AD1BA35B3E617986ED72499736D4DD2E1BA978071B32 |
| Key | Value |
|---|---|
| FileSize | 27958 |
| MD5 | 9B2E673685058CAD0386E0D99874963A |
| 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-7 |
| SHA-1 | 7D2AEC0BE22333984C3EEE56751EE75B3DE7D493 |
| SHA-256 | 49284ECEE2C85B887F79150B792995E7EA4E18CF674D2B0B029D9BD0A31E9376 |