diff options
| author | Julien Nabet <serval2412@yahoo.fr> | 2015-06-13 09:12:34 +0200 |
|---|---|---|
| committer | Julien Nabet <serval2412@yahoo.fr> | 2015-06-13 09:13:52 +0200 |
| commit | 3754474cdea72ebe7f09457ef82a5c3131d06b78 (patch) | |
| tree | bc2ce16e15475dda27d89f61d8cb2b0558df27ed /svx/source/table | |
| parent | d56b125f6c6c18ac40712cefc3cec06530750e15 (diff) | |
Typos
Change-Id: I21c352a63d668c174eef212dbfbe6346c678ce4d
Diffstat (limited to 'svx/source/table')
| -rw-r--r-- | svx/source/table/accessiblecell.cxx | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/svx/source/table/accessiblecell.cxx b/svx/source/table/accessiblecell.cxx index b41e5002f8e3..a1437b3a58ae 100644 --- a/svx/source/table/accessiblecell.cxx +++ b/svx/source/table/accessiblecell.cxx @@ -276,7 +276,7 @@ sal_Bool SAL_CALL AccessibleCell::containsPoint( const ::com::sun::star::awt::Po /** The implementation below is at the moment straightforward. It iterates over all children (and thereby instances all children which have not - been already instatiated) until a child covering the specifed point is + been already instantiated) until a child covering the specified point is found. This leaves room for improvement. For instance, first iterate only over the already instantiated children and only if no match is found |