| Key | Value |
|---|---|
| FileName | ./usr/share/doc/darts/changelog.Debian.gz |
| FileSize | 968 |
| MD5 | DD9D2F710C83FB8C7C63645861AB4EAB |
| SHA-1 | C244CADC223C97E28D45369D1456154568A2D5FF |
| SHA-256 | 906758371A92B378AEE498A3CFC3890CC1249ABD31274A0CDA4F702ED0924574 |
| SSDEEP | 24:XXH0wNWBIPY/BkVrAi9211Hq6CKMyfkJLDNixrf:XXrNUIJAieq6CFHNyr |
| TLSH | T1D811C803804FD0EDAEC4B7743A009A42C522A0CEE429A17DB733AA667DE691153FD31E |
| 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 | 28662 |
| MD5 | 92C8E5A4BAAD27D91115679D0CCD1928 |
| 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-13 |
| SHA-1 | DB4FC087B0CEFF4D68ED955B49D38DFB88F9149B |
| SHA-256 | AB062A2569441BE3632915FB268B56E9260F7CA733D84C2B2E1EEAA8EE26D41B |
| Key | Value |
|---|---|
| FileSize | 25528 |
| MD5 | D8F717D3F939B5CB11906194E3E9DE4E |
| 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-13 |
| SHA-1 | FD0CC69601DEFC198B765A4B8A432345E021416E |
| SHA-256 | A0FAF4210B6189572C7B8AFB056C13AC5A294D64B01DCA45D0C5642CE1BB337E |
| Key | Value |
|---|---|
| FileSize | 28724 |
| MD5 | E89A79D23DFACE3E085D6ED15AAEDA96 |
| 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-13 |
| SHA-1 | 06DBDBDA289BE49861BDA2D2702956E129636F51 |
| SHA-256 | DFEDA1F56A37AE10F82DAA939AD1797388214A87CE60BCD204985E0CC3C4D13B |
| Key | Value |
|---|---|
| FileSize | 27598 |
| MD5 | 5AD9406433884840BC71755E579F7C83 |
| 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-13 |
| SHA-1 | 7D3EFB32A2A1ADBD18888DCCB4BE45FCB7BEAB9D |
| SHA-256 | D6416FB320ECE63B987BF3ACDFA51EACACBCB8727F1EB102209822BC2651D800 |
| Key | Value |
|---|---|
| FileSize | 27940 |
| MD5 | F7082C3A6EB5E659AF42C9B79F352343 |
| 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-13 |
| SHA-1 | 31A9014B0EE432D53C4057461998567033393976 |
| SHA-256 | 103A96D3155AE0B8785EA56014AC5F06C59BB656A579D005805B52CBC40AA57B |
| Key | Value |
|---|---|
| FileSize | 26526 |
| MD5 | D46EE62DC8E3171C19E2DA8CE70380D9 |
| 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-13 |
| SHA-1 | 93B9BD9E0BE961017BBB67D442685EAC7DE7FB17 |
| SHA-256 | AC7003FF13C1D862CDBAFFD1E93F7A976A70B55F005F381DF021DEAFF466CC02 |