indexing
	description: "Menu bar containing drop down menus. See EV_MENU."
	status: "See notice at end of class"
	keywords: "menu, bar, item, file, edit, help"
	date: "$Date$"
	revision: "$Revision$"

class interface
	EV_MENU_BAR

create 

	frozen default_create
			-- Standard creation procedure.
			-- (from EV_ANY)
		ensure then -- from EV_ANY
			is_coupled: implementation /= void
			is_initialized: is_initialized
			default_create_called_set: default_create_called
			is_in_default_state: is_in_default_state

feature -- Initialization

	frozen default_create
			-- Standard creation procedure.
			-- (from EV_ANY)
		ensure then -- from EV_ANY
			is_coupled: implementation /= void
			is_initialized: is_initialized
			default_create_called_set: default_create_called
			is_in_default_state: is_in_default_state
	
feature -- Access

	cursor: EV_DYNAMIC_LIST_CURSOR [EV_MENU_ITEM]
			-- Current cursor position.
			-- (from EV_DYNAMIC_LIST)
		ensure then -- from EV_DYNAMIC_LIST
			bridge_ok: Result.is_equal (implementation.cursor)

	data: ANY
			-- Arbitrary user data may be stored here.
			-- (from EV_ANY)

	first: like item
			-- Item at first position
			-- (from CHAIN)
		require -- from CHAIN
			not_empty: not is_empty

	has (v: like item): BOOLEAN
			-- Does chain include v?
			-- (Reference or object equality,
			-- based on object_comparison.)
			-- (from CHAIN)
		ensure -- from CONTAINER
			not_found_in_empty: Result implies not is_empty

	i_th (i: INTEGER): EV_MENU_ITEM
			-- Item at i-th position.
			-- (from EV_DYNAMIC_LIST)
		require -- from TABLE
			valid_key: valid_index (k)
		ensure then -- from EV_DYNAMIC_LIST
			bridge_ok: Result.is_equal (implementation.i_th (i))

	index: INTEGER
			-- Current position.
			-- (from EV_DYNAMIC_LIST)
		ensure then -- from EV_DYNAMIC_LIST
			bridge_ok: Result = implementation.index

	index_of (v: like item; i: INTEGER): INTEGER
			-- Index of ith occurence of v.
			-- (from EV_DYNAMIC_LIST)
		require -- from LINEAR
			positive_occurrences: i > 0
		ensure -- from LINEAR
			non_negative_result: Result >= 0
		ensure then -- from EV_DYNAMIC_LIST
			bridge_ok: Result = implementation.index_of (v, i)

	item: EV_MENU_ITEM
			-- Item at current position.
			-- (from EV_DYNAMIC_LIST)
		require -- from TRAVERSABLE
			not_off: not off
		require -- from ACTIVE
			readable: readable
		ensure then -- from EV_DYNAMIC_LIST
			not_void: Result /= void
			bridge_ok: Result.is_equal (implementation.item)

	item_by_data (some_data: ANY): like item
			-- First item with some_data.
			-- (from EV_ITEM_LIST)
		require -- from EV_ITEM_LIST
			not_destroyed: not is_destroyed
			data_not_void: some_data /= void
		ensure -- from EV_ITEM_LIST
			bridge_ok: Result = implementation.item_by_data (some_data)

	last: like item
			-- Item at last position
			-- (from CHAIN)
		require -- from CHAIN
			not_empty: not is_empty

	sequential_occurrences (v: EV_MENU_ITEM): INTEGER
			-- Number of times v appears.
			-- (Reference or object equality,
			-- based on object_comparison.)
			-- (from LINEAR)
		ensure -- from BAG
			non_negative_occurrences: Result >= 0

	infix "@" (i: INTEGER): like item
			-- Item at i-th position
			-- Was declared in CHAIN as synonym of i_th.
			-- (from CHAIN)
		require -- from TABLE
			valid_key: valid_index (k)
	
