media/libopus/silk/float/sort_FLP.c@6474c204b198 (annotated)
media/libopus/silk/float/sort_FLP.c
Wed, 31 Dec 2014 06:09:35 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Wed, 31 Dec 2014 06:09:35 +0100
- changeset 0
- 6474c204b198
- permissions
- -rw-r--r--
Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.
| michael@0 | 1 | /*********************************************************************** |
| michael@0 | 2 | Copyright (c) 2006-2011, Skype Limited. All rights reserved. |
| michael@0 | 3 | Redistribution and use in source and binary forms, with or without |
| michael@0 | 4 | modification, are permitted provided that the following conditions |
| michael@0 | 5 | are met: |
| michael@0 | 6 | - Redistributions of source code must retain the above copyright notice, |
| michael@0 | 7 | this list of conditions and the following disclaimer. |
| michael@0 | 8 | - Redistributions in binary form must reproduce the above copyright |
| michael@0 | 9 | notice, this list of conditions and the following disclaimer in the |
| michael@0 | 10 | documentation and/or other materials provided with the distribution. |
| michael@0 | 11 | - Neither the name of Internet Society, IETF or IETF Trust, nor the |
| michael@0 | 12 | names of specific contributors, may be used to endorse or promote |
| michael@0 | 13 | products derived from this software without specific prior written |
| michael@0 | 14 | permission. |
| michael@0 | 15 | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| michael@0 | 16 | AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| michael@0 | 17 | IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| michael@0 | 18 | ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
| michael@0 | 19 | LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| michael@0 | 20 | CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| michael@0 | 21 | SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| michael@0 | 22 | INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| michael@0 | 23 | CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| michael@0 | 24 | ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| michael@0 | 25 | POSSIBILITY OF SUCH DAMAGE. |
| michael@0 | 26 | ***********************************************************************/ |
| michael@0 | 27 | |
| michael@0 | 28 | #ifdef HAVE_CONFIG_H |
| michael@0 | 29 | #include "config.h" |
| michael@0 | 30 | #endif |
| michael@0 | 31 | |
| michael@0 | 32 | /* Insertion sort (fast for already almost sorted arrays): */ |
| michael@0 | 33 | /* Best case: O(n) for an already sorted array */ |
| michael@0 | 34 | /* Worst case: O(n^2) for an inversely sorted array */ |
| michael@0 | 35 | |
| michael@0 | 36 | #include "typedef.h" |
| michael@0 | 37 | #include "SigProc_FLP.h" |
| michael@0 | 38 | |
| michael@0 | 39 | void silk_insertion_sort_decreasing_FLP( |
| michael@0 | 40 | silk_float *a, /* I/O Unsorted / Sorted vector */ |
| michael@0 | 41 | opus_int *idx, /* O Index vector for the sorted elements */ |
| michael@0 | 42 | const opus_int L, /* I Vector length */ |
| michael@0 | 43 | const opus_int K /* I Number of correctly sorted positions */ |
| michael@0 | 44 | ) |
| michael@0 | 45 | { |
| michael@0 | 46 | silk_float value; |
| michael@0 | 47 | opus_int i, j; |
| michael@0 | 48 | |
| michael@0 | 49 | /* Safety checks */ |
| michael@0 | 50 | silk_assert( K > 0 ); |
| michael@0 | 51 | silk_assert( L > 0 ); |
| michael@0 | 52 | silk_assert( L >= K ); |
| michael@0 | 53 | |
| michael@0 | 54 | /* Write start indices in index vector */ |
| michael@0 | 55 | for( i = 0; i < K; i++ ) { |
| michael@0 | 56 | idx[ i ] = i; |
| michael@0 | 57 | } |
| michael@0 | 58 | |
| michael@0 | 59 | /* Sort vector elements by value, decreasing order */ |
| michael@0 | 60 | for( i = 1; i < K; i++ ) { |
| michael@0 | 61 | value = a[ i ]; |
| michael@0 | 62 | for( j = i - 1; ( j >= 0 ) && ( value > a[ j ] ); j-- ) { |
| michael@0 | 63 | a[ j + 1 ] = a[ j ]; /* Shift value */ |
| michael@0 | 64 | idx[ j + 1 ] = idx[ j ]; /* Shift index */ |
| michael@0 | 65 | } |
| michael@0 | 66 | a[ j + 1 ] = value; /* Write value */ |
| michael@0 | 67 | idx[ j + 1 ] = i; /* Write index */ |
| michael@0 | 68 | } |
| michael@0 | 69 | |
| michael@0 | 70 | /* If less than L values are asked check the remaining values, */ |
| michael@0 | 71 | /* but only spend CPU to ensure that the K first values are correct */ |
| michael@0 | 72 | for( i = K; i < L; i++ ) { |
| michael@0 | 73 | value = a[ i ]; |
| michael@0 | 74 | if( value > a[ K - 1 ] ) { |
| michael@0 | 75 | for( j = K - 2; ( j >= 0 ) && ( value > a[ j ] ); j-- ) { |
| michael@0 | 76 | a[ j + 1 ] = a[ j ]; /* Shift value */ |
| michael@0 | 77 | idx[ j + 1 ] = idx[ j ]; /* Shift index */ |
| michael@0 | 78 | } |
| michael@0 | 79 | a[ j + 1 ] = value; /* Write value */ |
| michael@0 | 80 | idx[ j + 1 ] = i; /* Write index */ |
| michael@0 | 81 | } |
| michael@0 | 82 | } |
| michael@0 | 83 | } |
