39         maEntries[i].Clear();  in ScQueryParamBase()
45     maEntries(r.maEntries)  in ScQueryParamBase()
55     return maEntries.size();  in GetEntryCount()
60     return maEntries[n];  in GetEntry()
69     SCSIZE nCopy = ::std::min(maEntries.size(), nNew);  in Resize()
71         aNewEntries[i] = maEntries[i];  in Resize()
73     maEntries.swap(aNewEntries);  in Resize()
78     if (nPos >= maEntries.size())  in DeleteQuery()
81     size_t n = maEntries.size();  in DeleteQuery()
86             aNewEntries.push_back(maEntries[i]);  in DeleteQuery()
92     maEntries.swap(aNewEntries);  in DeleteQuery()
99         if ( nIndex >= maEntries.size() )  in FillInExcelSyntax()
214         maEntries[i].Clear();  in Clear()
248     maEntries = r.maEntries;  in operator =()
265     while ( nUsed<nEntryCount && maEntries[nUsed].bDoQuery ) ++nUsed;  in operator ==()
266     while ( nOtherUsed<nOtherEntryCount && rOther.maEntries[nOtherUsed].bDoQuery )  in operator ==()
289             bEqual = maEntries[i] == rOther.maEntries[i];  in operator ==()
309         size_t n = maEntries.size();  in MoveToDest()
311             maEntries[i].nField += nDifX;  in MoveToDest()