| Modifier and Type | Method and Description |
|---|---|
void |
SignatureAlgorithmCarroll2003.nondeterministicPreCanonicalization(NamedGraph g)
Performs nondeterministic pre-canonicalization
Use multiple one-step deterministic labeling passes
Steps (some may be skipped depending on blank nodes):
1) substituteBlankNodes & oneStepDeterministicLabelling
2) remove all triples with c14n:true predicate
3) substituteBlankNodes & oneStepDeterministicLabelling
4) Add new triples with c14n:true predicate for hard to label blank nodes
5) substituteBlankNodes & oneStepDeterministicLabelling
Comments "(Step A)" to "(Step F)" in code below refer to the algorithm description of Carroll
|
| Modifier and Type | Method and Description |
|---|---|
static BigInteger |
GraphBaseHasher.calculate(NamedGraph g,
MessageDigest d)
Calculates the base hash of a graph as BigInteger
|
| Modifier and Type | Method and Description |
|---|---|
NamedGraph |
NamedGraph.getParent() |
| Modifier and Type | Method and Description |
|---|---|
LinkedList<NamedGraph> |
NamedGraph.getChildren() |
LinkedList<NamedGraph> |
GraphCollection.getGraphs() |
| Modifier and Type | Method and Description |
|---|---|
void |
GraphCollection.addGraph(NamedGraph g)
Adds a graph to the
GraphCollection |
int |
NamedGraph.compareTo(NamedGraph g)
Compares graph with another graph (used for sorting, lexicographic order)
|
void |
NamedGraph.updateDepths(int _depth,
NamedGraph _parent)
Updates the depth of this graphs and all sub graphs (recursive)
|
| Modifier and Type | Method and Description |
|---|---|
void |
NamedGraph.setChildren(LinkedList<NamedGraph> children) |
void |
GraphCollection.setGraphs(LinkedList<NamedGraph> graphs) |
| Constructor and Description |
|---|
NamedGraph(String name,
int depth,
NamedGraph parent) |
| Modifier and Type | Method and Description |
|---|---|
static void |
TriGPlusWriter.writeGraph(BufferedWriter bw,
NamedGraph g,
int padding)
Writes a
NamedGraph to a BufferedWriter (recursive). |
Copyright © 2018. All rights reserved.