24 #ifndef __UIDLISTINTERNAL__ 25 #define __UIDLISTINTERNAL__ 30 const int32 kUIDDefaultChunkSize = 8;
37 friend class SortedUIDList;
40 #if defined(DEBUG) && defined(MACINTOSH) 42 friend void GetUIDListDescriptionHelper(
void* uidListInternalArg,
char* buffer, uint32 bufferSize);
49 { fArray.reserve(kUIDDefaultChunkSize); }
56 { fArray.push_back(singleEntry); ;}
59 { fArray.push_back(::GetUID(obj)); ;}
62 { fArray.push_back(obj.
GetUID()); ;}
77 typedef UIDArray::value_type value_type;
78 typedef UIDArray::size_type size_type;
79 typedef UIDArray::const_reference const_reference;
80 typedef UIDArray::reference reference;
81 typedef UIDArray::difference_type difference_type;
82 typedef UIDArray::pointer pointer;
83 typedef UIDArray::const_pointer const_pointer;
89 { fArray = other.fArray; fDB = other.fDB;
return *
this; }
95 {
return fArray == other.fArray; }
101 {
return fArray != other.fArray; }
108 {
return fArray[i]; }
115 {
return (fArray[i]); }
121 { fArray.reserve(chunk); }
128 { fArray.reserve(newlen);
return kTrue; }
138 { fArray.insert(fArray.begin(),t); }
145 { fArray.insert(fArray.begin() + before, t); }
157 { fArray.push_back(t); }
164 { fArray.insert(fArray.begin() + after + 1, t); }
175 { fArray.erase(fArray.begin() + at); }
190 {
return fArray.size(); }
194 {
return fArray.empty(); }
197 const_reference
First()
const 198 {
return fArray.front(); }
202 {
return fArray.front(); }
205 const_reference
Last()
const 206 {
return fArray.back(); }
210 {
return fArray.back(); }
218 UIDArray::const_iterator iter = K2find(fArray, t);
219 return (iter != fArray.end() ? iter - fArray.begin() : -1);
230 {
return UIDRef(fDB, fArray[at]); }
233 int32 GetReferenceCount() {
return fRefCount;}
241 #if defined(DEBUG) && defined(MACINTOSH) 242 void GetUIDListDescriptionHelper(
void* uidListInternalArg,
char* buffer, uint32 bufferSize);
245 #endif // __UIDLISTINTERNAL__