feature -- Measurement

	count: INTEGER
			-- Number of items.
			-- (from EV_DYNAMIC_LIST)
		ensure then -- from EV_DYNAMIC_LIST
			bridge_ok: Result = implementation.count

	index_set: INTEGER_INTERVAL
			-- Range of acceptable indexes
			-- (from CHAIN)
		ensure -- from INDEXABLE
			not_void: Result /= void
		ensure then -- from CHAIN
			count_definition: Result.count = count

	occurrences (v: like item): INTEGER
			-- Number of times v appears.
			-- (Reference or object equality,
			-- based on object_comparison.)
			-- (from CHAIN)
		ensure -- from BAG
			non_negative_occurrences: Result >= 0

	occurrences (v: like item): INTEGER
			-- Number of times v appears.
			-- (Reference or object equality,
			-- based on object_comparison.)
			-- (from CHAIN)
		ensure -- from BAG
			non_negative_occurrences: Result >= 0
	
feature -- Comparison

	is_equal (other: like Current): BOOLEAN
			-- Does other contain the same elements?
			-- (from LIST)
		require -- from ANY
			other_not_void: other /= void
		ensure -- from ANY
			symmetric: Result implies other.is_equal (Current)
			consistent: standard_is_equal (other) implies Result
		ensure then -- from LIST
			indices_unchanged: index = old index and other.index = old other.index
			true_implies_same_size: Result implies count = other.count
	
feature -- Status report

	after: BOOLEAN
			-- Is there no valid cursor position to the right of cursor?
			-- (from LIST)

	before: BOOLEAN
			-- Is there no valid cursor position to the left of cursor?
			-- (from LIST)

	exhausted: BOOLEAN
			-- Has structure been completely explored?
			-- (from LINEAR)
		ensure -- from LINEAR
			exhausted_when_off: off implies Result

	Extendible: BOOLEAN is True
			-- May new items be added? (Answer: yes.)
			-- (from DYNAMIC_CHAIN)

	Full: BOOLEAN is False
			-- Is structured filled to capacity? (Answer: no.)
			-- (from EV_DYNAMIC_LIST)

	is_empty: BOOLEAN
			-- Is structure empty?
			-- (from FINITE)

	is_inserted (v: EV_MENU_ITEM): BOOLEAN
			-- 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)

	isfirst: BOOLEAN
			-- Is cursor at first position?
			-- (from CHAIN)
		ensure -- from CHAIN
			valid_position: Result implies not is_empty

	islast: BOOLEAN
			-- Is cursor at last position?
			-- (from CHAIN)
		ensure -- from CHAIN
			valid_position: Result implies not is_empty

	object_comparison: BOOLEAN
			-- Must search operations use equal rather than =
			-- for comparing references? (Default: no, use =.)
			-- (from CONTAINER)

	off: BOOLEAN
			-- Is there no current item?
			-- (from CHAIN)

	parent: EV_WINDOW
			-- Parent of Current.

	prunable: BOOLEAN
			-- May items be removed? (Answer: yes.)
			-- (from DYNAMIC_CHAIN)

	readable: BOOLEAN
			-- Is there a current item that may be read?
			-- (from SEQUENCE)

	valid_cursor (p: CURSOR): BOOLEAN
			-- Can the cursor be moved to position p?
			-- This is True if p conforms to EV_DYNAMIC_LIST_CURSOR and
			-- if it points to an item, Current must have it.
			-- (from EV_DYNAMIC_LIST)
		ensure then -- from EV_DYNAMIC_LIST
			bridge_ok: Result = implementation.valid_cursor (p)

	valid_cursor_index (i: INTEGER): BOOLEAN
			-- Is i correctly bounded for cursor movement?
			-- (from CHAIN)
		ensure -- from CHAIN
			valid_cursor_index_definition: Result = ((i >= 0) and (i <= count + 1))

	valid_index (i: INTEGER): BOOLEAN
			-- Is i within allowable bounds?
			-- (from CHAIN)
		ensure then -- from INDEXABLE
			only_if_in_index_set: Result implies ((i >= index_set.lower) and (i <= index_set.upper))
		ensure then -- from CHAIN
			valid_index_definition: Result = ((i >= 1) and (i <= count))

	writable: BOOLEAN
			-- Is there a current item that may be modified?
			-- (from SEQUENCE)
	
feature -- Status setting

	compare_objects
			-- Ensure that future search operations will use equal
			-- rather than = for comparing references.
			-- (from CONTAINER)
		require -- from CONTAINER
			changeable_comparison_criterion
		ensure -- from CONTAINER
			object_comparison

	compare_references
			-- Ensure that future search operations will use =
			-- rather than equal for comparing references.
			-- (from CONTAINER)
		require -- from CONTAINER
			changeable_comparison_criterion
		ensure -- from CONTAINER
			reference_comparison: not object_comparison
	
