|
Node specifier. A node is the operand in the message structure.
Folders in a hard disk can be given a "tree structure" on a PC. A folder is created and files are placed inside of it. Not only files but also folders can be made inside of a folder. In a tree format, the folder is the "branch" and the files are the "leaves".
In the same way, an SML data structure can also be given a tree structure. The list will be the "branch", and the other items will be the "leaves". The node is a classifier which identifies the "branch" and "leaf" positions.
Nodes are made up of slashes ("/") and the node number.If a node is empty (""), the root will be considered what was specified. In general roots are in list format, but other formats may also be specified. The root must be in list format when there are sub-nodes.
For example, let us assume an SML as follows.
{
<a'Kelly'>
{
<a'Brenda'>
{
<a'Donna'>
}
}
<a'Valerie'>
{
{
{
<a'Andrea'>
}
}
}
}
Let us assign numbers so it is easy to identify nodes.
1 {
1 <a'Kelly'>
2 {
1 <a'Brenda'>
2 {
1 <a'Donna'>
}
}
3 <a'Valerie'>
4 {
1 {
1 {
1 <a'Andrea'>
}
}
}
}
If Kelly, Brenda, Donna, Valerie, and Andrea are shown denoted as node positions, they would be as follows. There are no restrictions on the node nesting level.
| Kelly | 1 |
| Brenda | 2/1 |
| Donna | 2/2/1 |
| Valerie | 3 |
| Andrea | 4/1/1/1 |
If the node is in array format, use [] to extract identifiers and specify and index. For example, let us assume an SML such as that below.
{
<f8 9.11 3.14>
}
If we wished to extract the second element, "3.14", we would specify the index. Since the index starts from 0, if it is the 2nd element, it would be "1".
.Node = "1[1]"
When this is read out, only the identifier returns, as shown below.
"3.14"
 構文
|
|
|
BSTR GetNode();
void SetNode(LPCTSTR lpszNewValue);
|
戻り値
使用例
特記事項
参照
NodeCount プロパティ
NodeType プロパティ
NodeValue プロパティ
NodeValueHex プロパティ
|