Accidentaly copied here

git-svn-id: file:///fltk/svn/fltk/branches/branch-1.3@8219 ea41ed52-d2ee-0310-a9c1-e6b18d33e121

1 files changed, 0 insertions, 157 deletions

diff --git a/branch-3.0-2011/src/Fl_Tree_Item_Array.cxx b/branch-3.0-2011/src/Fl_Tree_Item_Array.cxx
deleted file mode 100644
index 6353e9a6a..000000000
--- a/branch-3.0-2011/src/Fl_Tree_Item_Array.cxx
+++ /dev/null
@@ -1,157 +0,0 @@
-//
-// "$Id$"
-//
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#include <FL/Fl_Tree_Item_Array.H>
-#include <FL/Fl_Tree_Item.H>
-
-//////////////////////
-// Fl_Tree_Item_Array.cxx
-//////////////////////
-//
-// Fl_Tree -- This file is part of the Fl_Tree widget for FLTK
-// Copyright (C) 2009-2010 by Greg Ercolano.
-//
-// This library is free software; you can redistribute it and/or
-// modify it under the terms of the GNU Library General Public
-// License as published by the Free Software Foundation; either
-// version 2 of the License, or (at your option) any later version.
-//
-// This library 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
-// Library General Public License for more details.
-//
-// You should have received a copy of the GNU Library General Public
-// License along with this library; if not, write to the Free Software
-// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
-// USA.
-//
-
-/// Constructor; creates an empty array.
-///
-///     The optional 'chunksize' can be specified to optimize
-///     memory allocation for potentially large arrays. Default chunksize is 10.
-/// 
-Fl_Tree_Item_Array::Fl_Tree_Item_Array(int new_chunksize) {
-  _items     = 0;
-  _total     = 0;
-  _size      = 0;
-  _chunksize = new_chunksize;
-}
-
-/// Destructor. Calls each item's destructor, destroys internal _items array.
-Fl_Tree_Item_Array::~Fl_Tree_Item_Array() {
-  clear();
-}
-
-/// Copy constructor. Makes new copy of array, with new instances of each item.
-Fl_Tree_Item_Array::Fl_Tree_Item_Array(const Fl_Tree_Item_Array* o) {
-  _items = (Fl_Tree_Item**)malloc(o->_size * sizeof(Fl_Tree_Item*));
-  _total     = o->_total;
-  _size      = o->_size;
-  _chunksize = o->_chunksize;
-  for ( int t=0; t<o->_total; t++ ) {
-    _items[t] = new Fl_Tree_Item(o->_items[t]);
-  }
-}
-
-/// Clear the entire array.
-///
-///     Each item will be deleted (destructors will be called),
-///     and the array will be cleared. total() will return 0.
-///
-void Fl_Tree_Item_Array::clear() {
-  if ( _items ) {
-    for ( int t=0; t<_total; t++ ) {
-      delete _items[t];
-      _items[t] = 0;
-    }
-    free((void*)_items); _items = 0;
-  }
-  _total = _size = 0;
-}
-
-// Internal: Enlarge the items array.
-//
-//    Adjusts size/items memory allocation as needed.
-//    Does NOT change total.
-//
-void Fl_Tree_Item_Array::enlarge(int count) {
-  int newtotal = _total + count;	// new total
-  if ( newtotal >= _size ) {		// more than we have allocated?
-    // Increase size of array
-    int newsize = _size + _chunksize;
-    Fl_Tree_Item **newitems = (Fl_Tree_Item**)malloc(newsize * sizeof(Fl_Tree_Item*));
-    if ( _items ) { 
-      // Copy old array -> new, delete old
-      memmove(newitems, _items, _size * sizeof(Fl_Tree_Item*));
-      free((void*)_items); _items = 0;
-    }
-    // Adjust items/sizeitems
-    _items = newitems;
-    _size = newsize;
-  }
-}
-
-/// Insert an item at index position \p pos.
-///
-///     Handles enlarging array if needed, total increased by 1.
-///     If \p pos == total(), an empty item is appended to the array.
-///
-void Fl_Tree_Item_Array::insert(int pos, Fl_Tree_Item *new_item) {
-  enlarge(1);
-  // printf("*** POS=%d TOTAL-1=%d NITEMS=%d\n", pos, _total-1, (_total-pos));
-  if ( pos <= (_total - 1) ) {	// need to move memory around?
-    int nitems = _total - pos;
-    memmove(&_items[pos+1], &_items[pos], sizeof(Fl_Tree_Item*) * nitems);
-  } 
-  _items[pos] = new_item;
-  _total++;
-}
-
-/// Add an item* to the end of the array.
-///
-///     Assumes the item was created with 'new', and will remain
-///     allocated.. Fl_Tree_Item_Array will handle calling the
-///     item's destructor when the array is cleared or the item remove()'ed.
-///
-void Fl_Tree_Item_Array::add(Fl_Tree_Item *val) {
-  insert(_total, val);
-}
-
-/// Remove the item at \param[in] index from the array.
-///
-///     The item will be delete'd (if non-NULL), so its destructor will be called.
-///
-void Fl_Tree_Item_Array::remove(int index) {
-  if ( _items[index] ) {		// delete if non-zero
-    delete _items[index];
-  }
-  _items[index] = 0;
-  for ( _total--; index<_total; index++ ) {
-    _items[index] = _items[index+1];
-  }
-}
-
-/// Remove the item from the array.
-///
-///     \returns 0 if removed, or -1 if the item was not in the array.
-///
-int Fl_Tree_Item_Array::remove(Fl_Tree_Item *item) {
-  for ( int t=0; t<_total; t++ ) {
-    if ( item == _items[t] ) {
-      remove(t);
-      return(0);
-    }
-  }
-  return(-1);
-}
-
-//
-// End of "$Id$".
-//