mirror of
https://github.com/mozilla/gecko-dev.git
synced 2024-11-04 16:15:25 +00:00
88 lines
3.0 KiB
Plaintext
88 lines
3.0 KiB
Plaintext
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*-
|
|
*
|
|
* The contents of this file are subject to the Netscape Public License
|
|
* Version 1.0 (the "NPL"); you may not use this file except in
|
|
* compliance with the NPL. You may obtain a copy of the NPL at
|
|
* http://www.mozilla.org/NPL/
|
|
*
|
|
* Software distributed under the NPL is distributed on an "AS IS" basis,
|
|
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
|
|
* for the specific language governing rights and limitations under the
|
|
* NPL.
|
|
*
|
|
* The Initial Developer of this code under the NPL is Netscape
|
|
* Communications Corporation. Portions created by Netscape are
|
|
* Copyright (C) 1998 Netscape Communications Corporation. All Rights
|
|
* Reserved.
|
|
*/
|
|
|
|
#include "nsISupports.idl"
|
|
|
|
[scriptable, uuid(D1899240-F9D2-11D2-BDD6-000064657374)]
|
|
interface nsISimpleEnumerator : nsISupports {
|
|
boolean HasMoreElements();
|
|
nsISupports GetNext();
|
|
};
|
|
|
|
[uuid(ad385286-cbc4-11d2-8cca-0060b0fc14a3)]
|
|
interface nsIEnumerator : nsISupports {
|
|
|
|
/** First will reset the list. will return NS_FAILED if no items
|
|
*/
|
|
void First();
|
|
|
|
/** Next will advance the list. will return failed if already at end
|
|
*/
|
|
void Next();
|
|
|
|
/** CurrentItem will return the CurrentItem item it will fail if the
|
|
* list is empty
|
|
*/
|
|
nsISupports CurrentItem();
|
|
|
|
/** return if the collection is at the end. that is the beginning following
|
|
* a call to Prev and it is the end of the list following a call to next
|
|
*/
|
|
void IsDone();
|
|
};
|
|
|
|
[uuid(75f158a0-cadd-11d2-8cca-0060b0fc14a3)]
|
|
interface nsIBidirectionalEnumerator : nsIEnumerator {
|
|
|
|
/** Last will reset the list to the end. will return NS_FAILED if no items
|
|
*/
|
|
void Last();
|
|
|
|
/** Prev will decrement the list. will return failed if already at beginning
|
|
*/
|
|
void Prev();
|
|
};
|
|
|
|
%{C++
|
|
extern "C" NS_COM nsresult
|
|
NS_NewEmptyEnumerator(nsISimpleEnumerator** aResult);
|
|
|
|
// Construct and return an implementation of a "conjoining enumerator." This
|
|
// enumerator lets you string together two other enumerators into one sequence.
|
|
// The result is an nsIBidirectionalEnumerator, but if either input is not
|
|
// also bidirectional, the Last and Prev operations will fail.
|
|
extern "C" NS_COM nsresult
|
|
NS_NewConjoiningEnumerator(nsIEnumerator* first, nsIEnumerator* second,
|
|
nsIBidirectionalEnumerator* *aInstancePtrResult);
|
|
|
|
// Construct and return an implementation of a "union enumerator." This
|
|
// enumerator will only return elements that are found in both constituent
|
|
// enumerators.
|
|
extern "C" NS_COM nsresult
|
|
NS_NewUnionEnumerator(nsIEnumerator* first, nsIEnumerator* second,
|
|
nsIEnumerator* *aInstancePtrResult);
|
|
|
|
// Construct and return an implementation of an "intersection enumerator." This
|
|
// enumerator will return elements that are found in either constituent
|
|
// enumerators, eliminating duplicates.
|
|
extern "C" NS_COM nsresult
|
|
NS_NewIntersectionEnumerator(nsIEnumerator* first, nsIEnumerator* second,
|
|
nsIEnumerator* *aInstancePtrResult);
|
|
|
|
%}
|