b0VIM 7.0}ñ`D‰wûBmdeligonullcc94.languagecomputer.com~mdeligonul/ezbounce-1.04b/lib/linkedlist.hutf-8 3210#"! Utpÿ‚adºÖ‚ÿüåâÁ½p#Ö‰<ï ¢ T S < % $  ú ù æ ä  · ¦   ‹ v a I H  ÿ ì Ù Ø Ð ¹ • v W B *  û ú »  ~ Y T S A ? 6  î ä Ì ¹ ´ ¬ | öæäÍʶ³±}ga+ÛÕÒÍ‘‡OÑ“‹XRJÁ:ýü»{xwvZY#"𴲦”}wd=0 ôîàÞÝÖÒ####endif} return 1; } l->remove (0); delete (T *) l->first(); else delete[] (T *) l->first(); if (array) { while (l->first()) return 1; if (!l){template int destroy_list(list * l, bool array) * delete every element, and destroy it too *//*int strlist_remove(strlist * list, const char * str);typedef list strlist;}; T * last(void) { return (T *) __list_core::last(); } T * first(void) { return (T *) __list_core::first(); } bool remove(T * d) { return __list_core::remove(d); } T * remove(int idx) { return (T *) __list_core::remove(idx); } T * get(int idx) { return (T *) __list_core::get(idx); } int add(int w, T * x) { return __list_core::add(w, (void *) x); } int add(T *x) { return __list_core::add((void *) x); }public:{ template class list : public __list_core }; T * set(int x) { return (T *) __list_iter::set(x); } T * remove() { return (T *) __list_iter::remove(); } T * next() { return (T *) __list_iter::next(); } list_iterator(__list_core * x) : __list_iter(x) { }public:{template class list_iterator : public __list_iter }; } return (n) ? current->data : 0; current = n; if (n) __list_core::node * n = list->find_by_idx(i); { void * set(int i) /* Set current pointer to ith item (0-based) */ } return (current); { bool has_next() const void * next(); void * remove(); void attach(__list_core * l) { list = l; mod_count = l->mod_count; last_returned = 0; current = l->_first; } __list_iter(__list_core * l) { attach(l); }public: int mod_count; __list_core * list; * last_returned; __list_core::node * current,private:{class __list_iter}; int size() { return num_nodes; } void * last(void) { return (_last) ? _last->data : 0; } void * first(void) { return (_first) ? _first->data : 0; } void clear(); bool remove(void *); void * remove(int); void * get(int); int add(int, void * data); int add(void * data); ~__list_core(void) { clear(); } __list_core(void);public: int mod_count; int num_nodes; void * remove(node *); node * find_by_idx(int, int * = 0) const; } *_first, * _last; node * prev; node * next; void * data; { struct node protected: friend class __list_iter; {class __list_core #include "debug.h"#include "autoconf.h"#define __LINKEDLIST_H#ifndef __LINKEDLIST_H ***************************************************************************/ * * * (at your option) any later version. * * the Free Software Foundation; either version 2 of the License, or * * it under the terms of the GNU General Public License as published by * * This program is free software; you can redistribute it and/or modify * * * *************************************************************************** * * (C) 1998-2002 Murat Deligonul * * Doubly-linked list./*