feature -- Cursor movement

	back
			-- Move to previous position.
			-- (from EV_DYNAMIC_LIST)
		require -- from BILINEAR
			not_before: not before

	finish
			-- Move cursor to last position.
			-- (No effect if empty)
			-- (from CHAIN)
		ensure then -- from CHAIN
			at_last: not is_empty implies islast

	forth
			-- Move cursor to next position.
			-- (from EV_DYNAMIC_LIST)
		require -- from LINEAR
			not_after: not after
		ensure then -- from LIST
			moved_forth: index = old index + 1

	go_i_th (i: INTEGER)
			-- Move cursor to i-th position.
			-- (from EV_DYNAMIC_LIST)
		require -- from CHAIN
			valid_cursor_index: valid_cursor_index (i)
		ensure -- from CHAIN
			position_expected: index = i

	go_to (p: CURSOR)
			-- Move cursor to position p.
			-- (from EV_DYNAMIC_LIST)
		require -- from CURSOR_STRUCTURE
			cursor_position_valid: valid_cursor (p)

	move (i: INTEGER)
			-- Move cursor i positions.
			-- (from EV_DYNAMIC_LIST)
		ensure -- from CHAIN
			too_far_right: (old index + i > count) implies exhausted
			too_far_left: (old index + i < 1) implies exhausted
			expected_index: (not exhausted) implies (index = old index + i)

	search (v: like item)
			-- Move to first position (at or after current
			-- position) where item and v are equal.
			-- If structure does not include v ensure that
			-- exhausted will be true.
			-- (Reference or object equality,
			-- based on object_comparison.)
			-- (from BILINEAR)
		ensure -- from LINEAR
			object_found: (not exhausted and object_comparison) implies equal (v, item)
			item_found: (not exhausted and not object_comparison) implies v = item

	start
			-- Move cursor to first position.
			-- (from EV_DYNAMIC_LIST)
		ensure then -- from CHAIN
			at_first: not is_empty implies isfirst
		ensure then -- from EV_DYNAMIC_LIST
			empty_implies_after: is_empty implies after
	
