#include <set.H>

Inheritance diagram for Designar::GenArraySet< Key, Cmp, ArraySetOp >:

Collaboration diagram for Designar::GenArraySet< Key, Cmp, ArraySetOp >:

[legend]

Classes
class	Iterator

Public Types
using	ItemType = Key

using	KeyType = Key

using	DataType = Key

using	ValueType = Key

using	SizeType = nat_t

Public Member Functions
	GenArraySet (nat_t cap, Cmp &_cmp)

	GenArraySet (Cmp &&_cmp=Cmp())

	GenArraySet (nat_t cap, Cmp &&_cmp=Cmp())

	GenArraySet (const GenArraySet &a)

	GenArraySet (GenArraySet &&a)

	GenArraySet (const std::initializer_list< Key > &)

GenArraySet &	operator= (const GenArraySet &a)

GenArraySet &	operator= (GenArraySet &&a)

void	swap (GenArraySet &a)

Cmp &	get_cmp ()

const Cmp &	get_cmp () const

bool	is_empty () const

nat_t	size () const

void	clear ()

Key *	append (const Key &k)

Key *	append (Key &&k)

Key *	append_dup (const Key &k)

Key *	append_dup (Key &&k)

Key *	search (const Key &item)

const Key *	search (const Key &item) const

Key &	find (const Key &item)

const Key &	find (const Key &item) const

bool	remove (const Key &item)

Key &	operator[] (nat_t i)

const Key &	operator[] (nat_t i) const

Iterator	begin ()

Iterator	begin () const

Iterator	end ()

Iterator	end () const

Public Member Functions inherited from Designar::ContainerAlgorithms< GenArraySet< Key, Cmp, ArraySetOp >, Key >
Key *	nth_ptr (nat_t i)

Key &	nth (nat_t i)

const Key &	nth (nat_t i) const

void	for_each (Op &op) const

void	for_each (Op &&op=Op()) const

ContainerRet	filter (Pred &pred) const

ContainerRet	filter (Pred &&pred=Pred()) const

ContainerRet	map (Op &op) const

ContainerRet	map (Op &&op=Op()) const

ContainerRet	map_if (Op &op, Pred &pred) const

ContainerRet	map_if (Op &op, Pred &&pred=Pred()) const

ContainerRet	map_if (Op &&op, Pred &pred) const

ContainerRet	map_if (Op &&op=Op(), Pred &&pred=Pred()) const

RetT	fold (const RetT &init_val, Op &op) const

RetT	fold (const RetT &init_val, Op &&op=Op()) const

RetT	fold (RetT &&init_val, Op &op) const

RetT	fold (RetT &&init_val, Op &&op=Op()) const

bool	all (Pred &pred) const

bool	all (Pred &&pred=Pred()) const

bool	exists (Pred &pred) const

bool	exists (Pred &&pred=Pred()) const

bool	none (Pred &pred) const

bool	none (Pred &&pred=Pred()) const

Key *	search_ptr (Pred &pred) const

Key *	search_ptr (Pred &&pred=Pred()) const

bool	remove_first_if (Pred &pred)

bool	remove_first_if (Pred &&pred=Pred())

void	remove_if (Pred &pred)

void	remove_if (Pred &&pred=Pred())

bool	equal (const ContainerType2 &c, Eq &eq) const

bool	equal (const ContainerType2 &c, Eq &&eq=Eq()) const

bool	is_sorted (Cmp &cmp) const

bool	is_sorted (Cmp &&cmp=Cmp()) const

SLList< std::pair< Key, typename ContainerType2::KeyType > >	zip (const ContainerType2 &c) const

SLList< std::pair< Key, typename ContainerType2::KeyType > >	zip_eq (const ContainerType2 &c) const

SLList< std::pair< Key, typename ContainerType2::KeyType > >	zip_left (const ContainerType2 &c) const

SLList< std::pair< Key, typename ContainerType2::KeyType > >	zip_right (const ContainerType2 &c) const

DynArray< Key >	to_array () const

SLList< Key >	to_list () const

Public Member Functions inherited from Designar::SetAlgorithms< GenArraySet< Key, Cmp, ArraySetOp >, Key >
bool	contains (const Key &k) const

bool	has (const Key &k) const

GenArraySet< Key, Cmp, ArraySetOp >	join (const GenArraySet< Key, Cmp, ArraySetOp > &s) const

GenArraySet< Key, Cmp, ArraySetOp >	intersect (const GenArraySet< Key, Cmp, ArraySetOp > &s) const

GenArraySet< Key, Cmp, ArraySetOp >	difference (const GenArraySet< Key, Cmp, ArraySetOp > &s) const

SLList< std::pair< Key, typename SetType2::KeyType > >	cartesian_product (const SetType2 &s) const