Gobo Eiffel XML Library
Copyright (c) 2001, Andreas Leitner and others
Eiffel Forum License v2 (see forum.txt)
$Date: 2005/07/13 19:49:04 $
$Revision: 1.45 $
-- Create a new child element.
Use make
-- Routines that ought to be in class ANY
-- (From KL_IMPORTED_ANY_ROUTINES)
-- Routines that ought to be in class STRING
-- (From KL_IMPORTED_STRING_ROUTINES)
-- Attribute named a_name in current element;
-- Return Void if no such attribute was found.
-- Attribute named a_name in current element;
-- Return Void if no such attribute was found.
-- List of all attributes in current element
-- (Create a new list at each call.)
-- List of all direct child elements in current element
-- (Create a new list at each call.)
-- (From XM_COMPOSITE)
-- Equality tester;
-- A void equality tester means that =
-- will be used as comparison criterion.
-- (From DS_SEARCHABLE)
-- Index of current internal cursor position
-- (From DS_LIST)
-- Item at index i
-- (Performance: O(i).)
-- (From DS_INDEXABLE)
-- Item at index i
-- (Performance: O(i).)
-- (From DS_INDEXABLE)
-- Name
-- (From XM_NAMED_NODE)
-- Namespace of the name of current node
-- (From XM_NAMED_NODE)
-- Namespaces declared directly in this element;
-- This list must contain at most one namespace with a
-- void prefix. If such a namespace exists it is a declared
-- default namespace.
-- (Returns a new list object at each call.)
-- New external cursor for traversal
-- (From DS_TRAVERSABLE)
-- Namespace prefix used to declare the namespace of the
-- name of current node
-- (From XM_NAMED_NODE)
-- Parent of current node;
-- Void if current node is root
-- (From XM_NODE)
-- Number of items in list
-- (Performance: O(1).)
-- (From DS_CONTAINER)
-- Number of times v appears in list
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- (From DS_SEARCHABLE)
-- Is list equal to other?
-- Do not take cursor positions nor
-- equality_tester into account.
-- (Performance: O(count).)
-- (From ANY)
-- Is there no valid position to left of internal cursor?
-- (From DS_BILINEAR)
-- Can set_equality_tester be called with a_tester
-- as argument in current state of container?
-- (Default answer: True.)
-- (From DS_SEARCHABLE)
-- May list be extended with n items?
-- (From DS_EXTENDIBLE)
-- Does list include v?
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- (From DS_SEARCHABLE)
-- Does current element contain an attribute named a_name?
-- element?
-- Does current element contain an attribute with
-- this qualified name?
-- Has the name of current node been defined with namespace?
-- (From XM_NAMED_NODE)
-- Has a prefix been used to define the namespace?
-- (It could also be that the namespace used was the default namespace)
-- (From XM_NAMED_NODE)
-- Does this node match the qualified name?
-- (From XM_NAMED_NODE)
-- Is container empty?
-- (From DS_CONTAINER)
-- Is this node the first in its parent's child list,
-- or the root node?
-- (From XM_NODE)
-- Is this node the last in its parent's child list,
-- or the root node?
-- (From XM_NODE)
-- Depth at which current node appears relative to its root
-- (The root node has the level 1.)
-- (From XM_NODE)
-- Is internal cursor on first item?
-- (From DS_LINEAR)
-- Is internal cursor on last item?
-- (From DS_BILINEAR)
-- Is there no item at internal cursor position?
-- (From DS_TRAVERSABLE)
-- Does container use the same comparison
-- criterion as other?
-- (From DS_SEARCHABLE)
-- Are v and u considered equal?
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- (From DS_SEARCHABLE)
-- Has current node same name and namespace as other?
-- (From XM_NAMED_NODE)
-- Has current node same namespace as other?
-- (From XM_NAMED_NODE)
-- Is internal cursor at same position as a_cursor?
-- (From DS_TRAVERSABLE)
-- Is container sorted according to a_sorter's criterion?
-- (From DS_SORTABLE)
-- Move internal cursor to last position.
-- (From DS_BILINEAR)
-- Move internal cursor to first position at or before current
-- position where item_for_iteration and v are equal.
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- Move before if not found.
-- (From DS_BILINEAR)
-- Move internal cursor to first position at or after current
-- position where item_for_iteration and v are equal.
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- Move after if not found.
-- (From DS_LINEAR)
-- Add an attribute to current element.
-- (at end if last is an attribute, at beginning otherwise)
-- Add an attribute without a specific namespace.
-- append_first with parent processing.
-- (From DS_INDEXABLE)
-- append_last with parent processing.
-- (From DS_EXTENDIBLE)
-- Add items of other to left of internal cursor position.
-- Keep items of other in the same order.
-- Do not move cursors.
-- (From DS_LIST)
-- append_left_cursor with parent processing.
-- (From DS_LIST)
-- Add items of other to right of internal cursor position.
-- Keep items of other in the same order.
-- Do not move cursors.
-- (From DS_LIST)
-- append_right_cursor with parent processing.
-- (From DS_LIST)
-- Add items of other to left of internal cursor position.
-- Keep items of other in the same order.
-- Do not move cursors.
-- (From DS_LIST)
-- extend_left_cursor with parent processing.
-- (From DS_LIST)
-- Add items of other to right of internal cursor position.
-- Keep items of other in the same order.
-- Do not move cursors.
-- (From DS_LIST)
-- extend_right_cursor with parent processing.
-- (From DS_LIST)
-- force_first with parent processing.
-- (From DS_INDEXABLE)
-- force_last with parent removal and optimisation for
-- force_last (last).
-- (From DS_EXTENDIBLE)
-- force_left_cursor with parent processing.
-- (From DS_LIST)
-- force_right_cursor with parent processing.
-- (From DS_LIST)
-- put_last with parent removal and optimisation for
-- put_last (last).
-- (From DS_EXTENDIBLE)
-- Add v to left of internal cursor position.
-- Do not move cursors.
-- (From DS_LIST)
-- put_left_cursor with parent processing.
-- (From DS_LIST)
-- Add v to right of internal cursor position.
-- Do not move cursors.
-- (From DS_LIST)
-- put_right_cursor with parent processing.
-- (From DS_LIST)
-- Set namespace to a_namespace.
-- (From XM_NAMED_NODE)
-- Remove all occurrences of v.
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- Move all cursors off.
-- (Performance: O(count).)
-- (From DS_LIST)
-- Call delete with Void equality tester.
-- (From XM_COMPOSITE)
-- Join sequences of text nodes.
-- (From XM_COMPOSITE)
-- Keep n first items in list.
-- Move all cursors off.
-- (Performance: O(n).)
-- (From DS_INDEXABLE)
-- Keep n last items in list.
-- Move all cursors off.
-- (Performance: O(count-n).)
-- (From DS_INDEXABLE)
-- Remove n first items from list.
-- Move all cursors off.
-- (Performance: O(n).)
-- (From DS_INDEXABLE)
-- Remove n last items from list.
-- Move all cursors off.
-- (Performance: O(count-n).)
-- (From DS_INDEXABLE)
-- Remove attribute named a_name from current element.
-- Remove attribute named a_name from current element.
-- Remove item at beginning of list.
-- Move any cursors at this position forth.
-- (Performance: O(1).)
-- (From DS_INDEXABLE)
-- Remove item at end of list.
-- Move any cursors at this position forth.
-- (Performance: O(count).)
-- (From DS_INDEXABLE)
-- Remove all items from list.
-- Move all cursors off.
-- (Performance: O(1).)
-- (From DS_CONTAINER)
-- Clone of current object
-- (From KL_CLONABLE)
-- Process current node with a_processor.
-- (From XM_NODE)
-- Process direct children.
-- (From XM_COMPOSITE)
-- Process direct and indirect children.
-- (From XM_COMPOSITE)
-- Add a_cursor to the list of traversing cursors
-- (i.e. cursors associated with current container
-- and which are not currently off).
-- (From DS_TRAVERSABLE)
-- Is there no valid position to right of a_cursor?
-- (From DS_LINEAR)
-- Move a_cursor to previous position.
-- (Performance: O(a_cursor.index).)
-- (From DS_BILINEAR)
-- Is there no valid position to left of a_cursor?
-- (From DS_BILINEAR)
-- Move a_cursor to last position.
-- (Performance: O(1).)
-- (From DS_BILINEAR)
-- Move a_cursor to next position.
-- (Performance: O(1).)
-- (From DS_LINEAR)
-- Move a_cursor to i-th position.
-- (Performance: O(i).)
-- (From DS_LIST)
-- Move a_cursor to other's position.
-- (Performance: O(1).)
-- (From DS_TRAVERSABLE)
-- Index of a_cursor's current position
-- (Performance: O(count).)
-- (From DS_LIST)
-- Is a_cursor on first item?
-- (From DS_LINEAR)
-- Is a_cursor on last item?
-- (From DS_BILINEAR)
-- Item at a_cursor position
-- (Performance: O(1).)
-- (From DS_TRAVERSABLE)
-- Is there no item at a_cursor position?
-- (From DS_TRAVERSABLE)
-- Is a_cursor at same position as other?
-- (From DS_TRAVERSABLE)
-- Move a_cursor to first position at or before its current
-- position where cursor_item (a_cursor) and v are equal.
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- Move before if not found.
-- (Performance: O(a_cursor.index).)
-- (From DS_BILINEAR)
-- Move a_cursor to first position at or after its current
-- position where cursor_item (a_cursor) and v are equal.
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- Move after if not found.
-- (From DS_LINEAR)
-- Move a_cursor to first position.
-- (Performance: O(1).)
-- (From DS_LINEAR)
-- Remove a_cursor from the list of traversing cursors
-- (i.e. cursors associated with current container
-- and which are not currently off).
-- (From DS_TRAVERSABLE)
-- Sort container using a_sorter's algorithm.
-- (From DS_SORTABLE)
-- Set equality_tester to a_tester.
-- A void equality tester means that =
-- will be used as comparison criterion.
-- (From DS_SEARCHABLE)
-- Direct child element with name a_name;
-- If there are more than one element with that name, anyone may be returned.
-- Return Void if no element with that name is a child of current node.
-- (From XM_COMPOSITE)
-- Direct child element with given qualified name;
-- If there are more than one element with that name, anyone may be returned.
-- Return Void if no element with that name is a child of current node.
-- (From XM_COMPOSITE)
-- Has current node at least one direct child
-- element with the name a_name?
-- (From XM_COMPOSITE)
-- Has current node at least one direct child
-- element with this qualified name ?
-- (From XM_COMPOSITE)
-- Concatenation of all texts directly found in
-- current element; Void if no text found
-- (Return a new string at each call.)
-- (From XM_COMPOSITE)
-- First cell in list
-- (From DS_LINKED_LIST)
-- Last cell in list
-- (From DS_LINKED_LIST)
XML element nodes