7 if (wrapper == NULL)
return;
14 if (index >=
wrappers.size())
return NULL;
20 size_t totalCount = 0;
21 size_t wrappersCount = this->
count();
23 for (
size_t i = 0; i < wrappersCount; i++) {
25 if (wrapper == NULL) {
37 std::map<ResourceLeafWrapper*, ResourceContentWrapper*>::iterator itr;
49 std::map<ResourceLeafWrapper*, ResourceContentWrapper*>::iterator cntItr;
63 allLeafs[topEntryId].push_back(leaf);
68 std::map<long, std::vector<ResourceLeafWrapper*> >::iterator itr;
71 std::vector<ResourceLeafWrapper*> &leafVec = itr->second;
72 long topEntryId = itr->first;
74 for (
size_t i = 0; i < leafVec.size(); i++) {
107 if (
hasType(typeId) ==
false) {
116 std::map<pe::resource_type, ResourcesContainer>::iterator itr;
118 for ( itr = this->
allWrappers.begin(); itr != this->allWrappers.end(); ++itr ) {
119 pe::resource_type type = itr->first;
static ResourceContentWrapper * makeResContentWrapper(pe::resource_type typeId, ResourceLeafWrapper *leaf)
virtual size_t getFieldsCount()
size_t entriesCountAt(long topEntryId)
std::map< ResourceLeafWrapper *, ResourceContentWrapper * > leafToContentWrapper
std::vector< pe::resource_type > allTypes
void putLeaf(ResourceLeafWrapper *leaf, long topEntryId)
std::map< long, std::vector< ResourceLeafWrapper * > > allLeafs
ResourcesContainer * getResourcesOfType(pe::resource_type typeId)
bool hasTopEntry(long topEntryId)
std::vector< ResourceLeafWrapper * > * entriesAt(long topEntryId)
std::map< long, pe::resource_type > idToLeafType
bool hasType(pe::resource_type typeId)
std::map< pe::resource_type, ResourcesContainer > allWrappers
void putWrapper(ResourceContentWrapper *wrapper)
ResourceContentWrapper * getWrapperAt(size_t index)
std::vector< ResourceContentWrapper * > wrappers