| Key | Value |
|---|---|
| FileName | ./usr/bin/darts |
| FileSize | 9740 |
| MD5 | 2C3D3E85960BBD89C6F6089D028F5D72 |
| SHA-1 | B7793240A936AEA246E7EA0E184EAC6FFA2FC23A |
| SHA-256 | 26FB660CE67158766C810FE8D8734E17EA636E3A5F1F4317876BF152F882E768 |
| SSDEEP | 96:txHd62j+BWBFAzoS4HkvKz6/yrGHscPw6JyBYSQYA26M/yP+49dfS5+vnOeNPS:I2j+8kcS4EvPyrYP8YMIEyPF9df5 |
| TLSH | T18912C549EAC77E33C8D02B3E54C30E1C23A1C98B969B4F27A12C65552F176B59D0EB87 |
| 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 | 24864 |
| MD5 | D5AFDF24F43D2064CF56467DB8F0F623 |
| 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 | 359DC663766EFCA50F9650760EDCEC19027A28C4 |
| SHA-256 | 6B50F83B31FF340C6E3868A52B587DFE9761A1BB91C7CE2514CD9741476309C5 |