diff options
| author | Darrell Anderson <humanreadable@yahoo.com> | 2012-04-13 00:25:47 -0500 |
|---|---|---|
| committer | Slávek Banko <slavek.banko@axis.cz> | 2012-06-03 19:30:05 +0200 |
| commit | e842e1de9df9b2d1ec2bea9c6a12f6371cd82ffa (patch) | |
| tree | 33332ec7fb974491bc57aa4ed326407792a44f61 /kviewshell/plugins/djvu/libdjvu/BSEncodeByteStream.cpp | |
| parent | b93ebd692de461b59ce2db6181b08d736d37a423 (diff) | |
| download | tdegraphics-e842e1de9df9b2d1ec2bea9c6a12f6371cd82ffa.tar.gz tdegraphics-e842e1de9df9b2d1ec2bea9c6a12f6371cd82ffa.zip | |
Fix inadvertent "TQ" changes.
(cherry picked from commit ca4b0c6d6aef469eede468b405ea89e119da3626)
Diffstat (limited to 'kviewshell/plugins/djvu/libdjvu/BSEncodeByteStream.cpp')
| -rw-r--r-- | kviewshell/plugins/djvu/libdjvu/BSEncodeByteStream.cpp | 16 |
1 files changed, 8 insertions, 8 deletions
diff --git a/kviewshell/plugins/djvu/libdjvu/BSEncodeByteStream.cpp b/kviewshell/plugins/djvu/libdjvu/BSEncodeByteStream.cpp index 350d792d..9d5b726d 100644 --- a/kviewshell/plugins/djvu/libdjvu/BSEncodeByteStream.cpp +++ b/kviewshell/plugins/djvu/libdjvu/BSEncodeByteStream.cpp @@ -104,7 +104,7 @@ static const int OVERFLOW=32; // Sorting tresholds static const int RANKSORT_THRESH=10; -static const int TQUICKSORT_STACK=512; +static const int QUICKSORT_STACK=512; static const int PRESORT_THRESH=10; static const int PRESORT_DEPTH=8; static const int RADIX_THRESH=32768; @@ -283,8 +283,8 @@ void _BSort::quicksort3r(int lo, int hi, int depth) { /* Initialize stack */ - int slo[TQUICKSORT_STACK]; - int shi[TQUICKSORT_STACK]; + int slo[QUICKSORT_STACK]; + int shi[QUICKSORT_STACK]; int sp = 1; slo[0] = lo; shi[0] = hi; @@ -342,7 +342,7 @@ _BSort::quicksort3r(int lo, int hi, int depth) vswap(hi-tmp+1, h+1, tmp, posn); h1 = hi - (h1-h); // -- process segments - ASSERT(sp+2<TQUICKSORT_STACK); + ASSERT(sp+2<QUICKSORT_STACK); // ----- middle segment (=?) [l1, h1] for(int i=l1;i<=h1;i++) rank[posn[i]] = h1; @@ -437,9 +437,9 @@ void _BSort::quicksort3d(int lo, int hi, int depth) { /* Initialize stack */ - int slo[TQUICKSORT_STACK]; - int shi[TQUICKSORT_STACK]; - int sd[TQUICKSORT_STACK]; + int slo[QUICKSORT_STACK]; + int shi[QUICKSORT_STACK]; + int sd[QUICKSORT_STACK]; int sp = 1; slo[0] = lo; shi[0] = hi; @@ -518,7 +518,7 @@ _BSort::quicksort3d(int lo, int hi, int depth) vswap(hi-tmp+1, h+1, tmp, posn); h1 = hi - (h1-h); // -- process segments - ASSERT(sp+3<TQUICKSORT_STACK); + ASSERT(sp+3<QUICKSORT_STACK); // ----- middle segment (=?) [l1, h1] l = l1; h = h1; if (med==0) // special case for marker [slow] |