diff options
| author | Joe Tsai <joetsai@digital-static.net> | 2015-10-20 03:02:55 -0700 |
|---|---|---|
| committer | Joe Tsai <joetsai@digital-static.net> | 2015-10-20 03:02:55 -0700 |
| commit | 4f1fce1681c0dbbaa455f01a6f99c154b176296e (patch) | |
| tree | 081f167b77ce273a1e92409dc0d0161548e37dbf /docs | |
| parent | f908a4ebe451055dbc688a4642e8c2cce2c2f495 (diff) | |
| download | brotli-4f1fce1681c0dbbaa455f01a6f99c154b176296e.zip brotli-4f1fce1681c0dbbaa455f01a6f99c154b176296e.tar.gz brotli-4f1fce1681c0dbbaa455f01a6f99c154b176296e.tar.bz2 | |
Make code and paragraph both use 3-space indents
Diffstat (limited to 'docs')
| -rw-r--r-- | docs/draft-alakuijala-brotli-07.nroff | 18 |
1 files changed, 9 insertions, 9 deletions
diff --git a/docs/draft-alakuijala-brotli-07.nroff b/docs/draft-alakuijala-brotli-07.nroff index 652e8c4..ddf93c5 100644 --- a/docs/draft-alakuijala-brotli-07.nroff +++ b/docs/draft-alakuijala-brotli-07.nroff @@ -493,11 +493,11 @@ from most- to least-significant bit. The code lengths are initially in tree[I].Len; the codes are produced in tree[I].Code. .nf - 1) Count the number of codes for each code length. Let - bl_count[N] be the number of codes of length N, N >= 1. + 1) Count the number of codes for each code length. Let + bl_count[N] be the number of codes of length N, N >= 1. - 2) Find the numerical value of the smallest code for each - code length: + 2) Find the numerical value of the smallest code for each + code length: .KS code = 0; @@ -508,11 +508,11 @@ initially in tree[I].Len; the codes are produced in tree[I].Code. } .KE - 3) Assign numerical values to all codes, using consecutive - values for all codes of the same length with the base - values determined at step 2. Codes that are never used - (which have a bit length of zero) must not be assigned a - value. + 3) Assign numerical values to all codes, using consecutive + values for all codes of the same length with the base + values determined at step 2. Codes that are never used + (which have a bit length of zero) must not be assigned a + value. .KS for (n = 0; n <= max_code; n++) { |