#include <BLI_set.hh>

Classes
class	Iterator

Public Types
using	value_type = Key

using	pointer = Key *

using	const_pointer = const Key *

using	reference = Key &

using	const_reference = const Key &

using	iterator = Iterator

using	size_type = int64_t

Public Member Functions
	Set (Allocator allocator={}) noexcept

	Set (NoExceptConstructor, Allocator allocator={}) noexcept

	Set (Span< Key > values, Allocator allocator={})

	Set (const std::initializer_list< Key > &values)

	~Set ()=default

	Set (const Set &other)=default

	Set (Set &&other) noexcept(std::is_nothrow_move_constructible_v< SlotArray >)

Set &	operator= (const Set &other)

Set &	operator= (Set &&other)

void	add_new (const Key &key)

void	add_new (Key &&key)

bool	add (const Key &key)

bool	add (Key &&key)

template<typename ForwardKey >
bool	add_as (ForwardKey &&key)

void	add_multiple (Span< Key > keys)

void	add_multiple_new (Span< Key > keys)

bool	contains (const Key &key) const

template<typename ForwardKey >
bool	contains_as (const ForwardKey &key) const

const Key &	lookup_key (const Key &key) const

template<typename ForwardKey >
const Key &	lookup_key_as (const ForwardKey &key) const

const Key &	lookup_key_default (const Key &key, const Key &default_value) const

template<typename ForwardKey >
const Key &	lookup_key_default_as (const ForwardKey &key, const Key &default_key) const

const Key *	lookup_key_ptr (const Key &key) const

template<typename ForwardKey >
const Key *	lookup_key_ptr_as (const ForwardKey &key) const

const Key &	lookup_key_or_add (const Key &key)

const Key &	lookup_key_or_add (Key &&key)

template<typename ForwardKey >
const Key &	lookup_key_or_add_as (ForwardKey &&key)

bool	remove (const Key &key)

template<typename ForwardKey >
bool	remove_as (const ForwardKey &key)

void	remove_contained (const Key &key)

template<typename ForwardKey >
void	remove_contained_as (const ForwardKey &key)

Iterator	begin () const

Iterator	end () const

void	print_stats (StringRef name="") const

int64_t	count_collisions (const Key &key) const

void	clear ()

void	rehash ()

int64_t	size () const

bool	is_empty () const

int64_t	capacity () const

int64_t	removed_amount () const

int64_t	size_per_element () const

int64_t	size_in_bytes () const

void	reserve (const int64_t n)

Static Public Member Functions
static bool	Intersects (const Set &a, const Set &b)

static bool	Disjoint (const Set &a, const Set &b)

Detailed Description

template<typename Key, int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>
class blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >

Definition at line 121 of file BLI_set.hh.

Member Typedef Documentation

◆ const_pointer

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

using blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::const_pointer = const Key *

Definition at line 126 of file BLI_set.hh.

◆ const_reference

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

using blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::const_reference = const Key &

Definition at line 128 of file BLI_set.hh.

◆ iterator

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

using blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::iterator = Iterator

Definition at line 129 of file BLI_set.hh.

◆ pointer

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

using blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::pointer = Key *

Definition at line 125 of file BLI_set.hh.

◆ reference

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

using blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::reference = Key &

Definition at line 127 of file BLI_set.hh.

◆ size_type

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

using blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::size_type = int64_t

Definition at line 130 of file BLI_set.hh.

◆ value_type

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

using blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::value_type = Key

Definition at line 124 of file BLI_set.hh.

Constructor & Destructor Documentation

◆ Set() [1/6]

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::Set ( Allocator allocator = {} )

inlinenoexcept

Initialize an empty set. This is a cheap operation no matter how large the inline buffer is. This is necessary to avoid a high cost when no elements are added at all. An optimized grow operation is performed on the first insertion.

Definition at line 183 of file BLI_set.hh.

Referenced by blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::clear().

◆ Set() [2/6]

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::Set	(	NoExceptConstructor	,
		Allocator	allocator = `{}`
	)

inlinenoexcept

Definition at line 192 of file BLI_set.hh.

◆ Set() [3/6]

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::Set	(	Span< Key >	values,
		Allocator	allocator = `{}`
	)

inline

Definition at line 196 of file BLI_set.hh.

◆ Set() [4/6]

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::Set ( const std::initializer_list< Key > & values )

inline

