#include <pointer-set.h>
Data Fields | |
| size_t | log_slots |
| size_t | n_slots |
| size_t | n_elements |
| const void ** | slots |
Detailed Description
Set operations on pointers Copyright (C) 2004-2013 Free Software Foundation, Inc.
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3, or (at your option) any later version.
GCC 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 General Public License for more details.
You should have received a copy of the GNU General Public License along with GCC; see the file COPYING3. If not see http://www.gnu.org/licenses/. A pointer set is represented as a simple open-addressing hash table. Simplifications: The hash code is based on the value of the pointer, not what it points to. The number of buckets is always a power of 2. Null pointers are a reserved value. Deletion is not supported (yet). There is no mechanism for user control of hash function, equality comparison, initial size, or resizing policy.
Field Documentation
| size_t pointer_set_t::log_slots |
Referenced by pointer_map_contains(), and pointer_set_insert().
| size_t pointer_set_t::n_elements |
Referenced by pointer_map_contains(), and pointer_set_contains().
| size_t pointer_set_t::n_slots |
Referenced by pointer_map_contains(), pointer_set_contains(), pointer_set_insert(), and pointer_set_lookup().
| const void** pointer_set_t::slots |
Referenced by pointer_map_contains(), pointer_set_insert(), and pointer_set_lookup().
The documentation for this struct was generated from the following file:
