BitFlow.NET
Source code documentation of the BitFlow .NET interface.
|
Properties | |
Int64 | Value [get, set] |
The node value as its base type. More... | |
Int64 | Minimum [get] |
The minimum valid value of the node. More... | |
Int64 | Maximum [get] |
The maximum valid value of the node. More... | |
Int64 | Increment [get] |
The node value increment, where valid values are defined by the set: v(n) = Minimum + Increment * n; Minimum <= v(n) <= Maximum More... | |
![]() | |
String | StringValue [get, set] |
A string representation of the ValueNode value. More... | |
![]() | |
bool | IsValid [get] |
This instance represents a valid node. More... | |
String | Name [get] |
Retrieve the node name. More... | |
String | DisplayName [get] |
Retrieve the node display name. More... | |
String | ToolTip [get] |
Retrieve the node tool-tip. More... | |
String | Description [get] |
Retrieve the node description. More... | |
NodeType | Type [get] |
Retrieve the node type. More... | |
Access | Access [get] |
Retrieve the node accessibility. More... | |
bool | IsReadable [get] |
Convenience method to evaluate node readability. More... | |
bool | IsWritable [get] |
Convenience method to evaluate node writability. More... | |
bool | IgnoreCache [get, set] |
When this flag is raised, cached node data is ignored, and the data is read anew. More... | |
Additional Inherited Members | |
![]() | |
bool | GetIsValid () |
This instance represents a valid node. More... | |
override bool | Equals (Object other) |
Determine if two another Object is equivalent to this node. More... | |
override int | GetHashCode () |
Generate a hash code for this node. This is derived from the node name, which will be unique for every node of a given device. More... | |
![]() | |
static implicit | operator bool (BaseNode node) |
static bool | operator! (BaseNode node) |
This instance does not represent a valid node. More... | |
![]() | |
Device | m_device |
ManagedBFGTLUtilitiesBaseNode | m_node |
|
get |
The node value increment, where valid values are defined by the set: v(n) = Minimum + Increment * n; Minimum <= v(n) <= Maximum
|
get |
The maximum valid value of the node.
|
get |
The minimum valid value of the node.
|
getset |
The node value as its base type.