| Key | Value |
|---|---|
| FileName | ./usr/bin/darts |
| FileSize | 18592 |
| MD5 | AAA35C8406F01BB989883EE17D32AA9D |
| SHA-1 | AFCCB28542A42A11F463004D8B605FEB2811FD64 |
| SHA-256 | E0CBECA9F4E2A7FE5883A794E11705139761B5C38BFAE3E9DA1A52912E257F4B |
| SSDEEP | 192:Rlx8GIAEIp+XnqHHVxD9U1e9yiZB/Tyzl3gmL5KL+VSiAi:nIAEIp+XqHHVxDWe9yiZB/Tvm8S+i |
| TLSH | T10D82E607F6969E3DC4D48B34458B963131B03806EF23931F6610263E2D52B99AB2FBD6 |
| hashlookup:parent-total | 1 |
| hashlookup:trust | 55 |
The searched file hash is included in 1 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 |