diff options
| author | Alex Beregszaszi <alex@rtfs.hu> | 2018-11-26 05:57:44 +0800 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2018-11-26 05:57:44 +0800 |
| commit | 96333f303373e073ef58a676983ed368fcd4b9f4 (patch) | |
| tree | c02c12d507b376d1310f16a87ecf1320e90b5cff | |
| parent | 1e03c1602a477086638b377cf29d94e1216e8e9a (diff) | |
| parent | 06ae2286212bac0834090db415947c4d378b6122 (diff) | |
| download | dexon-solidity-96333f303373e073ef58a676983ed368fcd4b9f4.tar dexon-solidity-96333f303373e073ef58a676983ed368fcd4b9f4.tar.gz dexon-solidity-96333f303373e073ef58a676983ed368fcd4b9f4.tar.bz2 dexon-solidity-96333f303373e073ef58a676983ed368fcd4b9f4.tar.lz dexon-solidity-96333f303373e073ef58a676983ed368fcd4b9f4.tar.xz dexon-solidity-96333f303373e073ef58a676983ed368fcd4b9f4.tar.zst dexon-solidity-96333f303373e073ef58a676983ed368fcd4b9f4.zip | |
Merge pull request #5500 from davidlj95/patch-1
Documentation typo fixes
| -rw-r--r-- | docs/installing-solidity.rst | 2 | ||||
| -rw-r--r-- | docs/introduction-to-smart-contracts.rst | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/docs/installing-solidity.rst b/docs/installing-solidity.rst index f8de0e8d..2797d8b0 100644 --- a/docs/installing-solidity.rst +++ b/docs/installing-solidity.rst @@ -115,7 +115,7 @@ Arch Linux also has packages, albeit limited to the latest development version: pacman -S solidity -We distribute the Solidity compiler through Homebrow +We distribute the Solidity compiler through Homebrew as a build-from-source version. Pre-built bottles are currently not supported. diff --git a/docs/introduction-to-smart-contracts.rst b/docs/introduction-to-smart-contracts.rst index 9245300b..34ef012e 100644 --- a/docs/introduction-to-smart-contracts.rst +++ b/docs/introduction-to-smart-contracts.rst @@ -400,7 +400,7 @@ within a word). At the time of expansion, the cost in gas must be paid. Memory i costly the larger it grows (it scales quadratically). The EVM is not a register machine but a stack machine, so all -computations are performed on an data area called the **stack**. It has a maximum size of +computations are performed on a data area called the **stack**. It has a maximum size of 1024 elements and contains words of 256 bits. Access to the stack is limited to the top end in the following way: It is possible to copy one of |