1999-02-23 11:04:28 +03:00
|
|
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
2001-09-29 00:14:13 +04:00
|
|
|
/* ***** BEGIN LICENSE BLOCK *****
|
|
|
|
* Version: NPL 1.1/GPL 2.0/LGPL 2.1
|
1999-02-23 11:04:28 +03:00
|
|
|
*
|
2001-09-29 00:14:13 +04: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/
|
|
|
|
*
|
|
|
|
* 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.
|
1999-02-23 11:04:28 +03:00
|
|
|
*
|
1999-11-06 06:43:54 +03:00
|
|
|
* The Original Code is mozilla.org code.
|
|
|
|
*
|
2001-09-29 00:14:13 +04:00
|
|
|
* The Initial Developer of the Original Code is
|
|
|
|
* Netscape Communications Corporation.
|
|
|
|
* Portions created by the Initial Developer are Copyright (C) 1998
|
|
|
|
* the Initial Developer. All Rights Reserved.
|
|
|
|
*
|
|
|
|
* Contributor(s):
|
|
|
|
*
|
|
|
|
* Alternatively, the contents of this file may be used under the terms of
|
|
|
|
* either the GNU General Public License Version 2 or later (the "GPL"), or
|
|
|
|
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
|
|
|
|
* in which case the provisions of the GPL or the LGPL are applicable instead
|
|
|
|
* of those above. If you wish to allow use of your version of this file only
|
|
|
|
* under the terms of either the GPL or the LGPL, and not to allow others to
|
|
|
|
* use your version of this file under the terms of the NPL, indicate your
|
|
|
|
* decision by deleting the provisions above and replace them with the notice
|
|
|
|
* and other provisions required by the GPL or the LGPL. If you do not delete
|
|
|
|
* the provisions above, a recipient may use your version of this file under
|
|
|
|
* the terms of any one of the NPL, the GPL or the LGPL.
|
1999-11-06 06:43:54 +03:00
|
|
|
*
|
2001-09-29 00:14:13 +04:00
|
|
|
* ***** END LICENSE BLOCK ***** */
|
1999-02-23 11:04:28 +03:00
|
|
|
|
|
|
|
#include "nsSupportsArrayEnumerator.h"
|
|
|
|
#include "nsISupportsArray.h"
|
|
|
|
|
|
|
|
nsSupportsArrayEnumerator::nsSupportsArrayEnumerator(nsISupportsArray* array)
|
|
|
|
: mArray(array), mCursor(0)
|
|
|
|
{
|
|
|
|
NS_ASSERTION(array, "null array");
|
|
|
|
NS_ADDREF(mArray);
|
|
|
|
}
|
|
|
|
|
|
|
|
nsSupportsArrayEnumerator::~nsSupportsArrayEnumerator()
|
|
|
|
{
|
|
|
|
NS_RELEASE(mArray);
|
|
|
|
}
|
|
|
|
|
1999-08-23 14:14:16 +04:00
|
|
|
NS_IMPL_ISUPPORTS2(nsSupportsArrayEnumerator, nsIBidirectionalEnumerator, nsIEnumerator)
|
1999-02-23 11:04:28 +03:00
|
|
|
|
|
|
|
NS_IMETHODIMP
|
|
|
|
nsSupportsArrayEnumerator::First()
|
|
|
|
{
|
|
|
|
mCursor = 0;
|
1999-05-13 08:56:04 +04:00
|
|
|
PRUint32 cnt;
|
|
|
|
nsresult rv = mArray->Count(&cnt);
|
|
|
|
if (NS_FAILED(rv)) return rv;
|
|
|
|
PRInt32 end = (PRInt32)cnt;
|
1999-03-05 08:48:21 +03:00
|
|
|
if (mCursor < end)
|
|
|
|
return NS_OK;
|
|
|
|
else
|
|
|
|
return NS_ERROR_FAILURE;
|
1999-02-23 11:04:28 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
NS_IMETHODIMP
|
|
|
|
nsSupportsArrayEnumerator::Next()
|
|
|
|
{
|
1999-05-13 08:56:04 +04:00
|
|
|
PRUint32 cnt;
|
|
|
|
nsresult rv = mArray->Count(&cnt);
|
|
|
|
if (NS_FAILED(rv)) return rv;
|
|
|
|
PRInt32 end = (PRInt32)cnt;
|
1999-02-23 11:04:28 +03:00
|
|
|
if (mCursor < end) // don't count upward forever
|
|
|
|
mCursor++;
|
|
|
|
if (mCursor < end)
|
|
|
|
return NS_OK;
|
|
|
|
else
|
|
|
|
return NS_ERROR_FAILURE;
|
|
|
|
}
|
|
|
|
|
|
|
|
NS_IMETHODIMP
|
|
|
|
nsSupportsArrayEnumerator::CurrentItem(nsISupports **aItem)
|
|
|
|
{
|
|
|
|
NS_ASSERTION(aItem, "null out parameter");
|
1999-05-13 08:56:04 +04:00
|
|
|
PRUint32 cnt;
|
|
|
|
nsresult rv = mArray->Count(&cnt);
|
|
|
|
if (NS_FAILED(rv)) return rv;
|
|
|
|
if (mCursor >= 0 && mCursor < (PRInt32)cnt) {
|
1999-06-02 04:14:41 +04:00
|
|
|
*aItem = mArray->ElementAt(mCursor);
|
1999-02-23 11:04:28 +03:00
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
return NS_ERROR_FAILURE;
|
|
|
|
}
|
|
|
|
|
|
|
|
NS_IMETHODIMP
|
|
|
|
nsSupportsArrayEnumerator::IsDone()
|
|
|
|
{
|
1999-05-13 08:56:04 +04:00
|
|
|
PRUint32 cnt;
|
|
|
|
nsresult rv = mArray->Count(&cnt);
|
|
|
|
if (NS_FAILED(rv)) return rv;
|
|
|
|
return (mCursor >= 0 && mCursor < (PRInt32)cnt)
|
1999-10-28 07:16:48 +04:00
|
|
|
? NS_ENUMERATOR_FALSE : NS_OK;
|
1999-02-23 11:04:28 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
|
|
|
|
NS_IMETHODIMP
|
|
|
|
nsSupportsArrayEnumerator::Last()
|
|
|
|
{
|
1999-05-13 08:56:04 +04:00
|
|
|
PRUint32 cnt;
|
|
|
|
nsresult rv = mArray->Count(&cnt);
|
|
|
|
if (NS_FAILED(rv)) return rv;
|
|
|
|
mCursor = cnt - 1;
|
1999-02-23 11:04:28 +03:00
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
NS_IMETHODIMP
|
|
|
|
nsSupportsArrayEnumerator::Prev()
|
|
|
|
{
|
|
|
|
if (mCursor >= 0)
|
|
|
|
--mCursor;
|
|
|
|
if (mCursor >= 0)
|
|
|
|
return NS_OK;
|
|
|
|
else
|
|
|
|
return NS_ERROR_FAILURE;
|
|
|
|
}
|
|
|
|
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
|
|
|
|
NS_COM nsresult
|
|
|
|
NS_NewISupportsArrayEnumerator(nsISupportsArray* array,
|
|
|
|
nsIBidirectionalEnumerator* *aInstancePtrResult)
|
|
|
|
{
|
|
|
|
if (aInstancePtrResult == 0)
|
|
|
|
return NS_ERROR_NULL_POINTER;
|
|
|
|
nsSupportsArrayEnumerator* e = new nsSupportsArrayEnumerator(array);
|
|
|
|
if (e == 0)
|
|
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
|
|
NS_ADDREF(e);
|
|
|
|
*aInstancePtrResult = e;
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
|