Stroika Library 3.0d16
 
Loading...
Searching...
No Matches
KeyedCollection_stdhashset.inl
1/*
2 * Copyright(c) Sophist Solutions, Inc. 1990-2025. All rights reserved
3 */
4#include "Stroika/Foundation/Common/Concepts.h"
6#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
9
11
12 /*
13 ********************************************************************************
14 ********** KeyedCollection_stdhashset<T, KEY_TYPE, TRAITS>::Rep_ ***************
15 ********************************************************************************
16 */
17 template <typename T, typename KEY_TYPE, typename TRAITS>
18 template <typename KEY_HASH, typename KEY_EQUALS_COMPARER>
19 class KeyedCollection_stdhashset<T, KEY_TYPE, TRAITS>::Rep_
20 : public IImplRepBase_,
21 public Memory::UseBlockAllocationIfAppropriate<Rep_<KEY_HASH, KEY_EQUALS_COMPARER>> {
22 public:
23 static_assert (not is_reference_v<KEY_HASH>);
24 static_assert (not is_reference_v<KEY_EQUALS_COMPARER>);
25
26 private:
27 using inherited = IImplRepBase_;
28
29 private:
30 // these are stored inside fData_ (often zero sized so no matter) - but if not zero sized - @todo just re-use the space inside fData_
31 [[no_unique_address]] const KeyExtractorType fKeyExtractor_;
32 [[no_unique_address]] const ElementHash<KEY_HASH> fElementHasher_;
33 [[no_unique_address]] const ElementEqualsComparer<KEY_EQUALS_COMPARER> fElementComparer_;
34
35 public:
36 Rep_ (const KeyExtractorType& keyExtractor, const KEY_HASH& keyHash, const KEY_EQUALS_COMPARER& keyEqualsComparer)
37 : fKeyExtractor_{keyExtractor}
38 , fElementHasher_{keyExtractor, keyHash}
39 , fElementComparer_{keyExtractor, keyEqualsComparer}
40 , fData_{11u, fElementHasher_, fElementComparer_}
41 {
42 }
43 Rep_ (const Rep_& from) = default;
44
45 public:
46 nonvirtual Rep_& operator= (const Rep_&) = delete;
47
48 // Iterable<T>::_IRep overrides
49 public:
50 virtual shared_ptr<typename Iterable<T>::_IRep> Clone () const override
51 {
53 return Memory::MakeSharedPtr<Rep_> (*this);
54 }
55 virtual Iterator<value_type> MakeIterator () const override
56 {
58 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
59 }
60 virtual size_t size () const override
61 {
63 return fData_.size ();
64 }
65 virtual bool empty () const override
66 {
68 return fData_.empty ();
69 }
70 virtual void Apply (const function<void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]] Execution::SequencePolicy seq) const override
71 {
73 fData_.Apply (doToElement);
74 }
75 virtual Iterator<T> Find (const function<bool (ArgByValueType<value_type> item)>& that, Execution::SequencePolicy seq) const override
76 {
78 return this->inherited::Find (that, seq); // @todo rewrite to use fData
79 }
80 virtual Iterator<value_type> Find_equal_to (const ArgByValueType<value_type>& v, [[maybe_unused]] Execution::SequencePolicy seq) const override
81 {
82 // if doing a find by 'equals-to' - we already have this indexed
83 auto found = fData_.find (v);
84 Ensure ((found == fData_.end () and this->inherited::Find_equal_to (v, seq) == Iterator<value_type>{nullptr}) or
85 (found == Debug::UncheckedDynamicCast<const IteratorRep_&> (this->inherited::Find_equal_to (v, seq).ConstGetRep ())
86 .fIterator.GetUnderlyingIteratorRep ()));
87 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, found)};
88 }
89
90 // KeyedCollection<T, KEY_TYPE, TRAITS>::_IRep overrides
91 public:
92 virtual KeyExtractorType GetKeyExtractor () const override
93 {
95 return fKeyExtractor_;
96 }
97 virtual KeyEqualityComparerType GetKeyEqualityComparer () const override
98 {
100 return fElementComparer_.fKeyComparer;
101 }
102 virtual shared_ptr<typename KeyedCollection<T, KEY_TYPE, TRAITS>::_IRep> CloneEmpty () const override
103 {
105 return Memory::MakeSharedPtr<Rep_> (this->fKeyExtractor_, this->fElementHasher_.fKeyHasher, this->fElementComparer_.fKeyComparer); // lose data but keep compare/extractor functions
106 }
107 virtual shared_ptr<typename KeyedCollection<T, KEY_TYPE, TRAITS>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
108 {
109 RequireNotNull (i);
111 auto result = Memory::MakeSharedPtr<Rep_> (*this);
112 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
113 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
114 i->Refresh (); // reflect updated rep
115 return result;
116 }
117 virtual bool Lookup (ArgByValueType<KeyType> key, optional<value_type>* item) const override
118 {
120 auto i = fData_.find (key);
121 if (i == fData_.end ()) {
122 if (item != nullptr) {
123 *item = nullopt;
124 }
125 return false;
126 }
127 else {
128 if (item != nullptr) {
129 *item = *i;
130 }
131 return true;
132 }
133 return false;
134 }
135 virtual bool Add (ArgByValueType<value_type> item) override
136 {
138 pair<typename DataStructureImplType_::iterator, bool> flagAndI = fData_.insert (item);
139 if (flagAndI.second) {
140 return true;
141 }
142 else {
143 // @todo must patch!!!
144 // in case of update, set<> wont update the value so we must remove and re-add, but todo that, use previous iterator as hint
145 typename DataStructureImplType_::iterator hint = flagAndI.first;
146 ++hint;
147 fData_.erase (flagAndI.first);
148 fData_.insert (hint, item);
149 fChangeCounts_.PerformedChange ();
150 return false;
151 }
152 }
153 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
154 {
156 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
157 auto nextStdI = fData_.erase (mir.fIterator.GetUnderlyingIteratorRep ());
158 fChangeCounts_.PerformedChange ();
159 if (nextI != nullptr) {
160 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, nextStdI)};
161 }
162 }
163 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key) override
164 {
166 auto i = fData_.find (key);
167 if (i != fData_.end ()) {
168 fData_.erase (i);
169 return true;
170 }
171 return false;
172 }
173
174 private:
175 using DataStructureImplType_ = DataStructures::STLContainerWrapper<STDHASHSET<KEY_HASH, KEY_EQUALS_COMPARER>>;
176 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
177
178 private:
179 DataStructureImplType_ fData_;
180 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
181 };
182
183 /*
184 ********************************************************************************
185 *********** KeyedCollection_stdhashset<KEY_TYPE,MAPPED_VALUE_TYPE> *************
186 ********************************************************************************
187 */
188 template <typename T, typename KEY_TYPE, typename TRAITS>
189 template <typename KEY_HASH, typename KEY_EQUALS_COMPARER>
190 KeyedCollection_stdhashset<T, KEY_TYPE, TRAITS>::KeyedCollection_stdhashset (const KeyExtractorType& keyExtractor, KEY_HASH&& keyHasher,
191 KEY_EQUALS_COMPARER&& keyComparer)
192 requires (IEqualsComparer<KEY_EQUALS_COMPARER, KEY_TYPE> and Cryptography::Digest::IHashFunction<KEY_HASH, KEY_TYPE>)
193 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_HASH>, remove_cvref_t<KEY_EQUALS_COMPARER>>> (
194 keyExtractor, forward<KEY_HASH> (keyHasher), forward<KEY_EQUALS_COMPARER> (keyComparer))}
195 {
196 }
197 template <typename T, typename KEY_TYPE, typename TRAITS>
199 {
201 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{this}; // for side-effect of AssertMember
202 }
203 }
204
205}
#define qStroika_Foundation_Debug_AssertionsChecked
The qStroika_Foundation_Debug_AssertionsChecked flag determines if assertions are checked and validat...
Definition Assertions.h:48
#define RequireNotNull(p)
Definition Assertions.h:347
KeyedCollection_stdhashset<KEY_TYPE,MAPPED_VALUE_TYPE> is an std::map-based concrete implementation o...
KeyedCollection_stdhashset(const KeyExtractorType &keyExtractor={}, KEY_HASH &&keyHasher={}, KEY_EQUALS_COMPARER &&keyComparer=KEY_EQUALS_COMPARER{})
a cross between Mapping<KEY, T> and Collection<T> and Set<T>
nonvirtual bool Add(ArgByValueType< value_type > item)
nonvirtual KeyExtractorType GetKeyExtractor() const
nonvirtual bool RemoveIf(ArgByValueType< KeyType > item)
nonvirtual KeyEqualityComparerType GetKeyEqualityComparer() const
nonvirtual void Remove(const Iterator< value_type > &i, const Iterator< value_type > *nextI=nullptr)
Remove the argument value (which must exist) from the KeyedCollection.
nonvirtual optional< value_type > Lookup(ArgByValueType< KeyType > key) const
shared_lock< const AssertExternallySynchronizedMutex > ReadContext
Instantiate AssertExternallySynchronizedMutex::ReadContext to designate an area of code where protect...
unique_lock< AssertExternallySynchronizedMutex > WriteContext
Instantiate AssertExternallySynchronizedMutex::WriteContext to designate an area of code where protec...
nonvirtual void Apply(const function< void(ArgByValueType< T > item)> &doToElement, Execution::SequencePolicy seq=Execution::SequencePolicy::eDEFAULT) const
Run the argument function (or lambda) on each element of the container.
nonvirtual Iterator< T > Find(THAT_FUNCTION &&that, Execution::SequencePolicy seq=Execution::SequencePolicy::eDEFAULT) const
Run the argument bool-returning function (or lambda) on each element of the container,...
nonvirtual size_t size() const
Returns the number of items contained.
Definition Iterable.inl:300
nonvirtual bool empty() const
Returns true iff size() == 0.
Definition Iterable.inl:306
nonvirtual Iterator< T > MakeIterator() const
Create an iterator object which can be used to traverse the 'Iterable'.
Definition Iterable.inl:294
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...