Data Fields | |
| struct et_node * | of |
| struct et_occ * | parent |
| struct et_occ * | prev |
| struct et_occ * | next |
| int | depth |
| int | min |
| struct et_occ * | min_occ |
Detailed Description
@verbatim
ET-trees data structure implementation. Contributed by Pavel Nejedly Copyright (C) 2002-2013 Free Software Foundation, Inc.
This file is part of the libiberty library. Libiberty is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version.
Libiberty is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for more details.
You should have received a copy of the GNU Library General Public License along with libiberty; see the file COPYING3. If not see http://www.gnu.org/licenses/.
The ET-forest structure is described in: D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. J. G'omput. System Sci., 26(3):362 381, 1983.
We do not enable this with ENABLE_CHECKING, since it is awfully slow.
The occurrence of a node in the et tree.
Field Documentation
| int et_occ::depth |
Referenced by et_check_tree_sanity(), et_recomp_min(), and record_path_before().
| int et_occ::min |
Referenced by et_recomp_min(), and et_splay().
| struct et_occ* et_occ::min_occ |
Referenced by et_recomp_min(), and et_splay().
| struct et_occ* et_occ::next |
Referenced by et_check_occ_sanity(), et_splay(), and record_path_before().
| struct et_node* et_occ::of |
Referenced by record_path_before().
| struct et_occ* et_occ::parent |
Referenced by et_check_occ_sanity(), et_check_sanity(), and et_splay().
| struct et_occ* et_occ::prev |
Referenced by check_path_after_1(), and et_splay().
The documentation for this struct was generated from the following file:
