| author | zecke <zecke> | 2002-10-07 09:10:05 (UTC) |
|---|---|---|
| committer | zecke <zecke> | 2002-10-07 09:10:05 (UTC) |
| commit | acd2d0062dd87635feb03927663b1f700305d67b (patch) (side-by-side diff) | |
| 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) (ignore whitespace changes)
| -rw-r--r-- | libopie2/opiepim/orecordlist.h | 5 |
1 files changed, 2 insertions, 3 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 @@ -154,14 +154,13 @@ ORecordListIterator<T> &ORecordListIterator<T>::operator=( const ORecordListIter template <class T> T ORecordListIterator<T>::operator*() { -// qWarning("operator* %d %d", m_current, m_uids[m_current] ); + qWarning("operator* %d %d", m_current, m_uids[m_current] ); if (!m_end ) /* FIXME * until the cache is in place * we do the uid match uid check */ - if(m_record.uid() != m_uids[m_current] ) - m_record = m_temp->find( m_uids[m_current] ); + m_record = m_temp->find( m_uids[m_current] ); else m_record = T(); |