Construct a set that contains the given keys. Duplicates will be removed automatically.

Definition at line 204 of file BLI_set.hh.

◆ ~Set()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::~Set ( )

default

Referenced by blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::clear().

◆ Set() [5/6]

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::Set ( const Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator > & other )

default

◆ Set() [6/6]

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::Set ( Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator > && other )

inlinenoexcept

Definition at line 212 of file BLI_set.hh.

Member Function Documentation

◆ add() [1/2]

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

bool blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::add ( const Key & key )

inline

Add a key to the set. If the key exists in the set already, nothing is done. The return value is true if the key was newly added to the set.

This is similar to std::unordered_set::insert.

Definition at line 267 of file BLI_set.hh.

References blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::add_as().

Referenced by blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::add_multiple(), addIdsUsedBySocket(), GeometryComponent::attribute_foreach(), GeometryComponent::attribute_names(), blender::nodes::find_all_attribute_names(), blender::fn::MFNetwork::find_dependencies(), find_used_ids_from_nodes(), generate_unique_instance_ids(), blender::deg::is_reachable(), blender::tests::TEST(), and update_visible_columns().

◆ add() [2/2]

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

bool blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::add ( Key && key )

inline

Definition at line 271 of file BLI_set.hh.

References blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::add_as().

◆ add_as()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

template<typename ForwardKey >

bool blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::add_as ( ForwardKey && key )

inline

Definition at line 275 of file BLI_set.hh.

Referenced by blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::add(), BKE_nodetree_attribute_hint_add(), and blender::tests::TEST().

◆ add_multiple()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

void blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::add_multiple ( Span< Key > keys )

inline

Convenience function to add many keys to the set at once. Duplicates are removed automatically.

We might be able to make this faster than sequentially adding all keys, but that is not implemented yet.

Definition at line 287 of file BLI_set.hh.

References blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::add().

◆ add_multiple_new()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

void blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::add_multiple_new ( Span< Key > keys )

inline

Convenience function to add many new keys to the set at once. The keys must not exist in the set before and there must not be duplicates in the array.

Definition at line 298 of file BLI_set.hh.

References blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::add_new().

◆ add_new() [1/2]

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

void blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::add_new ( const Key & key )

inline

Add a new key to the set. This invokes undefined behavior when the key is in the set already. When you know for certain that a key is not in the set yet, use this method for better performance. This also expresses the intent better.

Definition at line 252 of file BLI_set.hh.

Referenced by blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::add_multiple_new(), GeometryComponent::attribute_foreach(), and blender::tests::TEST().

◆ add_new() [2/2]

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

void blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::add_new ( Key && key )

inline

Definition at line 256 of file BLI_set.hh.

◆ begin()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

Iterator blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::begin ( ) const

inline

Definition at line 472 of file BLI_set.hh.

References blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::end().

Referenced by blender::tests::TEST().

◆ capacity()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

int64_t blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::capacity ( ) const

inline

Returns the number of available slots. This is mostly for debugging purposes.

Definition at line 542 of file BLI_set.hh.

◆ clear()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

void blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::clear ( )

inline

Remove all elements from the set.

Definition at line 508 of file BLI_set.hh.

References blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::Set(), and blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::~Set().

Referenced by blender::tests::TEST().

◆ contains()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

bool blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::contains ( const Key & key ) const

inline

Returns true if the key is in the set.

This is similar to std::unordered_set::find() != std::unordered_set::end().

Definition at line 310 of file BLI_set.hh.

References blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::contains_as().

Referenced by attribute_search_update_fn(), blender::bke::geometry_set_gather_instances_attribute_info(), blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::Intersects(), and blender::tests::TEST().

◆ contains_as()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

template<typename ForwardKey >

bool blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::contains_as ( const ForwardKey & key ) const

inline

Definition at line 314 of file BLI_set.hh.

Referenced by blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::contains(), and blender::tests::TEST().

◆ count_collisions()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

int64_t blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::count_collisions ( const Key & key ) const

inline

Get the number of collisions that the probing strategy has to go through to find the key or determine that it is not in the set.

Definition at line 500 of file BLI_set.hh.

◆ Disjoint()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

static bool blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::Disjoint	(	const Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator > &	a,
		const Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator > &	b
	)

inlinestatic

Returns true if no key from a is also in b and vice versa.

