GNU
|
Liberty Eiffel
|
Automated Tests
|
Wiki
|
Savannah project
|
Debian packages
|
Documentation
>
libraries
>
XML_DTD_NODE
+
Point of view
All features
ANY
RECYCLING_POOL
XML_DTD_VALIDATOR
XML_DTD_ELEMENT
XML_DTD_NODE
All features
class XML_DTD_NODE
Summary
top
A real node read from the XML stream.
Direct parents
Insert list:
RECYCLABLE
Class invariant
top
children
/= Void
Overview
top
Creation features
{
XML_DTD_VALIDATOR
}
make
Features
{
ANY
}
fill_tagged_out_memory
Append a viewable information in
tagged_out_memory
in order to affect the behavior of
out
,
tagged_out
, etc.
{
XML_DTD_VALIDATOR
,
XML_DTD_ELEMENT
}
name
:
UNICODE_STRING
element
:
XML_DTD_ELEMENT
parent
: XML_DTD_NODE
children
:
FAST_ARRAY
[XML_DTD_NODE]
set_element
(a_element:
XML_DTD_ELEMENT
) assign
element
set_parent
(a_parent: XML_DTD_NODE) assign
parent
{
XML_DTD_NODE
,
XML_DTD_VALIDATOR
}
valid_index
(index:
INTEGER_32
):
BOOLEAN
remove
(index:
INTEGER_32
)
add_last
(a_node: XML_DTD_NODE)
is_empty
:
BOOLEAN
count
:
INTEGER_32
fast_has
(a_node: XML_DTD_NODE):
BOOLEAN
first
: XML_DTD_NODE
last
: XML_DTD_NODE
item
(index:
INTEGER_32
): XML_DTD_NODE
fast_first_index_of
(a_node: XML_DTD_NODE):
INTEGER_32
Tree validation
{
XML_DTD_VALIDATOR
}
is_valid_child
(explorer:
XML_DTD_VALIDATOR
, node_name:
UNICODE_STRING
):
BOOLEAN
is_valid_data
(explorer:
XML_DTD_VALIDATOR
, data:
UNICODE_STRING
):
BOOLEAN
{
RECYCLING_POOL
}
recycle
Do whatever needs to be done to free resources or recycle other objects when recycling this one
{}
make
fill_tagged_out_memory
effective procedure
{
ANY
}
top
Append a viewable information in
tagged_out_memory
in order to affect the behavior of
out
,
tagged_out
, etc.
require
locked:
tagged_out_locked
ensure
still_locked:
tagged_out_locked
name
:
UNICODE_STRING
effective function
{
XML_DTD_VALIDATOR
,
XML_DTD_ELEMENT
}
top
require
element
/= Void
element
:
XML_DTD_ELEMENT
writable attribute
{
XML_DTD_VALIDATOR
,
XML_DTD_ELEMENT
}
top
parent
: XML_DTD_NODE
writable attribute
{
XML_DTD_VALIDATOR
,
XML_DTD_ELEMENT
}
top
children
:
FAST_ARRAY
[XML_DTD_NODE]
writable attribute
{
XML_DTD_VALIDATOR
,
XML_DTD_ELEMENT
}
top
set_element
(a_element:
XML_DTD_ELEMENT
) assign
element
effective procedure
{
XML_DTD_VALIDATOR
,
XML_DTD_ELEMENT
}
top
ensure
element
= a_element
set_parent
(a_parent: XML_DTD_NODE) assign
parent
effective procedure
{
XML_DTD_VALIDATOR
,
XML_DTD_ELEMENT
}
top
require
not a_parent.
fast_has
(Current)
valid_index
(index:
INTEGER_32
):
BOOLEAN
effective function
{
XML_DTD_NODE
,
XML_DTD_VALIDATOR
}
top
remove
(index:
INTEGER_32
)
effective procedure
{
XML_DTD_NODE
,
XML_DTD_VALIDATOR
}
top
require
valid_index
(index)
add_last
(a_node: XML_DTD_NODE)
effective procedure
{
XML_DTD_NODE
,
XML_DTD_VALIDATOR
}
top
ensure
not
is_empty
is_empty
:
BOOLEAN
effective function
{
XML_DTD_NODE
,
XML_DTD_VALIDATOR
}
top
count
:
INTEGER_32
effective function
{
XML_DTD_NODE
,
XML_DTD_VALIDATOR
}
top
fast_has
(a_node: XML_DTD_NODE):
BOOLEAN
effective function
{
XML_DTD_NODE
,
XML_DTD_VALIDATOR
}
top
first
: XML_DTD_NODE
effective function
{
XML_DTD_NODE
,
XML_DTD_VALIDATOR
}
top
require
not
is_empty
last
: XML_DTD_NODE
effective function
{
XML_DTD_NODE
,
XML_DTD_VALIDATOR
}
top
require
not
is_empty
item
(index:
INTEGER_32
): XML_DTD_NODE
effective function
{
XML_DTD_NODE
,
XML_DTD_VALIDATOR
}
top
require
valid_index
(index)
fast_first_index_of
(a_node: XML_DTD_NODE):
INTEGER_32
effective function
{
XML_DTD_NODE
,
XML_DTD_VALIDATOR
}
top
is_valid_child
(explorer:
XML_DTD_VALIDATOR
, node_name:
UNICODE_STRING
):
BOOLEAN
effective function
{
XML_DTD_VALIDATOR
}
top
require
explorer /= Void
element
.is_built
is_valid_data
(explorer:
XML_DTD_VALIDATOR
, data:
UNICODE_STRING
):
BOOLEAN
effective function
{
XML_DTD_VALIDATOR
}
top
require
explorer /= Void
element
.is_built
recycle
effective procedure
{
RECYCLING_POOL
}
top
Do whatever needs to be done to free resources or recycle other objects when recycling this one
ensure
old
parent
/= Void implies not old
parent
.
fast_has
(Current)
parent
= Void
make
effective procedure
{}
top