File: NameIndexSort.cxx

package info (click to toggle)
caret 5.6.4~dfsg.1-3
  • links: PTS, VCS
  • area: main
  • in suites: jessie, jessie-kfreebsd, wheezy
  • size: 31,904 kB
  • ctags: 28,901
  • sloc: cpp: 378,050; python: 6,718; ansic: 5,507; makefile: 333; sh: 46
file content (154 lines) | stat: -rw-r--r-- 3,357 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
/*LICENSE_START*/
/*
 *  Copyright 1995-2002 Washington University School of Medicine
 *
 *  http://brainmap.wustl.edu
 *
 *  This file is part of CARET.
 *
 *  CARET is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 2 of the License, or
 *  (at your option) any later version.
 *
 *  CARET is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with CARET; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 */
/*LICENSE_END*/

#include <algorithm>

#include "NameIndexSort.h"

/**
 * Constructor.
 */
NameIndexSort::NameIndexSort()
{
}

/**
 * Constructor.
 */
NameIndexSort::NameIndexSort(const std::vector<int>& indicesIn,
                             const std::vector<QString>& namesIn)
{
   for (unsigned int i = 0; i < indicesIn.size(); i++) {
      add(indicesIn[i], namesIn[i]);
   }
   
   sortByNameCaseSensitive();
}
              
/**
 * Constructor.
 */
NameIndexSort::~NameIndexSort()
{
}

/**
 * add a pair of items (must call sort when done adding items).
 */
void 
NameIndexSort::add(const int indx,
                   const QString& name)
{
   names.push_back(NameIndexPair(indx, name));
}
         
/**
 * sort by name case sensitive.
 */
void 
NameIndexSort::sortByNameCaseSensitive()
{
   std::sort(names.begin(), names.end());
}

/**
 * sort by name case insensitive.
 */
void 
NameIndexSort::sortByNameCaseInsensitive()
{
   std::sort(names.begin(), names.end(), NameIndexPair::lessThanCaseInsensitive);
}

/**
 * get number of name indice pairs.
 */
int 
NameIndexSort::getNumberOfItems() const 
{ 
   return names.size(); 
}

/**
 * get name and index for an item after sorting.
 */
void 
NameIndexSort::getSortedNameAndIndex(const int itemNum,
                                     int& indexOut,
                                     QString& nameOut) const
{
   indexOut = names[itemNum].indx;
   nameOut  = names[itemNum].name;
}
                           
/**
 * get index for an item after sorting.
 */
int 
NameIndexSort::getSortedIndex(const int itemNum) const
{
   return names[itemNum].indx;
}
      
/**
 * get name for an item after sorting.
 */
QString 
NameIndexSort::getSortedName(const int itemNum) const
{
   return names[itemNum].name;
}
      
/**
 * constructor.
 */
NameIndexSort::NameIndexPair::NameIndexPair(const int indexIn, const QString& nameIn)
{
   indx = indexIn;
   name = nameIn;
}

/**
 * less than operator.
 */
bool 
NameIndexSort::NameIndexPair::operator<(const NameIndexPair& nip) const
{
   if (name == nip.name) {
      return (indx < nip.indx);
   }
   return (name < nip.name);
}

//=================================================================
/**
 * compare case insensitive.
 */
bool 
NameIndexSort::NameIndexPair::lessThanCaseInsensitive(const NameIndexPair& nip1,
                                                      const NameIndexPair& nip2)
{
   return (QString::compare(nip1.name, nip2.name, Qt::CaseInsensitive) < 0);
}