$Date: 2005/10/26 07:42:54 $
$Revision: 1.12 $
-- Builds an EM_ANIMATION from the information provided by the script file a_file_name.
-- The script file has the following format:
-- File ::= [file_name_of_picture [duration]nl]* eof
-- Initialize from the items of a.
-- (Useful in proper descendants of class ARRAY,
-- to initialize an array-like object from a manifest array.)
-- (From ARRAY)
-- Allocate array; set index interval to
-- min_index .. max_index; set all values to default.
-- (Make array empty if min_index = max_index + 1).
-- (From ARRAY)
-- Allocate array; set index interval to
-- min_index .. max_index; set all values to default.
-- (Make array empty if min_index = max_index + 1).
-- (From ARRAY)
-- Initialize from the items of a.
-- (Useful in proper descendants of class ARRAY,
-- to initialize an array-like object from a manifest array.)
-- (From ARRAY)
-- Initialize array from na.
-- (From ARRAY)
-- Special data zone
-- (From TO_SPECIAL)
-- Does v appear in array?
-- (Reference or object equality,
-- based on object_comparison.)
-- (From CONTAINER)
-- Entry at index i, if in index interval
-- (From TABLE)
-- Entry at index i, if in index interval
-- (From TABLE)
-- Percentage by which structure will grow automatically
-- (From RESIZABLE)
-- Minimal number of additional items
-- (From RESIZABLE)
-- Proposed number of additional items
--| Result is a reasonable value, resulting from a space-time tradeoff.
-- (From RESIZABLE)
-- Minimum index
-- (From ARRAY)
-- Number of times v appears in structure
-- (From BAG)
-- Maximum index
-- (From ARRAY)
-- May object_comparison be changed?
-- (Answer: yes by default.)
-- (From CONTAINER)
-- May items be added?
-- (Answer: no, although array may be resized.)
-- (From COLLECTION)
-- Does file with name fn exist?
-- if file with a_file_name in correct format?
-- The correct format is:
-- File ::= [file_name_of_picture [duration]nl]* eof
-- Is structure filled to capacity? (Answer: yes)
-- (From BOX)
-- Is structure empty?
-- (From CONTAINER)
-- Is fn a valid file name?
-- Has v been inserted by the most recent insertion?
-- (By default, the value returned is equivalent to calling
-- has (v). However, descendants might be able to provide more
-- efficient implementations.)
-- (From COLLECTION)
-- Must search operations use equal rather than =
-- for comparing references? (Default: no, use =.)
-- (From CONTAINER)
-- May items be removed? (Answer: no.)
-- (From COLLECTION)
-- Do other and Current have same items?
-- (From ARRAY)
-- (From ARRAY)
-- Ensure that future search operations will use equal
-- rather than = for comparing references.
-- (From CONTAINER)
-- Ensure that future search operations will use =
-- rather than equal for comparing references.
-- (From CONTAINER)
-- Replace i-th entry, if in index interval, by v.
-- (From ARRAY)
-- Fill with as many items of other as possible.
-- The representations of other and current structure
-- need not be the same.
-- (From COLLECTION)
-- Assign item v to i-th entry.
-- Always applicable: resize the array if i falls out of
-- currently defined bounds; preserve existing items.
-- (From ARRAY)
-- Replace i-th entry, if in index interval, by v.
-- (From TABLE)
-- Copy items of other within bounds start_pos and end_pos
-- to current array starting at index index_pos.
-- (From ARRAY)
-- Reset all items to default values.
-- (From ARRAY)
-- Reset all items to default values with reallocation.
-- (From ARRAY)
-- Remove all occurrences of v.
-- (Reference or object equality,
-- based on object_comparison.)
--|Default implementation, usually inefficient.
-- (From COLLECTION)
-- Make array empty.
-- (From COLLECTION)
Not applicable since not prunable. Use discard_items instead.
-- Change the capacity to accommodate at least
-- Growth_percentage more items.
--| Trades space for time:
--| allocates fairly large chunks of memory but not very often.
-- (From RESIZABLE)
-- Rearrange array so that it can accommodate
-- indices down to min_index and up to max_index.
-- Do not lose any previously entered item.
-- (From ARRAY)
-- Rearrange array so that it can accommodate
-- indices down to min_index and up to max_index.
-- Do not lose any previously entered item.
-- (From ARRAY)
Use conservative_resize instead as future versions will implement resize as specified in ELKS.
-- Representation as a linear structure
-- (From CONTAINER)
-- Address of actual sequence of values,
-- for passing to external (non-Eiffel) routines.
-- (From ARRAY)
-- Address of actual sequence of values,
-- for passing to external (non-Eiffel) routines.
-- (From ARRAY)
-- Array made of items of current array within
-- bounds start_pos and end_pos.
-- (From ARRAY)
-- Apply action to every non-void item.
-- Semantics not guaranteed if action changes the structure;
-- in such a case, apply iterator to clone of structure instead.
-- (From ARRAY)
-- Apply action to every non-void item that satisfies test.
-- Semantics not guaranteed if action or test changes the structure;
-- in such a case, apply iterator to clone of structure instead.
-- (From ARRAY)
-- Is test true for all non-void items?
-- (From ARRAY)
-- Is test true for at least one item?
-- (From ARRAY)
An EM_ANIMATION is an array of EM_DRAWABLE. To create an EM_ANIMATION you have
to give an animation script file to the creation feature make.
The format of the animation script file:
File ::= [file_name_of_picture [duration]nl]* eof
If no duration is given every frame takes 125ms, which equals 8 frames per second.
The unit of duration is millisecons.