QtLing/StemCollection.cpp at master · JohnAGoldsmith/QtLing · GitHub

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
#include "StemCollection.h"
#include <QDebug>
#include <QMapIterator>

CStemCollection::CStemCollection(CLexicon* lexicon)
{   m_stem_list             = new QList<CStem*>;
    m_StringToStemMap       = new map_string_to_stem();
    m_CorpusCount			= 0;
    m_MemberName			= QString();
    m_forward_sort_valid_flag = false;
    m_SortStyle				= KEY;
    m_Lexicon               = lexicon;
}


CStemCollection::~CStemCollection()
{
    // delete each stem individually, and then...
    // Moved some code here into clear(): -- Hanson 7.31
    clear();
    delete m_StringToStemMap;
}

void CStemCollection::clear(){
    foreach (CStem* stem, *m_stem_list){
        //delete stem; // memory leak TO DO
    }
    m_StringToStemMap->clear();
    //m_SortedStringList.clear();
    m_CorpusCount = 0;
}
CStem* CStemCollection::add(const QString& stem)
{
    CStem* pStem = new CStem(stem);
    m_stem_list->append(pStem);
    m_StringToStemMap->insert(stem, pStem);
    m_forward_sort_valid_flag = false;
    return pStem;
}
CStem* CStemCollection::operator <<(const QString& stem)
{
    return this->add(stem);
}

CStem* CStemCollection::operator ^=(const QString& stem)
{
    return this->find_or_add(stem);
}


CStem* CStemCollection::get_from_string( QString stem)
{
    return m_StringToStemMap->value(stem);
}

CStem* CStemCollection::get_at( int stemno)
{
    if (!m_forward_sort_valid_flag){ sort_alphabetically();}
    return m_stem_list->at(stemno);
}
QStringList CStemCollection::get_list_of_stem_strings(){
    QStringList result;
    foreach (CStem* stem, *m_stem_list  ){
        result.append(stem->get_stem());
    }
    return result;
}


CStem* CStemCollection::find_or_add(const QString& stem)
{
    //if (!m_forward_sort_valid_flag){
    //    sort_alphabetically();
    //}
    if (m_StringToStemMap->contains(stem)){
        return m_StringToStemMap->value(stem);
    } else{
        return add(stem);
    }
}
CStem* CStemCollection::find_or_fail(const QString& stem)
{
    if (m_StringToStemMap->contains(stem)){
        return m_StringToStemMap->value(stem);
    } else{
        return NULL;
    }
}
bool compare_stems_by_key(CStem* stem1, CStem* stem2){
    return stem1->get_key() < stem2->get_key();
}

void CStemCollection::sort_alphabetically()
{   m_stem_list->clear();
    foreach(CStem* stem, m_StringToStemMap->values()){
        m_stem_list->append(stem);
    }
    std::sort(m_stem_list->begin(), m_stem_list->end(), compare_stems_by_key);
    m_forward_sort_valid_flag = true;
}

QString CStemCollection::get_string_at(int index) {
    if (!m_forward_sort_valid_flag) { sort_alphabetically();}
    return m_stem_list->at(index)->get_key();
}