Personal_mirrors/bitburner-src
1
0
Fork 0
mirror of https://github.com/bitburner-official/bitburner-src.git synced 2024-12-18 20:25:45 +01:00
Code Issues Packages Projects Releases Wiki Activity

DOC: CCT: typo fixes (#145)

Browse Source 
Fixes #144.  Some typographical fixes in the description of a Coding Contract.
This commit is contained in:
quacksouls 2022-10-24 23:46:26 +11:00 committed by GitHub
parent 0a3ff56331
commit e9e9ac1def
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
2 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
doc/source/basicgameplay/codingcontracts.rst
View File

@ -286,7 +286,7 @@ The list contains the name of (i.e. the value returned by
| | | Treat it as a Hammingcode with 1 'possible' error on an random Index. | | | | Treat it as a Hammingcode with 1 'possible' error on an random Index. |
| | | Find the 'possible' wrong bit, fix it and extract the decimal value, which is | | | | Find the 'possible' wrong bit, fix it and extract the decimal value, which is |
| | | hidden inside the string.\n\n", | | | | hidden inside the string.\n\n", |
| | | Note: The length of the binary string is dynamic, but it's encoding/decoding is | | | | Note: The length of the binary string is dynamic, but its encoding/decoding is |
| | | following Hammings 'rule'\n", | | | | following Hammings 'rule'\n", |
| | | Note 2: Index 0 is an 'overall' parity bit. Watch the Hammingcode-video from | | | | Note 2: Index 0 is an 'overall' parity bit. Watch the Hammingcode-video from |
| | | 3Blue1Brown for more information\n", | | | | 3Blue1Brown for more information\n", |

2
src/data/codingcontracttypes.ts
View File

@ -1320,7 +1320,7 @@ export const codingContractTypesMetadata: ICodingContractTypeMetadata[] = [
`'${n}' \n\n`, `'${n}' \n\n`,
"Treat it as an extended Hamming code with 1 'possible' error at a random index.\n", "Treat it as an extended Hamming code with 1 'possible' error at a random index.\n",
"Find the 'possible' wrong bit, fix it and extract the decimal value, which is hidden inside the string.\n\n", "Find the 'possible' wrong bit, fix it and extract the decimal value, which is hidden inside the string.\n\n",
"Note: The length of the binary string is dynamic, but it's encoding/decoding follows Hamming's 'rule'\n", "Note: The length of the binary string is dynamic, but its encoding/decoding follows Hamming's 'rule'\n",
"Note 2: Index 0 is an 'overall' parity bit. Watch the Hamming code video from 3Blue1Brown for more information\n", "Note 2: Index 0 is an 'overall' parity bit. Watch the Hamming code video from 3Blue1Brown for more information\n",
"Note 3: There's a ~55% chance for an altered Bit. So... MAYBE there is an altered Bit 😉\n", "Note 3: There's a ~55% chance for an altered Bit. So... MAYBE there is an altered Bit 😉\n",
"Note: The endianness of the encoded decimal value is reversed in relation to the endianness of the Hamming code. Where", "Note: The endianness of the encoded decimal value is reversed in relation to the endianness of the Hamming code. Where",