bitdeque::insert

insert overloads

Synopses

Declared in <util/bitdeque.h>

Insert a single bit before the given position.

iterator
insert(
    const_iterator pos,
    bool val);

Insert count copies of a bit before the given position.

iterator
insert(
    const_iterator pos,
    size_type count,
    bool val);

Insert the bits in [first,last) before the given position.]

template<typename It>
iterator
insert(
    const_iterator pos,
    It first,
    It last);

Name

Description

pos

Iterator before which the bit is inserted.

val

Value of the inserted bit.

count

Number of bits to insert.

first

Iterator to the first bit to insert.

last

Iterator past the last bit to insert.

Created with MrDocs