cppcontainers1.0.4 package

'C++' Standard Template Library Containers

assign

Replace all elements

at

Access elements with bounds checking

back

Access last element

bucket_count

Get the number of buckets

capacity

Get container capacity

clear

Clear the container

contains

Check for elements

count

Count element frequency

cpp_deque

Create deque

cpp_forward_list

Create forward list

cpp_list

Create list

cpp_map

Create map

cpp_multimap

Create multimap

cpp_multiset

Create multiset

cpp_priority_queue

Create priority queue

cpp_queue

Create queue

cpp_set

Create set

cpp_stack

Create stack

cpp_unordered_map

Create unordered map

cpp_unordered_multimap

Create unordered multimap

cpp_unordered_multiset

Create unordered multiset

cpp_unordered_set

Create unordered set

cpp_vector

Create vector

emplace_after

Add an element

emplace_back

Add an element to the back

emplace_front

Add an element to the front

emplace

Add an element

empty

Check emptiness

equal

Check equality

erase_after

Erase elements

erase

Erase elements

flip

Toggle boolean values

front

Access first element

insert_after

Add elements

insert_or_assign

Add or overwrite elements

insert

Add elements

load_factor

Get the mean number of elements per bucket

max_bucket_count

Get the maximum number of buckets

max_load_factor

Get or set the maximum load factor

max_size

Get maximum container size

merge

Merge two objects

pop_back

Remove an element from the back

pop_front

Remove an element from the front

pop

Remove top element

print

Print container data

push_back

Add an element to the back

push_front

Add an element to the front

push

Add elements

rehash

Set minimum bucket count and rehash

remove.

Remove elements

reserve

Reserve space

resize

Alter the container size

reverse

Reverse element order

shrink_to_fit

Shrink container capacity to size

size

Get container size

sort

Sort elements

sorting

Print the sorting order

splice_after

Move elements

splice

Move elements

sub

Access or insert elements without bounds checking

to_r

Export data to R

top

Access top element

try_emplace

Add an element

type

Get data type

unique

Delete consecutive duplicates

Use 'C++' Standard Template Library containers interactively in R. Includes sets, unordered sets, multisets, unordered multisets, maps, unordered maps, multimaps, unordered multimaps, stacks, queues, priority queues, vectors, deques, forward lists, and lists.

  • Maintainer: Christian Düben
  • License: MIT + file LICENSE
  • Last published: 2025-01-15