Lines Matching refs:table_

113       : table_(table), row_(row) {  in BitTableAccessor()
114     DCHECK(table_ != nullptr);  in BitTableAccessor()
119   ALWAYS_INLINE bool IsValid() const { return row_ < table_->NumRows(); }  in IsValid()
122     return this->table_ == other.table_ && this->row_ == other.row_;  in Equals()
134   ALWAYS_INLINE uint32_t Get##NAME() const { return table_->Get(row_, COLUMN); }     \
141   const BitTableBase<kNumColumns>* table_ = nullptr;
164     const_iterator(const BitTable* table, uint32_t row) : table_(table), row_(row) {}  in const_iterator()
165     const_iterator operator+(difference_type n) { return const_iterator(table_, row_ + n); }
166     const_iterator operator-(difference_type n) { return const_iterator(table_, row_ - n); }
170     const_iterator operator++() { return const_iterator(table_, ++row_); }
171     const_iterator operator--() { return const_iterator(table_, --row_); }
172     const_iterator operator++(int) { return const_iterator(table_, row_++); }
173     const_iterator operator--(int) { return const_iterator(table_, row_--); }
174     bool operator==(const_iterator i) const { DCHECK(table_ == i.table_); return row_ == i.row_; }
175     bool operator!=(const_iterator i) const { DCHECK(table_ == i.table_); return row_ != i.row_; }
176     bool operator<=(const_iterator i) const { DCHECK(table_ == i.table_); return row_ <= i.row_; }
177     bool operator>=(const_iterator i) const { DCHECK(table_ == i.table_); return row_ >= i.row_; }
178     bool operator<(const_iterator i) const { DCHECK(table_ == i.table_); return row_ < i.row_; }
179     bool operator>(const_iterator i) const { DCHECK(table_ == i.table_); return row_ > i.row_; }
181       DCHECK_LT(row_, table_->NumRows());
182       return Accessor(table_, row_);
185       DCHECK_LT(row_, table_->NumRows());
186       return Accessor(table_, row_);
189       DCHECK_LT(row_ + index, table_->NumRows());
190       return Accessor(table_, row_ + index);
193     const BitTable* table_ = nullptr;