feature -- Element change

	append (s: SEQUENCE [EV_MENU_ITEM])
			-- Append a copy of s.
			-- (from SEQUENCE)
		require -- from SEQUENCE
			argument_not_void: s /= void
		ensure -- from SEQUENCE
			new_count: count >= old count

	extend (v: like item)
			-- Add v to end. Do not move cursor.
			-- (from EV_DYNAMIC_LIST)
		require -- from EV_DYNAMIC_LIST
			not_destroyed: not is_destroyed
			extendible: extendible
			v_not_void: v /= void
			v_parent_void: v.parent = void
			v_not_current: not same (v)
			v_not_parent_of_current: not is_parent_recursive (v)
		ensure -- from EV_DYNAMIC_LIST
			parent_is_current: v.parent = Current
			v_is_last: v = last
			count_increased: count = old count + 1
			cursor_not_moved: (index = old index) or (after and old after)

	fill (other: CONTAINER [EV_MENU_ITEM])
			-- Fill with as many items of other as possible.
			-- The representations of other and current structure
			-- need not be the same.
			-- (from COLLECTION)
		require -- from COLLECTION
			other_not_void: other /= void
			extendible

	force (v: like item)
			-- Add v to end.
			-- (from SEQUENCE)
		require -- from SEQUENCE
			extendible: extendible
		ensure then -- from SEQUENCE
			new_count: count = old count + 1
			item_inserted: has (v)

	merge_left (other: like Current)
			-- Merge other into current structure before cursor
			-- position. Do not move cursor. Empty other.
			-- (from EV_DYNAMIC_LIST)
		require -- from DYNAMIC_CHAIN
			extendible: extendible
			not_before: not before
			other_exists: other /= void
		ensure -- from DYNAMIC_CHAIN
			new_count: count = old count + old other.count
			new_index: index = old index + old other.count
			other_is_empty: other.is_empty
		ensure then -- from DYNAMIC_LIST
			other_empty: other.is_empty

	merge_right (other: like Current)
			-- Merge other into current structure after cursor
			-- position. Do not move cursor. Empty other.
			-- (from EV_DYNAMIC_LIST)
		require -- from DYNAMIC_CHAIN
			extendible: extendible
			not_after: not after
			other_exists: other /= void
		ensure -- from DYNAMIC_CHAIN
			new_count: count = old count + old other.count
			same_index: index = old index
			other_is_empty: other.is_empty
		ensure then -- from DYNAMIC_LIST
			other_empty: other.is_empty

	put (v: like item)
			-- Replace current item by v.
			-- (Synonym for replace)
			-- (from CHAIN)
		require -- from COLLECTION
			extendible: extendible
		ensure -- from COLLECTION
			item_inserted: is_inserted (v)
		ensure then -- from SET
			in_set_already: old has (v) implies (count = old count)
			added_to_set: not old has (v) implies (count = old count + 1)
		ensure then -- from CHAIN
			same_count: count = old count

	put_front (v: like item)
			-- Add v at beginning. Do not move cursor.
			-- (from EV_DYNAMIC_LIST)
		require -- from EV_DYNAMIC_LIST
			not_destroyed: not is_destroyed
			extendible: extendible
			v_not_void: v /= void
			v_parent_void: v.parent = void
			v_not_current: not same (v)
			v_not_parent_of_current: not is_parent_recursive (v)
		ensure -- from EV_DYNAMIC_LIST
			parent_is_current: v.parent = Current
			v_is_first: v = first
			count_increased: count = old count + 1
			cursor_not_moved: (index = old index + 1) or (before and old before)

	put_i_th (v: like item; i: INTEGER)
			-- Replace item at i-th position by v.
			-- (from EV_DYNAMIC_LIST)
		require -- from EV_DYNAMIC_LIST
			not_destroyed: not is_destroyed
			valid_index: i > 0 and i <= count
			v_not_void: v /= void
			v_parent_void: v.parent = void
			v_not_current: not same (v)
			v_not_parent_of_current: not is_parent_recursive (v)
		ensure -- from EV_DYNAMIC_LIST
			parent_is_current: v.parent = Current
			item_replaced: v = i_th (i)
			not_has_old_item: not has (old i_th (i))
			old_item_parent_void: (old i_th (i)).parent = void
			count_same: count = old count
			cursor_not_moved: index = old index

	put_left (v: like item)
			-- Add v to the left of cursor position. Do not move cursor.
			-- (from EV_DYNAMIC_LIST)
		require -- from EV_DYNAMIC_LIST
			not_destroyed: not is_destroyed
			extendible: extendible
			not_before: not before
			v_not_void: v /= void
			v_parent_void: v.parent = void
			v_not_current: not same (v)
			v_not_parent_of_current: not is_parent_recursive (v)
		ensure -- from EV_DYNAMIC_LIST
			parent_is_current: v.parent = Current
			v_at_index_plus_one: v = i_th (index - 1)
			count_increased: count = old count + 1
			cursor_not_moved: index = old index + 1

	put_right (v: like item)
			-- Add v to right of cursor position. Do not move cursor.
			-- (from EV_DYNAMIC_LIST)
		require -- from EV_DYNAMIC_LIST
			not_destroyed: not is_destroyed
			extendible: extendible
			not_after: not after
			v_not_void: v /= void
			v_parent_void: v.parent = void
			v_not_current: not same (v)
			v_not_parent_of_current: not is_parent_recursive (v)
		ensure -- from EV_DYNAMIC_LIST
			parent_is_current: v.parent = Current
			v_at_index_plus_one: v = i_th (index + 1)
			count_increased: count = old count + 1
			cursor_not_moved: index = old index

	replace (v: like item)
			-- Replace current item by v.
			-- (from EV_DYNAMIC_LIST)
		require -- from EV_DYNAMIC_LIST
			not_destroyed: not is_destroyed
			writable: writable
			v_not_void: v /= void
			v_parent_void: v.parent = void
			v_not_current: not same (v)
			v_not_parent_of_current: not is_parent_recursive (v)
		ensure -- from EV_DYNAMIC_LIST
			parent_is_current: v.parent = Current
			item_replaced: v = item
			not_has_old_item: not has (old item)
			old_item_parent_void: (old item).parent = void
			count_same: count = old count
			cursor_not_moved: index = old index

	set_data (some_data: like data)
			-- Assign some_data to data.
			-- (from EV_ANY)
		require -- from EV_ANY
			not_destroyed: not is_destroyed
		ensure -- from EV_ANY
			data_assigned: data = some_data

	swap (i: INTEGER)
			-- Exchange_item at i-th position with item
			-- at cursor position.
			-- (from EV_DYNAMIC_LIST)
		require -- from CHAIN
			not_off: not off
			valid_index: valid_index (i)
		ensure -- from CHAIN
			swapped_to_item: item = old i_th (i)
			swapped_from_item: i_th (i) = old item
	
