| Key | Value |
|---|---|
| FileName | ./usr/bin/darts |
| FileSize | 14432 |
| MD5 | FAB3E0F1F2466114C191B8790B5BDB6E |
| SHA-1 | 6C345BE6988AE2FA622B251FADCEA06074A3A868 |
| SHA-256 | 214E1147989D79A13FB54B7CFAD1A0AC6D193EF8F5C41909E4461EA945228F97 |
| SSDEEP | 96:Z7Ql3BWBMvTcAEI4wUrgTdB/5EvrFZOUN480oP43FsQjr///LGT8qRii4EtxozS6:Zo38GIAEIBNaw8m//TG7iSGC8S |
| TLSH | T19F526511F74A9D7BC9C497B54A8B87B0B3329489D39A57D3610CC618BE827EA1E187C4 |
| 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 | 24584 |
| MD5 | D76EFB0E89CBB6B8EAEAA2DCC668856F |
| 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-18 |
| SHA-1 | 1B3D0E962427290883990CB049E5FD055D43EC6D |
| SHA-256 | CB29B9FD04BC4B9AEC3BCBDB3970E42D1D9F03DCF210BDEBC6A13BF9D6D2D481 |