| Key | Value |
|---|---|
| FileName | ./usr/bin/mkdarts |
| FileSize | 18936 |
| MD5 | C9925B74C444CF6004841BA856E32149 |
| SHA-1 | 03A2666AD978ED735EC9F677C3FB243A0CD6FCFF |
| SHA-256 | DF3F49CC14A6562929C5276475E38B158B0D9DED2FAB25142007CDDF140A4A88 |
| SSDEEP | 384:FtVCv16IoUEuBk2q+IRXlv4NbV9RrZmijgMXAzJIVm9I/jBmPw60mnLjuME7hunp:FGvw7UER+IhlWbV9RrZmijgMXAzJIVmD |
| TLSH | T1A6823912BF568F33C8D6CE30052F8301A2AEDE5FC1D99707E928C7482A867981D73E58 |
| 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 | 26512 |
| MD5 | 28305C0E2911DE4CECCE4473742D21E8 |
| 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 | Natural Language Processing (Japanese) <team+pkg-nlp-ja@tracker.debian.org> |
| PackageName | darts |
| PackageSection | devel |
| PackageVersion | 0.32-19 |
| SHA-1 | B9847974A97CA59AEE91D534673725E43A37992B |
| SHA-256 | 64405D17803F0385652DAEB4E144AFD615EA2AAEDC8002A3477C5BFCD1D2DB2F |