BaseNode Class |
Namespace: VDS.RDF
public abstract class BaseNode : INode, IComparable<INode>, IComparable<IBlankNode>, IComparable<IGraphLiteralNode>, IComparable<ILiteralNode>, IComparable<IUriNode>, IComparable<IVariableNode>, IEquatable<INode>, IEquatable<IBlankNode>, IEquatable<IGraphLiteralNode>, IEquatable<ILiteralNode>, IEquatable<IUriNode>, IEquatable<IVariableNode>, ISerializable, IXmlSerializable
The BaseNode type exposes the following members.
| Name | Description | |
|---|---|---|
| BaseNode |
Base Constructor which instantiates the Graph reference, Graph Uri and Node Type of the Node.
|
| Name | Description | |
|---|---|---|
| Graph |
Nodes belong to a Graph.
| |
| GraphUri |
Gets/Sets the Graph Uri of the Node.
| |
| NodeType |
Nodes have a Type.
|
| Name | Description | |
|---|---|---|
| CompareTo(IBlankNode) |
Nodes must implement a CompareTo method to allow them to be Sorted.
| |
| CompareTo(IGraphLiteralNode) |
Nodes must implement a CompareTo method to allow them to be Sorted.
| |
| CompareTo(ILiteralNode) |
Nodes must implement a CompareTo method to allow them to be Sorted.
| |
| CompareTo(INode) |
Nodes must implement a CompareTo method to allow them to be Sorted.
| |
| CompareTo(IUriNode) |
Nodes must implement a CompareTo method to allow them to be Sorted.
| |
| CompareTo(IVariableNode) |
Nodes must implement a CompareTo method to allow them to be Sorted.
| |
| Equals(Object) |
Nodes must implement an Equals method.
(Overrides ObjectEquals(Object).) | |
| Equals(IBlankNode) |
Nodes must implement an Equals method so we can do type specific equality.
| |
| Equals(IGraphLiteralNode) |
Nodes must implement an Equals method so we can do type specific equality.
| |
| Equals(ILiteralNode) |
Nodes must implement an Equals method so we can do type specific equality.
| |
| Equals(INode) |
Nodes must implement an Equals method so we can do type specific equality.
| |
| Equals(IUriNode) |
Nodes must implement an Equals method so we can do type specific equality.
| |
| Equals(IVariableNode) |
Nodes must implement an Equals method so we can do type specific equality.
| |
| Finalize | Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection. (Inherited from Object.) | |
| GetHashCode |
Gets a Hash Code for a Node.
(Overrides ObjectGetHashCode.) | |
| GetObjectData |
Gets the information for serialization.
| |
| GetSchema |
Gets the schema for XML serialization.
| |
| GetType | Gets the Type of the current instance. (Inherited from Object.) | |
| MemberwiseClone | Creates a shallow copy of the current Object. (Inherited from Object.) | |
| ReadXml |
Reads the data for XML deserialization.
| |
| ToString |
Nodes must implement a ToString method.
(Overrides ObjectToString.) | |
| ToString(INodeFormatter) |
Gets the String representation of the Node formatted with the given Node formatter.
| |
| ToString(INodeFormatter, TripleSegment) |
Gets the String representation of the Node formatted with the given Node formatter.
| |
| WriteXml |
Writes the data for XML serialization.
|
| Name | Description | |
|---|---|---|
| Equality |
The Equality operator is defined for Nodes.
| |
| Inequality |
The Non-Equality operator is defined for Nodes.
|
| Name | Description | |
|---|---|---|
| _graph |
Reference to the Graph that the Node belongs to.
| |
| _graphUri |
Uri of the Graph that the Node belongs to.
| |
| _hashcode |
Stores the computed Hash Code for this Node.
| |
| _nodetype |
Node Type for the Node.
|
| Name | Description | |
|---|---|---|
| AsDynamic |
Dynamically wraps a node.
(Defined by DynamicExtensions.) | |
| AsValuedNode |
Takes a INode and converts it to a IValuedNode if it is not already an instance that implements the interface.
(Defined by ValuedNodeExtensions.) | |
| CopyNode(IGraph) | Overloaded.
Copies a Node to the target Graph.
(Defined by Extensions.) | |
| CopyNode(IGraph, Boolean) | Overloaded.
Copies a Node to the target Graph.
(Defined by Extensions.) | |
| IsListRoot |
Gets whether a given Node is valid as a List Root, this does not guarantee that the list itself is valid simply that the Node appears to be the root of a list.
(Defined by Extensions.) |