dbaccess/source/ui/control/dbtreelistbox.cxx |    2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

New commits:
commit 3d6e58bf7db631043da44655cac5eb828dbbfdcc
Author:     Caolán McNamara <caol...@redhat.com>
AuthorDate: Wed Oct 5 16:11:44 2022 +0100
Commit:     Xisco Fauli <xiscofa...@libreoffice.org>
CommitDate: Thu Oct 6 10:14:45 2022 +0200

    Resolves: tdf#149277 we don't want to search the whole tree for dups
    
    just the immediate children of the supplied parent node
    
    Change-Id: I79595fd940257615f0d012cb9a4556aea51d7db9
    Reviewed-on: https://gerrit.libreoffice.org/c/core/+/140963
    Tested-by: Jenkins
    Reviewed-by: Adolfo Jayme Barrientos <fit...@ubuntu.com>
    (cherry picked from commit 98a35a2fdbd0de9afedc48812d9821dc0305f575)
    Reviewed-on: https://gerrit.libreoffice.org/c/core/+/140967
    Tested-by: Xisco Fauli <xiscofa...@libreoffice.org>
    Reviewed-by: Xisco Fauli <xiscofa...@libreoffice.org>

diff --git a/dbaccess/source/ui/control/dbtreelistbox.cxx 
b/dbaccess/source/ui/control/dbtreelistbox.cxx
index 472171142368..09ca5b466715 100644
--- a/dbaccess/source/ui/control/dbtreelistbox.cxx
+++ b/dbaccess/source/ui/control/dbtreelistbox.cxx
@@ -199,7 +199,7 @@ std::unique_ptr<weld::TreeIter> 
TreeListBox::GetEntryPosByName(std::u16string_vi
                 return xEntry;
             }
         }
-    } while (m_xTreeView->iter_next(*xEntry));
+    } while (m_xTreeView->iter_next_sibling(*xEntry));
 
     return nullptr;
 }

Reply via email to