-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathhash.js
50 lines (43 loc) · 1.41 KB
/
hash.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
/* Copyright (c) 2009, Markus Peloquin <[email protected]>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED 'AS IS' AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
* SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
* OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
* CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. */
'use strict';
/** Abstract Hash class. */
class Hash {
constructor() {}
/** Initialize the hash function */
init() {
throw 'Hash.init() not overloaded';
}
/** Add data to the computation
* \param buf The data
* \param sz The size of buf in bytes
*/
update(buf, sz) {
throw 'Hash.update() not overloaded';
}
/** End the hash computation
* \return The digest
*/
end() {
throw 'Hash.update() not overloaded';
}
/** Get the size of the digest in bytes */
digestSize() {
throw 'Hash.digestSize not overloaded';
}
/** Get the size of the blocks in bytes */
blockSize() {
throw 'Hash.blockSize not overloaded';
}
}