| Commit message (Collapse) | Author | Age | Files | Lines |
|---|
| |
|
|
|
|
|
|
|
| |
* move tests to testament
* minor
* fix random
* disable test random
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
* Do not read the whole file to compute SHA1 hash (fixes 15997)
* Update lib/std/sha1.nim
Co-authored-by: Andreas Rumpf <rumpf_a@web.de>
* Update lib/std/sha1.nim
Co-authored-by: Andreas Rumpf <rumpf_a@web.de>
* Directly break from loop
Co-authored-by: Andreas Rumpf <rumpf_a@web.de>
[backport:1.2] [backport:1.4]
|
| |
|
|
|
|
| |
Note that contrary to what docgen.rst currently says, the ids have
to match exactly or else most web browsers will not jump to the
intended symbol.
|
| | |
|
| |
|
|
|
|
|
|
|
|
| |
* Make public additional types from sha1 module
After making public newSha1State, update and finalize methods from the
sha1 module was forgotten to be made public Sha1Digest and Sha1State
types used by the new public methods.
* Update changelog.md with sha1 module changes
|
| |
|
|
|
| |
Make "newSha1State", "update" and "finalize" procedures from the sha1
module public in order to be possible to compute single sha1 hash of
multiple separate blocks of data.
|
| |
|
|
|
|
| |
* Make `secureHash` accept any `openArray[char]`, not only `string`.
* Put in a changelog entry as per Araq request.
|
| | |
|
| |
|
|
|
|
|
|
|
| |
As #9239 points out the old implementation had some serious flaws.
The new implementation is a port of the MIT-licensed one used by
Chromium OS and has been tested against the FIPS-provided vectors and by
generating huge files like the ones mentioned in the issue above.
While I tried my best to take into account the existence of BE machines
the code has only been tested on a LE one.
|
| | |
|
| |
|