feature -- Removal

	prune (v: like item)
			-- Remove v if present. Do not move cursor, except if
			-- cursor was on v, move to right neighbor.
			-- (from EV_DYNAMIC_LIST)
		require -- from COLLECTION
			prunable: prunable
		ensure then -- from SET
			removed_count_change: old has (v) implies (count = old count - 1)
			not_removed_no_count_change: not old has (v) implies (count = old count)
			item_deleted: not has (v)
		ensure then -- from EV_DYNAMIC_LIST
			not_has_v: not has (v)
			had_item_implies_parent_void: old has (v) implies v.parent = void
			had_item_implies_count_decreased: old has (v) implies count = old count - 1
			had_item_and_was_after_implies_index_decreased: (old after and old has (v)) implies index = old index - 1

	prune_all (v: like item)
			-- Remove all occurrences of v.
			-- (Reference or object equality,
			-- based on object_comparison.)
			-- Leave structure exhausted.
			-- (from DYNAMIC_CHAIN)
		require -- from COLLECTION
			prunable
		ensure -- from COLLECTION
			no_more_occurrences: not has (v)
		ensure then -- from DYNAMIC_CHAIN
			is_exhausted: exhausted

	remove
			-- Remove current item. Move cursor to right neighbor.
			-- (or after if no right neighbor).
			-- (from EV_DYNAMIC_LIST)
		require -- from ACTIVE
			prunable: prunable
			writable: writable
		ensure then -- from DYNAMIC_LIST
			after_when_empty: is_empty implies after
		ensure then -- from EV_DYNAMIC_LIST
			v_removed: not has (old item)
			parent_void: (old item).parent = void
			count_decreased: count = old count - 1
			index_same: index = old index

	remove_left
			-- Remove item to left of cursor position.
			-- Do not move cursor.
			-- (from EV_DYNAMIC_LIST)
		require -- from DYNAMIC_CHAIN
			left_exists: index > 1
		require else -- from DYNAMIC_LIST
			not_before: not before
		ensure -- from DYNAMIC_CHAIN
			new_count: count = old count - 1
			new_index: index = old index - 1
		ensure then -- from EV_DYNAMIC_LIST
			left_neighbor_removed: not has (old i_th (index - 1))
			parent_void: (old i_th (index - 1)).parent = void
			index_decreased: index = old index - 1

	remove_right
			-- Remove item to right of cursor position.
			-- Do not move cursor.
			-- (from EV_DYNAMIC_LIST)
		require -- from DYNAMIC_CHAIN
			right_exists: index < count
		ensure -- from DYNAMIC_CHAIN
			new_count: count = old count - 1
			same_index: index = old index
		ensure then -- from EV_DYNAMIC_LIST
			right_neighbor_removed: not has (old i_th (index + 1))
			parent_void: (old i_th (index + 1)).parent = void
			index_same: index = old index

	wipe_out
			-- Remove all items.
			-- (from EV_DYNAMIC_LIST)
		require -- from COLLECTION
			prunable
		ensure -- from COLLECTION
			wiped_out: is_empty
		ensure then -- from DYNAMIC_LIST
			is_before: before
	
feature -- Conversion

	linear_representation: LINEAR [EV_MENU_ITEM]
			-- Representation as a linear structure
			-- (from LINEAR)
	
feature -- Duplication

	copy (other: like Current)
			-- Update current object using fields of object attached
			-- to other, so as to yield equal objects.
			-- (from EV_ANY)
		require -- from ANY
			other_not_void: other /= void
			type_identity: same_type (other)
		ensure -- from ANY
			is_equal: is_equal (other)
	
