/*
 * Copyright 2000 Sun Microsystems, Inc.  All Rights Reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.
 *
 * This 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.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
 * CA 95054 USA or visit www.sun.com if you need additional information or
 * have any questions.
 *
 */

#ifndef _BASIC_LIST_
#define _BASIC_LIST_

#include <vector>

template<class T>
class BasicList {
protected:
  typedef std::vector<T> InternalListType;
  InternalListType internalList;

public:
  BasicList() {
  }
  virtual ~BasicList() {
  }

  void add(T arg) {
    internalList.push_back(arg);
  }

  bool remove(T arg) {
    for (InternalListType::iterator iter = internalList.begin();
         iter != internalList.end(); iter++) {
      if (*iter == arg) {
        internalList.erase(iter);
        return true;
      }
    }
    return false;
  }

  int size() {
    return internalList.size();
  }

  T get(int index) {
    return internalList[index];
  }
};

#endif  // #defined _BASIC_LIST_