summaryrefslogtreecommitdiffstats
path: root/branches/lydia/linklist.h
diff options
context:
space:
mode:
Diffstat (limited to 'branches/lydia/linklist.h')
-rw-r--r--branches/lydia/linklist.h110
1 files changed, 0 insertions, 110 deletions
diff --git a/branches/lydia/linklist.h b/branches/lydia/linklist.h
deleted file mode 100644
index db030e5..0000000
--- a/branches/lydia/linklist.h
+++ /dev/null
@@ -1,110 +0,0 @@
-/* C++ Linked list class, threadsafe (boolean is atom)
- *
- * (c) Copyright 2001 Denis Roio aka jaromil <jaromil@dyne.org>
- *
- * This source code is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Public License as published
- * by the Free Software Foundation; either version 2 of the License,
- * or (at your option) any later version.
- *
- * This source code 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.
- * Please refer to the GNU Public License for more details.
- *
- * You should have received a copy of the GNU Public License along with
- * this source code; if not, write to:
- * Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
- */
-
-#ifndef __linklist_h__
-#define __linklist_h__
-
-
-// uncomment to have mutex locked operations
-// can be slow on OSX and adds dependency to pthreads
-//#define THREADSAFE 1
-#ifdef THREADSAFE
-#include <pthread.h>
-#endif
-
-// maximum lenght of names
-#define MAX_ENTRY_NAME 512
-
-// maximum number of members returned by the completion
-#define MAX_COMPLETION 256
-
-class Entry;
-
-class Linklist {
- public:
- Linklist();
- virtual ~Linklist();
-
- Entry *begin() { return(first); };
- Entry *end() { return(last); };
- int len() { return(length); };
-
- void append(Entry *addr);
- void add(Entry *addr) { append(addr); }; /* lazy backward compatibility */
- void prepend(Entry *addr);
- void insert(Entry *addr, int pos);
- void insert_after(Entry *addr, Entry *pos);
- void rem(int pos);
- void sel(int pos);
- void clear();
- bool moveup(int pos);
- bool movedown(int pos);
- bool moveto(int num, int pos);
- Entry *pick(int pos);
- Entry *search(char *name);
- int *completion(char *needle);
-
- Entry *Linklist::selected();
-
- Entry *operator[](int pos) { return pick(pos); };
-
- /* don't touch these directly */
- Entry *first;
- Entry *last;
- int length;
-
-
-#ifdef THREADSAFE
- pthread_mutex_t mutex;
- void lock() { pthread_mutex_lock(&mutex); };
- void unlock() { pthread_mutex_unlock(&mutex); };
-#endif
-
- int compbuf[MAX_COMPLETION]; // maximum completion listsize allowed
-
-};
-
-class Entry {
- friend class Linklist;
-
- public:
- Entry();
- ~Entry();
-
- void set_name(char *nn);
-
- Entry *next;
- Entry *prev;
-
- Linklist *list;
-
- bool up();
- bool down();
- bool move(int pos);
- void rem();
- void sel(bool on);
-
- bool select;
-
- char name[MAX_ENTRY_NAME];
-
- void *data; ///< generic data pointer
-};
-
-#endif