Key | Value |
---|---|
FileName | ./usr/include/darts.h |
FileSize | 14376 |
MD5 | 25AEC196F8239CA859D03EDA25C5F228 |
RDS:package_id | 182052 |
SHA-1 | 29F59B29BBC11DAC7CABE7575315F42321E65A2D |
SHA-256 | C40824BD33A13194D44D902FE2717E1A90AEF0043CE80DD1507A1C29321AC562 |
SSDEEP | 384:s5i19cft1YyHv9/NzCCUTu3/KkpQ73+Xe4glNJsKZ+dsyHDkbUrUJhQJc:rSEuaIfr4UrUvQC |
TLSH | T1E452234B4CE374663587A03F5B866005622761036629EF81BFAF16707F8153E63F6FA8 |
insert-timestamp | 1679426120.5966403 |
source | RDS.db |
hashlookup:parent-total | 68 |
hashlookup:trust | 100 |
The searched file hash is included in 68 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 | 25962 |
MD5 | CB7AD1EBE64F3CDBC8F94F066D73031B |
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-9 |
SHA-1 | 0994218DE98974B9FFB3F1E52BA40D0CD2B935E5 |
SHA-256 | 99FBF2DA8D6CD80A1F5A466BE164B7A1011018FD3A1947DD967D2D9F860F99FF |
Key | Value |
---|---|
FileSize | 26012 |
MD5 | 32F4145E29493C6D963112CD1A808D07 |
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-8 |
SHA-1 | 138120293979DF336F9FCF84AA626FDE61F5F7EB |
SHA-256 | 50870EA2397D2A00773588AFECF15617D9A79606085A769A2C02467B419595E6 |
Key | Value |
---|---|
FileSize | 26372 |
MD5 | 8EA039487B092E2523ACF96EE1C6DBF2 |
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 | 1A19EC85269127EFC104BE80B4B07D9D4592767C |
SHA-256 | 6D1680841E69C126D71849DF8E28DB080744F3BEF049E76A63A8ED1BB2463DC4 |
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 | 27070 |
MD5 | AEC61C1A2E0F823BDD318AA73DEF66AE |
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-9 |
SHA-1 | 203F1F63CAAA9630AB12D1BB32AD583C3A62B708 |
SHA-256 | 8113E030B9F2A56748DE153F4C8C5322B6FC883B32E231E6B4EA62307D879F37 |
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 | 27924 |
MD5 | 0BC1DA0EC16F04BAA029BA25F90E0E1F |
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 MOTU Developers <ubuntu-motu@lists.ubuntu.com> |
PackageName | darts |
PackageSection | devel |
PackageVersion | 0.32-5 |
SHA-1 | 230A6965E328D87F8D6692E395A3E67E2D1F3883 |
SHA-256 | BA5E808AE025B6930825150B0F8A8C449B4A8A55553797D9748709AE81D0F1DA |