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     2541536 : bool operator <(TypeDescription const & left, TypeDescription const & right) {
      36             :     assert(left.is() && right.is());
      37     2541536 :     typelib_TypeClass tc1 = left.get()->eTypeClass;
      38     2541535 :     typelib_TypeClass tc2 = right.get()->eTypeClass;
      39     3232125 :     return tc1 < tc2 ||
      40     2433395 :         (tc1 == tc2 &&
      41     2433398 :          (OUString::unacquired(&left.get()->pTypeName) <
      42     4974924 :           OUString::unacquired(&right.get()->pTypeName)));
      43             : }
      44             : 
      45           0 : bool TypeDescEqual::operator()( const TypeDescription& rLeft, const TypeDescription& rRight) const
      46             : {
      47             :         assert( rLeft.is() && rRight.is());
      48           0 :         const typelib_TypeDescription& rA = *rLeft.get();
      49           0 :         const typelib_TypeDescription& rB = *rRight.get();
      50           0 :         if( rA.eTypeClass != rB.eTypeClass)
      51           0 :                 return false;
      52             :         const sal_Int32 nCmp = rtl_ustr_compare_WithLength(
      53             :                         rA.pTypeName->buffer, rA.pTypeName->length,
      54           0 :                         rB.pTypeName->buffer, rB.pTypeName->length);
      55           0 :         return (nCmp == 0);
      56             : }
      57             : 
      58           0 : sal_Int32 TypeDescHash::operator()( const TypeDescription& rTD) const
      59             : {
      60             :         assert( rTD.is());
      61           0 :         const typelib_TypeDescription& rA = *rTD.get();
      62           0 :         sal_Int32 h = rtl_ustr_hashCode_WithLength( rA.pTypeName->buffer, rA.pTypeName->length);
      63           0 :         h ^= static_cast<sal_Int32>(rA.eTypeClass);
      64           0 :         return h;
      65             : }
      66             : 
      67             : } } } }
      68             : 
      69             : namespace rtl {
      70             : 
      71      101458 : bool operator <(ByteSequence const & left, ByteSequence const & right) {
      72      101458 :     const sal_Int32 nLen = std::min( left.getLength(), right.getLength());
      73     3744139 :     for( sal_Int32 i = 0; i < nLen; ++i )
      74             :     {
      75     3662325 :         if (left[i] < right[i]) {
      76       12925 :             return true;
      77             :         }
      78     3649400 :         if (right[i] < left[i]) {
      79        6719 :             return false;
      80             :         }
      81             :     }
      82       81814 :     return left.getLength() < right.getLength();
      83             : }
      84             : 
      85             : }
      86             : 
      87             : /* vim:set shiftwidth=4 softtabstop=4 expandtab: */