Definition at line 604 of file BLI_set.hh.

References Freestyle::a, and blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::Intersects().

◆ end()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

Iterator blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::end ( ) const

inline

Definition at line 482 of file BLI_set.hh.

Referenced by blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::begin(), and blender::tests::TEST().

◆ Intersects()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

static bool blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::Intersects	(	const Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator > &	a,
		const Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator > &	b
	)

inlinestatic

Returns true if there is a key that exists in both sets.

Definition at line 586 of file BLI_set.hh.

References Freestyle::a, blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::contains(), and blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::size().

Referenced by blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::Disjoint(), and blender::deg::RootPChanMap::has_common_root().

◆ is_empty()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

bool blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::is_empty ( ) const

inline

Returns true if no keys are stored.

Definition at line 534 of file BLI_set.hh.

Referenced by blender::tests::TEST(), and blender::gpu::GLContext::~GLContext().

◆ lookup_key()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

const Key& blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::lookup_key ( const Key & key ) const

inline

Returns the key that is stored in the set that compares equal to the given key. This invokes undefined behavior when the key is not in the set.

Definition at line 323 of file BLI_set.hh.

References blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::lookup_key_as().

Referenced by blender::tests::TEST().

◆ lookup_key_as()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

template<typename ForwardKey >

const Key& blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::lookup_key_as ( const ForwardKey & key ) const

inline

Definition at line 327 of file BLI_set.hh.

Referenced by blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::lookup_key().

◆ lookup_key_default()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

const Key& blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::lookup_key_default	(	const Key &	key,
		const Key &	default_value
	)		const

inline

Returns the key that is stored in the set that compares equal to the given key. If the key is not in the set, the given default value is returned instead.

Definition at line 336 of file BLI_set.hh.

References blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::lookup_key_default_as().

Referenced by blender::tests::TEST().

◆ lookup_key_default_as()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

template<typename ForwardKey >

const Key& blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::lookup_key_default_as	(	const ForwardKey &	key,
		const Key &	default_key
	)		const

inline

Definition at line 341 of file BLI_set.hh.

References ptr.

Referenced by blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::lookup_key_default().

◆ lookup_key_or_add() [1/2]

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

const Key& blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::lookup_key_or_add ( const Key & key )

inline

Returns the key in the set that compares equal to the given key. If it does not exist, the key is newly added.

Definition at line 367 of file BLI_set.hh.

References blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::lookup_key_or_add_as().

Referenced by blender::tests::TEST().

◆ lookup_key_or_add() [2/2]

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

const Key& blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::lookup_key_or_add ( Key && key )

inline

Definition at line 371 of file BLI_set.hh.

References blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::lookup_key_or_add_as().

◆ lookup_key_or_add_as()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

template<typename ForwardKey >

const Key& blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::lookup_key_or_add_as ( ForwardKey && key )

inline

Definition at line 375 of file BLI_set.hh.

Referenced by blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::lookup_key_or_add().

◆ lookup_key_ptr()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

const Key* blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::lookup_key_ptr ( const Key & key ) const

inline

Returns a pointer to the key that is stored in the set that compares equal to the given key. If the key is not in the set, nullptr is returned instead.

Definition at line 354 of file BLI_set.hh.

References blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::lookup_key_ptr_as().

Referenced by blender::tests::TEST().

◆ lookup_key_ptr_as()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

template<typename ForwardKey >

const Key* blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::lookup_key_ptr_as ( const ForwardKey & key ) const

inline

Definition at line 358 of file BLI_set.hh.

Referenced by blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::lookup_key_ptr().

◆ operator=() [1/2]

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

Set& blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::operator= ( const Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator > & other )

inline

Definition at line 237 of file BLI_set.hh.

References blender::copy_assign_container().

◆ operator=() [2/2]

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

Set& blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::operator= ( Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator > && other )

inline

Definition at line 242 of file BLI_set.hh.

References blender::move_assign_container().

◆ print_stats()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

void blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::print_stats ( StringRef name = "" ) const

inline

Print common statistics like size and collision count. This is useful for debugging purposes.

Definition at line 490 of file BLI_set.hh.

References blender::HashTableStats::print().

◆ rehash()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

void blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::rehash ( )

inline

Creates a new slot array and reinserts all keys inside of that. This method can be used to get rid of removed slots. Also this is useful for benchmarking the grow function.

