| Key | Value |
|---|---|
| FileName | ./usr/share/doc/darts/changelog.Debian.gz |
| FileSize | 1077 |
| MD5 | F6F1584EE059D98E723568897C74C2EF |
| SHA-1 | 946255B030CB729088A838B736510D62AB996C76 |
| SHA-256 | F521849C9C38F733485D5A14B8EC5EF35C04F4773B75E44F0A29592AF712C8AE |
| SSDEEP | 24:XymRrKHlgis2h5wwP3fDqeGlvXH9jdNXl19fj:XymRxis2h5xP3fDqeGlPdjdL |
| TLSH | T16011E9E9E95FFF02CFA1D1F0AA2C75EC5144D3092F96D62A90615D90416026413CC41E |
| 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 | 25568 |
| MD5 | ABCDB96C464DB84CA34A02A52FA90E97 |
| 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-19 |
| SHA-1 | E6669755339B1A2350FE5E7D6BFEBC939BA059F5 |
| SHA-256 | 119D40A42736661B31ECF9661361ED020DB65E701E79C52E62C31EBD0A107AEF |
| Key | Value |
|---|---|
| FileSize | 24648 |
| MD5 | 125D1A60ABEA50D2F276421D337C3076 |
| 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-19 |
| SHA-1 | A429F4A07EC1CEB27D65B88474ED0089FDB069BF |
| SHA-256 | DC7F78E44F3AA7878E48FF56E7817D381D27C831AE3A76C2C0A7D8FC00348933 |
| Key | Value |
|---|---|
| FileSize | 26012 |
| MD5 | 70F08224FA00CFFC8CF3C03CEBEF79CD |
| 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-19 |
| SHA-1 | 3A6ED787F889556FDDBC6017F7F81964EDDD1248 |
| SHA-256 | 60BD3B29C492176BCE8B02BFD6E0E7DD8174717E7EE4788A3A13BDEF3BFF5C1E |
| Key | Value |
|---|---|
| FileSize | 25988 |
| MD5 | 8BBA01303E9060697EFAAE6A74FF654C |
| 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-19 |
| SHA-1 | C3C7993BEA69354576C2D93B9DDEED595353479F |
| SHA-256 | 3623571F61622A3D511EA343CC74FDA002D6A934188EAF304CF648F5378413CD |
| Key | Value |
|---|---|
| FileSize | 24632 |
| MD5 | 498C42A9A3DF3E66CEBBBC401C411666 |
| 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-19 |
| SHA-1 | 8CF27CD68E322C55DA4136CBDDC5926EEEBE569B |
| SHA-256 | 84E9FC6C44FEE89D5CAE6FB6AB7ABB5D9ACC0345E5365776E60881A4B1256230 |
| Key | Value |
|---|---|
| FileSize | 23868 |
| MD5 | BC57B739F913C933417DDA24F98A1B7A |
| 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-19 |
| SHA-1 | AA6E619E8B77FCDA9806A611F9281B562B908BFD |
| SHA-256 | 2E6194D12CB1D8E6475B21BA9572410C419E8A4DABB5D6D5C59BB62D412C264F |