HelenOS sources
idx_ 69 uspace/lib/cpp/include/__bits/adt/deque.hpp : deq_{deq}, idx_{idx}
idx_ 73 uspace/lib/cpp/include/__bits/adt/deque.hpp : deq_{other.deq_}, idx_{other.idx_}
idx_ 79 uspace/lib/cpp/include/__bits/adt/deque.hpp idx_ = other.idx_;
idx_ 86 uspace/lib/cpp/include/__bits/adt/deque.hpp return deq_[idx_];
idx_ 91 uspace/lib/cpp/include/__bits/adt/deque.hpp return addressof(deq_[idx_]);
idx_ 96 uspace/lib/cpp/include/__bits/adt/deque.hpp ++idx_;
idx_ 103 uspace/lib/cpp/include/__bits/adt/deque.hpp return deque_const_iterator{deq_, idx_++};
idx_ 108 uspace/lib/cpp/include/__bits/adt/deque.hpp --idx_;
idx_ 115 uspace/lib/cpp/include/__bits/adt/deque.hpp return deque_const_iterator{deq_, idx_--};
idx_ 120 uspace/lib/cpp/include/__bits/adt/deque.hpp return deque_const_iterator{deq_, idx_ + n};
idx_ 125 uspace/lib/cpp/include/__bits/adt/deque.hpp idx_ += n;
idx_ 132 uspace/lib/cpp/include/__bits/adt/deque.hpp return deque_const_iterator{deq_, idx_ - n};
idx_ 137 uspace/lib/cpp/include/__bits/adt/deque.hpp idx_ -= n;
idx_ 144 uspace/lib/cpp/include/__bits/adt/deque.hpp return deq_[idx_ + n];
idx_ 149 uspace/lib/cpp/include/__bits/adt/deque.hpp return idx_ - rhs.idx_;
idx_ 154 uspace/lib/cpp/include/__bits/adt/deque.hpp return idx_;
idx_ 160 uspace/lib/cpp/include/__bits/adt/deque.hpp const_cast<deque<T, Allocator>&>(deq_), idx_
idx_ 166 uspace/lib/cpp/include/__bits/adt/deque.hpp size_type idx_;
idx_ 195 uspace/lib/cpp/include/__bits/adt/deque.hpp : deq_{deq}, idx_{idx}
idx_ 199 uspace/lib/cpp/include/__bits/adt/deque.hpp : deq_{other.deq_}, idx_{other.idx_}
idx_ 203 uspace/lib/cpp/include/__bits/adt/deque.hpp : deq_{other.deq_}, idx_{other.idx_}
idx_ 209 uspace/lib/cpp/include/__bits/adt/deque.hpp idx_ = other.idx_;
idx_ 217 uspace/lib/cpp/include/__bits/adt/deque.hpp idx_ = other.idx_;
idx_ 224 uspace/lib/cpp/include/__bits/adt/deque.hpp return deq_[idx_];
idx_ 229 uspace/lib/cpp/include/__bits/adt/deque.hpp return addressof(deq_[idx_]);
idx_ 234 uspace/lib/cpp/include/__bits/adt/deque.hpp ++idx_;
idx_ 241 uspace/lib/cpp/include/__bits/adt/deque.hpp return deque_iterator{deq_, idx_++};
idx_ 246 uspace/lib/cpp/include/__bits/adt/deque.hpp --idx_;
idx_ 253 uspace/lib/cpp/include/__bits/adt/deque.hpp return deque_iterator{deq_, idx_--};
idx_ 258 uspace/lib/cpp/include/__bits/adt/deque.hpp return deque_iterator{deq_, idx_ + n};
idx_ 263 uspace/lib/cpp/include/__bits/adt/deque.hpp idx_ += n;
idx_ 270 uspace/lib/cpp/include/__bits/adt/deque.hpp return deque_iterator{deq_, idx_ - n};
idx_ 275 uspace/lib/cpp/include/__bits/adt/deque.hpp idx_ -= n;
idx_ 282 uspace/lib/cpp/include/__bits/adt/deque.hpp return deq_[idx_ + n];
idx_ 287 uspace/lib/cpp/include/__bits/adt/deque.hpp return idx_ - rhs.idx_;
idx_ 292 uspace/lib/cpp/include/__bits/adt/deque.hpp return idx_;
idx_ 297 uspace/lib/cpp/include/__bits/adt/deque.hpp return deque_const_iterator{deq_, idx_};
idx_ 302 uspace/lib/cpp/include/__bits/adt/deque.hpp size_type idx_;
idx_ 54 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp : table_{table}, idx_{idx}, max_idx_{max_idx}, current_{current}
idx_ 73 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp if (current_ == table_[idx_].head)
idx_ 75 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp if (idx_ < max_idx_)
idx_ 77 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp while (!table_[++idx_].head && idx_ < max_idx_)
idx_ 80 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp if (idx_ < max_idx_)
idx_ 81 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp current_ = table_[idx_].head;
idx_ 112 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp return idx_;
idx_ 117 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp size_type idx_;
idx_ 159 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp : table_{table}, idx_{idx}, max_idx_{max_idx}, current_{current}
idx_ 166 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp : table_{other.table_}, idx_{other.idx_}, max_idx_{other.max_idx_},
idx_ 173 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp idx_ = other.idx_;
idx_ 193 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp if (current_ == table_[idx_].head)
idx_ 195 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp if (idx_ < max_idx_)
idx_ 197 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp while (!table_[++idx_].head && idx_ < max_idx_)
idx_ 200 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp if (idx_ < max_idx_)
idx_ 201 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp current_ = table_[idx_].head;
idx_ 232 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp return idx_;
idx_ 237 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp size_type idx_;
idx_ 291 uspace/lib/cpp/include/__bits/random.hpp state_[idx_(-n)] = value % aux::pow2u(w);;
idx_ 295 uspace/lib/cpp/include/__bits/random.hpp state_[idx_(i)] = (f * (state_[idx_(i - 1)] ^
idx_ 296 uspace/lib/cpp/include/__bits/random.hpp (state_[idx_(i - 1)] >> (w - 2))) + 1 % n) % aux::pow2u(w);
idx_ 311 uspace/lib/cpp/include/__bits/random.hpp state_[idx_(i)] = result_type{};
idx_ 313 uspace/lib/cpp/include/__bits/random.hpp state_[idx_(i)] += arr[k * (i + n) + j] * aux::pow2(32 * j);
idx_ 314 uspace/lib/cpp/include/__bits/random.hpp state_[idx_(i)] %= aux::pow2(w);
idx_ 358 uspace/lib/cpp/include/__bits/random.hpp os << state_[idx_(i_ - j - 1)];
idx_ 376 uspace/lib/cpp/include/__bits/random.hpp if (!(is >> state_[idx_(i_ - j - 1)]))
idx_ 394 uspace/lib/cpp/include/__bits/random.hpp auto y = (state_[idx_(i_ - n)] & ~mask) | (state_[idx_(i_ + 1 - n)] & mask);
idx_ 396 uspace/lib/cpp/include/__bits/random.hpp state_[i_] = state_[idx_(i_ + m - n)] ^ (y >> 1) ^ alpha;
idx_ 485 uspace/lib/cpp/include/__bits/random.hpp state_[idx_(i)] = result_type{};
idx_ 487 uspace/lib/cpp/include/__bits/random.hpp state_[idx_(i)] += z[j] * aux::pow2u(32 * j);
idx_ 488 uspace/lib/cpp/include/__bits/random.hpp state_[idx_(i)] %= m_;
idx_ 491 uspace/lib/cpp/include/__bits/random.hpp if (state_[idx_(-1)] == 0)
idx_ 511 uspace/lib/cpp/include/__bits/random.hpp state_[idx_(i)] = result_type{};
idx_ 513 uspace/lib/cpp/include/__bits/random.hpp state_[idx_(i)] += arr[k * (i + r) + j] * aux::pow2(32 * j);
idx_ 514 uspace/lib/cpp/include/__bits/random.hpp state_[idx_(i)] %= m_;
idx_ 519 uspace/lib/cpp/include/__bits/random.hpp if (state_[idx_(-1)] == 0)
idx_ 563 uspace/lib/cpp/include/__bits/random.hpp os << state_[idx_(i_ - j - 1)];
idx_ 581 uspace/lib/cpp/include/__bits/random.hpp if (!(is >> state_[idx_(i_ - j - 1)]))
idx_ 604 uspace/lib/cpp/include/__bits/random.hpp auto y = static_cast<int64_t>(state_[idx_(i_ - s)]) - state_[idx_(i_ - r)] - carry_;
HelenOS homepage, sources at GitHub