X-Git-Url: https://git.saurik.com/cycript.git/blobdiff_plain/da2af935087da0e425bbfb06fe1cc24107e3f32d..b23692f3038296c94d25c84c55ed4c1bb49619cf:/List.hpp?ds=sidebyside diff --git a/List.hpp b/List.hpp index 7113492..4caa536 100644 --- a/List.hpp +++ b/List.hpp @@ -1,21 +1,21 @@ /* Cycript - Optimizing JavaScript Compiler/Runtime - * Copyright (C) 2009-2010 Jay Freeman (saurik) + * Copyright (C) 2009-2015 Jay Freeman (saurik) */ -/* GNU Lesser General Public License, Version 3 {{{ */ +/* GNU Affero General Public License, Version 3 {{{ */ /* - * Cycript is free software: you can redistribute it and/or modify it under - * the terms of the GNU Lesser General Public License as published by the - * Free Software Foundation, either version 3 of the License, or (at your - * option) any later version. - * - * Cycript is distributed in the hope that it will be useful, but WITHOUT - * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or - * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public - * License for more details. - * - * You should have received a copy of the GNU Lesser General Public License - * along with Cycript. If not, see . + * This program is free software: you can redistribute it and/or modify + * it under the terms of the GNU Affero General Public License as published by + * the Free Software Foundation, either version 3 of the License, or + * (at your option) any later version. + + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU Affero General Public License for more details. + + * You should have received a copy of the GNU Affero General Public License + * along with this program. If not, see . **/ /* }}} */ @@ -42,17 +42,71 @@ struct CYNext { }; template -void CYSetLast(Type_ *&list, Type_ *item) { +Type_ *&CYSetLast(Type_ *&list) { if (list == NULL) - list = item; - else { - Type_ *next(list); - while (next->next_ != NULL) - next = next->next_; - next->next_ = item; - } + return list; + + Type_ *next(list); + while (next->next_ != NULL) + next = next->next_; + return next->next_; +} + +template +Type_ *&CYGetLast(Type_ *&list) { + if (list == NULL) + return list; + + Type_ **next(&list); + while ((*next)->next_ != NULL) + next = &(*next)->next_; + return *next; } +template +struct CYList { + Type_ *first_; + Type_ *last_; + + CYList(Type_ *first = NULL) : + first_(first), + last_(CYGetLast(first)) + { + } + + operator Type_ *() const { + return first_; + } + + Type_ *operator ->() const { + return first_; + } + + CYList &operator ->*(Type_ *next) { + if (next != NULL) + if (first_ == NULL) { + first_ = next; + last_ = next; + } else for (;; last_ = last_->next_) + if (last_->next_ == NULL) { + last_->next_ = next; + last_ = next; + break; + } + return *this; + } + + CYList &operator ->*(CYList &next) { + if (*this == NULL) + *this = next; + else if (next != NULL) { + last_->next_ = next.first_; + last_ = next.last_; + } + return *this; + } +}; + #define CYForEach(value, list) \ for (__typeof__(*list) *value(list); value != NULL; value = value->next_)