Lines Matching defs:cur
35 auto cur = new Node();
36 idle_ = cur;
39 Node *cur = idle_;
44 cur->next = busy_;
46 cur->prev = busy_->prev;
47 busy_->prev = cur;
49 busy_ = cur;
50 return cur->data;
56 Node *cur = idle_;
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;
75 cur = cur->next;
85 Node *cur = busy_;
86 while (cur != nullptr && cur->data != data) {
87 cur = cur->next;
89 if (cur == nullptr) {
92 if (cur == busy_) {
95 if (cur->next != nullptr) {
96 cur->next->prev = cur->prev;
98 if (cur->prev != nullptr) {
99 cur->prev->next = cur->next;
101 cur->prev = nullptr;
102 cur->next = idle_;
104 idle_->prev = cur;
106 idle_ = cur;