Commit 37e675b7 by Ulrik Mikaelsson Committed by Erik de Castro Lopo

### Simplified logic of parsing sizes of rice-partitions

```> if the partition order is zero, n = frame's blocksize - predictor order
> else if this is not the first partition of the subframe,
>   n = (frame's blocksize / (2^partition order))
> else n = (frame's blocksize / (2^partition order)) - predictor order

if the partition order is zero, then partition_number can only be zero
if the partition order is zero, then
(frame's blocksize / (2^partition order))
is (frame's blocksize / 1) == frame's blocksize```
parent 4fbb6d4f
 ... ... @@ -1737,13 +1737,13 @@ Encoded residual. The number of samples (n) in the partition is determined as follows:
• if the partition order is zero, n = frame's blocksize - predictor order partition size = (frame's blocksize / (2^partition order))
• else if this is not the first partition of the subframe, n = (frame's blocksize / (2^partition order)) for first partition of the subframe, n = partition size - predictor
• else n = (frame's blocksize / (2^partition order)) - predictor order for remaining partitions, n = partition size
... ... @@ -1816,13 +1816,13 @@ Encoded residual. The number of samples (n) in the partition is determined as follows:
• if the partition order is zero, n = frame's blocksize - predictor order partition size = (frame's blocksize / (2^partition order))
• else if this is not the first partition of the subframe, n = (frame's blocksize / (2^partition order)) for first partition of the subframe, n = partition size - predictor
• else n = (frame's blocksize / (2^partition order)) - predictor order for remaining partitions, n = partition size
... ...