| Key | Value |
|---|---|
| FileName | ./usr/share/doc/darts/copyright |
| FileSize | 2043 |
| MD5 | 46483DEE1A60EB2924991F28F5EC9407 |
| SHA-1 | FC729D07E8519CDC2AF3F99DCF7F1EF51EEBCBF0 |
| SHA-256 | EE841FB0B7E5AE4B7FF38D5A4CC44341E88FC4DCA049CBF7EB08030D9A8EEAF8 |
| SSDEEP | 48:4OLQj5Nk4OYrYJ0rYJ0tGMiPPLQtar43NA1Mv32s9EtIz3tolHZXn7G7q:4OLqNUYrYJ0rYJ0fibQb3m2v3hlKl5X3 |
| TLSH | T17041DA4B268847FB2BD153807A667AC5B25B802D3F179E09387CE101B73B11FB8F2491 |
| 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 | 25360 |
| MD5 | 390F60CE0650701004282C24952B59F9 |
| 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-15 |
| SHA-1 | F76022C07CC71E7C89717E26B007A7FE573C237A |
| SHA-256 | D617B59B771F0B2AEE8146D104243640335F60D336BDE880B1B153C069C69596 |
| Key | Value |
|---|---|
| FileSize | 25642 |
| MD5 | 02BC8E4AD751EFBD004B82BB8D338404 |
| 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-15 |
| SHA-1 | B66C649D88DD6754447D6A4B7FBA414214A04C0E |
| SHA-256 | 390526EC0ACB5AB94C21462E11C7EC5F327C4AE54870994BEB06FCD73827750E |
| Key | Value |
|---|---|
| FileSize | 24326 |
| MD5 | DF48C2B1D7088BE3CE82570AC9623AF7 |
| 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-15 |
| SHA-1 | 07B1FA0B0082BD2C76DB3ED3F1F542A23D9650BD |
| SHA-256 | 3515DD5C525A9B824FE6AB3F9C89F6C02FC2DF7A316F02BE9334E3F269D274D9 |
| Key | Value |
|---|---|
| FileSize | 23756 |
| MD5 | 02AFD70833FB15E44F2C0C1A598CA5B4 |
| 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-15 |
| SHA-1 | 2FDA4B3531FCE570ADE5C2EB114BDF36DDEE67CD |
| SHA-256 | 717C16A836FBEE57150744C45CAC73D7C448CE7B0A8C0C7F16BF90E7E94F831F |
| Key | Value |
|---|---|
| FileSize | 26128 |
| MD5 | 469F3339C21BE5864C78683013AF3526 |
| 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-15 |
| SHA-1 | 7F255FE83109AE54F7A9FB2AB8A553816CB7FA10 |
| SHA-256 | D8C8EB0D2F359BD95707C2C8C55857F9A45E35B35E128EAFA01773073C847103 |
| Key | Value |
|---|---|
| FileSize | 24480 |
| MD5 | 8DCA3E8DC049842312A2B811F9DE64AC |
| 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-15 |
| SHA-1 | B137906B8A7F49D29E33F17EB1D9FE476532D065 |
| SHA-256 | 6CE956F2AA66CFC1DA11225B6D2C15D7F7135FBFA86D301BC4610196CD888059 |