Key | Value |
---|---|
FileName | ./usr/include/darts.h |
FileSize | 14376 |
MD5 | DDBCC0E140346688B21B6B6EB0D2A4ED |
SHA-1 | D187E27D6F4701FA33D652AE104449F12A1C7E42 |
SHA-256 | 8C4CA82F2B701C245905646F6D718C59FD13A7C33332AE222D69B7242F4CB3F3 |
SSDEEP | 384:s5i19cft1YyHv9/NzCCUTu3/KkpQ73+Xe4glNJsKZ+dsyHDkbUrQJhQJc:rSEuaIfr4UrQvQC |
TLSH | T19252234B4CE374663587A03F5B866005622761036629EF81BFAF16707F8153E63F6FA8 |
tar:gname | root |
tar:uname | root |
hashlookup:parent-total | 69 |
hashlookup:trust | 100 |
The searched file hash is included in 69 parent files which include package known and seen by metalookup. A sample is included below:
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 | 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 | 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 |
---|---|
MD5 | 5C239B2E6E201A566549619EE45F2583 |
PackageArch | x86_64 |
PackageDescription | Darts is a simple C++ template library to construct Double-Arrays [Aoe 1989]. Double-Arrays are data structures to represent Trie. These are faster than other Trie implementations. Darts is used by Chasen. |
PackageMaintainer | https://bugs.opensuse.org |
PackageName | darts |
PackageRelease | lp150.1.3 |
PackageVersion | 0.32 |
SHA-1 | 0F3E69F65FC59CE39C9883AC2AE24B45BFDBE64C |
SHA-256 | 9AEDB15F379BD47568D78E52AB16E83706C6595FDED52B6609E82183D32A35CA |
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 | 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 |
Key | Value |
---|---|
FileSize | 26880 |
MD5 | 78692EE62E26258C5B0CC48EAA406EE5 |
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 | 1C56F43440E99BF523F9D9F331DD33B239ED4E81 |
SHA-256 | 930617F611BF00F00F8EAB657DD9AE79800DF3B7B601CF8A4B0FC80A7A26F1BF |
Key | Value |
---|---|
FileSize | 26700 |
MD5 | B3343351DDD891D012E1FC296CFBD5AB |
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 | 31D60DD5260147D4391A1BA0F7954538FCC2FCAF |
SHA-256 | 54C9E7DE7964953DA6F08B1517D7F1D8A7FFD56C151E03710FFC0167B52DBC40 |
Key | Value |
---|---|
MD5 | 63CFADB247E93EE192D6619580B60D90 |
PackageArch | x86_64 |
PackageDescription | Darts is a simple C++ template library to construct Double-Arrays [Aoe 1989]. Double-Arrays are data structures to represent Trie. These are faster than other Trie implementations. Darts is used by Chasen. |
PackageMaintainer | https://bugs.opensuse.org |
PackageName | darts |
PackageRelease | bp156.3.6 |
PackageVersion | 0.32 |
SHA-1 | 3656869D955A3A73E9C985A159B7DA96C1F09794 |
SHA-256 | CB33B8B7A5AED93ABDAB732A4D10660C84A436D7E03E41A1FB1CDADB9BCCFB11 |
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 |