Lines Matching refs:isValid
176 bool LevelDBTransaction::TreeIterator::isValid() const
184 if (isValid())
191 if (!isValid())
194 if (isValid())
200 ASSERT(isValid());
202 if (isValid()) {
211 ASSERT(isValid());
213 if (isValid()) {
221 ASSERT(isValid());
227 ASSERT(isValid());
234 ASSERT(isValid());
240 ASSERT(isValid());
242 ASSERT(isValid());
272 bool LevelDBTransaction::TransactionIterator::isValid() const
299 ASSERT(isValid());
309 if (nonCurrent->isValid() && !m_comparator->compare(nonCurrent->key(), key()))
312 ASSERT(!nonCurrent->isValid() || m_comparator->compare(nonCurrent->key(), key()) > 0);
324 ASSERT(isValid());
334 if (nonCurrent->isValid()) {
343 ASSERT(!nonCurrent->isValid() || m_comparator->compare(nonCurrent->key(), key()) < 0);
355 ASSERT(isValid());
363 ASSERT(isValid());
380 if (m_treeIterator->isValid() && m_treeIterator.get() == m_current) {
385 if (m_dbIterator->isValid()) {
392 if (m_treeIterator->isValid() && !m_comparator->compare(m_treeIterator->key(), m_dbIterator->key()))
398 if (m_treeIterator->isValid())
421 if (m_treeIterator->isValid() && m_dbIterator->isValid() && !m_comparator->compare(m_treeIterator->key(), m_dbIterator->key())) {
430 if (m_treeIterator->isValid() && m_treeIterator->isDeleted()) {
431 if (m_direction == kForward && (!m_dbIterator->isValid() || treeIteratorIsLower())) {
434 } else if (m_direction == kReverse && (!m_dbIterator->isValid() || treeIteratorIsHigher())) {
446 if (m_treeIterator->isValid())
449 if (m_dbIterator->isValid()) {
461 if (m_treeIterator->isValid())
464 if (m_dbIterator->isValid()) {