File: NameIndexSort.h

package info (click to toggle)
caret 5.6.4~dfsg.1-3
  • links: PTS, VCS
  • area: main
  • in suites: 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 (98 lines) | stat: -rw-r--r-- 2,964 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

#ifndef __NAME_INDEX_SORT_H__
#define __NAME_INDEX_SORT_H__

/*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 <QString>
#include <vector>

/// name and index sort
class NameIndexSort {
   protected:
      /// class for storing names and indices
      class NameIndexPair {
         public:
            /// constructor
            NameIndexPair(const int indexIn, const QString& nameIn);
            
            /// the name
            QString name;
            
            /// the index
            int indx;
            
            /// less than operator
            bool operator<(const NameIndexPair& nip) const;
            
            /// compare case insensitive
            static bool lessThanCaseInsensitive(const NameIndexPair& nip1,
                                                const NameIndexPair& nip2);
      };
      
   public:
      /// Constructor (must call sortByName after adding items);
      NameIndexSort();
      
      /// Constructor
      NameIndexSort(const std::vector<int>& indicesIn,
                    const std::vector<QString>& namesIn);
                    
      /// Constructor
      ~NameIndexSort();
      
      /// add a pair of items (must call sortByName when done adding items)
      void add(const int indx,
               const QString& name);
               
      /// get number of name indice pairs
      int getNumberOfItems() const;
      
      /// get name and index for an item after sorting
      void getSortedNameAndIndex(const int itemNum,
                           int& indexOut,
                           QString& nameOut) const;
      
      /// get index for an item after sorting
      int getSortedIndex(const int itemNum) const;
      
      /// get name for an item after sorting
      QString getSortedName(const int itemNum) const;
      
      /// sort by name case sensitive
      void sortByNameCaseSensitive();
      
      /// sort by name case insensitive
      void sortByNameCaseInsensitive();
      
   protected:
      /// the names and indices
      std::vector<NameIndexPair> names;
      
};

#endif // __NAME_INDEX_SORT_H__