Collaboration diagram for et_occ:

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

ET-trees data structure implementation.
   Contributed by Pavel Nejedly
   Copyright (C) 2002-2024 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 CHECKING_P, since it is awfully slow.

The occurrence of a node in the et tree.

Field Documentation

◆ depth

int et_occ::depth

Referenced by et_set_father(), and et_splay().

◆ min

int et_occ::min

Referenced by et_set_father(), and et_splay().

◆ min_occ

struct et_occ* et_occ::min_occ

Referenced by et_splay().

◆ next

struct et_occ* et_occ::next

Referenced by et_below(), and et_splay().

◆ of

struct et_node* et_occ::of

◆ parent

struct et_occ* et_occ::parent

Referenced by et_below(), et_nca(), et_splay(), set_next(), and set_prev().

◆ prev

struct et_occ* et_occ::prev