1 /*************************************************************************
2 *
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * Copyright 2000, 2011 Oracle and/or its affiliates.
6 *
7 * OpenOffice.org - a multi-platform office productivity suite
8 *
9 * This file is part of OpenOffice.org.
10 *
11 * OpenOffice.org is free software: you can redistribute it and/or modify
12 * it under the terms of the GNU Lesser General Public License version 3
13 * only, as published by the Free Software Foundation.
14 *
15 * OpenOffice.org is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
18 * GNU Lesser General Public License version 3 for more details
19 * (a copy is included in the LICENSE file that accompanied this code).
20 *
21 * You should have received a copy of the GNU Lesser General Public License
22 * version 3 along with OpenOffice.org.  If not, see
23 * <http://www.openoffice.org/license.html>
24 * for a copy of the LGPLv3 License.
25 *
26 ************************************************************************/
27 
28 #include "sal/config.h"
29 
30 #include <algorithm>
31 
32 #include "osl/diagnose.h"
33 #include "rtl/byteseq.hxx"
34 #include "rtl/ustring.hxx"
35 #include "sal/types.h"
36 #include "typelib/typeclass.h"
37 #include "typelib/typedescription.hxx"
38 
39 #include "lessoperators.hxx"
40 
41 namespace com { namespace sun { namespace star { namespace uno {
42 
43 bool operator <(TypeDescription const & left, TypeDescription const & right) {
44     OSL_ASSERT(left.is() && right.is());
45     typelib_TypeClass tc1 = left.get()->eTypeClass;
46     typelib_TypeClass tc2 = right.get()->eTypeClass;
47     return tc1 < tc2 ||
48         (tc1 == tc2 &&
49          (rtl::OUString(left.get()->pTypeName) <
50           rtl::OUString(right.get()->pTypeName)));
51 }
52 
53 } } } }
54 
55 namespace rtl {
56 
57 bool operator <(ByteSequence const & left, ByteSequence const & right) {
58     for (sal_Int32 i = 0; i != std::min(left.getLength(), right.getLength());
59          ++i)
60     {
61         if (left[i] < right[i]) {
62             return true;
63         }
64         if (right[i] < left[i]) {
65             return false;
66         }
67     }
68     return left.getLength() < right.getLength();
69 }
70 
71 }
72