---
name: "__gnu_pbds::detail::binomial_heap_base"
section: "3cxx"
platform: "linux"
package: "libstdc++-12-doc"
version: "12.4.0-5"
release: "Debian 13 (Trixie)"
platforms: ["linux"]
url: "https://new.carta.tech/__gnu_pbds::detail::binomial_heap_base/3cxx"
---

# \_\_gnu\_pbds::detail::binomial\_heap\_base(3cxx)

Base class for binomial heap.

## NAME

\_\_gnu\_pbds::detail::binomial\_heap\_base\< Value\_Type, Cmp\_Fn, \_Alloc \> - Base class for binomial heap.

## SYNOPSIS

`#include <binomial_heap_base_.hpp>`

Inherits **\_\_gnu\_pbds::detail::left\_child\_next\_sibling\_heap\< Value\_Type, Cmp\_Fn, \_Alloc::size\_type, \_Alloc \>**.

Inherited by **\_\_gnu\_pbds::detail::binomial\_heap\< Value\_Type, Cmp\_Fn, \_Alloc \>**, and **\_\_gnu\_pbds::detail::rc\_binomial\_heap\< Value\_Type, Cmp\_Fn, \_Alloc \>**.

### Public Types

typedef \_Alloc **allocator\_type**\
 typedef Cmp\_Fn **cmp\_fn**\
 typedef **base\_type::const\_iterator** **const\_iterator**\
 typedef \_\_rebind\_v::const\_pointer **const\_pointer**\
 typedef \_\_rebind\_v::const\_reference **const\_reference**\
 typedef \_Alloc::difference\_type **difference\_type**\
 typedef **base\_type::iterator** **iterator**\
 typedef **base\_type::point\_const\_iterator** **point\_const\_iterator**\
 typedef **base\_type::point\_iterator** **point\_iterator**\
 typedef \_\_rebind\_v::pointer **pointer**\
 typedef \_\_rebind\_v::reference **reference**\
 typedef \_Alloc::size\_type **size\_type**\
 typedef Value\_Type **value\_type**\

### Public Member Functions

**iterator** **begin** ()\
 **const\_iterator** **begin** () const\
 void **clear** ()\
 bool **empty** () const\
 **iterator** **end** ()\
 **const\_iterator** **end** () const\
 void **erase** (**point\_iterator**)\
 template\<typename Pred \> size\_type **erase\_if** (Pred)\
 Cmp\_Fn & **get\_cmp\_fn** ()\
 const Cmp\_Fn & **get\_cmp\_fn** () const\
 void **join** (**binomial\_heap\_base**\< Value\_Type, Cmp\_Fn, \_Alloc \> &)\
 size\_type **max\_size** () const\
 void **modify** (**point\_iterator**, const\_reference)\
 void **pop** ()\
 **point\_iterator** **push** (const\_reference)\
 size\_type **size** () const\
 template\<typename Pred \> void **split** (Pred, **binomial\_heap\_base**\< Value\_Type, Cmp\_Fn, \_Alloc \> &)\
 void **swap** (**left\_child\_next\_sibling\_heap**\< Value\_Type, Cmp\_Fn, \_Alloc::size\_type, \_Alloc \> &)\
 const\_reference **top** () const\

### Protected Types

typedef **base\_type::node** **node**\
 typedef alloc\_traits::allocator\_type **node\_allocator**\
 typedef base\_type::node\_const\_pointer **node\_const\_pointer**\
 typedef \_Alloc::size\_type **node\_metadata**\
 typedef base\_type::node\_pointer **node\_pointer**\
 typedef **std::pair**\< node\_pointer, node\_pointer \> **node\_pointer\_pair**\

### Protected Member Functions

**binomial\_heap\_base** (const **binomial\_heap\_base**\< Value\_Type, Cmp\_Fn, \_Alloc \> &)\
 **binomial\_heap\_base** (const Cmp\_Fn &)\
 void **actual\_erase\_node** (node\_pointer)\
 void **bubble\_to\_top** (node\_pointer)\
 void **clear\_imp** (node\_pointer)\
 template\<typename It \> void **copy\_from\_range** (It, It)\
 void **find\_max** ()\
 node\_pointer **get\_new\_node\_for\_insert** (const\_reference)\
 node\_pointer **prune** (Pred)\
 void **swap** (**binomial\_heap\_base**\< Value\_Type, Cmp\_Fn, \_Alloc \> &)\
 void **swap\_with\_parent** (node\_pointer, node\_pointer)\
 void **to\_linked\_list** ()\
 void **value\_swap** (**left\_child\_next\_sibling\_heap** &)\

### Static Protected Member Functions

static void **make\_child\_of** (node\_pointer, node\_pointer)\
 static node\_pointer **parent** (node\_pointer)\

### Protected Attributes

node\_pointer **m\_p\_max**\
 node\_pointer **m\_p\_root**\
 size\_type **m\_size**\

## Detailed Description

### template\<typename Value\_Type, typename Cmp\_Fn, typename \_Alloc\>

class \_\_gnu\_pbds::detail::binomial\_heap\_base\< Value\_Type, Cmp\_Fn, \_Alloc \>"Base class for binomial heap.

## Author

Generated automatically by Doxygen for libstdc++ from the source code.
