35             auto cur = new Node();
36             idle_ = cur;
39         Node *cur = idle_;  variable
44         cur->next = busy_;
46             cur->prev = busy_->prev;
47             busy_->prev = cur;
49         busy_ = cur;
50         return cur->data;
56         Node *cur = idle_;  variable
60         while (cur != nullptr) {
61             if (cur->data == data) {
62                 if (cur->next != nullptr) {
63                     cur->next->prev = cur->prev;
65                 if (cur->prev != nullptr) {
66                     cur->prev->next = cur->next;
68                 if (idle_ == cur) {
69                     idle_ = cur->next;
72                 delete cur;  variable
75                 cur = cur->next;
85         Node *cur = busy_;  in Idle()  local
86         while (cur != nullptr && cur->data != data) {  in Idle()
87             cur = cur->next;  in Idle()
89         if (cur == nullptr) {  in Idle()
92         if (cur == busy_) {  in Idle()
95         if (cur->next != nullptr) {  in Idle()
96             cur->next->prev = cur->prev;  in Idle()
98         if (cur->prev != nullptr) {  in Idle()
99             cur->prev->next = cur->next;  in Idle()
101         cur->prev = nullptr;  in Idle()
102         cur->next = idle_;  in Idle()
104             idle_->prev = cur;  in Idle()
106         idle_ = cur;  in Idle()