1998-10-19 17:48:55 +00:00
|
|
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
|
|
|
|
/*
|
1999-11-06 03:43:54 +00:00
|
|
|
* The contents of this file are subject to the Netscape Public
|
|
|
|
* License Version 1.1 (the "License"); you may not use this file
|
|
|
|
* except in compliance with the License. You may obtain a copy of
|
|
|
|
* the License at http://www.mozilla.org/NPL/
|
1998-10-19 17:48:55 +00:00
|
|
|
*
|
1999-11-06 03:43:54 +00:00
|
|
|
* Software distributed under the License is distributed on an "AS
|
|
|
|
* IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or
|
|
|
|
* implied. See the License for the specific language governing
|
|
|
|
* rights and limitations under the License.
|
1998-10-19 17:48:55 +00:00
|
|
|
*
|
1999-11-06 03:43:54 +00:00
|
|
|
* The Original Code is mozilla.org code.
|
|
|
|
*
|
|
|
|
* The Initial Developer of the Original Code is Netscape
|
1998-10-19 17:48:55 +00:00
|
|
|
* Communications Corporation. Portions created by Netscape are
|
1999-11-06 03:43:54 +00:00
|
|
|
* Copyright (C) 1998 Netscape Communications Corporation. All
|
|
|
|
* Rights Reserved.
|
|
|
|
*
|
|
|
|
* Contributor(s):
|
1998-10-19 17:48:55 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef nsVector_h__
|
|
|
|
#define nsVector_h__
|
|
|
|
|
|
|
|
#include "plvector.h"
|
|
|
|
#include "nsCom.h"
|
|
|
|
|
|
|
|
class nsVector : public PLVector {
|
|
|
|
public:
|
|
|
|
// Construction
|
|
|
|
nsVector(PRUint32 initialSize = 0, PRInt32 initialGrowBy = 0) {
|
|
|
|
PL_VectorInitialize(this, initialSize, initialGrowBy);
|
|
|
|
}
|
|
|
|
~nsVector(void) { PL_VectorFinalize(this); }
|
|
|
|
|
|
|
|
// Attributes
|
|
|
|
PRUint32 GetSize(void) const { return PL_VectorGetSize(this); }
|
|
|
|
PRUint32 GetUpperBound(void) const { return GetSize() - 1; }
|
|
|
|
PRBool SetSize(PRUint32 nNewSize, PRInt32 nGrowBy = PL_VECTOR_GROW_DEFAULT) {
|
|
|
|
return PL_VectorSetSize(this, nNewSize, nGrowBy);
|
|
|
|
}
|
1999-06-10 20:18:17 +00:00
|
|
|
PRBool IsValidIndex(PRUint32 indx) { return PL_VectorIsValidIndex(this, indx); }
|
1998-10-19 17:48:55 +00:00
|
|
|
|
|
|
|
// Operations
|
|
|
|
// Clean up
|
|
|
|
void Compact(void) { PL_VectorCompact(this); }
|
|
|
|
void RemoveAll(void) { SetSize(0); }
|
|
|
|
void Copy(nsVector* src, PRUint32 len, PRUint32 dstPos = 0, PRUint32 srcPos = 0) {
|
|
|
|
PL_VectorCopy(this, dstPos, src, srcPos, len);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Accessing elements
|
1999-06-10 20:18:17 +00:00
|
|
|
void* Get(PRUint32 indx) const { return PL_VectorGet(this, indx); }
|
|
|
|
void Set(PRUint32 indx, void* newElement) { PL_VectorSet(this, indx, newElement); }
|
|
|
|
void*& ElementAt(PRUint32 indx) { return *PL_VectorGetAddr(this, indx); }
|
1998-10-19 17:48:55 +00:00
|
|
|
|
|
|
|
// Potentially growing the array
|
|
|
|
PRInt32 Add(void* newElement) { return PL_VectorAdd(this, newElement); }
|
|
|
|
|
|
|
|
// overloaded operator helpers
|
1999-06-10 20:18:17 +00:00
|
|
|
void* operator[](PRUint32 indx) const { return Get(indx); }
|
|
|
|
void*& operator[](PRUint32 indx) { return ElementAt(indx); }
|
1998-10-19 17:48:55 +00:00
|
|
|
|
|
|
|
// Operations that move elements around
|
1999-06-10 20:18:17 +00:00
|
|
|
void Insert(PRUint32 indx, void* newElement, PRInt32 count = 1) {
|
|
|
|
PL_VectorInsert(this, indx, newElement, count);
|
1998-10-19 17:48:55 +00:00
|
|
|
}
|
1999-06-10 20:18:17 +00:00
|
|
|
void Remove(PRUint32 indx, PRInt32 count = 1) {
|
|
|
|
PL_VectorRemove(this, indx, count);
|
1998-10-19 17:48:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef DEBUG
|
|
|
|
void AssertValid(void) const { PL_VectorAssertValid((PLVector*)this); }
|
|
|
|
#endif
|
|
|
|
};
|
|
|
|
|
|
|
|
#endif
|