From e9e9ac1def8d36c27d33f666fe1a657bea2ea95c Mon Sep 17 00:00:00 2001 From: quacksouls <66396308+quacksouls@users.noreply.github.com> Date: Mon, 24 Oct 2022 23:46:26 +1100 Subject: [PATCH] DOC: CCT: typo fixes (#145) Fixes #144. Some typographical fixes in the description of a Coding Contract. --- doc/source/basicgameplay/codingcontracts.rst | 2 +- src/data/codingcontracttypes.ts | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/doc/source/basicgameplay/codingcontracts.rst b/doc/source/basicgameplay/codingcontracts.rst index 76bcaffbe..26f4e0528 100644 --- a/doc/source/basicgameplay/codingcontracts.rst +++ b/doc/source/basicgameplay/codingcontracts.rst @@ -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. | | | | 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 is | +| | | Note: The length of the binary string is dynamic, but its encoding/decoding is | | | | following Hammings 'rule'\n", | | | | Note 2: Index 0 is an 'overall' parity bit. Watch the Hammingcode-video from | | | | 3Blue1Brown for more information\n", | diff --git a/src/data/codingcontracttypes.ts b/src/data/codingcontracttypes.ts index c6e96c075..ed281cfa5 100644 --- a/src/data/codingcontracttypes.ts +++ b/src/data/codingcontracttypes.ts @@ -1320,7 +1320,7 @@ export const codingContractTypesMetadata: ICodingContractTypeMetadata[] = [ `'${n}' \n\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", - "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 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",