(str: string | Uint8Array, index: number, endian: Endian)
| 141 | } |
| 142 | |
| 143 | function wordAt(str: string | Uint8Array, index: number, endian: Endian): number { |
| 144 | let word = 0; |
| 145 | if (endian === Endian.Big) { |
| 146 | for (let i = 0; i < 4; i++) { |
| 147 | word += byteAt(str, index + i) << (24 - 8 * i); |
| 148 | } |
| 149 | } else { |
| 150 | for (let i = 0; i < 4; i++) { |
| 151 | word += byteAt(str, index + i) << (8 * i); |
| 152 | } |
| 153 | } |
| 154 | return word; |
| 155 | } |
| 156 | |
| 157 | function words32ToByteString(words32: number[]): string { |
| 158 | return words32.reduce((str, word) => str + word32ToByteString(word), ''); |
no test coverage detected
searching dependent graphs…