feature -- Implementation

	Changeable_comparison_criterion: BOOLEAN is False
			-- May object_comparison be changed?
			-- (Answer: no by default.
			-- (from EV_ITEM_LIST)
	
feature -- Command

	destroy
			-- Destroy underlying native toolkit object.
			-- Render Current unusable.
			-- (from EV_ANY)
		ensure -- from EV_ANY
			is_destroyed: is_destroyed
	
feature -- Contract support

	same (other: EV_ANY): BOOLEAN
			-- Is other Current?
			-- (from EV_DYNAMIC_LIST)
	
feature -- Event handling

	item_select_actions: EV_MENU_ITEM_SELECT_ACTION_SEQUENCE
			-- Actions to be performed when a menu item is selected.
			-- (from EV_MENU_ITEM_LIST_ACTION_SEQUENCES)
		ensure -- from EV_MENU_ITEM_LIST_ACTION_SEQUENCES
			not_void: Result /= void
	
feature -- Iteration

	do_all (action: PROCEDURE [ANY, TUPLE [EV_MENU_ITEM]])
			-- Apply action to every item.
			-- Semantics not guaranteed if action changes the structure;
			-- in such a case, apply iterator to clone of structure instead.
			-- (from LINEAR)
		require -- from TRAVERSABLE
			action_exists: action /= void

	do_if (action: PROCEDURE [ANY, TUPLE [EV_MENU_ITEM]]; test: FUNCTION [ANY, TUPLE [EV_MENU_ITEM], BOOLEAN])
			-- Apply action to every 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 LINEAR)
		require -- from TRAVERSABLE
			action_exists: action /= void
			test_exits: test /= void

	for_all (test: FUNCTION [ANY, TUPLE [EV_MENU_ITEM], BOOLEAN]): BOOLEAN
			-- Is test true for all items?
			-- (from LINEAR)
		require -- from TRAVERSABLE
			test_exits: test /= void

	there_exists (test: FUNCTION [ANY, TUPLE [EV_MENU_ITEM], BOOLEAN]): BOOLEAN
			-- Is test true for at least one item?
			-- (from LINEAR)
		require -- from TRAVERSABLE
			test_exits: test /= void
	
feature -- Status Report

	is_destroyed: BOOLEAN
			-- Is Current no longer usable?
			-- (from EV_ANY)
		ensure -- from EV_ANY
			bridge_ok: Result = implementation.is_destroyed
	
invariant

		-- from ANY
	reflexive_equality: standard_is_equal (Current)
	reflexive_conformance: conforms_to (Current)
		-- from EV_MENU_ITEM_LIST
	item_select_actions_not_void: is_usable implies item_select_actions /= void
		-- from EV_ITEM_LIST
	parent_of_items_is_current: is_usable implies parent_of_items_is_current
	items_unique: is_usable implies items_unique
		-- from EV_ANY
	is_initialized: is_initialized
	is_coupled: implementation /= void and then implementation.interface = Current
	default_create_called: default_create_called
		-- from LIST
	before_definition: before = (index = 0)
	after_definition: after = (index = count + 1)
		-- from CHAIN
	non_negative_index: index >= 0
	index_small_enough: index <= count + 1
	off_definition: off = ((index = 0) or (index = count + 1))
	isfirst_definition: isfirst = ((not is_empty) and (index = 1))
	islast_definition: islast = ((not is_empty) and (index = count))
	item_corresponds_to_index: (not off) implies (item = i_th (index))
	index_set_has_same_count: index_set.count = count
		-- from ACTIVE
	writable_constraint: writable implies readable
	empty_constraint: is_empty implies (not readable) and (not writable)
		-- from INDEXABLE
	index_set_not_void: index_set /= void
		-- from BILINEAR
	not_both: not (after and before)
	before_constraint: before implies off
		-- from LINEAR
	after_constraint: after implies off
		-- from TRAVERSABLE
	empty_constraint: is_empty implies off
		-- from FINITE
	empty_definition: is_empty = (count = 0)
	non_negative_count: count >= 0
		-- from DYNAMIC_CHAIN
	extendible: extendible

end -- class EV_MENU_BAR