Automatic generation produced by ISE Eiffel
indexing description: "Trees, without commitment to a particular representation" status: "See notice at end of class" names: tree access: cursor, membership representation: recursive contents: generic date: "$Date: 2001-11-16 20:32:23 +0000 (Fri, 16 Nov 2001) $" revision: "$Revision: 51435 $" deferred class interface TREE [G] feature -- Access parent: TREE [G] -- Parent of current node child: like parent -- Current child node require readable: readable_child item: G -- Item in current node child_item: like item -- Item in current child node require readable: child_readable child_cursor: CURSOR -- Current cursor position child_index: INTEGER -- Index of current child ensure valid_index: Result >= 0 and Result <= arity + 1 first_child: like parent -- Leftmost child require is_not_leaf: not is_leaf last_child: like first_child -- Right most child require is_not_leaf: not is_leaf left_sibling: like parent -- Left neighbor (if any) require is_not_root: not is_root ensure is_sibling: Result /= void implies is_sibling (Result) right_is_current: (Result /= void) implies (Result.right_sibling = Current) right_sibling: like parent -- Right neighbor (if any) require is_not_root: not is_root ensure is_sibling: Result /= void implies is_sibling (Result) left_is_current: (Result /= void) implies (Result.left_sibling = Current) feature -- Measurement arity: INTEGER -- Number of children child_capacity: INTEGER -- Maximal number of children count: INTEGER -- Number of items feature -- Comparison is_equal (other: like Current): BOOLEAN -- Does other contain the same elements? -- (Reference or object equality, -- based on object_comparison.) feature -- Status report Readable: BOOLEAN is True child_readable: BOOLEAN -- Is there a current child_item to be read? readable_child: BOOLEAN -- Is there a current child to be read? Writable: BOOLEAN is True -- Is there a current item that may be modified? child_writable: BOOLEAN -- Is there a current child_item that may be modified? writable_child: BOOLEAN -- Is there a current child that may be modified? child_off: BOOLEAN -- Is there no current child? child_before: BOOLEAN -- Is there no valid child position to the left of cursor? child_after: BOOLEAN -- Is there no valid child position to the right of cursor? is_empty: BOOLEAN -- Is structure empty of items? is_leaf: BOOLEAN -- Are there no children? is_root: BOOLEAN -- Is there no parent? child_isfirst: BOOLEAN -- Is cursor under first child? ensure not_is_leaf: Result implies not is_leaf child_islast: BOOLEAN -- Is cursor under last child? ensure not_is_leaf: Result implies not is_leaf valid_cursor_index (i: INTEGER): BOOLEAN -- Is i correctly bounded for cursor movement? ensure valid_cursor_index_definition: Result = (i >= 0) and (i <= child_capacity + 1) has (v: G): BOOLEAN -- Does subtree include v? -- (Reference or object equality, -- based on object_comparison.) is_sibling (other: like parent): BOOLEAN -- Are current node and other siblings? require other_exists: other /= void ensure not_root: Result implies not is_root other_not_root: Result implies not other.is_root same_parent: Result = not is_root and other.parent = parent feature -- Cursor movement child_go_to (p: CURSOR) -- Move cursor to position p. child_start -- Move cursor to first child. ensure then is_first_child: not is_leaf implies child_isfirst child_finish -- Move cursor to last child. ensure then is_last_child: not is_leaf implies child_islast child_forth -- Move cursor to next child. child_back -- Move cursor to previous child. child_go_i_th (i: INTEGER) -- Move cursor to i-th child. require else valid_cursor_index: valid_cursor_index (i) ensure then position: child_index = i feature -- Element change sprout -- Make current node a root. put (v: like item) -- Replace element at cursor position by v. -- Was declared in TREE as synonym of replace. require is_writable: writable ensure item_inserted: item = v replace (v: like item) -- Replace element at cursor position by v. -- Was declared in TREE as synonym of put. require is_writable: writable ensure item_inserted: item = v child_put (v: like item) -- Put v at current child position. -- Was declared in TREE as synonym of child_replace. require child_writable: child_writable ensure item_inserted: child_item = v child_replace (v: like item) -- Put v at current child position. -- Was declared in TREE as synonym of child_put. require child_writable: child_writable ensure item_inserted: child_item = v replace_child (n: like parent) -- Put n at current child position. require writable_child: writable_child was_root: n.is_root ensure child_replaced: child = n prune (n: like parent) -- Remove n from the children. require is_child: n.parent = Current ensure n_is_root: n.is_root fill (other: TREE [G]) -- Fill with as many items of other as possible. -- The representations of other and current node -- need not be the same. feature -- Conversion linear_representation: LINEAR [G] -- Representation as a linear structure binary_representation: BINARY_TREE [G] -- Convert to binary tree representation: -- first child becomes left child, -- right sibling becomes right child. ensure result_is_root: Result.is_root result_has_no_right_child: not Result.has_right feature -- Duplication duplicate (n: INTEGER): like Current -- Copy of sub-tree beginning at cursor position and -- having min (n, arity - child_index + 1) -- children. require not_child_off: not child_off valid_sublist: n >= 0 invariant leaf_definition: is_leaf = (arity = 0) child_off_definition: child_off = child_before or child_after child_before_definition: child_before = (child_index = 0) child_isfirst_definition: child_isfirst = (not is_leaf and child_index = 1) child_islast_definition: child_islast = (not is_leaf and child_index = child_capacity) child_after_definition: child_after = (child_index >= child_capacity + 1) child_consistency: child_readable implies child.parent = Current indexing library: "[ EiffelBase: Library of reusable components for Eiffel. ]" status: "[ Copyright 1986-2001 Interactive Software Engineering (ISE). For ISE customers the original versions are an ISE product covered by the ISE Eiffel license and support agreements. ]" license: "[ EiffelBase may now be used by anyone as FREE SOFTWARE to develop any product, public-domain or commercial, without payment to ISE, under the terms of the ISE Free Eiffel Library License (IFELL) at http://eiffel.com/products/base/license.html. ]" source: "[ Interactive Software Engineering Inc. ISE Building 360 Storke Road, Goleta, CA 93117 USA Telephone 805-685-1006, Fax 805-685-6869 Electronic mail <info@eiffel.com> Customer support http://support.eiffel.com ]" info: "[ For latest info see award-winning pages: http://eiffel.com ]" end -- class TREE -- Generated by ISE Eiffel --
For more details: www.eiffel.com