Key | Value |
---|---|
FileName | ./usr/share/doc-base/darts |
FileSize | 281 |
MD5 | 8998B112F7AE1E51B9A102456AA877D6 |
RDS:package_id | 182052 |
SHA-1 | 6ED898E8E914D98B636717B7CCDCC18462997F6C |
SHA-256 | FA16AAD427CF185DC7BA6A6286188E854DA264031A900248CCC8B9E698248134 |
SSDEEP | 6:5J6bTcQpbW6LrLWK3HGb4BhuQpbWb9wPfj4fliEPqWwEP4:XuThpy6HCcHGb4Bdpyb9AMflfq84 |
TLSH | T19FD02B6995B6F7FCF4019E8465DEBE415B7304D48807D440496D402C8087D7EB61F41E |
insert-timestamp | 1679426120.5712702 |
source | RDS.db |
hashlookup:parent-total | 92 |
hashlookup:trust | 100 |
The searched file hash is included in 92 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 | 26984 |
MD5 | FADC8BF120EC785124F87429B33EB1AB |
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 | 068F21B97C172CE7D865B63A0DF0A9A8B8ADEC02 |
SHA-256 | BD81074B9C591807B1FB7539CEA76E150A9B3964B82FFD4EEB5F736D2F68CAEE |
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 | 24326 |
MD5 | DF48C2B1D7088BE3CE82570AC9623AF7 |
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-15 |
SHA-1 | 07B1FA0B0082BD2C76DB3ED3F1F542A23D9650BD |
SHA-256 | 3515DD5C525A9B824FE6AB3F9C89F6C02FC2DF7A316F02BE9334E3F269D274D9 |
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 | 26604 |
MD5 | 8EC7A766822C1AFEFE2800D4EE9A9E9B |
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-20 |
SHA-1 | 0DAC58DB6A50403FB10435400FEBC889184D5710 |
SHA-256 | FBE61D84EDAA18676CDC8D281B42F49188394782A450F7FB22CC4F4E8B488FD1 |
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 | 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 |