min_available_id_   66 ui/gfx/sequential_id_generator.cc   while (id_to_number_.count(min_available_id_) > 0 &&
min_available_id_   67 ui/gfx/sequential_id_generator.cc          min_available_id_ < kMaxID) {
min_available_id_   68 ui/gfx/sequential_id_generator.cc     ++min_available_id_;
min_available_id_   70 ui/gfx/sequential_id_generator.cc   if (min_available_id_ >= kMaxID)
min_available_id_   71 ui/gfx/sequential_id_generator.cc     min_available_id_ = min_id_;
min_available_id_   72 ui/gfx/sequential_id_generator.cc   return min_available_id_;
min_available_id_   76 ui/gfx/sequential_id_generator.cc   if (id < min_available_id_) {
min_available_id_   77 ui/gfx/sequential_id_generator.cc     min_available_id_ = id;
min_available_id_   78 ui/gfx/sequential_id_generator.cc     DCHECK_GE(min_available_id_, min_id_);
min_available_id_   53 ui/gfx/sequential_id_generator.h   uint32 min_available_id_;