From f4c20290509d7ed3a8fd5304577e7a4cc0b9d974 Mon Sep 17 00:00:00 2001
From: Mike Buland <eichlan@xagasoft.com>
Date: Tue, 3 Apr 2007 03:49:53 +0000
Subject: Ok, no code is left in src, it's all in src/old.  We'll gradually
 move code back into src as it's fixed and re-org'd.  This includes tests,
 which, I may write a unit test system into libbu++ just to make my life
 easier.

---
 src/arraylist.h | 80 ---------------------------------------------------------
 1 file changed, 80 deletions(-)
 delete mode 100644 src/arraylist.h

(limited to 'src/arraylist.h')

diff --git a/src/arraylist.h b/src/arraylist.h
deleted file mode 100644
index 0fda34a..0000000
--- a/src/arraylist.h
+++ /dev/null
@@ -1,80 +0,0 @@
-/** \file arraylist.h
- * Describes the ArrayList class.
- *@author Mike Buland
- */
-#ifndef ARRAY_LIST_H
-#define ARRAY_LIST_H
-
-#include "list.h"
-
-/** A simple list which uses an array.  This is a great choice if you won't do
-  * a lot of adding and deleting and need a fast random access list.  Otherwise
-  * use the LinkedList.
-  *@author Mike Buland
-  */
-class ArrayList : public List
-{
-public:
-	/** Creates an arraylist with some pre-defined specs spelled out.
-	  *@param initSize the inital number of elements to allocate.
-	  *@param growByFactor How much to increase the size of the array by
-	  * each time we run out of room.
-	  */
-	ArrayList( int initSize=100, int growByFactor=10 );
-	/**
-	 * Destroy the ArrayList
-	 */
-	virtual ~ArrayList();
-
-	void *getAt( int nIndex );
-	void append( void *pData );
-	void insertBefore( void *pData, int nPos = 0 );
-	int getSize(  );
-	bool isEmpty(  );
-	void deleteAt( int nIndex );
-	void empty();
-	void setSize( int nNewSize );
-	void setAt( int nIndex, void *pData );
-
-private:
-	/**
-	 * Checks to see if the system needs to be resized, if it does, this will
-	 * automatically resize based on your parameters.
-	 */
-	void checkResize();
-
-	/**
-	 * Resize the system to a specified size.  If it is larger, then all data
-	 * will be retained, if smaller the elements at the end will be cut off.
-	 *@param newSize The number of elements to include after resizing.
-	 */
-	void resizeTo( int newSize );
-
-	/**
-	 * Actual master array of pointers.  This is done to follow the List specs.
-	 * All data transactions are performed with pointers or compatable
-	 * primitive data-types.
-	 */
-	void **apData;
-
-	/**
-	 * The number of filled in elements in the array.  This is the practical
-	 * real size of the ArrayList for all userspace applications.
-	 */
-	int nSize;
-
-	/**
-	 * The number of elements allocated in memory.  Not all of these have to be
-	 * filled in, and it is usually larger than nSize so that adding and
-	 * deleting elements is fast and easy.
-	 */
-	int nCapacity;
-
-	/**
-	 * The amount to grow by whenever the array needs resizing.
-	 */
-	int nGrowByFactor;
-};
-
-#endif
-
-- 
cgit v1.2.3