Amebis/wxWidgets
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

added the missing sentence end...

Browse Source 
git-svn-id: https://svn.wxwidgets.org/svn/wx/wxWidgets/trunk@1371 c3d73ce0-8a6f-49c7-b76d-6d57e0e08775
This commit is contained in:
Vadim Zeitlin
1999-01-11 13:36:02 +00:00
parent 437c49b200
commit d1b5756b71
1 changed files with 4 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
docs/latex/wx/array.tex
View File

@@ -50,8 +50,10 @@ $O(N)$ for the usual arrays but the \helpref{Add()}{wxarrayadd} method is
slower: it is $O(log(N))$ instead of constant time (neglecting time spent in slower: it is $O(log(N))$ instead of constant time (neglecting time spent in
memory allocation routine). However, in a usual situation elements are added to memory allocation routine). However, in a usual situation elements are added to
an array much less often than searched inside it, so wxSortedArray may lead to an array much less often than searched inside it, so wxSortedArray may lead to
huge performance improvements compared to wxArray. As wxArray this array can not huge performance improvements compared to wxArray. Finally, it should be
be used noticed that, as wxArray, wxSortedArray can not be used to store anything of
sizeof() larger than max(sizeof(long), sizeof(void *)) - an assertion failure
will be raised from the constructor otherwise.
wxObjArray class treats its elements like "objects". It may delete them when wxObjArray class treats its elements like "objects". It may delete them when
they are removed from the array (invoking the correct destructor) and copies they are removed from the array (invoking the correct destructor) and copies