Uses of Class
com.bigdata.rdf.sail.webapp.VoID.IVCount

Packages that use VoID.IVCount

Package	Description
com.bigdata.rdf.sail.webapp

Uses of VoID.IVCount in com.bigdata.rdf.sail.webapp

Methods in com.bigdata.rdf.sail.webapp that return VoID.IVCount

Modifier and Type	Method and Description
protected static VoID.IVCount[]	VoID.classUsage(AbstractTripleStore kb) Return an efficient statistical summary for the class partitions.
protected static VoID.IVCount[]	VoID.classUsage(AbstractTripleStore kb, IV<?,?> civ, VoID.IVCount[] classPartitionCounts) Return the class partition statistics for the named graph.
protected static VoID.IVCount[]	VoID.predicateUsage(AbstractTripleStore kb) Return an array of the distinct predicates in the KB ordered by their descending frequency of use.
protected static VoID.IVCount[]	VoID.predicateUsage(AbstractTripleStore kb, IV<?,?> civ, VoID.IVCount[] predicatePartitionCounts) Return the predicate partition statistics for the named graph.

Methods in com.bigdata.rdf.sail.webapp with parameters of type VoID.IVCount

Modifier and Type	Method and Description
protected static VoID.IVCount[]	VoID.classUsage(AbstractTripleStore kb, IV<?,?> civ, VoID.IVCount[] classPartitionCounts) Return the class partition statistics for the named graph.
int	VoID.IVCount.compareTo(VoID.IVCount arg0) Place into order by descending count.
protected void	VoID.describeGraph(org.openrdf.model.Resource graph, VoID.IVCount[] predicatePartitionCounts, VoID.IVCount[] classPartitionCounts) Describe a named or default graph.
protected void	VoID.describeGraph(org.openrdf.model.Resource graph, VoID.IVCount[] predicatePartitionCounts, VoID.IVCount[] classPartitionCounts) Describe a named or default graph.
protected void	VoID.describeVocabularies(VoID.IVCount[] predicatePartitionCounts) Describe the vocabularies which are in use in the KB based on the predicate partition statistics.
protected static VoID.IVCount[]	VoID.predicateUsage(AbstractTripleStore kb, IV<?,?> civ, VoID.IVCount[] predicatePartitionCounts) Return the predicate partition statistics for the named graph.