Enter your search terms GNU-Darwin Web Submit search form

csvector.h /* Crystal Space utility library: vector class interface Copyright (C) 1998,1999,2000 by Andrew Zabolotny <bit@eltech.ru> 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef __CSVECTOR_H__ #define __CSVECTOR_H__ #include "cstypes.h" class csBasicVector { protected: int count,limit,threshold; csSome *root; public: csBasicVector (int ilimit = 0, int ithreshold = 0); virtual ~csBasicVector(); inline csSome& operator [] (int n); inline csSome& operator [] (int n) const; inline csSome& Get (int n) const; void SetLength (int n); inline int Length () const; inline int Limit () const; bool Delete (int n); bool Delete (csSome Item); inline void Exchange (int n1, int n2); int Find (csSome which) const; inline int Push (csSome what); inline int PushSmart (csSome what); inline csSome Pop (); inline csSome Top () const; bool Insert (int n, csSome Item); }; class csVector : public csBasicVector { public: csVector (int ilimit = 8, int ithreshold = 16) : csBasicVector(ilimit, ithreshold) {} virtual ~csVector () {} int FindKey (csConstSome Key, int Mode = 0) const; int FindSortedKey (csConstSome Key, int Mode = 0) const; void QuickSort (int Left, int Right, int Mode = 0); void QuickSort (int Mode = 0); bool Delete (int n, bool FreeIt = true); bool Delete (csSome Item, bool FreeIt = true); bool Replace (int n, csSome what, bool FreePrevious = true); void DeleteAll (bool FreeThem = true); int InsertSorted (csSome Item, int *oEqual = NULL, int Mode = 0); virtual bool FreeItem (csSome Item); virtual int Compare (csSome Item1, csSome Item2, int Mode) const; virtual int CompareKey (csSome Item, csConstSome Key, int Mode) const; }; inline csSome& csBasicVector::operator [] (int n) { CS_ASSERT (n >= 0); if (n >= count) SetLength (n + 1); return (root [n]); } inline csSome& csBasicVector::operator [] (int n) const { CS_ASSERT (n >= 0); CS_ASSERT (n < count); return (root [n]); } inline csSome& csBasicVector::Get (int n) const { CS_ASSERT (n >= 0); CS_ASSERT (n < count); return (root [n]); } inline int csBasicVector::Limit () const { return (limit); } inline int csBasicVector::Length () const { return (count); } inline bool csBasicVector::Delete (csSome Item) { int n = Find (Item); if (n == -1) return false; else return Delete (n); } inline int csBasicVector::Push (csSome what) { SetLength (count + 1); root [count - 1] = what; return (count - 1); } inline int csBasicVector::PushSmart (csSome what) { int n = Find (what); return (n == -1) ? Push (what) : n; } inline csSome csBasicVector::Pop () { csSome ret = root [count - 1]; SetLength (count - 1); return (ret); } inline csSome csBasicVector::Top () const { return root [count - 1]; } inline void csBasicVector::Exchange (int n1, int n2) { csSome tmp = root [n1]; root [n1] = root [n2]; root [n2] = tmp; } inline bool csVector::Delete (csSome Item, bool FreeIt) { int n = Find (Item); if (n == -1) return false; else return Delete (n, FreeIt); } inline void csVector::QuickSort (int Mode) { if (count > 0) QuickSort (0, count - 1, Mode); } #endif // __CSVECTOR_H__ Generated for Crystal Space by doxygen 1.2.5 written by Dimitri van Heesch, ©1997-2000