author | zecke <zecke> | 2002-10-07 09:10:05 (UTC) |
---|---|---|
committer | zecke <zecke> | 2002-10-07 09:10:05 (UTC) |
commit | acd2d0062dd87635feb03927663b1f700305d67b (patch) (unidiff) | |
tree | 179217749ec7ba3217ca71f80a6e1064f249d1b0 /libopie2/opiepim/orecordlist.h | |
parent | de56dc7c5a21cbd70e9d1e66ab68ca95a277c45c (diff) | |
download | opie-acd2d0062dd87635feb03927663b1f700305d67b.zip opie-acd2d0062dd87635feb03927663b1f700305d67b.tar.gz opie-acd2d0062dd87635feb03927663b1f700305d67b.tar.bz2 |
First SQL backend Resource
The DB layout is not fully what we've in mind
but for example I do lack the Categories infrastructure
for that
I've to implement sorted lists and then I'll make
Todolist fast
Diffstat (limited to 'libopie2/opiepim/orecordlist.h') (more/less context) (show whitespace changes)
-rw-r--r-- | libopie2/opiepim/orecordlist.h | 3 |
1 files changed, 1 insertions, 2 deletions
diff --git a/libopie2/opiepim/orecordlist.h b/libopie2/opiepim/orecordlist.h index 1fd0741..b6fa7fa 100644 --- a/libopie2/opiepim/orecordlist.h +++ b/libopie2/opiepim/orecordlist.h | |||
@@ -145,31 +145,30 @@ template <class T> | |||
145 | ORecordListIterator<T> &ORecordListIterator<T>::operator=( const ORecordListIterator<T>& it) { | 145 | ORecordListIterator<T> &ORecordListIterator<T>::operator=( const ORecordListIterator<T>& it) { |
146 | m_uids = it.m_uids; | 146 | m_uids = it.m_uids; |
147 | m_current = it.m_current; | 147 | m_current = it.m_current; |
148 | m_temp = it.m_temp; | 148 | m_temp = it.m_temp; |
149 | m_end = it.m_end; | 149 | m_end = it.m_end; |
150 | m_record = it.m_record; | 150 | m_record = it.m_record; |
151 | 151 | ||
152 | return *this; | 152 | return *this; |
153 | } | 153 | } |
154 | 154 | ||
155 | template <class T> | 155 | template <class T> |
156 | T ORecordListIterator<T>::operator*() { | 156 | T ORecordListIterator<T>::operator*() { |
157 | // qWarning("operator* %d %d", m_current, m_uids[m_current] ); | 157 | qWarning("operator* %d %d", m_current, m_uids[m_current] ); |
158 | if (!m_end ) | 158 | if (!m_end ) |
159 | /* FIXME | 159 | /* FIXME |
160 | * until the cache is in place | 160 | * until the cache is in place |
161 | * we do the uid match uid check | 161 | * we do the uid match uid check |
162 | */ | 162 | */ |
163 | if(m_record.uid() != m_uids[m_current] ) | ||
164 | m_record = m_temp->find( m_uids[m_current] ); | 163 | m_record = m_temp->find( m_uids[m_current] ); |
165 | else | 164 | else |
166 | m_record = T(); | 165 | m_record = T(); |
167 | 166 | ||
168 | return m_record; | 167 | return m_record; |
169 | } | 168 | } |
170 | 169 | ||
171 | template <class T> | 170 | template <class T> |
172 | ORecordListIterator<T> &ORecordListIterator<T>::operator++() { | 171 | ORecordListIterator<T> &ORecordListIterator<T>::operator++() { |
173 | if (m_current < m_uids.count() ) { | 172 | if (m_current < m_uids.count() ) { |
174 | m_end = false; | 173 | m_end = false; |
175 | ++m_current; | 174 | ++m_current; |