mirror of
https://gitlab.winehq.org/wine/wine-gecko.git
synced 2024-09-13 09:24:08 -07:00
160 lines
5.2 KiB
C
160 lines
5.2 KiB
C
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
|
||
|
/* ***** BEGIN LICENSE BLOCK *****
|
||
|
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
||
|
*
|
||
|
* The contents of this file are subject to the Mozilla 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/MPL/
|
||
|
*
|
||
|
* 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.
|
||
|
*
|
||
|
* The Original Code is mozilla.org code.
|
||
|
*
|
||
|
* The Initial Developer of the Original Code is Neil Deakin
|
||
|
* Portions created by the Initial Developer are Copyright (C) 2005
|
||
|
* the Initial Developer. All Rights Reserved.
|
||
|
*
|
||
|
* Contributor(s):
|
||
|
*
|
||
|
* Alternatively, the contents of this file may be used under the terms of
|
||
|
* either of 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 MPL, 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 MPL, the GPL or the LGPL.
|
||
|
*
|
||
|
* ***** END LICENSE BLOCK ***** */
|
||
|
|
||
|
#ifndef nsRDFQuery_h__
|
||
|
#define nsRDFQuery_h__
|
||
|
|
||
|
#include "nsAutoPtr.h"
|
||
|
#include "nsISimpleEnumerator.h"
|
||
|
#include "nsCycleCollectionParticipant.h"
|
||
|
|
||
|
#define NS_ITEMPLATERDFQUERY_IID \
|
||
|
{0x8929ff60, 0x1c9c, 0x4d87, \
|
||
|
{ 0xac, 0x02, 0x09, 0x14, 0x15, 0x3b, 0x48, 0xc4 }}
|
||
|
|
||
|
/**
|
||
|
* A compiled query in the RDF query processor. This interface should not be
|
||
|
* used directly outside of the RDF query processor.
|
||
|
*/
|
||
|
class nsITemplateRDFQuery : public nsISupports
|
||
|
{
|
||
|
public:
|
||
|
NS_DECLARE_STATIC_IID_ACCESSOR(NS_ITEMPLATERDFQUERY_IID)
|
||
|
|
||
|
// return the processor the query was created from
|
||
|
virtual nsXULTemplateQueryProcessorRDF* Processor() = 0; // not addrefed
|
||
|
|
||
|
// return the member variable for the query
|
||
|
virtual nsIAtom* GetMemberVariable() = 0; // not addrefed
|
||
|
|
||
|
// return the <query> node the query was compiled from
|
||
|
virtual void GetQueryNode(nsIDOMNode** aQueryNode) = 0;
|
||
|
|
||
|
// remove any results that are cached by the query
|
||
|
virtual void ClearCachedResults() = 0;
|
||
|
};
|
||
|
|
||
|
class nsRDFQuery : public nsITemplateRDFQuery
|
||
|
{
|
||
|
public:
|
||
|
|
||
|
nsRDFQuery(nsXULTemplateQueryProcessorRDF* aProcessor)
|
||
|
: mProcessor(aProcessor),
|
||
|
mSimple(PR_FALSE),
|
||
|
mRoot(nsnull),
|
||
|
mCachedResults(nsnull)
|
||
|
{ }
|
||
|
|
||
|
~nsRDFQuery() { Finish(); }
|
||
|
|
||
|
NS_DECL_CYCLE_COLLECTING_ISUPPORTS
|
||
|
NS_DECL_CYCLE_COLLECTION_CLASS(nsRDFQuery)
|
||
|
|
||
|
/**
|
||
|
* Retrieve the root node in the rule network
|
||
|
* @return the root node in the rule network
|
||
|
*/
|
||
|
TestNode* GetRoot() { return mRoot; };
|
||
|
|
||
|
void SetRoot(TestNode* aRoot) { mRoot = aRoot; };
|
||
|
|
||
|
void GetQueryNode(nsIDOMNode** aQueryNode)
|
||
|
{
|
||
|
*aQueryNode = mQueryNode;
|
||
|
NS_IF_ADDREF(*aQueryNode);
|
||
|
}
|
||
|
|
||
|
void SetQueryNode(nsIDOMNode* aQueryNode)
|
||
|
{
|
||
|
mQueryNode = aQueryNode;
|
||
|
}
|
||
|
|
||
|
// an optimization is used when several queries all use the simple query
|
||
|
// syntax. Since simple queries can only generate one possible set of
|
||
|
// results, they only need to be calculated once and reused for every
|
||
|
// simple query. The results may be cached in the query for this purpose.
|
||
|
// If successful, this method takes ownership of aInstantiations.
|
||
|
nsresult SetCachedResults(nsXULTemplateQueryProcessorRDF* aProcessor,
|
||
|
const InstantiationSet& aInstantiations);
|
||
|
|
||
|
// grab the cached results, if any, causing the caller to take ownership
|
||
|
// of them. This also has the effect of setting the cached results in this
|
||
|
// nsRDFQuery to null.
|
||
|
void UseCachedResults(nsISimpleEnumerator** aResults);
|
||
|
|
||
|
// clear the cached results
|
||
|
void ClearCachedResults()
|
||
|
{
|
||
|
mCachedResults = nsnull;
|
||
|
}
|
||
|
|
||
|
nsXULTemplateQueryProcessorRDF* Processor() { return mProcessor; }
|
||
|
|
||
|
nsIAtom* GetMemberVariable() { return mMemberVariable; }
|
||
|
|
||
|
PRBool IsSimple() { return mSimple; }
|
||
|
|
||
|
void SetSimple() { mSimple = PR_TRUE; }
|
||
|
|
||
|
// the reference and member variables for the query
|
||
|
nsCOMPtr<nsIAtom> mRefVariable;
|
||
|
nsCOMPtr<nsIAtom> mMemberVariable;
|
||
|
|
||
|
protected:
|
||
|
|
||
|
nsXULTemplateQueryProcessorRDF* mProcessor;
|
||
|
|
||
|
// true if the query is a simple rule (one with a default query)
|
||
|
PRBool mSimple;
|
||
|
|
||
|
/**
|
||
|
* The root node in the network for this query
|
||
|
*/
|
||
|
TestNode *mRoot;
|
||
|
|
||
|
// the <query> node
|
||
|
nsCOMPtr<nsIDOMNode> mQueryNode;
|
||
|
|
||
|
// used for simple rules since their results are all determined in one step
|
||
|
nsCOMPtr<nsISimpleEnumerator> mCachedResults;
|
||
|
|
||
|
void Finish();
|
||
|
};
|
||
|
|
||
|
NS_DEFINE_STATIC_IID_ACCESSOR(nsRDFQuery, NS_ITEMPLATERDFQUERY_IID)
|
||
|
|
||
|
#endif // nsRDFQuery_h__
|