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

Add a comment about wxGridSelection::IsInSelection() complexity

Browse Source 
No real changes.
This commit is contained in:
Vadim Zeitlin
2020-04-05 01:42:40 +02:00
parent 791a9e68ae
commit 0ab23a0072
1 changed files with 6 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
src/generic/gridsel.cpp
View File

@@ -58,6 +58,12 @@ bool wxGridSelection::IsSelection()
bool wxGridSelection::IsInSelection( int row, int col ) bool wxGridSelection::IsInSelection( int row, int col )
{ {
// Check whether the given cell is contained in one of the selected blocks. // Check whether the given cell is contained in one of the selected blocks.
//
// Note that this algorithm is O(N) in number of selected blocks, not in
// number of cells in the grid, so it should be reasonably efficient even
// for very large grids, as the user shouldn't be able to select too many
// blocks. If we still run into problems with this, we should find a more
// efficient way of storing the selection, e.g. using k-d trees.
const size_t count = m_selection.size(); const size_t count = m_selection.size();
for ( size_t n = 0; n < count; n++ ) for ( size_t n = 0; n < count; n++ )
{ {