framework/src/main/java/org/apache/felix/framework/util/StringComparator.java [28:67]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    public int compare(String s1, String s2)
    {
        int n1 = s1.length();
        int n2 = s2.length();
        int min = n1 < n2 ? n1 : n2;
        for ( int i = 0; i < min; i++ )
        {
            char c1 = s1.charAt( i );
            char c2 = s2.charAt( i );
            if ( c1 != c2 )
            {
                // Fast check for simple ascii codes
                if ( c1 <= 128 && c2 <= 128 )
                {
                    c1 = toLowerCaseFast(c1);
                    c2 = toLowerCaseFast(c2);
                    if ( c1 != c2 )
                    {
                        return c1 - c2;
                    }
                }
                else
                {
                    c1 = Character.toUpperCase( c1 );
                    c2 = Character.toUpperCase( c2 );
                    if ( c1 != c2 )
                    {
                        c1 = Character.toLowerCase( c1 );
                        c2 = Character.toLowerCase( c2 );
                        if ( c1 != c2 )
                        {
                            // No overflow because of numeric promotion
                            return c1 - c2;
                        }
                    }
                }
            }
        }
        return n1 - n2;
    }
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -



configadmin/src/main/java/org/apache/felix/cm/impl/CaseInsensitiveDictionary.java [501:540]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
        public int compare(String s1, String s2)
        {
            int n1 = s1.length();
            int n2 = s2.length();
            int min = n1 < n2 ? n1 : n2;
            for ( int i = 0; i < min; i++ )
            {
                char c1 = s1.charAt( i );
                char c2 = s2.charAt( i );
                if ( c1 != c2 )
                {
                    // Fast check for simple ascii codes
                    if ( c1 <= 128 && c2 <= 128 )
                    {
                        c1 = toLowerCaseFast(c1);
                        c2 = toLowerCaseFast(c2);
                        if ( c1 != c2 )
                        {
                            return c1 - c2;
                        }
                    }
                    else
                    {
                        c1 = Character.toUpperCase( c1 );
                        c2 = Character.toUpperCase( c2 );
                        if ( c1 != c2 )
                        {
                            c1 = Character.toLowerCase( c1 );
                            c2 = Character.toLowerCase( c2 );
                            if ( c1 != c2 )
                            {
                                // No overflow because of numeric promotion
                                return c1 - c2;
                            }
                        }
                    }
                }
            }
            return n1 - n2;
        }
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -



connect/src/main/java/org/apache/felix/connect/felix/framework/util/StringComparator.java [28:67]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    public int compare(String s1, String s2)
    {
        int n1 = s1.length();
        int n2 = s2.length();
        int min = n1 < n2 ? n1 : n2;
        for ( int i = 0; i < min; i++ )
        {
            char c1 = s1.charAt( i );
            char c2 = s2.charAt( i );
            if ( c1 != c2 )
            {
                // Fast check for simple ascii codes
                if ( c1 <= 128 && c2 <= 128 )
                {
                    c1 = toLowerCaseFast(c1);
                    c2 = toLowerCaseFast(c2);
                    if ( c1 != c2 )
                    {
                        return c1 - c2;
                    }
                }
                else
                {
                    c1 = Character.toUpperCase( c1 );
                    c2 = Character.toUpperCase( c2 );
                    if ( c1 != c2 )
                    {
                        c1 = Character.toLowerCase( c1 );
                        c2 = Character.toLowerCase( c2 );
                        if ( c1 != c2 )
                        {
                            // No overflow because of numeric promotion
                            return c1 - c2;
                        }
                    }
                }
            }
        }
        return n1 - n2;
    }
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -