Java Doc for MultiUnion.java in » RSS-RDF » Jena-2.5.5 » com » hp » hpl » jena » graph » compose » Java Source Code / Java DocumentationJava Source Code and Java Documentation

Java Source Code / Java Documentation

1.	6.0 JDK Core
2.	6.0 JDK Modules
3.	6.0 JDK Modules com.sun
4.	6.0 JDK Modules com.sun.java
5.	6.0 JDK Modules sun
6.	6.0 JDK Platform
7.	Ajax
8.	Apache Harmony Java SE
9.	Aspect oriented
10.	Authentication Authorization
11.	Blogger System
12.	Build
13.	Byte Code
14.	Cache
15.	Chart
16.	Chat
17.	Code Analyzer
18.	Collaboration
19.	Content Management System
20.	Database Client
21.	Database DBMS
22.	Database JDBC Connection Pool
23.	Database ORM
24.	Development
25.	EJB Server geronimo
26.	EJB Server GlassFish
27.	EJB Server JBoss 4.2.1
28.	EJB Server resin 3.1.5
29.	ERP CRM Financial
30.	ESB
31.	Forum
32.	GIS
33.	Graphic Library
34.	Groupware
35.	HTML Parser
36.	IDE
37.	IDE Eclipse
38.	IDE Netbeans
39.	Installer
40.	Internationalization Localization
41.	Inversion of Control
42.	Issue Tracking
43.	J2EE
44.	JBoss
45.	JMS
46.	JMX
47.	Library
48.	Mail Clients
49.	Net
50.	Parser
51.	PDF
52.	Portal
53.	Profiler
54.	Project Management
55.	Report
56.	RSS RDF
57.	Rule Engine
58.	Science
59.	Scripting
60.	Search Engine
61.	Security
62.	Sevlet Container
63.	Source Control
64.	Swing Library
65.	Template Engine
66.	Test Coverage
67.	Testing
68.	UML
69.	Web Crawler
70.	Web Framework
71.	Web Mail
72.	Web Server
73.	Web Services
74.	Web Services apache cxf 2.0.1
75.	Web Services AXIS2
76.	Wiki Engine
77.	Workflow Engines
78.	XML
79.	XML UI

Java

Java Tutorial

Illustrator Tutorials

GIMP Tutorials

C# / C Sharp

C# / CSharp Tutorial

C# / CSharp Open Source

SQL Server / T-SQL Tutorial

Oracle PL / SQL

Oracle PL/SQL Tutorial

Flash / Flex / ActionScript

VBA / Excel / Access / Word

XML

XML Tutorial

Microsoft Office PowerPoint 2007 Tutorial

Microsoft Office Excel 2007 Tutorial

Microsoft Office Word 2007 Tutorial

Java Source Code / Java Documentation » RSS RDF » Jena 2.5.5 » com.hp.hpl.jena.graph.compose

Source Cross Reference

Class Diagram

Java Document (Java Doc)

com.hp.hpl.jena.graph.compose .CompositionBase

com.hp.hpl.jena.graph.compose .Polyadic

com.hp.hpl.jena.graph.compose .MultiUnion

MultiUnion
public class MultiUnion extends Polyadic (Code)
	A graph implementation that presents the union of zero or more subgraphs, one of which is distinguished as the updateable graph. author: Ian Dickinson, HP Labs author: (email) version: CVS $Id: MultiUnion.java,v 1.28 2008/01/02 12:10:20 andy_seaborne Exp $

Inner Class :public static class MultiUnionStatisticsHandler implements GraphStatisticsHandler

Constructor Summary
public	MultiUnion() Construct a union of exactly no sub graphs.
public	MultiUnion(Graph[] graphs)
public	MultiUnion(Iterator graphs) Construct a union of all of the given graphs. Parameters: graphs - An iterator of the sub-graphs of this union.

Method Summary
public void	addGraph(Graph graph) Add the given graph to this union.
protected GraphStatisticsHandler	createStatisticsHandler()
public Reifier	getReifier() Unions share the reifiers of their base graphs.
public boolean	graphBaseContains(Triple t) Answer true if at least one of the graphs in this union contain the given triple.
public ExtendedIterator	graphBaseFind(TripleMatch t) Answer an iterator over the triples in the union of the graphs in this composition.
public void	performAdd(Triple t) Add the given triple to the union model; the actual component model to be updated will be the designated (or default) graph.
public void	performDelete(Triple t) Delete the given triple from the union model; the actual component model to be updated will be the designated (or default) graph.
public QueryHandler	queryHandler()

Constructor Detail

MultiUnion
public MultiUnion()(Code)
	Construct a union of exactly no sub graphs.

MultiUnion
public MultiUnion(Graph[] graphs)(Code)
	Construct a union of all of the given graphs Parameters: graphs - An array of the sub-graphs of this union

MultiUnion
public MultiUnion(Iterator graphs)(Code)
	Construct a union of all of the given graphs. Parameters: graphs - An iterator of the sub-graphs of this union. If graphs isa closable iterator, it will be automatically closed.

Method Detail

addGraph
public void addGraph(Graph graph)(Code)
	Add the given graph to this union. If it is already a member of the union, don't add it a second time. Parameters: graph - A sub-graph to add to this union

createStatisticsHandler
protected GraphStatisticsHandler createStatisticsHandler()(Code)

getReifier
public Reifier getReifier()(Code)
	Unions share the reifiers of their base graphs. THIS WILL CHANGE.

graphBaseContains
public boolean graphBaseContains(Triple t)(Code)
	Answer true if at least one of the graphs in this union contain the given triple. Parameters: t - A triple True if any of the graphs in the union contain t

graphBaseFind
public ExtendedIterator graphBaseFind(TripleMatch t)(Code)
	Answer an iterator over the triples in the union of the graphs in this composition. Note that the requirement to remove duplicates from the union means that this will be an expensive operation for large (and especially for persistent) graphs. Parameters: t - The matcher to match against An iterator of all triples matching t in the union of the graphs.

performAdd
public void performAdd(Triple t)(Code)
	Add the given triple to the union model; the actual component model to be updated will be the designated (or default) graph. Parameters: t - A triple to add to the union graph exception: JenaException - if the union does not contain any sub-graphs yet

performDelete
public void performDelete(Triple t)(Code)
	Delete the given triple from the union model; the actual component model to be updated will be the designated (or default) graph. Parameters: t - A triple to from the union graph exception: JenaException - if the union does not contain any sub-graphs yet

queryHandler
public QueryHandler queryHandler()(Code)

Fields inherited from com.hp.hpl.jena.graph.compose.Polyadic

protected Graph m_baseGraph(Code)(Java Doc)
protected List m_subGraphs(Code)(Java Doc)

Methods inherited from com.hp.hpl.jena.graph.compose.Polyadic

public void addGraph(Graph graph)(Code)(Java Doc)
public void close()(Code)(Java Doc)
public boolean dependsOn(Graph graph)(Code)(Java Doc)
public Graph getBaseGraph()(Code)(Java Doc)
public BulkUpdateHandler getBulkUpdateHandler()(Code)(Java Doc)
public Capabilities getCapabilities()(Code)(Java Doc)
public PrefixMapping getPrefixMapping()(Code)(Java Doc)
public Graph getRequiredBaseGraph()(Code)(Java Doc)
public List getSubGraphs()(Code)(Java Doc)
public TransactionHandler getTransactionHandler()(Code)(Java Doc)
public void removeGraph(Graph graph)(Code)(Java Doc)
public void setBaseGraph(Graph graph)(Code)(Java Doc)

Methods inherited from com.hp.hpl.jena.graph.compose.CompositionBase

public static ClosableIterator butNot(ClosableIterator a, ClosableIterator b)(Code)(Java Doc)
public static Filter ifIn(ClosableIterator i)(Code)(Java Doc)
public static Filter ifIn(Graph g)(Code)(Java Doc)
public static ExtendedIterator recording(ClosableIterator i, Set seen)(Code)(Java Doc)
public static Filter reject(ClosableIterator i)(Code)(Java Doc)
public static ExtendedIterator rejecting(ExtendedIterator i, Set seen)(Code)(Java Doc)
public static ExtendedIterator rejecting(ExtendedIterator i, Graph seen)(Code)(Java Doc)

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.