Branch data     Line data    Source code

       1                 :            : /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
       2                 :            : /*
       3                 :            :  * This file is part of the LibreOffice project.
       4                 :            :  *
       5                 :            :  * This Source Code Form is subject to the terms of the Mozilla Public
       6                 :            :  * License, v. 2.0. If a copy of the MPL was not distributed with this
       7                 :            :  * file, You can obtain one at http://mozilla.org/MPL/2.0/.
       8                 :            :  *
       9                 :            :  * This file incorporates work covered by the following license notice:
      10                 :            :  *
      11                 :            :  *   Licensed to the Apache Software Foundation (ASF) under one or more
      12                 :            :  *   contributor license agreements. See the NOTICE file distributed
      13                 :            :  *   with this work for additional information regarding copyright
      14                 :            :  *   ownership. The ASF licenses this file to you under the Apache
      15                 :            :  *   License, Version 2.0 (the "License"); you may not use this file
      16                 :            :  *   except in compliance with the License. You may obtain a copy of
      17                 :            :  *   the License at http://www.apache.org/licenses/LICENSE-2.0 .
      18                 :            :  */
      19                 :            : 
      20                 :            : #include "sal/config.h"
      21                 :            : 
      22                 :            : #include <algorithm>
      23                 :            : #include <cassert>
      24                 :            : 
      25                 :            : #include "rtl/byteseq.hxx"
      26                 :            : #include "rtl/ustring.hxx"
      27                 :            : #include "sal/types.h"
      28                 :            : #include "typelib/typeclass.h"
      29                 :            : #include "typelib/typedescription.hxx"
      30                 :            : 
      31                 :            : #include "lessoperators.hxx"
      32                 :            : 
      33                 :            : namespace com { namespace sun { namespace star { namespace uno {
      34                 :            : 
      35                 :    2320271 : bool operator <(TypeDescription const & left, TypeDescription const & right) {
      36                 :            :     assert(left.is() && right.is());
      37                 :    2320271 :     typelib_TypeClass tc1 = left.get()->eTypeClass;
      38                 :    2320272 :     typelib_TypeClass tc2 = right.get()->eTypeClass;
      39                 :            :     return tc1 < tc2 ||
      40                 :            :         (tc1 == tc2 &&
      41                 :    2216187 :          (OUString(left.get()->pTypeName) <
      42 [ +  + ][ +  + ]:    4536459 :           OUString(right.get()->pTypeName)));
         [ +  + ][ +  + ]
                 [ +  + ]
      43                 :            : }
      44                 :            : 
      45                 :            : } } } }
      46                 :            : 
      47                 :            : namespace rtl {
      48                 :            : 
      49                 :     101195 : bool operator <(ByteSequence const & left, ByteSequence const & right) {
      50 [ +  - ][ +  + ]:    3566193 :     for (sal_Int32 i = 0; i != std::min(left.getLength(), right.getLength());
      51                 :            :          ++i)
      52                 :            :     {
      53         [ +  + ]:    3485778 :         if (left[i] < right[i]) {
      54                 :       8940 :             return true;
      55                 :            :         }
      56         [ +  + ]:    3476838 :         if (right[i] < left[i]) {
      57                 :      11840 :             return false;
      58                 :            :         }
      59                 :            :     }
      60                 :     101195 :     return left.getLength() < right.getLength();
      61                 :            : }
      62                 :            : 
      63                 :            : }
      64                 :            : 
      65                 :            : /* vim:set shiftwidth=4 softtabstop=4 expandtab: */