Key | Value |
---|---|
FileName | ./usr/share/doc/darts/copyright |
FileSize | 2016 |
MD5 | 8BCF0A4B48379383948F7FE45322112C |
RDS:package_id | 182052 |
SHA-1 | CAE96215ACB542F220BCC1CF1D2B788FF89D3470 |
SHA-256 | AA2B1C58DF3DB1E94B7C2F9266A95AB0DE06EA07A38E3EBBC1247286DB292316 |
SSDEEP | 48:4OLQt55x4OYrYJ0rYJ0tGMiPPLQtar43NA1Mv32s9EtIz3tolHZXn7G7q:4OLUnDYrYJ0rYJ0fibQb3m2v3hlKl5X3 |
TLSH | T15F41CC4B268447F72BD153807666BAC5B25B902D3F179D09387CE141B73B11FB9F1491 |
insert-timestamp | 1679426120.5324419 |
source | RDS.db |
hashlookup:parent-total | 36 |
hashlookup:trust | 100 |
The searched file hash is included in 36 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
FileSize | 26708 |
MD5 | 1C08BD5B88D48B2C9A7395E31FAF9FD7 |
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-11 |
SHA-1 | 03EB1857638276F10AB994E15F12AA5A8EC38847 |
SHA-256 | 016341FA4828D9B63541A957D4AAA0589C369616FD6F9C7AB4FA06CEB737E60A |
Key | Value |
---|---|
FileSize | 26656 |
MD5 | 10A80DAC6DF458285445F9249F473DB3 |
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 <pkg-nlp-ja-devel@lists.alioth.debian.org> |
PackageName | darts |
PackageSection | devel |
PackageVersion | 0.32-14+b1 |
SHA-1 | 0684DEAE1C80C6156955C5FB01B7BA7D67BF6077 |
SHA-256 | 44AD1BEEA388C461D8A1ACC0F7BD791295B462194C65E669F7366935BFAA5EEA |
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 | 26428 |
MD5 | DEDF623BB40151409B500F4B6DDE48C4 |
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 <pkg-nlp-ja-devel@lists.alioth.debian.org> |
PackageName | darts |
PackageSection | devel |
PackageVersion | 0.32-14+b1 |
SHA-1 | 10EB754F684E07065B72096A335EDFAAB7B31F97 |
SHA-256 | 7CF11E1EA9D840050580D4EFE984DF52535A2C897AF019EF3FE324E880D35F2A |
Key | Value |
---|---|
FileSize | 27556 |
MD5 | A980AB5A56CF882C27C81CF2627CAFA4 |
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-12 |
SHA-1 | 1C78F897EBEA4E9A42DD73AAF2B17D67B951527D |
SHA-256 | 3A2AF32B339F1419FFDC94D4D4C069EAA1A588B40EEF4AF4F1384152282E45B9 |
Key | Value |
---|---|
FileSize | 24978 |
MD5 | EF22C230D4A09E428C10D0E39035CBB2 |
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 <pkg-nlp-ja-devel@lists.alioth.debian.org> |
PackageName | darts |
PackageSection | devel |
PackageVersion | 0.32-14+b1 |
SHA-1 | 221E4E5443896588731F91A1C238826B5BA72D85 |
SHA-256 | 86FCC7F1FB668A418CFD0868D627E7FB473C7D1EBEDF0353894C7CBEA29E6D72 |
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 | 23818 |
MD5 | 4763AFA5C03F34090E9CD2BE3F43DC14 |
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-14 |
SHA-1 | 414F13864D1BBD8DEA6060AEAD49EDCC12C9D7DB |
SHA-256 | 63D04412B6F4CE98649CEF12F1896E02200FCBBA47359CA60BAF667CEF1E3A27 |
Key | Value |
---|---|
FileSize | 24374 |
MD5 | F58248F700F051BC2704B65DD341D9A8 |
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-14 |
SHA-1 | 478E5D725D22B9FC2B001255F623E0B32EFBA201 |
SHA-256 | BA20B667A5B650B3C87442FC70EED4D9FEE8A8A2FAE4BCF54911AD9B08A1AC6F |
Key | Value |
---|---|
FileSize | 27894 |
MD5 | 5B7F8592770AB1159D9F3FC602C17D64 |
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-11 |
SHA-1 | 4A9F09059B4197F41127BDC02C0D249AB1720FAC |
SHA-256 | B01B2D088A6AF6E8EE017A32AD98D6F09232FD6F48D7DA3A241BF5034641D648 |