Definition at line 518 of file BLI_set.hh.

References blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::size().

◆ remove()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

bool blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::remove ( const Key & key )

inline

Deletes the key from the set. Returns true when the key did exist beforehand, otherwise false.

This is similar to std::unordered_set::erase.

Definition at line 385 of file BLI_set.hh.

References blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::remove_as().

Referenced by blender::tests::TEST().

◆ remove_as()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

template<typename ForwardKey >

bool blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::remove_as ( const ForwardKey & key )

inline

Definition at line 389 of file BLI_set.hh.

Referenced by blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::remove(), and blender::tests::TEST().

◆ remove_contained()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

void blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::remove_contained ( const Key & key )

inline

Deletes the key from the set. This invokes undefined behavior when the key is not in the map.

Definition at line 397 of file BLI_set.hh.

References blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::remove_contained_as().

Referenced by blender::tests::TEST().

◆ remove_contained_as()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

template<typename ForwardKey >

void blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::remove_contained_as ( const ForwardKey & key )

inline

Definition at line 401 of file BLI_set.hh.

Referenced by blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::remove_contained(), and blender::tests::TEST().

◆ removed_amount()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

int64_t blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::removed_amount ( ) const

inline

Returns the amount of removed slots in the set. This is mostly for debugging purposes.

Definition at line 550 of file BLI_set.hh.

◆ reserve()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

void blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::reserve ( const int64_t n )

inline

Potentially resize the set such that it can hold the specified number of keys without another grow operation.

Definition at line 576 of file BLI_set.hh.

Referenced by generate_unique_instance_ids().

◆ size()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

int64_t blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::size ( ) const

inline

Returns the number of keys stored in the set.

Definition at line 526 of file BLI_set.hh.

Referenced by blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::Intersects(), blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::rehash(), and blender::tests::TEST().

◆ size_in_bytes()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

int64_t blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::size_in_bytes ( ) const

inline

Returns the approximate memory requirements of the set in bytes. This is more correct for larger sets.

Definition at line 567 of file BLI_set.hh.

◆ size_per_element()

template<typename Key , int64_t InlineBufferCapacity = default_inline_buffer_capacity(sizeof(Key)), typename ProbingStrategy = DefaultProbingStrategy, typename Hash = DefaultHash<Key>, typename IsEqual = DefaultEquality, typename Slot = typename DefaultSetSlot<Key>::type, typename Allocator = GuardedAllocator>

int64_t blender::Set< Key, InlineBufferCapacity, ProbingStrategy, Hash, IsEqual, Slot, Allocator >::size_per_element ( ) const

inline

Returns the bytes required per element. This is mostly for debugging purposes.

Definition at line 558 of file BLI_set.hh.

The documentation for this class was generated from the following file:

BLI_set.hh

Classes

Public Types

Public Member Functions

Static Public Member Functions

Detailed Description

Member Typedef Documentation

◆ const_pointer

◆ const_reference

◆ iterator

◆ pointer

◆ reference

◆ size_type

◆ value_type

Constructor & Destructor Documentation

◆ Set() [1/6]

◆ Set() [2/6]

◆ Set() [3/6]

◆ Set() [4/6]

◆ ~Set()

◆ Set() [5/6]

◆ Set() [6/6]

Member Function Documentation

◆ add() [1/2]

◆ add() [2/2]

◆ add_as()

◆ add_multiple()

◆ add_multiple_new()

◆ add_new() [1/2]

◆ add_new() [2/2]

◆ begin()

◆ capacity()

◆ clear()

◆ contains()

◆ contains_as()

◆ count_collisions()

◆ Disjoint()

◆ end()

◆ Intersects()

◆ is_empty()

◆ lookup_key()

◆ lookup_key_as()

◆ lookup_key_default()

◆ lookup_key_default_as()

◆ lookup_key_or_add() [1/2]

◆ lookup_key_or_add() [2/2]

◆ lookup_key_or_add_as()

◆ lookup_key_ptr()

◆ lookup_key_ptr_as()

◆ operator=() [1/2]

◆ operator=() [2/2]

◆ print_stats()

◆ rehash()

◆ remove()

◆ remove_as()

◆ remove_contained()

◆ remove_contained_as()

◆ removed_amount()

◆ reserve()

◆ size()

◆ size_in_bytes()

◆ size_per_element()