Key | Value |
---|---|
FileName | ./usr/lib/python3.6/site-packages/scspell/__pycache__/_portable.cpython-36.pyc |
FileSize | 1654 |
MD5 | DA9539C9139726F5BFB22646C445D449 |
SHA-1 | 01563F47ABBA41C0F1A2902A1074CCD408419ED7 |
SHA-256 | 0175D076C52EF873FB5ACFFF8BD75396E2D5686289C7125226BADD614F04FDD3 |
SSDEEP | 48:eOpPY8dF16Y3xESNClMe//pU4zonaydYPRG2wXJ/d9:eO1XdvSX//pUQ5ycRQXtd9 |
TLSH | T1813167C50E4A667CFD28F2B8914B836043709737138A925B7E60C1BF6DC74C76C25E84 |
hashlookup:parent-total | 12 |
hashlookup:trust | 100 |
The searched file hash is included in 12 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
MD5 | 8093F09B5CA9528F73F1AFC7BB664B83 |
PackageArch | noarch |
PackageDescription | Scspell is a spell checker for source code. This is an unofficial fork (of https://launchpad.net/scspell) that runs on both Python 2 and 3. Scspell does not try to be particularly smart--rather, it does the simplest thing that can possibly work: 1. All alphanumeric strings (strings of letters, numbers, and underscores) are spell-checked tokens. 2. Each token is split into one or more subtokens. Underscores and digits always divide tokens, and capital letters will begin new subtokens. In other words, ``some_variable`` and ``someVariable`` will both generate the subtoken list {``some``, ``variable``}. 3. All subtokens longer than three characters are matched against a set of dictionaries, and a match failure prompts the user for action. When matching against the included English dictionary, *prefix matching* is employed; this choice permits the use of truncated words like ``dict`` as valid subtokens. When applied to code written in most popular programming languages while using typical naming conventions, this algorithm will usually catch many errors without an annoying false positive rate. In an effort to catch more spelling errors, Scspell is able to check each file against a set of dictionary words selected *specifically for that file*. Up to three different sub-dictionaries may be searched for any given file: 1. A natural language dictionary. (Scspell provides an American English dictionary as the default.) 2. A programming language-specific dictionary, intended to contain oddly-spelled keywords and APIs associated with that language. (Scspell provides small default dictionaries for a number of popular programming languages.) 3. A file-specific dictionary, intended to contain uncommon strings which are not likely to be found in more than a handful of unique files. |
PackageName | python3-scspell3k |
PackageRelease | 5.12 |
PackageVersion | 2.2 |
SHA-1 | 4D06A418B55C0D03A64CF43B398818BBBDFE1058 |
SHA-256 | 5C4C78B6B2F92221E7A7CF72620416C77DC08EE5339CC19C349FB17BA4A6C8BD |
Key | Value |
---|---|
MD5 | DE924476EA334B1332169F85609760F9 |
PackageArch | noarch |
PackageDescription | Scspell is a spell checker for source code. This is an unofficial fork (of https://launchpad.net/scspell) that runs on both Python 2 and 3. Scspell does not try to be particularly smart--rather, it does the simplest thing that can possibly work: 1. All alphanumeric strings (strings of letters, numbers, and underscores) are spell-checked tokens. 2. Each token is split into one or more subtokens. Underscores and digits always divide tokens, and capital letters will begin new subtokens. In other words, ``some_variable`` and ``someVariable`` will both generate the subtoken list {``some``, ``variable``}. 3. All subtokens longer than three characters are matched against a set of dictionaries, and a match failure prompts the user for action. When matching against the included English dictionary, *prefix matching* is employed; this choice permits the use of truncated words like ``dict`` as valid subtokens. When applied to code written in most popular programming languages while using typical naming conventions, this algorithm will usually catch many errors without an annoying false positive rate. In an effort to catch more spelling errors, Scspell is able to check each file against a set of dictionary words selected *specifically for that file*. Up to three different sub-dictionaries may be searched for any given file: 1. A natural language dictionary. (Scspell provides an American English dictionary as the default.) 2. A programming language-specific dictionary, intended to contain oddly-spelled keywords and APIs associated with that language. (Scspell provides small default dictionaries for a number of popular programming languages.) 3. A file-specific dictionary, intended to contain uncommon strings which are not likely to be found in more than a handful of unique files. |
PackageName | python3-scspell3k |
PackageRelease | 5.10 |
PackageVersion | 2.2 |
SHA-1 | 13434592E499FF6A22BCAD168130A2D8E0C7EA2C |
SHA-256 | A3CB1AAA43B326D7906D8DD94B0BDB51966B4AE1F8E33DAF857B1E7F4F6EC6CD |
Key | Value |
---|---|
MD5 | 0BD27F4F469B372A4DE9730C2952FB08 |
PackageArch | noarch |
PackageDescription | Scspell is a spell checker for source code. This is an unofficial fork (of https://launchpad.net/scspell) that runs on both Python 2 and 3. Scspell does not try to be particularly smart--rather, it does the simplest thing that can possibly work: 1. All alphanumeric strings (strings of letters, numbers, and underscores) are spell-checked tokens. 2. Each token is split into one or more subtokens. Underscores and digits always divide tokens, and capital letters will begin new subtokens. In other words, ``some_variable`` and ``someVariable`` will both generate the subtoken list {``some``, ``variable``}. 3. All subtokens longer than three characters are matched against a set of dictionaries, and a match failure prompts the user for action. When matching against the included English dictionary, *prefix matching* is employed; this choice permits the use of truncated words like ``dict`` as valid subtokens. When applied to code written in most popular programming languages while using typical naming conventions, this algorithm will usually catch many errors without an annoying false positive rate. In an effort to catch more spelling errors, Scspell is able to check each file against a set of dictionary words selected *specifically for that file*. Up to three different sub-dictionaries may be searched for any given file: 1. A natural language dictionary. (Scspell provides an American English dictionary as the default.) 2. A programming language-specific dictionary, intended to contain oddly-spelled keywords and APIs associated with that language. (Scspell provides small default dictionaries for a number of popular programming languages.) 3. A file-specific dictionary, intended to contain uncommon strings which are not likely to be found in more than a handful of unique files. |
PackageName | python3-scspell3k |
PackageRelease | 5.7 |
PackageVersion | 2.2 |
SHA-1 | 5DC20560A5FD7785C414F0158739C5EDC4A23128 |
SHA-256 | FD523A341AE2FFE71B46096C9DD327F2120A5A129D83F214D4BBADBBE9BE76EE |
Key | Value |
---|---|
MD5 | B70A91EEC557C384BB97DDE79DFC788E |
PackageArch | noarch |
PackageDescription | Scspell is a spell checker for source code. This is an unofficial fork (of https://launchpad.net/scspell) that runs on both Python 2 and 3. Scspell does not try to be particularly smart--rather, it does the simplest thing that can possibly work: 1. All alphanumeric strings (strings of letters, numbers, and underscores) are spell-checked tokens. 2. Each token is split into one or more subtokens. Underscores and digits always divide tokens, and capital letters will begin new subtokens. In other words, ``some_variable`` and ``someVariable`` will both generate the subtoken list {``some``, ``variable``}. 3. All subtokens longer than three characters are matched against a set of dictionaries, and a match failure prompts the user for action. When matching against the included English dictionary, *prefix matching* is employed; this choice permits the use of truncated words like ``dict`` as valid subtokens. When applied to code written in most popular programming languages while using typical naming conventions, this algorithm will usually catch many errors without an annoying false positive rate. In an effort to catch more spelling errors, Scspell is able to check each file against a set of dictionary words selected *specifically for that file*. Up to three different sub-dictionaries may be searched for any given file: 1. A natural language dictionary. (Scspell provides an American English dictionary as the default.) 2. A programming language-specific dictionary, intended to contain oddly-spelled keywords and APIs associated with that language. (Scspell provides small default dictionaries for a number of popular programming languages.) 3. A file-specific dictionary, intended to contain uncommon strings which are not likely to be found in more than a handful of unique files. |
PackageName | python3-scspell3k |
PackageRelease | 18.14 |
PackageVersion | 2.2 |
SHA-1 | CDC90736FDABFFE2AD8E92A56CDA2CE823E21519 |
SHA-256 | EFB3EB26A0E90A36917C98825ADA584C34EB6817A63F0D04DBFDE11FEFC11714 |
Key | Value |
---|---|
MD5 | 19B57F132DDE59CEB8AA3BDA15CBCC24 |
PackageArch | noarch |
PackageDescription | Scspell is a spell checker for source code. This is an unofficial fork (of https://launchpad.net/scspell) that runs on both Python 2 and 3. Scspell does not try to be particularly smart--rather, it does the simplest thing that can possibly work: 1. All alphanumeric strings (strings of letters, numbers, and underscores) are spell-checked tokens. 2. Each token is split into one or more subtokens. Underscores and digits always divide tokens, and capital letters will begin new subtokens. In other words, ``some_variable`` and ``someVariable`` will both generate the subtoken list {``some``, ``variable``}. 3. All subtokens longer than three characters are matched against a set of dictionaries, and a match failure prompts the user for action. When matching against the included English dictionary, *prefix matching* is employed; this choice permits the use of truncated words like ``dict`` as valid subtokens. When applied to code written in most popular programming languages while using typical naming conventions, this algorithm will usually catch many errors without an annoying false positive rate. In an effort to catch more spelling errors, Scspell is able to check each file against a set of dictionary words selected *specifically for that file*. Up to three different sub-dictionaries may be searched for any given file: 1. A natural language dictionary. (Scspell provides an American English dictionary as the default.) 2. A programming language-specific dictionary, intended to contain oddly-spelled keywords and APIs associated with that language. (Scspell provides small default dictionaries for a number of popular programming languages.) 3. A file-specific dictionary, intended to contain uncommon strings which are not likely to be found in more than a handful of unique files. |
PackageName | python3-scspell3k |
PackageRelease | lp153.5.16 |
PackageVersion | 2.2 |
SHA-1 | C19E041486E7390C72EC007E09718AED3FA980C9 |
SHA-256 | 39D9C770BA33EA8C48DA13BA2F6BF22693889074EB12C31605D6D6F354E63A5B |
Key | Value |
---|---|
MD5 | 22C25098F72B5D03BC085C9F5631D682 |
PackageArch | noarch |
PackageDescription | Scspell is a spell checker for source code. This is an unofficial fork (of https://launchpad.net/scspell) that runs on both Python 2 and 3. Scspell does not try to be particularly smart--rather, it does the simplest thing that can possibly work: 1. All alphanumeric strings (strings of letters, numbers, and underscores) are spell-checked tokens. 2. Each token is split into one or more subtokens. Underscores and digits always divide tokens, and capital letters will begin new subtokens. In other words, ``some_variable`` and ``someVariable`` will both generate the subtoken list {``some``, ``variable``}. 3. All subtokens longer than three characters are matched against a set of dictionaries, and a match failure prompts the user for action. When matching against the included English dictionary, *prefix matching* is employed; this choice permits the use of truncated words like ``dict`` as valid subtokens. When applied to code written in most popular programming languages while using typical naming conventions, this algorithm will usually catch many errors without an annoying false positive rate. In an effort to catch more spelling errors, Scspell is able to check each file against a set of dictionary words selected *specifically for that file*. Up to three different sub-dictionaries may be searched for any given file: 1. A natural language dictionary. (Scspell provides an American English dictionary as the default.) 2. A programming language-specific dictionary, intended to contain oddly-spelled keywords and APIs associated with that language. (Scspell provides small default dictionaries for a number of popular programming languages.) 3. A file-specific dictionary, intended to contain uncommon strings which are not likely to be found in more than a handful of unique files. |
PackageName | python3-scspell3k |
PackageRelease | lp153.5.1 |
PackageVersion | 2.2 |
SHA-1 | AFA46F0156F83D0A148A00D898B94A3B293871B5 |
SHA-256 | 71A547DDAFF911DAB7084C8EB17975AC0C9C5ABAB7D39FE29F77D6702EA311A1 |
Key | Value |
---|---|
MD5 | B99A3610EB1832E8DFB3D520E38F479E |
PackageArch | noarch |
PackageDescription | Scspell is a spell checker for source code. This is an unofficial fork (of https://launchpad.net/scspell) that runs on both Python 2 and 3. Scspell does not try to be particularly smart--rather, it does the simplest thing that can possibly work: 1. All alphanumeric strings (strings of letters, numbers, and underscores) are spell-checked tokens. 2. Each token is split into one or more subtokens. Underscores and digits always divide tokens, and capital letters will begin new subtokens. In other words, ``some_variable`` and ``someVariable`` will both generate the subtoken list {``some``, ``variable``}. 3. All subtokens longer than three characters are matched against a set of dictionaries, and a match failure prompts the user for action. When matching against the included English dictionary, *prefix matching* is employed; this choice permits the use of truncated words like ``dict`` as valid subtokens. When applied to code written in most popular programming languages while using typical naming conventions, this algorithm will usually catch many errors without an annoying false positive rate. In an effort to catch more spelling errors, Scspell is able to check each file against a set of dictionary words selected *specifically for that file*. Up to three different sub-dictionaries may be searched for any given file: 1. A natural language dictionary. (Scspell provides an American English dictionary as the default.) 2. A programming language-specific dictionary, intended to contain oddly-spelled keywords and APIs associated with that language. (Scspell provides small default dictionaries for a number of popular programming languages.) 3. A file-specific dictionary, intended to contain uncommon strings which are not likely to be found in more than a handful of unique files. |
PackageName | python3-scspell3k |
PackageRelease | lp152.5.8 |
PackageVersion | 2.2 |
SHA-1 | 9B5C66F468B993336C3FE232C03EF07C5397B184 |
SHA-256 | 07425A6EBF5399B42E76FD0A419076CE3CBF7FACF546267B99C67DC453F98956 |
Key | Value |
---|---|
MD5 | 5C698C2793A6A63BB8F095963F0B9636 |
PackageArch | noarch |
PackageDescription | Scspell is a spell checker for source code. This is an unofficial fork (of https://launchpad.net/scspell) that runs on both Python 2 and 3. Scspell does not try to be particularly smart--rather, it does the simplest thing that can possibly work: 1. All alphanumeric strings (strings of letters, numbers, and underscores) are spell-checked tokens. 2. Each token is split into one or more subtokens. Underscores and digits always divide tokens, and capital letters will begin new subtokens. In other words, ``some_variable`` and ``someVariable`` will both generate the subtoken list {``some``, ``variable``}. 3. All subtokens longer than three characters are matched against a set of dictionaries, and a match failure prompts the user for action. When matching against the included English dictionary, *prefix matching* is employed; this choice permits the use of truncated words like ``dict`` as valid subtokens. When applied to code written in most popular programming languages while using typical naming conventions, this algorithm will usually catch many errors without an annoying false positive rate. In an effort to catch more spelling errors, Scspell is able to check each file against a set of dictionary words selected *specifically for that file*. Up to three different sub-dictionaries may be searched for any given file: 1. A natural language dictionary. (Scspell provides an American English dictionary as the default.) 2. A programming language-specific dictionary, intended to contain oddly-spelled keywords and APIs associated with that language. (Scspell provides small default dictionaries for a number of popular programming languages.) 3. A file-specific dictionary, intended to contain uncommon strings which are not likely to be found in more than a handful of unique files. |
PackageName | python3-scspell3k |
PackageRelease | lp152.5.7 |
PackageVersion | 2.2 |
SHA-1 | AE47F9C042E91F78A32EBFF0689937344A4E81A9 |
SHA-256 | 7C3D82035100EF83F2F92A32383F1E4051073515A1A2418B49FFB135B06D09D5 |
Key | Value |
---|---|
MD5 | 816C55EB340296D3EFC5247649DA128E |
PackageArch | noarch |
PackageDescription | Scspell is a spell checker for source code. This is an unofficial fork (of https://launchpad.net/scspell) that runs on both Python 2 and 3. Scspell does not try to be particularly smart--rather, it does the simplest thing that can possibly work: 1. All alphanumeric strings (strings of letters, numbers, and underscores) are spell-checked tokens. 2. Each token is split into one or more subtokens. Underscores and digits always divide tokens, and capital letters will begin new subtokens. In other words, ``some_variable`` and ``someVariable`` will both generate the subtoken list {``some``, ``variable``}. 3. All subtokens longer than three characters are matched against a set of dictionaries, and a match failure prompts the user for action. When matching against the included English dictionary, *prefix matching* is employed; this choice permits the use of truncated words like ``dict`` as valid subtokens. When applied to code written in most popular programming languages while using typical naming conventions, this algorithm will usually catch many errors without an annoying false positive rate. In an effort to catch more spelling errors, Scspell is able to check each file against a set of dictionary words selected *specifically for that file*. Up to three different sub-dictionaries may be searched for any given file: 1. A natural language dictionary. (Scspell provides an American English dictionary as the default.) 2. A programming language-specific dictionary, intended to contain oddly-spelled keywords and APIs associated with that language. (Scspell provides small default dictionaries for a number of popular programming languages.) 3. A file-specific dictionary, intended to contain uncommon strings which are not likely to be found in more than a handful of unique files. |
PackageName | python3-scspell3k |
PackageRelease | 5.13 |
PackageVersion | 2.2 |
SHA-1 | 66511D305DA6A066200F86C02FA6A8BC68876463 |
SHA-256 | 584F0F5C965DB6E65A57929697DE78E79812877C06C9108CF043EC2D27910793 |
Key | Value |
---|---|
MD5 | 5AE0EB3ED10EA0131EAE77196C90FCC3 |
PackageArch | noarch |
PackageDescription | Scspell is a spell checker for source code. This is an unofficial fork (of https://launchpad.net/scspell) that runs on both Python 2 and 3. Scspell does not try to be particularly smart--rather, it does the simplest thing that can possibly work: 1. All alphanumeric strings (strings of letters, numbers, and underscores) are spell-checked tokens. 2. Each token is split into one or more subtokens. Underscores and digits always divide tokens, and capital letters will begin new subtokens. In other words, ``some_variable`` and ``someVariable`` will both generate the subtoken list {``some``, ``variable``}. 3. All subtokens longer than three characters are matched against a set of dictionaries, and a match failure prompts the user for action. When matching against the included English dictionary, *prefix matching* is employed; this choice permits the use of truncated words like ``dict`` as valid subtokens. When applied to code written in most popular programming languages while using typical naming conventions, this algorithm will usually catch many errors without an annoying false positive rate. In an effort to catch more spelling errors, Scspell is able to check each file against a set of dictionary words selected *specifically for that file*. Up to three different sub-dictionaries may be searched for any given file: 1. A natural language dictionary. (Scspell provides an American English dictionary as the default.) 2. A programming language-specific dictionary, intended to contain oddly-spelled keywords and APIs associated with that language. (Scspell provides small default dictionaries for a number of popular programming languages.) 3. A file-specific dictionary, intended to contain uncommon strings which are not likely to be found in more than a handful of unique files. |
PackageMaintainer | https://www.suse.com/ |
PackageName | python3-scspell3k |
PackageRelease | lp154.18.1 |
PackageVersion | 2.2 |
SHA-1 | C31C3A6AAA614C768A280E0CD680D7598AD03DE0 |
SHA-256 | 46DB1BD898426218DF10630617D2B20ED415119B9ED0B459265A1256F55232F0 |
Key | Value |
---|---|
MD5 | 924225F7EAC4DA1FE5DD742441194A71 |
PackageArch | noarch |
PackageDescription | Scspell is a spell checker for source code. This is an unofficial fork (of https://launchpad.net/scspell) that runs on both Python 2 and 3. Scspell does not try to be particularly smart--rather, it does the simplest thing that can possibly work: 1. All alphanumeric strings (strings of letters, numbers, and underscores) are spell-checked tokens. 2. Each token is split into one or more subtokens. Underscores and digits always divide tokens, and capital letters will begin new subtokens. In other words, ``some_variable`` and ``someVariable`` will both generate the subtoken list {``some``, ``variable``}. 3. All subtokens longer than three characters are matched against a set of dictionaries, and a match failure prompts the user for action. When matching against the included English dictionary, *prefix matching* is employed; this choice permits the use of truncated words like ``dict`` as valid subtokens. When applied to code written in most popular programming languages while using typical naming conventions, this algorithm will usually catch many errors without an annoying false positive rate. In an effort to catch more spelling errors, Scspell is able to check each file against a set of dictionary words selected *specifically for that file*. Up to three different sub-dictionaries may be searched for any given file: 1. A natural language dictionary. (Scspell provides an American English dictionary as the default.) 2. A programming language-specific dictionary, intended to contain oddly-spelled keywords and APIs associated with that language. (Scspell provides small default dictionaries for a number of popular programming languages.) 3. A file-specific dictionary, intended to contain uncommon strings which are not likely to be found in more than a handful of unique files. |
PackageName | python3-scspell3k |
PackageRelease | lp154.5.1 |
PackageVersion | 2.2 |
SHA-1 | 89E6D7D1A032499414B5E4F2AABBE041A6211C4D |
SHA-256 | 65782E6CBC3EB9EE8F05FE09F8ED53F645172AF431D4C9304D7D65B4434B91BC |
Key | Value |
---|---|
MD5 | 273C851DB38D8DEF973A38868096D091 |
PackageArch | noarch |
PackageDescription | Scspell is a spell checker for source code. This is an unofficial fork (of https://launchpad.net/scspell) that runs on both Python 2 and 3. Scspell does not try to be particularly smart--rather, it does the simplest thing that can possibly work: 1. All alphanumeric strings (strings of letters, numbers, and underscores) are spell-checked tokens. 2. Each token is split into one or more subtokens. Underscores and digits always divide tokens, and capital letters will begin new subtokens. In other words, ``some_variable`` and ``someVariable`` will both generate the subtoken list {``some``, ``variable``}. 3. All subtokens longer than three characters are matched against a set of dictionaries, and a match failure prompts the user for action. When matching against the included English dictionary, *prefix matching* is employed; this choice permits the use of truncated words like ``dict`` as valid subtokens. When applied to code written in most popular programming languages while using typical naming conventions, this algorithm will usually catch many errors without an annoying false positive rate. In an effort to catch more spelling errors, Scspell is able to check each file against a set of dictionary words selected *specifically for that file*. Up to three different sub-dictionaries may be searched for any given file: 1. A natural language dictionary. (Scspell provides an American English dictionary as the default.) 2. A programming language-specific dictionary, intended to contain oddly-spelled keywords and APIs associated with that language. (Scspell provides small default dictionaries for a number of popular programming languages.) 3. A file-specific dictionary, intended to contain uncommon strings which are not likely to be found in more than a handful of unique files. |
PackageName | python3-scspell3k |
PackageRelease | lp153.18.6 |
PackageVersion | 2.2 |
SHA-1 | 019E606C1C35C3EF1F609BE81582BD9DB7F3923F |
SHA-256 | 92D244D138BB5E3CBEB6D8E082D2FA776B50E9A18D72A32C0D8EC0D189D2CE68 |